System and method of generating data points from one or more data stores of data items for chart creation and manipulation

Description

BACKGROUND OF THE INVENTION

Embodiments of the present disclosure generally relate to the creation and manipulation of charts used for data analysis.

Analysts and regulators often must often sift through large amounts of data when attempting to identify occurrences of market manipulation and/or other types of bad behavior in a particular market or network. For example, such data may include trade execution data, order data, employee data, market price data, etc. This can be an arduous and time-consuming process, especially since the data may be very large (potentially spanning hundreds of terabytes) and be spread across multiple databases or servers.

Visualizations of the collected data (such as charts, graphs, or histograms) are often an important part of data analysis, as they allow the analyst to more easily visualize large amounts of data, and may aid them in performing comparisons of different data sets and identifying data trends and correlations.

However, many conventional tools used for creating charts and graphs (such as MICROSOFT EXCEL) exhibit a number of shortcomings. For example, many chart creation tools are not able to effectively handle large volumes of data, or data spanning multiple servers or databases. They may also lack sufficient search and filtering options to define the set of data from which to create a chart, and may not be dynamically updatable in response to interactive user inputs. In addition, the chart creation tool may not possess functionality to allow an analyst to drill down into the full metadata of data items corresponding to the data points in the chart.

SUMMARY OF THE INVENTION

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.

Embodiments of the present disclosure relate to a data analysis system (also referred to herein as “the system”) that may be used to implement cross-application coordination between a chart creation tool and a data analysis workspace, in order to create one or more charts from customized sets of data points, and drill down to access the full metadata of data points in the created charts, beyond what would normally be possible using the chart creation tool by itself.

In some embodiments, a chart creation tool creates charts from one or more received data points. In some embodiments, the chart creation tool may be implemented as a web app. The chart creation tool may be configured by the user to synchronize manipulations between different charts, allowing them to be more effectively compared with each other. In addition, the user may select different charts of different types to be merged or overlaid, allowing easier identifying of patterns or correlations indicative of market manipulation and/or other suspect behavior.

In some embodiments, the chart creation tool coordinates with a separate data analysis workspace application to receive more customized and refined sets of data points for chart creation. The workspace application may contain more specialized tools for searching through and filtering large sets of data (potentially spanning hundreds of terabytes) and/or data spread over multiple databases or servers. In addition, the workspace application provides additional customization options allowing a user to select, remove, or cherry-pick the data items for visualization as a chart or graph. After defining one or more sets of data points using the workspace application, the user may then transmit the selected data points to the chart creation tool.

In some embodiments, coordination with the separate workspace application allows users of the chart creation tool to access the full metadata of data points on the created charts, including metadata that cannot be normally accessed by the chart creation tool. For example, if the user desires to drill down on or view the full metadata of one or more particular data points in a created chart, the user may select the data points in the chart to retrieve one or more identifiers. The identifiers are transmitted back to the workspace application, where they may be used to identify the data items associated with the selected data points, and retrieve the full metadata of the data items for viewing by the user.

BRIEF DESCRIPTION OF THE DRAWINGS

The following drawings and the associated descriptions are provided to illustrate embodiments of the present disclosure and do not limit the scope of the claims. Aspects and many of the attendant advantages of this disclosure will become more readily appreciated as the same become better understood by reference to the following detailed description, when taken in conjunction with the accompanying drawings, wherein:

FIG. 1 is a block diagram illustrating an example data analysis system, in accordance with some embodiments.

FIG. 2A is illustrates a flowchart of a process for creating a plurality of charts in accordance with some embodiments.

FIG. 2B illustrates an example process for implementing synchronized manipulation of multiple charts.

FIG. 2C illustrates an example process for merging multiple charts.

FIGS. 3A-3E illustrate an example interface for creating and manipulating one or more charts.

FIGS. 4A and 4B illustrate flowcharts of processes for cross-application coordination in accordance with some embodiments.

FIGS. 5A-5G illustrate example interfaces for creating charts using a workspace application in conjunction with a chart creation tool, in accordance with some embodiments.

FIG. 6A illustrates an embodiment of a database system using an ontology.

FIG. 6B illustrates an embodiment of a system for creating data in a data store using a dynamic ontology.

FIG. 6C illustrates a sample user interface using relationships described in a data store using a dynamic ontology.

FIG. 7 illustrates a computer system with which certain methods discussed herein may be implemented.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT

Although certain preferred embodiments and examples are disclosed below, inventive subject matter extends beyond the specifically disclosed embodiments to other alternative embodiments and/or uses and to modifications and equivalents thereof. Thus, the scope of the claims appended hereto is not limited by any of the particular embodiments described below. For example, in any method or process disclosed herein, the acts or operations of the method or process may be performed in any suitable sequence and are not necessarily limited to any particular disclosed sequence. Various operations may be described as multiple discrete operations in turn, in a manner that may be helpful in understanding certain embodiments; however, the order of description should not be construed to imply that these operations are order dependent. Additionally, the structures, systems, and/or devices described herein may be embodied as integrated components or as separate components. For purposes of comparing various embodiments, certain aspects and advantages of these embodiments are described. Not necessarily all such aspects or advantages are achieved by any particular embodiment. Thus, for example, various embodiments may be carried out in a manner that achieves or optimizes one advantage or group of advantages as taught herein without necessarily achieving other aspects or advantages as may also be taught or suggested herein.

Terms

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 broadly to include, without limitation, the provided definitions, the ordinary and customary meanings of the terms, and/or any other implied meanings for the respective terms. Thus, the definitions below do not limit the meaning of these terms, but only provide example definitions.

Database: A broad term for any data structure for storing and/or organizing data, including, but not limited to, relational databases (for example, Oracle database, mySQL database, and the like), spreadsheets, XML files, and text file, among others. The various terms “database,” “data store,” and “data source” may be used interchangeably in the present disclosure.

Data Item (Item), Data Object (Object), or Data Entity (Entity): A data container for information representing a specific thing, or a group of things, in the world. A data item may be associated with a number of definable properties (as described below). For example, a data item may represent an item such as a person, a place, an organization, an account, a computer, an activity, a market instrument, or other noun. A data item may represent an event that happens at a point in time or for a duration. A data item may represent a document or other unstructured data source such as an e-mail message, a news report, or a written paper or article. Each data item may be associated with a unique identifier that uniquely identifies the data item. The terms “data item,” “data object,” “data entity,” “item,” “object,” and “entity” may be used interchangeably and/or synonymously in the present disclosure.

Item (or Entity or Object) Type: Type of a data item (for example, Person, Event, or Document). Data item types may be defined by an ontology and may be modified or updated to include additional data item types. An data item definition may include how the data item is related to other data items, such as being a sub-data item type of another data item type (for example, an agent may be a sub-data item of a person data item type), and the properties the data item type may have.

Properties: Also referred to herein as “attributes” or “metadata” of data items. A property of a data item may include any item of information associated with, and/or relevant to, the data item. At a minimum, each property of a data item has a property type and a value or values. For example, properties associated with a person data item may include a name (for example, John Doe), an address (for example, 123 S. Orange Street), and/or a phone number (for example, 800-0000), among other properties. In another example, properties associated with a computer data item may include a list of users (for example, user1, user 2, and the like), and/or an IP (internet protocol) address, among other properties.

Property Type: The type of data a property is, such as a string, an integer, or a double. Property types may include complex property types, such as a series data values associated with timed ticks (for example, a time series), and the like.

Property Value: The value associated with a property, which is of the type indicated in the property type associated with the property. A property may have multiple values.

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.

Data Point: A data item or a subset of the properties of a data item, to be used in the creation of a chart and/or in another application. A data point is typically associated with at least two properties: a first property corresponding to a first axis of the chart, and a second property corresponding to a second axis of the chart. A data point is also often associated with a unique identifier of the data item to which it relates. In some cases, a property of a data point may comprise an aggregation of multiple data items (e.g., a count of data items having a certain property value).

Overview

Embodiments of the present disclosure relate to a data analysis system configured to synchronize manipulations between multiple charts, merge multiple charts, and coordinate with a data analysis workspace to receive customized sets of data points.

Analysts and regulators often, in order to identify market manipulation and/or other types of bad behavior in a monitored market or network, must regularly sift through large amounts of data. For example, such data may include trade execution data, order data, employee data, market data, communications data, etc. By analyzing the data, an analyst may detect patterns and/or correlations indicative of market manipulation and/or other types of monitored behavior.

Visualizations of the data (such as charts, graphs, or histograms) are often an important part of data analysis, as they allow an analyst to more easily visualize large amounts of data, and may also aid them in performing comparisons of different data sets and identifying trends and correlations in the data.

However, many conventional tools used for creating charts and graphs (such as MICROSOFT EXCEL) exhibit a number of shortcomings. Large scale data analysis often necessitates the creation of multiple charts covering different sets of related data. When performing comparisons between different charts, if an analyst performs a manipulation on a first chart, he or she must often also perform a matching manipulation in a second chart in order to continue the comparison. In addition, an analyst may sometimes desire to merge one or more charts of different types in order to better visualize how the data in the first chart correlates with that of the second chart. Many chart creation tools, while allowing for manipulations of individual charts, do not support synchronized manipulation of multiple charts, and/or merging of different charts of different types.

Many chart creation tools also cannot effectively handle large volumes of data, or data spanning multiple databases or servers, and may lack sufficient search and filtering options. For example, while many conventional chart creation tools may contain basic filters, they often lack the ability allow the analyst to select data items for visualization based upon any attribute or combination of attributes, or to remove or cherry-pick specific data items for chart creation in a dynamic and interactive fashion.

In addition, chart creation tools, when creating charts based upon received data items, often only read or process attributes of the data items relevant to chart creation. It is often difficult or impossible for an analyst, when viewing a created chart, to drill down into the full metadata of data items corresponding to the data points in the chart.

In various embodiments of the system, a chart creation tool is used to create charts from one or more received data points. In some embodiments, the chart creation tool may be implemented as a web app. The chart creation tool may be configured by the user to synchronize manipulations between different charts, allowing them to be more effectively compared with each other. In addition, the user may select different charts of different types to be merged or overlaid, allowing easier identifying of patterns or correlations indicative of market manipulation and/or other suspect behavior. While the present disclosure refers largely to detecting market manipulation for the purpose of example, the various embodiments described may be used in a variety of different applications, such as detecting tax evasion, the presence of malware, interesting market conditions, and/or the like.

In various embodiments, the chart creation tool may coordinate with a separate workspace application to receive more customized and refined sets of data points for chart creation. The workspace application may contain more specialized tools for searching through and filtering large sets of data, and may provide additional customization options by allowing a user to select, remove, or cherry-pick the data items that the user decides to visualize as a chart or graph. After defining one or more sets of data points using the workspace application, the user may then transmit the selected data points to the chart creation tool.

Afterwards, if the user desires to drill down on or view the full metadata of one or more particular data points in a created chart, the user may select the data points in the chart to retrieve one or more identifiers. The identifiers are transmitted back to the workspace application, where they may be used to identify the data items associated with the selected data points, and retrieve the full metadata of the data items for viewing by the user.

DESCRIPTION OF THE FIGURES

Embodiments of the disclosure will now be described with reference to the accompanying Figures, wherein like numerals refer to like elements throughout. The terminology used in the description presented herein is not intended to be interpreted in any limited or restrictive manner, simply because it is being utilized in conjunction with a detailed description of certain specific embodiments of the disclosure. Furthermore, embodiments of the disclosure described above and/or below may include several novel features, no single one of which is solely responsible for its desirable attributes or which is essential to practicing the embodiments of the disclosure herein described.

FIG. 1 is a block diagram illustrating an example data analysis system, in accordance with some embodiments. As shown in the embodiment of FIG. 1, the data analysis system 100 includes a user station 101, an application server 103, a web app 104, and a database 106. Further, the user station 101, application server 103, and web app 104 may communicate over a network 102, for example, to access data from database 106, and/or to communicate with each other.

The user station 101 may correspond to any type of computing station that may be used to operate or interface with the applications in the system (e.g., applications on application server 103 and/or web app 104). Examples of such user stations include for example, workstations, personal computers, or remote computing terminals. User stations may also include mobile devices, such as smartphones, tablets, or touchscreen devices. The user station 101 comprises a display device, such as a display monitor, for displaying a user interface to users at the user station. The user station 101 also comprises one or more input devices for the user to provide operational control over the activities of the system, such as a mouse, keyboard, or touchscreen to manipulate a graphical user interface to generate user inputs (e.g., by manipulating a cursor or pointing object in the graphical user interface).

The applications server 103 may include a workspace app 105. The workspace app 105 may comprise a software application that be used by a user at user station 101 to retrieve data comprising one or more data items from a database 106 or other data source. In addition, workspace app 105 may be used to search, filter, and/or otherwise manipulate the received data items to be displayed to the user at user station 101. In some embodiments, workspace app 105 may also be used to perform other types of operations, such as enrichment and analysis, on the received data. Example methods and systems for displaying and enriching data items are disclosed in U.S. patent application Ser. No. 14/859,882, titled “SYSTEMS AND INTERACTIVE USER INTERFACES FOR DYNAMIC RETRIEVAL, ANALYSIS, AND TRIAGE OF DATA ITEMS,” filed on even date herewith, which is hereby incorporated by reference in its entirety. Additional examples of organization and storage of data items and functionality of the workspace app 105 may be found in the description of FIGS. 4A-4B, 5A-5G, 6A-6C and 7 below.

Web app 104 may comprise a software application accessible by the user at user interface 101 to perform a variety of operations on received data items from database 106 or another data source. In some embodiments, web app 104 is accessed by the user at user station 101 through an internet or web browser, such as Internet Explorer, Mozilla Firefox, or Google Chrome, although it is understood that in other embodiments, web app 104 may correspond to any type of application that can be accessed by a user at user station 101. Web app 104 may contain chart creation tools to be used by the user to create one or more charts, graphs, and/or other visualizations based upon received data items from database 106 and/or other data sources.

While the user station 101, application server 103, and web app 104 are shown as distinct computing systems, the user station 101, application server 103, and web app 104 may be part of the same computing system and/or organized differently than shown. For example, in one embodiment both the workspace app 105 and the web app 104 may be executed by the application server 103. In some embodiments, some components of the data analysis system (e.g., user station 101, application server 103, and/or web app 104) may be implemented as one or more computing systems 800 and/or servers 830, as described below in reference to FIG. 7. In various embodiments, one or more of the application server 103, the workspace app 105, the web app 104, and other another aspect of the computing systems described herein may be configured to and/or designed to generate user interface data useable for rendering the interactive user interfaces described herein. In various embodiments the user interface data may be transmitted to the user station 101, and/or any other computing device, such that the example user interfaces are displayed to the user and the user may interact with the system via the user interfaces. As mentioned above, in some embodiments the user station 101 may include a browser (and/or other software program) accessing a web service and configured to render the user interfaces based on the user interface data.

The database 106 may be a Relational Database Management System (RDBMS) that stores the data as rows in relational tables. The term “database,” as used herein, may refer to an database (e.g., RDBMS or SQL database), or may refer to any other data structure, such as, for example a comma separated values (CSV), extensible markup language (XML), text (TXT) file, flat file, spreadsheet file, and/or any other widely used or proprietary format. While the database 106 is shown as a distinct computing system, the database 106 may operate on the same server computing system as the application server 103, web app 104, and/or user station 101. In some embodiments, database 106 may correspond to multiple databases, and/or span multiple servers or computing devices. In some embodiments, web app 104 and workspace app 105 are configured to be able to retrieve data from database 106 by querying database 106, e.g., without having to go through a separate database administrator.

The data stored in database 106 may include a variety of information and data (for example, various data items as described herein), for example, personal information, financial information, tax-related information, computer network-related data, and/or computer-related activity data, among others. For example, the data sources may be related to customer account records stored by a financial institution. In such a case, the data sources may include a credit card account data, bank account data, customer data, and transaction data. The data may include data attributes such as account numbers, account balances, phone numbers, addresses, and transaction amounts, and the like. Of course, database 106 is included to be representative of a variety of data available to the application server 103 and web app 104 over network 102, as well as locally available data sources.

Chart Creation

FIG. 2A illustrates a flowchart of an example process for creating a plurality of charts based upon received data items, in accordance with some embodiments. In various embodiments, fewer blocks or additional blocks may be included in the example method of FIG. 2A, or various blocks may be performed in an order different from that shown. In various embodiments, one or more blocks in the flowchart may be performed by one or more components of the data analysis system, for example, web app 104, as described in reference to FIG. 1.

In the embodiment of the flowchart of FIG. 2A, at block 202, one or more data sets comprising one or more data items are accessed. The data sets may comprise data received from one or more data sources, such as a database or data store (e.g., database 106, as illustrated in FIG. 1). In some embodiments, the data sets may be retrieved by querying one or more databases or data stores directly, e.g., without having to go through a database administrator. In some embodiments, the data sets may be imported from another application (e.g., from an EXCEL spreadsheet). The data sets may comprise relational data, data organized as data items or an item/node graph (described in greater detail below with regards to FIGS. 6A-6C), and/or any other type of data or combination of different types of data.

At block 204, a first set of parameters for defining a chart is received. The first set of parameters may specify one or more data sets and one or more filters to be used for the creation of a chart. For example, an analyst may, in order to search for signs of market manipulation or insider trading in a particular market over a specified time period, desire to view data relating to the market during the specified time period. Thus, the first set of parameters may comprise filters for the specified time period, market being analyzed, and market attribute(s) to be analyzed (e.g., index price, number of shares traded, etc.) In addition, one or more inputs associated with chart presentation may also be received (e.g., an input specifying a type of chart, such as line graph, bar graph, or scatter plot). In some embodiments, the selected data set attributes are plotted as a time series (e.g., using an identified time-based attribute from the data set). However, it is understood that in other embodiments, data set attributes other than time may be used. For example, a user may create a chart plotting exchange rate against market trade volume.

At block 206, a first chart is created based upon the data specified by the first set of parameters. In some embodiments, the first set of parameters is used to query the data set in order to retrieve one or more data points. In addition, additional analysis and/or aggregation may be used in order to obtain the data points for the chart. For example, if a data set comprises data items corresponding to individual trades occurring in a market at a given time, aggregation may be performed to obtain a data point corresponding to the total number of trades occurring at the time.

At block 208, a second set of parameters different from the first set of parameters is received. In some embodiments, the second set of parameters may be directed to the same data set(s) as the first set of parameters, or to different data set(s). For example, the user may have created a first chart based upon a first set of parameters directed to a market trades data set, while the second set of parameters may be directed to an exchange rates data set, a market price data set, and/or the like. In some embodiments, different types of data sets may be used for different applications. For example, a user attempting to identify malware or occurrences of malicious activity on a network may desire to access data sets relating to network processes, proxy requests originating from the network, proxy requests directed to the network, and/or the like. It is appreciated that any type of data set may be used for chart creation and manipulation, depending on the particular application desired by the user.

At block 210, a second chart is created based upon the data specified by the second set of parameters. The process for creating the second chart using the second set of parameters may be similar to that for creating the first chart using the first set of parameters at block 206. The two charts may be simultaneously displayed to the user (e.g., side by side or one above the other), allowing for easier comparison. For example, in the above scenario, a user may wish to compare how an attribute relating to market trades changes over time correlates with how an exchange rate attribute changes over time.

Chart Manipulation and Merging

Once the first and second charts have been created and displayed to the user, the user may wish to perform manipulations on the displayed charts. These manipulations may comprise analytical manipulations and/or presentation manipulations. For example, the user may wish to alter the filters or data points covered by the first chart (e.g., change a time period covered by the first chart), and/or change how the first chart is presented (e.g., compress or expand the x-axis of the first chart). However, once a manipulation is performed on the first chart, the user will often desire for a corresponding manipulation to be performed on the second chart. For example, if the user changes the time period examined by first chart from January 31 to February 1, it may be desirable to change the time period covered by the second chart from January 31 to February 1 as well, so that the user can continue comparing the data of the two charts.

FIG. 2B illustrates a flowchart of an example method for implementing synchronized manipulation of multiple charts, in accordance with some embodiments. At block 212, an input is received specifying a manipulation of the first chart. It is appreciated that many different types of inputs may be used in various embodiments to specify a manipulation. For example, in some embodiments a user can expand or compress an axis of the first chart by clicking on an axis of the first chart, and dragging the cursor towards the center of the chart to compress or towards the edge of the chart to expand. Alternatively, the user may type a value within a text box, drag a slider, or perform some other type of input to specify a level of expansion/compression. At block 214, a manipulation of the first chart is performed based at least in part upon the received input.

At block 216, a manipulation of the second chart is performed, based at least in part upon the manipulation of the first chart. For example, if the manipulation of the first chart caused an expansion/compression of the x-axis of the first chart, a matching expansion/compression is performed on the x-axis of the second chart, so that the user is able to continue analysis of the first and second charts without further interruption.

In some embodiments, the manipulation of the second chart can only be performed if the second chart shares certain attributes with the first chart. Certain manipulations may only be performed if the first and second charts share the same source data set or have a compatible data attribute. For example, in some embodiments, an expansion/compression of the x-axis of a first chart, wherein the x-axis correspond to a time attribute, may not be performed on a second chart if the second chart does not also have an axis corresponding to a time attribute.

In addition, in some embodiments, a user indication must be received in order to synchronize manipulation between a first and second chart. For example, a user may select a first chart and a second chart, and then select an option to “lock axes” for the selected charts, resulting in an expansions/compression to an axis of the first chart also being reflected in an axis of the second chart. At a later time, the user may choose to disable “lock axes,” and may thereby be enabled to perform manipulations on the first chart without affecting the second chart.

In addition to synchronizing manipulations, multiple charts can be merged in order facilitate analysis and comparison. FIG. 2C illustrates a flowchart of a process for merging multiple charts in accordance with some embodiments. At block 218, a first chart is identified. At block 220, a second chart that can be merged with the first chart is identified.

Typically, in order for two charts to be merged, they must share at least one common axis. For example, a first chart having a time axis and a share price axis may be merged with a second chart having a time axis and a share volume axis, due to both charts having a common axis (e.g., time). On the other hand, a first chart having a time axis and a share price axis cannot be merged with a second chart having a share volume axis and an exchange rate axis, due to the lack of a common axis between the first and second charts. It is noted that in some embodiments the first and second charts may have axes with different names that are nonetheless considered compatible. For example, the first chart may be based upon a first data set having a time-based attribute, while the second chart may be based upon a second data set having a time-based attribute with a different name (e.g., “receive_time,” “trade_time,” etc.) In such cases, the user, when merging the first and second charts, may be prompted to enter single axis name to be used for the axis of the merged chart.

At block 222, the first and second charts are merged based at least in part upon a common axis, wherein the first chart may be superimposed over the second chart, or vice versa. In addition, the common axis of the first and second charts (typically, the x-axis) are aligned when performing the superposition. In some embodiments, the first and second charts may have a second axis that is different (typically y-axis). In such cases, values for the non-shared axis of each chart may be displayed on opposite sides of the merged chart. For example, y-axis values of the first chart may be displayed on the left side of the merged chart, while y-axis values of the second chart may be displayed on the right side of the merged chart. It is understood that although FIG. 2C refers to merging a first chart and a second chart, in some embodiments any number of compatible charts may be merged. In some embodiments, when merging charts having different axes (e.g., y-axes), the different axes may be automatically scaled relative to each other in order to make the data easier to visualize and compare. The scaling may be based at least in part upon a highest/lowest value along an axis, a mean value of an axis, and/or other factors.

FIGS. 3A-3E illustrate example user interfaces for creating and manipulating charts in accordance with some embodiments. FIG. 3A illustrates an interface 302 with one or more interactive fields or elements used to define parameters for the creation of a first chart 304. For example, the user may specify a data set to be used for the chart at 306, a time period filter at 308, and one or more additional filters at 310. For example, additional filters used in the context of detecting market manipulation may include geographic region, currency type, type of trade, price range, and/or the like. In some embodiments, types of additional filters available may be based at least in part upon the selected data set. For example, each available data set may be associated with one or more available filters. In addition, the user interface may contain one or more interactive fields or elements used to define how the created chart will be displayed to the user. For example, the interface may contain a drop-down menu allowing the user to select between different types of charts, such as a line graph, bar chart, or scatter plot.

FIG. 3B illustrates a user interface wherein a second chart 312 has been created using a second set of parameters entered by the user at interface 302. Second chart 312 is positioned directly below first chart 304, allowing for easy visual comparison. A select button 314 or other interface element may be located next to each created chart, allowing the user to select a chart for the performance of one or more manipulations. It is noted that first chart 304 and second chart 312 may be of different types. For example, first chart 304 is a line graph while second chart 312 is a scatter plot.

FIG. 3C illustrates a screen where the user has performed a manipulation on the first chart 304 that causes a corresponding manipulation to be performed on the second chart 312. In the illustrated example, the first and second charts share a common axis (x-axis indicating time). The charts can be configured by a user to be axis-locked (e.g., by selecting the first and second charts using buttons 314, and selecting an “axis lock” option), such that the manipulation of the axis of the first chart 304 (axis compression 316) causes the same manipulation on the axis of the second chart 312 (a corresponding axis compression 318).

FIG. 3D illustrates a screen wherein the first chart 304 and second chart 312 are merged to form a merged chart 320. As noted above, the first chart 304 and second chart 312 shared a common x-axis (corresponding to time). In addition, the two charts shared a common y-axis (corresponding to price). Thus, when merged, both the x-axis and the y-axis of the chart may remain unchanged. In some embodiments, when one or more charts are merged, a color of at least one of the charts will be changed in order to improve user readability. For example, first chart 304 and second chart 312 may have both been represented using the color blue prior to merging. When merged, second chart 312 may be changed to another color (e.g., green), so that the user will be able to differentiate between data from the first chart and data from the second chart.

FIG. 3E illustrates a screen where the merged chart 320 is merged with a third chart (a bar chart) to form merged chart 322. While all charts involved in the merge shared a common x-axis (time), the third chart had a y-axis different from that of merged chart 320. Thus, in merged chart 322, the y-axis for the original merged chart 320 (comprising first chart 304 and second chart 312) is displayed on the left side of the chart, while the y-axis of the third chart is displayed on the right side of the chart.

In some embodiments the user interface of the chart creation tool includes a time zone selection element, for example, a dropdown. Using the time zone selection element, the user may indicate a time zone in which the user is located. The system then automatically adjusts time-based attributes (such as timestamps) associated with the various data points obtained and plotted in the one or more charts, to be consistent with the indicated time zone. Accordingly, the various data points displayed to the user are more easily evaluated using as consistent time zone in which the user is located, and/or a preferred time zone of the user.

Cross-Application Coordination

In some embodiments, the chart creation tool (e.g., web app 104, described above in reference to FIGS. 2A-2C and 3A-3E) may be to perform a basic level of filtering on a data set. However, in many cases a user or analyst may desire a greater degree of control over the data than that provided by the chart creation tool. In addition, data items to be analyzed may contain many attributes (also referred to as metadata for the data items) that are not used or considered by the chart creation tool when creating a chart, and thus often do not contain functionality for the user to drill down into the full metadata of the data items used to create the chart.

Instead, a separate workspace application (e.g., workspace app 105) may be used to further filter or fine-tune the data to be analyzed. The workspace application may be used to create a set of data points, which are then sent to the chart creation tool to create the charts. The workspace application may further coordinate with the chart creation tool by allowing the user to access of full metadata of data items associated with selected chart data points.

FIGS. 4A and 4B illustrate flowcharts of processes for cross-application coordination in accordance with some embodiments. At block 402, the workspace application receives one or more data sets containing one or more data items. The data sets may be received by accessing one or more databases or data stores (e.g., database 106, as illustrated in FIG. 1). In some embodiments, the data set may be retrieved by querying database or data stores directly, e.g., without having to go through a database administrator. In some embodiments, the data set may also be imported from one or more other applications (e.g., an EXCEL spreadsheet).

At block 404, the desired data items to be used in creating the chart(s) are selected. In some embodiments, this may comprise defining one or more filters for narrowing the data set to specific data items. In addition, in some embodiments the user may manually add or remove certain data items from the selection. For example, the user may identify certain data items as outliers or otherwise undesirable to be included in the selection, even though it may not be readily apparent from the data item attributes, and remove those data items from the selection. Similarly, the user may be able to manually add one or more additional data items to the selection.

In some embodiments, data items from the received data set may be displayed in a graphical format (e.g., an array of dots or other selectable objects, wherein a dot represents an individual data item, as described below in reference to FIG. 6C) in a graphical interface. The user may use the graphical interface to select, de-select, group, and separate data items in order to form a desired selection.

At block 406, desired attributes of the selected data items are identified. In some embodiments, the desired attributes correspond to data item attributes that are relevant to the creation of the chart. For example, for a chart that plots share price against time, the desired attributes may comprise time and share price. In some embodiments, analysis and/or aggregation may be performed in order to obtain the desired attributes. For example, if the data items correspond to individual trades, and the chart to be created plots number of trades against time, the data items corresponding to individual trades may be aggregated to obtain a desired attribute (e.g., number of trades).

In some embodiments, the desired attributes may be determined based at least in part upon an input from the chart creation tool and/or some other application (e.g., based upon a type of chart to be created at the chart creation tool). For example, the chart creation tool and/or other application may communicate (automatic or user-initiated) with the workspace application indicating one or more desired attributes. In other embodiments, the desired attributes may be determined at least in part upon a type of data item selected. For example, certain types of data items may have one or more attributes designated as desirable attributes for chart creation. In other embodiments, the desired attributes may be based at least in part upon a selection or input by the user, corresponding to a chart that the user wishes to create, or other action the user intends on taking with respect to the data items. In some embodiments, identification of desired attributes may be based upon any combination of the options described above (e.g., a particular data type is associated with several possible desired attributes, which may then be narrowed down through user input or communication from the chart creation tool).

In addition to desired attributes, the data items may have many attributes that are not relevant to chart creation. For example, in the above example of a chart plotting number of trades against time, certain attributes, such as individual trader names, individual transaction numbers, amount of shares involved in the trade, etc., may not be relevant to the chart. Thus, at block 408, unnecessary attributes of the data items may be removed. By removing these attributes and retaining only the desired attributes of the selected data items, the amount of the data that needs to be sent to the chart creation tool can be greatly reduced, lowering the memory and processing requirements of the chart creation tool, as well as load on the network when transmitting the data.

At block 410, the stripped down data items are sent by the workspace to the chart creation tool as one or more data points. In some embodiments, the transmitted data points will each include an identifier identifying the data item corresponding to the data point. The identifier may correspond to an identifying attribute value of its associated data item, or be created if one does not already exist in the data item (e.g., a hash value using one or more attributes of the data item).

A variety of different methods may be used by the user to transmit the data points to the chart creation tool. For example, the workspace application may contain a display area where the user may drag and drop selected data items. Alternatively, a user may select the desired data items and click a button or other interface element to send the selected data items to the chart creation tool as data points.

In some embodiments, a link is established between the workspace app and the chart creation tool, allowing for data (e.g., data points) to be sent between them. For example, in some embodiments, a user, after launching or logging into the workspace app, may specify a chart creation tool to be linked with the workspace app. In other embodiments, the workspace app and chart creation tool may be linked based at least in part upon detection of a common user authentication for both programs. It is understood that in various embodiments, different methods of linking the workspace app with the chart creation tool may be used.

At block 412, the chart creation tool receives the data points from the workspace application. At block 414, the chart creation tool creates one or more charts based at least in part upon the received data points. In addition, the charts may be created based at least in part upon one or more addition user inputs, such as a user input specifying chart type. The user may also use the filtering functions of the chart creation tool (if any) to further filter the received data points prior to creating the charts. In some embodiments, a single chart is created from the received data points, while in other embodiments, multiple charts may be created (e.g., a first chart based upon a first subset of the received data points, and a second chart based upon a second subset of the received data points).

In some embodiments, data points from the created charts may be used to drill down into the attributes of the associated data items. For example, a user viewing the created charts via the chart web app may desire to view additional attribute data associated with certain data points or sets of data points in the chart. However, the additional attribute data may not be available at the chart creation tool, due to chart creation tool lacking means to display the addition attribute data, or because the additional attribute data was removed prior to the data points being transmitted to the chart creation tool. Therefore, communication with the workspace application may be required to allow the user to view the full metadata associated with the data points of the chart.

FIG. 4B illustrates a flowchart of a process coordinating between a chart creation tool (web app) and a separate workspace, in accordance with some embodiments. At block 416, a selection of one or more data points of a chart is received. For example, a user may click on a chart to select a data point, drag over an area of the chart to select multiple data points, specify desired data points using a text box or other interface element, and/or the like. The selected data points correspond to data items that the user wishes to obtain more information about.

At block 418, identifiers associated with the selected data points are identified. For example, as stated above, each data point that was sent to the chart creation tool for creating the chart is associated with an identifier that identifies the data item corresponding to the data point.

At block 420, the identifiers are sent to the workspace application. At block 422, the workspace application receives the identifiers from the web app. At block 424, the received identifiers are used to look up their associated data items.

At block 426, once the data items have been identified, the full metadata of the identified data items (or a portion thereof) may be displayed to the user. The data may be displayed as a table, chart, and/or any other visual format. In addition or in the alternative, the data item metadata may be stored and/or exported to another application (e.g., as an EXCEL spreadsheet). In an embodiment, the data item metadata may be transmitted back to the web app and displayed to the user in, for example, a pop up associated with the selected data point.

Although the methods illustrated in FIGS. 4A and 4B are described primarily in reference to chart creation tools, it is understood that they may be applied to a variety of applications. For example, the workspace application may be used to select one or more sets of data items (e.g., using filters, manual manipulations, and/or a combination thereof), stripping the data items of unneeded attributes, and transmitting stripped down data items to any type of separate application for further processing and/or analysis. In addition, the stripped down data items may be associated with identifiers, so that they when selected at the separate application, the identifiers can be transmitted back to the workspace application to retrieve the full metadata (or a portion thereof) of the original data items.

FIGS. 5A-5G illustrate example user interfaces for creating charts using a workspace application in conjunction with a chart creation tool, in accordance with some embodiments. FIG. 5A illustrates a user interface of a workspace application in accordance with some embodiments. The workspace application may contain a data display area 502 displaying one or more data items in a tabular format, wherein rows correspond to individual data items, and columns correspond to data item attributes. The workspace application may also contain an interface portion 504 comprising one or more user interface elements allowing a user to specify parameters to search through and/or filter data items from the data source, the results being displayed in display area 502.

FIG. 5B illustrates an example interface of the workspace application in accordance with some embodiments. In some embodiments, the data items to be graphed may be displayed in a graphical format in display area 506 for easier selection and/or filtering instead of in a tabular format as illustrated in FIG. 5A. For example, the data items may be displayed as an array of dots 508 (or other icon or graphic), wherein each dot in the array corresponds to an individual data item (hereinafter also referred to as a “data item dot”). Users may select, move, drag and drop, and perform other operations on individual data item dots or groups of data item dots.

In addition, the interface may contain interface elements allowing a user to send selected data items to the web app for chart creation. For example, the user may select the data items and drag them to a designated area 510, which are then sent to the web app and used to create a chart. In some embodiments, automatic stripping of unnecessary attributes of the data items may be performed (e.g., as in block 408 illustrated in FIG. 4A) in response to the user initiating transmission of data to the web app for chart creation.

FIG. 5C illustrates using the interface to filter the selected data items. For example, data items may be associated with a plurality of different properties or attributes. A user may select one or more data item attribute values at interface portion 504, wherein the data items matching the selection (e.g., having the selected attribute value) may be reflected in the graphical display of the data items in display area 506. For example, as shown in array 508 in FIG. 5C, data item dots that satisfy a selected attribute value are highlighted in a color different from the remaining data item dots that do not have the selected attribute value.

FIG. 5D illustrates the interface shown in FIG. 5C, wherein data items containing certain selected attributes or combinations of attributes are removed from the data set. For example, a user may select an attribute value or combination of attribute values, and select an action to perform on displayed data items having the selected attribute values. This may include removing all displayed data items having the selected attribute values, removing all displayed data items not having the selected attribute values, and/or the like. In some embodiments, the user, after selecting the data item dots or a subset of the data item dots, may perform a command to reorganize the selected data item dots as an array, in order to improve presentation and organization.

FIG. 5E illustrates the interface, wherein data items in the data set may be separated based upon data item attribute values (instead of simply removed). For example, in the illustrated interface, data items associated with a particular attribute value (or group of attribute values) are separated into a separate array 508b from data items associated that do not have that attribute value, which remain in array 508a. This allows the user to easily select data having particular attributes to be used for chart creation. For instance, by separating the data items into distinct arrays, a user more easily select data to create a first chart for data items having the attribute value (e.g., by selecting array 508b), and a second chart showing data items not having the attribute value (e.g., by selecting array 508a), allowing for easy comparison between the two.

In addition, a user may obtain additional information on individual data items (e.g., by a selecting or placing a cursor over a data item dot). For example, as illustrated in FIG. 5E, attribute values for a selected data item are displayed to the user at 512 when the user places a cursor over a corresponding data item dot.

FIG. 5F illustrates the interface, wherein the user may select and manipulate (e.g., remove or separate) particular data items from the data set. For example, the user may wish to separate a certain subset of data items (as a new array 508c) from the main data set (array 508a), in order to further refine or narrow the data items that are used to create the charts at the web app. The user may select individual data item dots and/or groups of data item dots in display area 506, without having to select particular filters or attribute values using interface 504.

FIG. 5G illustrates a plurality of charts that can be created using the selected data from the workspace. For example, the user may create a chart using all of the selected data, a chart using a first subset of the selected data (e.g., data items from arrays 508a, 508b, or 508c), and a chart using a second subset of the selected data (e.g., data items from a different array 508a, 508b, or 508c). In addition, the charts can be manipulated and/or merged to allow for easier analysis.

Data Item-Centric Data Model

To provide a framework for the description of specific systems and methods provided above and below, an example database system 1210 using an ontology 1205 will now be described in reference to FIGS. 6A-6C. This description is provided for the purpose of providing an example and is not intended to limit the techniques to the example data model, the example database system, or the example database system's use of an ontology to represent information.

In one embodiment, a body of data is conceptually structured according to data item-centric data model represented by ontology 1205. The conceptual data model is independent of any particular database used for durably storing one or more database(s) 1209 based on the ontology 1205. For example, each object of the conceptual data model may correspond to one or more rows in a relational database or an entry in Lightweight Directory Access Protocol (LDAP) database, or any combination of one or more databases.

FIG. 6A illustrates data item-centric conceptual data model (which may also be referred to as an “object-centric conceptual data model”) according to an embodiment. An ontology 1205, as noted above, may include stored information providing a data model for storage of data in the database 1209. The ontology 1205 may be defined by one or more data item types (which may also be referred to as “object types”), which may each be associated with one or more property types. At the highest level of abstraction, data item 1201 (which may also be referred to as a “data object” or “object”) is a container for information representing things in the world. For example, data item 1201 can represent an entity such as a person, a place, an organization, a market instrument, or other noun. Data item 1201 can represent an event that happens at a point in time or for a duration. Data item 1201 can represent a document or other unstructured data source such as a file (for example, a malware file), an email message, a news report, or a written paper or article. Each data item 1201 is associated with a unique identifier that uniquely identifies the data item within the database system.

Different types of data items may have different property types. For example, a “file” data item (as described above) may have various property types as described above (for example, various hash property types, associated file property types, various external analysis property types, and/or the like), a “Person” data item may have an “Eye Color” property type, and an “Event” data item may have a “Date” property type. Each property 1203 as represented by data in the database system 1210 may have a property type defined by the ontology 1205 used by the database 1205. Properties of data items may, in an embodiment, themselves be data items and/or associated with data items. For example, file data items may be associated with various analysis information items, as described above. Analysis information items may comprise data items and/or properties associated with data items (for example, file data items).

Items may be instantiated in the database 1209 in accordance with the corresponding data item definition for the particular data item in the ontology 1205. For example, a specific monetary payment (e.g., an item of type “event”) of US$30.00 (e.g., a property of type “currency”) taking place on Mar. 27, 2009 (e.g., a property of type “date”) may be stored in the database 1209 as an event data item with associated currency and date properties as defined within the ontology 1205.

The data objects defined in the ontology 1205 may support property multiplicity. In particular, a data item 1201 may be allowed to have more than one property 1203 of the same property type. For example, a “Person” data item may have multiple “Address” properties or multiple “Name” properties.

Each link 1202 represents a connection between two data items 1201. In one embodiment, the connection is either through a relationship, an event, or through matching properties. A relationship connection may be asymmetrical or symmetrical. For example, “Person” data item A may be connected to “Person” data item B by a “Child Of” relationship (where “Person” data item B has an asymmetric “Parent Of” relationship to “Person” data item A), a “Kin Of” symmetric relationship to “Person” data item C, and an asymmetric “Member Of” relationship to “Organization” data item X. The type of relationship between two data items may vary depending on the types of the data items. For example, “Person” data item A may have an “Appears In” relationship with “Document” data item Y or have a “Participate In” relationship with “Event” data item E. As an example of an event connection, two “Person” data items may be connected by an “Airline Flight” data item representing a particular airline flight if they traveled together on that flight, or by a “Meeting” data item representing a particular meeting if they both attended that meeting. In one embodiment, when two data items are connected by an event, they are also connected by relationships, in which each data item has a specific relationship to the event, such as, for example, an “Appears In” relationship.

As an example of a matching properties connection, two “Person” data items representing a brother and a sister, may both have an “Address” property that indicates where they live. If the brother and the sister live in the same home, then their “Address” properties likely contain similar, if not identical property values. In one embodiment, a link between two data items may be established based on similar or matching properties (e.g., property types and/or property values) of the data items. These are just some examples of the types of connections that may be represented by a link and other types of connections may be represented; embodiments are not limited to any particular types of connections between data items. For example, a document might contain references to two different items. For example, a document may contain a reference to a payment (one item), and a person (a second item). A link between these two items may represent a connection between these two entities through their co-occurrence within the same document.

Each data item 1201 may have multiple links with another data item 1201 to form a link set 1204. For example, two “Person” data items representing a husband and a wife could be linked through a “Spouse Of” relationship, a matching “Address” property, and one or more matching “Event” properties (e.g., a wedding). Each link 1202 as represented by data in a database may have a link type defined by the database ontology used by the database.

FIG. 6B is a block diagram illustrating example components and data that may be used in identifying and storing data according to an ontology. In this example, the ontology may be configured, and data in the data model populated, by a system of parsers and ontology configuration tools. In the embodiment of FIG. 6B, input data 1300 is provided to parser 1302. The input data may comprise data from one or more sources. For example, an institution may have one or more databases with information on credit card transactions, rental cars, and people. The databases may contain a variety of related information and attributes about each type of data, such as a “date” for a credit card transaction, an address for a person, and a date for when a rental car is rented. The parser 1302 is configured to read a variety of source input data types and determine which type of data it is reading.

In accordance with the discussion above, the example ontology 1205 comprises stored information providing the data model of data stored in database 1209, and the ontology is defined by one or more data item types 1310, one or more property types 1316, and one or more link types 1330. Based on information determined by the parser 1302 or other mapping of source input information to item type, one or more data items 1201 may be instantiated in the database 209 based on respective determined item types 1310, and each of the items 1201 has one or more properties 1203 that are instantiated based on property types 1316. Two data items 1201 may be connected by one or more links 1202 that may be instantiated based on link types 1330. The property types 1316 each may comprise one or more data types 1318, such as a string, number, etc. Property types 1316 may be instantiated based on a base property type 1320. For example, a base property type 1320 may be “Locations” and a property type 1316 may be “Home.”

In an embodiment, a user of the system uses an item type editor 1324 to create and/or modify the item types 1310 and define attributes of the item types. In an embodiment, a user of the system uses a property type editor 1326 to create and/or modify the property types 1316 and define attributes of the property types. In an embodiment, a user of the system uses link type editor 1328 to create the link types 1330. Alternatively, other programs, processes, or programmatic controls may be used to create link types and property types and define attributes, and using editors is not required.

In an embodiment, creating a property type 1316 using the property type editor 1326 involves defining at least one parser definition using a parser editor 1322. A parser definition comprises metadata that informs parser 1302 how to parse input data 1300 to determine whether values in the input data can be assigned to the property type 1316 that is associated with the parser definition. In an embodiment, each parser definition may comprise a regular expression parser 1304A or a code module parser 1304B. In other embodiments, other kinds of parser definitions may be provided using scripts or other programmatic elements. Once defined, both a regular expression parser 1304A and a code module parser 1304B can provide input to parser 1302 to control parsing of input data 1300.

Using the data types defined in the ontology, input data 1300 may be parsed by the parser 1302 determine which item type 1310 should receive data from a record created from the input data, and which property types 1316 should be assigned to data from individual field values in the input data. Based on the item/object-property mapping 1301, the parser 1302 selects one of the parser definitions that is associated with a property type in the input data. The parser parses an input data field using the selected parser definition, resulting in creating new or modified data 1303. The new or modified data 1303 is added to the database 1209 according to ontology 205 by storing values of the new or modified data in a property of the specified property type. As a result, input data 1300 having varying format or syntax can be created in database 1209. The ontology 1205 may be modified at any time using item/object type editor 1324, property type editor 1326, and link type editor 1328, or under program control without human use of an editor. Parser editor 1322 enables creating multiple parser definitions that can successfully parse input data 1300 having varying format or syntax and determine which property types should be used to transform input data 300 into new or modified input data 1303.

The properties, data items, and links (e.g. relationships) between the data items can be visualized using a graphical user interface (“GUI”). For example, FIG. 6C displays a user interface showing a graph representation 1403 of relationships (including relationships and/or links 1404, 1405, 1406, 1407, 1408, 1409, 1410, 1411, 1412, and 1413) between the data items (including data items 1421, 1422, 1423, 1424, 1425, 1426, 1427, 1428, and 1429) that are represented as nodes in the example of FIG. 6C. In this embodiment, the data items include person data items 1421, 1422, 1423, 1424, 1425, and 1426; a flight item 1427; a financial account 1428; and a computer data item 1429. In this example, each person node (associated with person data items), flight node (associated with flight data items), financial account node (associated with financial account data items), and computer node (associated with computer data items) may have relationships and/or links with any of the other nodes through, for example, other data items such as payment data items. Various aspects of the user interface of FIG. 6C may be similar to those of the user interfaces described above in reference to FIGS. 5A-5G.

For example, in FIG. 6C, relationship 1404 is based on a payment associated with the individuals indicated in person data items 1421 and 1423. The link 1404 represents these shared payments (for example, the individual associated with data item 1421 may have paid the individual associated with data item 1423 on three occasions). The relationship is further indicated by the common relationship between person data items 1421 and 1423 and financial account data item 1428. For example, link 1411 indicates that person data item 1421 transferred money into financial account data item 1428, while person data item 1423 transferred money out of financial account data item 1428. In another example, the relationships between person data items 1424 and 1425 and flight data item 1427 are indicated by links 1406, 1409, and 1410. In this example, person data items 1424 and 1425 have a common address and were passengers on the same flight data item 1427. In an embodiment, further details related to the relationships between the various items may be displayed. For example, links 1411 and 1412 may, in some embodiments, indicate the timing of the respective money transfers. In another example, the time of the flight associated with the flight data item 1427 may be shown.

Relationships between data items may be stored as links, or in some embodiments, as properties, where a relationship may be detected between the properties. In some cases, as stated above, the links may be directional. For example, a payment link may have a direction associated with the payment, where one person data item is a receiver of a payment, and another person data item is the payer of payment.

In various embodiments, data items may further include data items, metadata, and/or links related to detecting market manipulations, as described above. Such market manipulation-related data items may be accessed by the data analysis system for displaying objects and features on the user interface, selecting and filter particular data items, and transferring data item and/or data points to the chart creations tool and/or another application (as described above).

In addition to visually showing relationships between the data items, the user interface may allow various other manipulations. For example, the data items within database 1108 may be searched using a search interface 1450 (e.g., text string matching of data item properties), inspected (e.g., properties and associated data viewed), filtered (e.g., narrowing the universe of data items into sets and subsets by properties or relationships), and statistically aggregated (e.g., numerically summarized based on summarization criteria), among other operations and visualizations.

Implementation Mechanisms

According to an embodiment, the data analysis system and other methods and techniques described herein are implemented by one or more special-purpose computing devices. For example, any of the computing devices illustrated in FIG. 1, such as user station 101, application server 103, and/or web app 104, may be implemented on one or more special-purpose computing devices. The special-purpose computing devices may be hard-wired to perform the techniques, or may include digital electronic devices such as one or more application-specific integrated circuits (ASICs) or field programmable gate arrays (FPGAs) that are persistently programmed to perform the techniques, or may include one or more general purpose hardware processors programmed to perform the techniques pursuant to program instructions in firmware, memory, other storage, or a combination. Such special-purpose computing devices may also combine custom hard-wired logic, ASICs, or FPGAs with custom programming to accomplish the techniques. The special-purpose computing devices may be desktop computer systems, server computer systems, portable computer systems, handheld devices, networking devices or any other device or combination of devices that incorporate hard-wired and/or program logic to implement the techniques.

Computing device(s) are generally controlled and coordinated by operating system software, such as iOS, Android, Chrome OS, Windows XP, Windows Vista, Windows 7, Windows 8, Windows Server, Windows CE, Unix, Linux, SunOS, Solaris, iOS, Blackberry OS, VxWorks, or other compatible operating systems. In other embodiments, the computing device may be controlled by a proprietary operating system. Conventional operating systems control and schedule computer processes for execution, perform memory management, provide file system, networking, I/O services, and provide a user interface functionality, such as a graphical user interface (“GUI”), among other things.

For example, FIG. 7 is a block diagram that illustrates a computer system 800 upon which the various systems and methods discussed herein may be implemented. For instance, user station 101, application server 103, and/or web app 104 as illustrated in FIG. 1, may be implemented as one or more computer systems 800 or servers 830 as illustrated in FIG. 7.

Computer system 800 includes a bus 802 or other communication mechanism for communicating information, and a hardware processor, or multiple processors, 804 coupled with bus 802 for processing information. Hardware processor(s) 804 may be, for example, one or more general purpose microprocessors.

Computer system 800 also includes a main memory 806, such as a random access memory (RAM), cache and/or other dynamic storage devices, coupled to bus 802 for storing information and instructions to be executed by processor 804. Main memory 806 also may be used for storing temporary variables or other intermediate information during execution of instructions to be executed by processor 804. Such instructions, when stored in storage media accessible to processor 804, render computer system 800 into a special-purpose machine that is customized to perform the operations specified in the instructions.

Computer system 800 further includes a read only memory (ROM) 808 or other static storage device coupled to bus 802 for storing static information and instructions for processor 804. A storage device 810, such as a magnetic disk, optical disk, or USB thumb drive (Flash drive), and/or any other suitable data store, is provided and coupled to bus 802 for storing information (for example, file data items, analysis information data items, submission data items, and/or the like) and instructions.

Computer system 800 may be coupled via bus 802 to a display 812, such as a cathode ray tube (CRT), LCD display, or touch screen display, for displaying information to a computer user and/or receiving input from the user. An input device 814, including alphanumeric and other keys, is coupled to bus 802 for communicating information and command selections to processor 804. Another type of user input device is cursor control 816, such as a mouse, a trackball, or cursor direction keys for communicating direction information and command selections to processor 804 and for controlling cursor movement on display 812. 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 800 may include a user interface module, and/or various other types of modules to implement one or more graphical user interface of the data analysis system, as described above. The modules may be stored in a mass storage device as executable software codes that are executed by the computing device(s). This and other modules may include, by way of example, components, such as software components, object-oriented software components, class components and task components, processes, functions, attributes, procedures, subroutines, segments of program code, drivers, firmware, microcode, circuitry, data, databases, data structures, tables, arrays, and variables.

In general, the word “module,” as used herein, refers to a collection of software instructions, possibly having entry and exit points, written in a programming language, such as, for example, Java, Lua, C or C++. A software module may be compiled and linked into an executable program, installed in a dynamic link library, or may be written in an interpreted programming language such as, for example, BASIC, Perl, or Python. It will be appreciated that software modules may be callable from other modules or from themselves, and/or may be invoked in response to detected events or interrupts. Software modules configured for execution on computing devices may be provided on a computer readable medium, such as a compact disc, digital video disc, flash drive, magnetic disc, or any other tangible medium, or as a digital download (and may be originally stored in a compressed or installable format that requires installation, decompression or decryption prior to execution). Such software code may be stored, partially or fully, on a memory device of the executing computing device, for execution by the computing device. Software instructions may be embedded in firmware, such as an EPROM. It will be further appreciated that hardware devices (such as processors and CPUs) may be comprised of connected logic units, such as gates and flip-flops, and/or may be comprised of programmable units, such as programmable gate arrays or processors. Generally, the modules described herein refer to logical modules that may be combined with other modules or divided into sub-modules despite their physical organization or storage. In various embodiments, aspects of the methods and systems described herein may be implemented by one or more hardware devices, for example, as logic circuits. In various embodiments, some aspects of the methods and systems described herein may be implemented as software instructions, while other may be implemented in hardware, in any combination.

As mentioned, computer system 800 may implement the techniques described herein using customized hard-wired logic, one or more ASICs or FPGAs, firmware and/or program logic which in combination with the computer system causes or programs computer system 800 to be a special-purpose machine. According to one embodiment, the techniques herein are performed by computer system 800 in response to processor(s) 804 executing one or more sequences of one or more modules and/or instructions contained in main memory 806. Such instructions may be read into main memory 806 from another storage medium, such as storage device 810. Execution of the sequences of instructions contained in main memory 806 causes processor(s) 804 to perform the process steps described herein. In alternative embodiments, hard-wired circuitry may be used in place of or in combination with software instructions.

The term “non-transitory media,” and similar terms, as used herein refers to any media that store data and/or instructions that cause a machine to operate in a specific fashion. Such non-transitory media may comprise non-volatile media and/or volatile media. Non-volatile media includes, for example, optical or magnetic disks, such as storage device 810. Volatile media includes dynamic memory, such as main memory 806. Common forms of non-transitory media include, for example, a floppy disk, a flexible disk, hard disk, solid state drive, magnetic tape, or any other magnetic data storage medium, a CD-ROM, any other optical data storage medium, any physical medium with patterns of holes, a RAM, a PROM, and EPROM, a FLASH-EPROM, NVRAM, any other memory chip or cartridge, and networked versions of the same.

Non-transitory media is distinct from but may be used in conjunction with transmission media. Transmission media participates in transferring information between nontransitory media. For example, transmission media includes coaxial cables, copper wire and fiber optics, including the wires that comprise bus 802. Transmission media can also take the form of acoustic or light waves, such as those generated during radio-wave and infra-red data communications.

Various forms of media may be involved in carrying one or more sequences of one or more instructions to processor 804 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 and/or modules into its dynamic memory and send the instructions over a telephone line using a modem. A modem local to computer system 800 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 802. Bus 802 carries the data to main memory 806, from which processor 804 retrieves and executes the instructions. The instructions received by main memory 806 may optionally be stored on storage device 810 either before or after execution by processor 804.

Computer system 800 also includes a communication interface 818 coupled to bus 802. Communication interface 818 provides a two-way data communication coupling to a network link 820 that is connected to a local network 822. For example, communication interface 818 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 818 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 818 sends and receives electrical, electromagnetic or optical signals that carry digital data streams representing various types of information.

Network link 820 typically provides data communication through one or more networks to other data devices. For example, network link 820 may provide a connection through local network 822 to a host computer 824 or to data equipment operated by an Internet Service Provider (ISP) 826. ISP 826 in turn provides data communication services through the world wide packet data communication network now commonly referred to as the “Internet” 828. Local network 822 and Internet 828 both use electrical, electromagnetic or optical signals that carry digital data streams. The signals through the various networks and the signals on network link 820 and through communication interface 818, which carry the digital data to and from computer system 800, are example forms of transmission media. In some embodiments, network 102 (as illustrated in FIG. 1) may correspond to local network 822 and/or Internet 828.

Computer system 800 can send messages and receive data, including program code, through the network(s), network link 820 and communication interface 818. In the Internet example, a server 830 might transmit a requested code for an application program through Internet 828, ISP 826, local network 822 and communication interface 818. For example, in an embodiment various aspects of the data analysis system may be implemented on one or more of the servers 830 and may be transmitted to and from the computer system 800. For example, data points and/or data item identifiers items may be transmitted between computer system 800 and one or more servers 830. In an example, requests for external analyses of file data items may be transmitted to one or more third-party servers 830 (from, for example, the computer system 800 and/or another server 830 of the system), and analysis data may then be transmitted back from third-party servers 830.

In an embodiment, the data analysis system may be accessible by the user through a web-based viewer, such as a web browser. In this embodiment, the user interfaces of the system may be generated by a server (such as one of the servers 830) and/or the computer system 800 and transmitted to the web browser of the user. The user may then interact with the user interfaces through the web-browser. In an embodiment, the computer system 800 may comprise a mobile electronic device, such as a cell phone, smartphone, and/or tablet. The system may be accessible by the user through such a mobile electronic device, among other types of electronic devices.

ADDITIONAL EMBODIMENTS

While the foregoing is directed to various embodiments, other and further embodiments may be devised without departing from the basic scope thereof. For example, aspects of the present disclosure may be implemented in hardware or software or in a combination of hardware and software. An embodiment of the disclosure may be implemented as a program product for use with a computer system. The program(s) of the program product define functions of the embodiments (including the methods described herein) and may be contained on a variety of computer-readable storage media. Illustrative computer-readable storage media include, but are not limited to: (i) non-writable storage media (e.g., read-only memory devices within a computer such as CD-ROM disks readable by a CD-ROM drive, flash memory, ROM chips or any type of solid-state non-volatile semiconductor memory) on which information is permanently stored; and (ii) writable storage media (e.g., hard-disk drive or any type of solid-state random-access semiconductor memory) on which alterable information is stored. Each of the processes, methods, and algorithms described in the preceding sections may be embodied in, and fully or partially automated by, code modules executed by one or more computer systems or computer processors comprising computer hardware. The processes and algorithms may alternatively be implemented partially or wholly in application-specific circuitry.

The various features and processes described above may be used independently of one another, or may be combined in various ways. All possible combinations and subcombinations are intended to fall within the scope of this disclosure. In addition, certain method or process blocks may be omitted in some implementations. The methods and processes described herein are also not limited to any particular sequence, and the blocks or states relating thereto can be performed in other sequences that are appropriate. For example, described blocks or states may be performed in an order other than that specifically disclosed, or multiple blocks or states may be combined in a single block or state. The example blocks or states may be performed in serial, in parallel, or in some other manner. Blocks or states may be added to or removed from the disclosed example embodiments. The example systems and components described herein may be configured differently than described. For example, elements may be added to, removed from, or rearranged compared to the disclosed example embodiments.

Conditional language, such as, among others, “can,” “could,” “might,” or “may,” unless specifically stated otherwise, or otherwise understood within the context as used, is generally intended to convey that certain embodiments include, while other embodiments do not include, certain features, elements and/or steps. Thus, such conditional language is not generally intended to imply that features, elements and/or steps are in any way required for one or more embodiments or that one or more embodiments necessarily include logic for deciding, with or without user input or prompting, whether these features, elements and/or steps are included or are to be performed in any particular embodiment.

The term “comprising” as used herein should be given an inclusive rather than exclusive interpretation. For example, a general purpose computer comprising one or more processors should not be interpreted as excluding other computer components, and may possibly include such components as memory, input/output devices, and/or network interfaces, among others.

Any process descriptions, elements, or blocks in the flow diagrams described herein and/or depicted in the attached figures should be understood as potentially representing modules, segments, or portions of code which include one or more executable instructions for implementing specific logical functions or steps in the process. Alternate implementations are included within the scope of the embodiments described herein in which elements or functions may be deleted, executed out of order from that shown or discussed, including substantially concurrently or in reverse order, depending on the functionality involved, as would be understood by those skilled in the art.

It should be emphasized that many variations and modifications may be made to the above-described embodiments, the elements of which are among other acceptable examples. All such modifications and variations are intended to be included herein within the scope of this disclosure. The foregoing description details certain embodiments of the invention. It will be appreciated, however, that no matter how detailed the foregoing appears in text, the invention may be practiced in many ways. As is also stated above, it should be noted that the use of particular terminology when describing certain features or aspects of the invention should not be taken to imply that the terminology is being re-defined herein to be restricted to including any specific characteristics of the features or aspects of the invention with which that terminology is associated. The scope of the invention should therefore be construed in accordance with the appended claims and any equivalents thereof.

Claims

1. A computer system comprising: one or more computer readable storage devices configured to store: a plurality of computer executable instructions; anda plurality of data items, wherein each of the data items of the plurality of data items is associated with a respective plurality of attributes;one or more hardware computer processors in communication with the one or more computer readable storage devices and configured to execute the plurality of computer executable instructions to cause the computer system to: receive one or more search or filter parameters at a workspace application;select a set of data items, from the plurality of data items, based at least in part on the one or more search or filter parameters;in response to receiving a request to provide the selected set of data items to a chart creation tool to create a chart based at least in part on the selected set of data items: identify attributes of the selected set data items that are not needed to create the chart;remove, from the respective pluralities of attributes of the selected set of data items, the attributes that are not needed to create the chart;create a set of data points based on the selected set of data items from which the attributes that are not needed to create the chart have been removed; andsend the set of data points to the chart creation tool separate from the workspace application; andat the chart creation tool, in response to receiving the set of data points, automatically create a chart based at least in part on the received set of data points.
2. The computer system of claim 1, wherein the workspace application comprises a user interface containing a designated display area, and wherein the one or more hardware computer processors are further configured to execute the plurality of computer executable instructions to cause the computer system to: display, in the designated display area, interactive graphical representations of at least some of the data items of the plurality of data items;receive a first user input selecting the interactive graphical representations associated with the selected set of data items;receive a second user input dragging and dropping the interactive graphical representations associated with the selected set of data items onto the designated display area of the user interface; andcause said identifying attributes, said removing the attributes, and said sending the set of data points in response to receiving the second user input.
3. The computer system of claim 1, wherein a data point of the set of data points contains a corresponding identifier, wherein the identifier identifies a data item of the selected set of data items corresponding to the data point.
4. The computer system of claim 3, wherein the one or more hardware computer processors are further configured to execute the plurality of computer executable instructions to cause the computer system to: receive a selection of one or more data points on the created chart;identify one or more identifiers corresponding to the selected data points;send the one or more identifiers to the workspace application; andat the workspace application, in response to receiving the one or more identifiers; identify data items corresponding to the one or more identifiers; andretrieve attribute data associated with the identified data items.
5. The computer system of claim 1, wherein selecting the set of data items further comprises manually adding one or more data items to, or removing one or more data items from, the set of data items.
6. The computer system of claim 5, wherein the selected set of data items is displayed to a user as an array of selectable objects in a user interface.
7. The computer system of claim 1, wherein creating a chart comprises creating a first chart based at least in part on a first subset of the set of data points, and a second chart based at least in part on a second subset of the set of data points.
8. The computer system of claim 7, wherein the one or more hardware computer processors are further configured to execute the plurality of computer executable instructions to cause the computer system to: receive a user input specifying a manipulation to be performed on the first chart;perform the manipulation on the first chart based at least in part on the received input; andautomatically perform a corresponding manipulation on the second chart in response to the manipulation of the first chart.
9. The computer system of claim 8, wherein the corresponding manipulation of the second chart is only performed if the first chart has a compatible attribute with the second chart.
10. The computer system of claim 8, wherein the manipulation comprises an expansion or compression of an axis of the first chart.
11. The computer system of claim 7, wherein the one or more hardware computer processors are further configured to execute the plurality of computer executable instructions to cause the computer system to: receive a user input identifying a first chart;identify a second chart that is compatible with the first chart; andmerge the first chart with the second chart.
12. The computer system of claim 11, wherein the second chart is compatible with the first chart if the second chart contains at least one compatible axis with the first chart.
13. The computer system of claim 1, wherein the one or more hardware computer processors are further configured to execute the plurality of computer executable instructions to cause the computer system to: identify the attributes of the selected set of data items that are not needed to create the chart based at least in part on a type of the chart.
14. A computer-implemented method comprising: by one or more processors executing program instructions: communicating with one or more computer readable storage devices configured to store: a plurality of computer executable instructions; anda plurality of data items, wherein each of the data items of the plurality of data items is associated with a respective plurality of attributes;receiving one or more search or filter parameters at a workspace application;selecting a set of data items, from the plurality of data items, based at least in part on the one or more search or filter parameters;in response to receiving a request to provide the selected set of data items to a chart creation tool to create a chart based at least in part on the selected set of data items: identifying attributes of the selected set data items that are not needed to create the chart;removing, from the respective pluralities of attributes of the selected set of data items, the attributes that are not needed to create the chart;creating a set of data points based on the selected set of data items from which the attributes that are not needed to create the chart have been removed; andsending the set of data points to the chart creation tool separate from the workspace application; andat the chart creation tool, in response to receiving the set of data points, automatically creating a chart based at least in part on the received set of data points.
15. The computer-implemented method of claim 14, wherein the workspace application comprises a user interface containing a designated display area, and wherein the computer-implemented method further comprises: by the one or more processors executing program instructions: displaying, in the designated display area, interactive graphical representations of at least some of the data items of the plurality of data items;receiving a first user input selecting the interactive graphical representations associated with the selected set of data items;receiving a second user input dragging and dropping the interactive graphical representations associated with the selected set of data items onto the designated display area of the user interface; andcausing said identifying attributes, said removing the attributes, and said sending the set of data points in response to receiving the second user input.
16. The computer-implemented method of claim 14, wherein a data point of the set of data points contains a corresponding identifier, wherein the identifier identifies a data item of the selected set of data items corresponding to the data point.
17. The computer-implemented method of claim 16 further comprising: by the one or more processors executing program instructions: receiving a selection of one or more data points on the created chart;identifying one or more identifiers corresponding to the selected data points;sending the one or more identifiers to the workspace application; andat the workspace application, in response to receiving the one or more identifiers; identifying data items corresponding to the one or more identifiers; andretrieving attribute data associated with the identified data items.
18. The computer-implemented method of claim 14, wherein selecting the set of data items further comprises manually adding one or more data items to, or removing one or more data items from, the set of data items.
19. The computer-implemented method of claim 18, wherein the selected set of data items is displayed to a user as an array of selectable objects in a user interface.
20. A computer readable storage medium having program instructions embodied therewith, the program instructions executable by one or more processors to cause the one or more processors to: communicate with one or more computer readable storage devices configured to store: a plurality of computer executable instructions; anda plurality of data items, wherein each of the data items of the plurality of data items is associated with a respective plurality of attributes;receive one or more search or filter parameters at a workspace application;select a set of data items, from the plurality of data items, based at least in part on the one or more search or filter parameters;in response to receiving a request to provide the selected set of data items to a chart creation tool to create a chart based at least in part on the selected set of data items: identify attributes of the selected set data items that are not needed to create the chart;remove, from the respective pluralities of attributes of the selected set of data items, the attributes that are not needed to create the chart;create a set of data points based on the selected set of data items from which the attributes that are not needed to create the chart have been removed; andsend the set of data points to the chart creation tool separate from the workspace application; andat the chart creation tool, in response to receiving the set of data points, automatically create a chart based at least in part on the received set of data points.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No. 14/584,961, filed Dec. 29, 2014, entitled “SYSTEM AND METHOD OF GENERATING DATA POINTS FROM ONE OR MORE DATA STORES OF DATA ITEMS FOR CHART CREATION AND MANIPULATION.” The entire disclosure of the above item is hereby made part of this specification as if set forth fully herein and incorporated by reference for all purposes, for all that it contains. Any and all applications for which a foreign or domestic priority claim is identified in the Application Data Sheet as filed with the present application are hereby incorporated by reference under 37 CFR 1.57.

US Referenced Citations (939)

Number	Name	Date	Kind
5109399	Thompson	Apr 1992	A
5329108	Lamoure	Jul 1994	A
5632009	Rao et al.	May 1997	A
5670987	Doi et al.	Sep 1997	A
5724575	Hoover et al.	Mar 1998	A
5781704	Rossmo	Jul 1998	A
5798769	Chiu et al.	Aug 1998	A
5845300	Comer	Dec 1998	A
5872973	Mitchell et al.	Feb 1999	A
5897636	Kaeser	Apr 1999	A
6003040	Mital et al.	Dec 1999	A
6057757	Arrowsmith et al.	May 2000	A
6073129	Levine et al.	Jun 2000	A
6091956	Hollenberg	Jul 2000	A
6094653	Li et al.	Jul 2000	A
6161098	Wallman	Dec 2000	A
6167405	Rosensteel, Jr. et al.	Dec 2000	A
6219053	Tachibana et al.	Apr 2001	B1
6232971	Haynes	May 2001	B1
6243717	Gordon et al.	Jun 2001	B1
6247019	Davies	Jun 2001	B1
6279018	Kudrolli et al.	Aug 2001	B1
6304873	Klein et al.	Oct 2001	B1
6341310	Leshem et al.	Jan 2002	B1
6366933	Ball et al.	Apr 2002	B1
6369835	Lin	Apr 2002	B1
6374251	Fayyad et al.	Apr 2002	B1
6418438	Campbell	Jul 2002	B1
6430305	Decker	Aug 2002	B1
6456997	Shukla	Sep 2002	B1
6510504	Satyanarayana	Jan 2003	B2
6549752	Tsukamoto	Apr 2003	B2
6549944	Weinberg et al.	Apr 2003	B1
6560620	Ching	May 2003	B1
6567936	Yang et al.	May 2003	B1
6574635	Stauber et al.	Jun 2003	B2
6581068	Bensoussan et al.	Jun 2003	B1
6594672	Lampson et al.	Jul 2003	B1
6631496	Li et al.	Oct 2003	B1
6642945	Sharpe	Nov 2003	B1
6674434	Chojnacki et al.	Jan 2004	B1
6714936	Nevin, III	Mar 2004	B1
6745382	Zothner	Jun 2004	B1
6775675	Nwabueze et al.	Aug 2004	B1
6820135	Dingman	Nov 2004	B1
6828920	Owen et al.	Dec 2004	B2
6839745	Dingari et al.	Jan 2005	B1
6877137	Rivette et al.	Apr 2005	B1
6906717	Couckuyt	Jun 2005	B2
6976210	Silva et al.	Dec 2005	B1
6978419	Kantrowitz	Dec 2005	B1
6980984	Huffman et al.	Dec 2005	B1
6985950	Hanson et al.	Jan 2006	B1
7036085	Barros	Apr 2006	B2
7043702	Chi et al.	May 2006	B2
7055110	Kupka et al.	May 2006	B2
7058648	Lightfoot et al.	Jun 2006	B1
7111231	Huck et al.	Sep 2006	B1
7139800	Bellotti et al.	Nov 2006	B2
7158878	Rasmussen et al.	Jan 2007	B2
7162475	Ackerman	Jan 2007	B2
7168039	Bertram	Jan 2007	B2
7171427	Witowski et al.	Jan 2007	B2
7194680	Roy et al.	Mar 2007	B1
7269786	Malloy et al.	Sep 2007	B1
7278105	Kitts	Oct 2007	B1
7290698	Poslinski et al.	Nov 2007	B2
7318054	Nomura et al.	Jan 2008	B2
7333998	Heckerman et al.	Feb 2008	B2
7370047	Gorman	May 2008	B2
7373669	Eisen	May 2008	B2
7379811	Rasmussen et al.	May 2008	B2
7379903	Caballero et al.	May 2008	B2
7392249	Harris et al.	Jun 2008	B1
7426654	Adams et al.	Sep 2008	B2
7451397	Weber et al.	Nov 2008	B2
7454466	Bellotti et al.	Nov 2008	B2
7461158	Rider et al.	Dec 2008	B2
7467375	Tondreau et al.	Dec 2008	B2
7487139	Fraleigh et al.	Feb 2009	B2
7502786	Liu et al.	Mar 2009	B2
7525422	Bishop et al.	Apr 2009	B2
7529727	Arning et al.	May 2009	B2
7529734	Dirisala	May 2009	B2
7558677	Jones	Jul 2009	B2
7574409	Patinkin	Aug 2009	B2
7574428	Leiserowitz et al.	Aug 2009	B2
7579965	Bucholz	Aug 2009	B2
7596285	Brown et al.	Sep 2009	B2
7614006	Molander	Nov 2009	B2
7617232	Gabbert et al.	Nov 2009	B2
7620628	Kapur et al.	Nov 2009	B2
7627812	Chamberlain et al.	Dec 2009	B2
7634717	Chamberlain et al.	Dec 2009	B2
7703021	Flam	Apr 2010	B1
7706817	Bamrah et al.	Apr 2010	B2
7712049	Williams et al.	May 2010	B2
7716077	Mikurak	May 2010	B1
7725530	Sah et al.	May 2010	B2
7725547	Albertson et al.	May 2010	B2
7725728	Ama et al.	May 2010	B2
7730082	Sah et al.	Jun 2010	B2
7730109	Rohrs et al.	Jun 2010	B2
7756843	Palmer	Jul 2010	B1
7761407	Stern	Jul 2010	B1
7770100	Chamberlain et al.	Aug 2010	B2
7783658	Bayliss	Aug 2010	B1
7805457	Viola et al.	Sep 2010	B1
7809703	Balabhadrapatruni et al.	Oct 2010	B2
7814084	Hallett et al.	Oct 2010	B2
7814102	Miller et al.	Oct 2010	B2
7818658	Chen	Oct 2010	B2
7870493	Pall et al.	Jan 2011	B2
7894984	Rasmussen et al.	Feb 2011	B2
7899611	Downs et al.	Mar 2011	B2
7899796	Borthwick et al.	Mar 2011	B1
7917376	Bellin et al.	Mar 2011	B2
7920963	Jouline et al.	Apr 2011	B2
7933862	Chamberlain et al.	Apr 2011	B2
7941321	Greenstein et al.	May 2011	B2
7962281	Rasmussen et al.	Jun 2011	B2
7962495	Jain et al.	Jun 2011	B2
7962848	Bertram	Jun 2011	B2
7970240	Chao et al.	Jun 2011	B1
7971150	Raskutti et al.	Jun 2011	B2
7979457	Garman	Jul 2011	B1
7984374	Caro 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
8024778	Cash et al.	Sep 2011	B2
8036632	Cona et al.	Oct 2011	B1
8036971	Aymeloglu et al.	Oct 2011	B2
8041714	Aymeloglu et al.	Oct 2011	B2
8046283	Burns	Oct 2011	B2
8046362	Bayliss	Oct 2011	B2
8054756	Chand et al.	Nov 2011	B2
8095582	Cramer	Jan 2012	B2
8103543	Zwicky	Jan 2012	B1
8112425	Baum et al.	Feb 2012	B2
8126848	Wagner	Feb 2012	B2
8134457	Velipasalar et al.	Mar 2012	B2
8135679	Bayliss	Mar 2012	B2
8135719	Bayliss	Mar 2012	B2
8145703	Frishert et al.	Mar 2012	B2
8185819	Sah et al.	May 2012	B2
8196184	Amirov et al.	Jun 2012	B2
8214361	Sandler et al.	Jul 2012	B1
8214490	Vos et al.	Jul 2012	B1
8214764	Gemmell et al.	Jul 2012	B2
8225201	Michael	Jul 2012	B2
8229902	Vishniac et al.	Jul 2012	B2
8229947	Fujinaga	Jul 2012	B2
8230333	Decherd et al.	Jul 2012	B2
8250474	Peters et al.	Aug 2012	B2
8266168	Bayliss	Sep 2012	B2
8271461	Pike et al.	Sep 2012	B2
8280880	Aymeloglu et al.	Oct 2012	B1
8290838	Thakur et al.	Oct 2012	B1
8290926	Ozzie et al.	Oct 2012	B2
8290942	Jones et al.	Oct 2012	B2
8301464	Cave et al.	Oct 2012	B1
8301904	Gryaznov	Oct 2012	B1
8302855	Ma et al.	Nov 2012	B2
8312367	Foster	Nov 2012	B2
8312546	Alme	Nov 2012	B2
8321943	Walters et al.	Nov 2012	B1
8347398	Weber	Jan 2013	B1
8352881	Champion et al.	Jan 2013	B2
8368695	Howell et al.	Feb 2013	B2
8375141	Rowstron et al.	Feb 2013	B2
8392394	Kumar et al.	Mar 2013	B1
8397171	Klassen et al.	Mar 2013	B2
8412707	Mianji	Apr 2013	B1
8423909	Zabielski	Apr 2013	B2
8447674	Choudhuri et al.	May 2013	B2
8447722	Ahuja et al.	May 2013	B1
8452790	Mianji	May 2013	B1
8463036	Ramesh et al.	Jun 2013	B1
8473454	Evanitsky et al.	Jun 2013	B2
8484115	Aymeloglu et al.	Jul 2013	B2
8484168	Bayliss	Jul 2013	B2
8489331	Kopf et al.	Jul 2013	B2
8489623	Jain et al.	Jul 2013	B2
8489641	Seefeld et al.	Jul 2013	B1
8495077	Bayliss	Jul 2013	B2
8498969	Bayliss	Jul 2013	B2
8498984	Hwang et al.	Jul 2013	B1
8504542	Chang et al.	Aug 2013	B2
8510743	Hackborn et al.	Aug 2013	B2
8514082	Cova et al.	Aug 2013	B2
8515207	Chau	Aug 2013	B2
8554579	Tribble et al.	Oct 2013	B2
8554653	Falkenborg et al.	Oct 2013	B2
8554709	Goodson et al.	Oct 2013	B2
8560413	Quarterman	Oct 2013	B1
8577911	Stepinski et al.	Nov 2013	B1
8589273	Creeden et al.	Nov 2013	B2
8595234	Siripuapu et al.	Nov 2013	B2
8600872	Yan	Dec 2013	B1
8620641	Farnsworth et al.	Dec 2013	B2
8620934	Fong	Dec 2013	B2
8639757	Zang et al.	Jan 2014	B1
8646080	Williamson et al.	Feb 2014	B2
8656478	Forristal	Feb 2014	B1
8676857	Adams et al.	Mar 2014	B1
8682812	Ranjan	Mar 2014	B1
8688573	Ruknoic et al.	Apr 2014	B1
8689108	Duffield et al.	Apr 2014	B1
8700643	Gossweiler	Apr 2014	B1
8713467	Goldenberg et al.	Apr 2014	B1
8726379	Stiansen et al.	May 2014	B1
8739278	Varghese	May 2014	B2
8742934	Sarpy et al.	Jun 2014	B1
8744890	Bernier	Jun 2014	B1
8745516	Mason et al.	Jun 2014	B2
8781169	Jackson et al.	Jul 2014	B2
8786605	Curtis et al.	Jul 2014	B1
8787939	Papakipos et al.	Jul 2014	B2
8788405	Sprague et al.	Jul 2014	B1
8788407	Singh et al.	Jul 2014	B1
8799799	Cervelli et al.	Aug 2014	B1
8812960	Sun et al.	Aug 2014	B1
8818892	Sprague et al.	Aug 2014	B1
8830322	Nerayoff et al.	Sep 2014	B2
8832594	Thompson et al.	Sep 2014	B1
8868537	Colgrove et al.	Oct 2014	B1
8898184	Garman	Nov 2014	B1
8917274	Ma et al.	Dec 2014	B2
8924388	Elliot et al.	Dec 2014	B2
8924389	Elliot et al.	Dec 2014	B2
8924872	Bogomolov et al.	Dec 2014	B1
8930331	McGrew et al.	Jan 2015	B2
8937619	Sharma et al.	Jan 2015	B2
8938686	Erenrich et al.	Jan 2015	B1
8949164	Mohler	Feb 2015	B1
8954410	Chang et al.	Feb 2015	B2
9009171	Grossman et al.	Apr 2015	B1
9009827	Albertson et al.	Apr 2015	B1
9021260	Falk et al.	Apr 2015	B1
9021384	Beard et al.	Apr 2015	B1
9043696	Meiklejohn et al.	May 2015	B1
9043894	Dennison et al.	May 2015	B1
9069842	Melby	Jun 2015	B2
9092482	Harris et al.	Jul 2015	B2
9100428	Visbal	Aug 2015	B1
9116975	Shankar et al.	Aug 2015	B2
9129219	Robertson et al.	Sep 2015	B1
9135233	Fan	Sep 2015	B2
9135658	Sprague et al.	Sep 2015	B2
9146954	Boe et al.	Sep 2015	B1
9165299	Stowe et al.	Oct 2015	B1
9171334	Visbal et al.	Oct 2015	B1
9177344	Singh et al.	Nov 2015	B1
9202249	Cohen et al.	Dec 2015	B1
9208159	Stowe et al.	Dec 2015	B2
9229952	Meacham et al.	Jan 2016	B1
9230280	Maag et al.	Jan 2016	B1
9256664	Chakerian et al.	Feb 2016	B2
9280532	Cicerone	Mar 2016	B2
9344447	Cohen et al.	May 2016	B2
9348920	Kesin	May 2016	B1
9367872	Visbal et al.	Jun 2016	B1
9535974	Kesin et al.	Jan 2017	B1
9547693	Sheasby et al.	Jan 2017	B1
9645727	Devarajan	May 2017	B2
9817563	Stokes et al.	Nov 2017	B1
9898528	Kesin	Feb 2018	B2
10180929	Kesin et al.	Jan 2019	B1
20010021936	Bertram	Sep 2001	A1
20010051949	Carey et al.	Dec 2001	A1
20010056522	Satyanarayana	Dec 2001	A1
20020013781	Petersen et al.	Jan 2002	A1
20020033848	Sciammarella et al.	Mar 2002	A1
20020065708	Senay et al.	May 2002	A1
20020083039	Ferrari	Jun 2002	A1
20020091694	Hrle et al.	Jul 2002	A1
20020091707	Keller	Jul 2002	A1
20020095360	Joao	Jul 2002	A1
20020095658	Shulman	Jul 2002	A1
20020103705	Brady	Aug 2002	A1
20020116120	Ruiz et al.	Aug 2002	A1
20020130907	Chi et al.	Sep 2002	A1
20020147805	Leshem et al.	Oct 2002	A1
20020169759	Kraft et al.	Nov 2002	A1
20020174201	Ramer et al.	Nov 2002	A1
20020194119	Wright et al.	Dec 2002	A1
20030028560	Kudrolli et al.	Feb 2003	A1
20030033228	Bosworth-Davies et al.	Feb 2003	A1
20030036848	Sheha et al.	Feb 2003	A1
20030039948	Donahue	Feb 2003	A1
20030055830	Gutierrez-Rivas et al.	Mar 2003	A1
20030074368	Schuetze et al.	Apr 2003	A1
20030097330	Hillmer et al.	May 2003	A1
20030105759	Bess et al.	Jun 2003	A1
20030115481	Baird et al.	Jun 2003	A1
20030120675	Stauber et al.	Jun 2003	A1
20030126102	Borthwick	Jul 2003	A1
20030130993	Mendelevitch et al.	Jul 2003	A1
20030140106	Raguseo	Jul 2003	A1
20030144868	MacIntyre et al.	Jul 2003	A1
20030154044	Lundstedt et al.	Aug 2003	A1
20030163352	Surpin et al.	Aug 2003	A1
20030172014	Quackenbush et al.	Sep 2003	A1
20030200217	Ackerman	Oct 2003	A1
20030212718	Tester	Nov 2003	A1
20030225755	Iwayama et al.	Dec 2003	A1
20030229848	Arend et al.	Dec 2003	A1
20040032432	Baynger	Feb 2004	A1
20040034570	Davis	Feb 2004	A1
20040064256	Barinek et al.	Apr 2004	A1
20040085318	Hassler et al.	May 2004	A1
20040095349	Bito et al.	May 2004	A1
20040111410	Burgoon et al.	Jun 2004	A1
20040111480	Yue	Jun 2004	A1
20040117345	Bamford et al.	Jun 2004	A1
20040117387	Civetta et al.	Jun 2004	A1
20040126840	Cheng et al.	Jul 2004	A1
20040143602	Ruiz et al.	Jul 2004	A1
20040143796	Lerner et al.	Jul 2004	A1
20040148301	McKay et al.	Jul 2004	A1
20040153418	Hanweck	Aug 2004	A1
20040160309	Stilp	Aug 2004	A1
20040163039	Gorman	Aug 2004	A1
20040181543	Wu et al.	Sep 2004	A1
20040181554	Heckerman et al.	Sep 2004	A1
20040193600	Kaasten et al.	Sep 2004	A1
20040205524	Richter et al.	Oct 2004	A1
20040221223	Yu et al.	Nov 2004	A1
20040236688	Bozeman	Nov 2004	A1
20040260702	Cragun et al.	Dec 2004	A1
20040267746	Marcjan et al.	Dec 2004	A1
20050010472	Quatse et al.	Jan 2005	A1
20050027705	Sadri et al.	Feb 2005	A1
20050028094	Allyn	Feb 2005	A1
20050039119	Parks et al.	Feb 2005	A1
20050065811	Chu et al.	Mar 2005	A1
20050078858	Yao et al.	Apr 2005	A1
20050080769	Gemmell	Apr 2005	A1
20050086207	Heuer et al.	Apr 2005	A1
20050097441	Herbach et al.	May 2005	A1
20050108063	Madill et al.	May 2005	A1
20050108231	Findleton et al.	May 2005	A1
20050114763	Nonomura et al.	May 2005	A1
20050125715	Di Franco et al.	Jun 2005	A1
20050154628	Eckart et al.	Jul 2005	A1
20050154769	Eckart et al.	Jul 2005	A1
20050162523	Darrell et al.	Jul 2005	A1
20050166144	Gross	Jul 2005	A1
20050180330	Shapiro	Aug 2005	A1
20050182793	Keenan et al.	Aug 2005	A1
20050183005	Denoue et al.	Aug 2005	A1
20050210409	Jou	Sep 2005	A1
20050222928	Steier et al.	Oct 2005	A1
20050246327	Yeung et al.	Nov 2005	A1
20050251786	Citron et al.	Nov 2005	A1
20050289524	McGinnes	Dec 2005	A1
20060026120	Carolan et al.	Feb 2006	A1
20060026170	Kreitler et al.	Feb 2006	A1
20060045470	Poslinski et al.	Mar 2006	A1
20060059139	Robinson	Mar 2006	A1
20060074866	Chamberlain et al.	Apr 2006	A1
20060074881	Vembu et al.	Apr 2006	A1
20060080316	Gilmore et al.	Apr 2006	A1
20060080616	Vogel et al.	Apr 2006	A1
20060080619	Carlson et al.	Apr 2006	A1
20060093222	Saffer et al.	May 2006	A1
20060095521	Patinkin	May 2006	A1
20060106847	Eckardt et al.	May 2006	A1
20060116991	Calderwood	Jun 2006	A1
20060129746	Porter	Jun 2006	A1
20060136402	Lee et al.	Jun 2006	A1
20060139375	Rasmussen et al.	Jun 2006	A1
20060142949	Helt	Jun 2006	A1
20060143034	Rothermel	Jun 2006	A1
20060143075	Carr et al.	Jun 2006	A1
20060143079	Basak et al.	Jun 2006	A1
20060149596	Surpin et al.	Jul 2006	A1
20060161558	Tamma et al.	Jul 2006	A1
20060184889	Molander	Aug 2006	A1
20060203337	White	Sep 2006	A1
20060209085	Wong et al.	Sep 2006	A1
20060218206	Bourbonnais et al.	Sep 2006	A1
20060218405	Ama et al.	Sep 2006	A1
20060218491	Grossman et al.	Sep 2006	A1
20060218637	Thomas et al.	Sep 2006	A1
20060241974	Chao et al.	Oct 2006	A1
20060242040	Rader	Oct 2006	A1
20060242630	Koike et al.	Oct 2006	A1
20060253502	Raman et al.	Nov 2006	A1
20060265397	Bryan et al.	Nov 2006	A1
20060271277	Hu et al.	Nov 2006	A1
20060279630	Aggarwal et al.	Dec 2006	A1
20070000999	Kubo et al.	Jan 2007	A1
20070011150	Frank	Jan 2007	A1
20070011304	Error	Jan 2007	A1
20070016363	Huang et al.	Jan 2007	A1
20070038646	Thota	Feb 2007	A1
20070038962	Fuchs et al.	Feb 2007	A1
20070050429	Goldring et al.	Mar 2007	A1
20070057966	Ohno et al.	Mar 2007	A1
20070061487	Moore et al.	Mar 2007	A1
20070078832	Ott et al.	Apr 2007	A1
20070083541	Fraleigh et al.	Apr 2007	A1
20070094389	Nussey et al.	Apr 2007	A1
20070106582	Baker et al.	May 2007	A1
20070130206	Zhou et al.	Jun 2007	A1
20070143253	Kostamaa et al.	Jun 2007	A1
20070150369	Zivin	Jun 2007	A1
20070150801	Chidlovskii et al.	Jun 2007	A1
20070156673	Maga	Jul 2007	A1
20070174760	Chamberlain et al.	Jul 2007	A1
20070185850	Walters et al.	Aug 2007	A1
20070185867	Maga	Aug 2007	A1
20070192265	Chopin et al.	Aug 2007	A1
20070198571	Ferguson et al.	Aug 2007	A1
20070208497	Downs et al.	Sep 2007	A1
20070208498	Barker et al.	Sep 2007	A1
20070208736	Tanigawa et al.	Sep 2007	A1
20070233709	Abnous	Oct 2007	A1
20070233756	D'Souza et al.	Oct 2007	A1
20070240062	Christena et al.	Oct 2007	A1
20070266336	Nojima et al.	Nov 2007	A1
20070271317	Carmel	Nov 2007	A1
20070284433	Domenica et al.	Dec 2007	A1
20070294200	Au	Dec 2007	A1
20070294643	Kyle	Dec 2007	A1
20080015970	Brookfield et al.	Jan 2008	A1
20080016216	Worley et al.	Jan 2008	A1
20080040275	Paulsen et al.	Feb 2008	A1
20080040684	Crump	Feb 2008	A1
20080051989	Welsh	Feb 2008	A1
20080052142	Bailey et al.	Feb 2008	A1
20080189408	Cancel et al.	Feb 2008	A1
20080071731	Ma et al.	Mar 2008	A1
20080077597	Butler	Mar 2008	A1
20080077642	Carbone et al.	Mar 2008	A1
20080082486	Lermant et al.	Apr 2008	A1
20080104019	Nath	May 2008	A1
20080104060	Abhyankar et al.	May 2008	A1
20080104149	Vishniac et al.	May 2008	A1
20080126951	Sood et al.	May 2008	A1
20080133567	Ames et al.	Jun 2008	A1
20080148398	Mezack et al.	Jun 2008	A1
20080155440	Trevor et al.	Jun 2008	A1
20080162616	Gross et al.	Jul 2008	A1
20080195417	Surpin et al.	Aug 2008	A1
20080195608	Clover	Aug 2008	A1
20080195672	Hamel et al.	Aug 2008	A1
20080201339	McGrew	Aug 2008	A1
20080215546	Baum et al.	Sep 2008	A1
20080222295	Robinson et al.	Sep 2008	A1
20080249983	Meisels et al.	Oct 2008	A1
20080255973	El Wade et al.	Oct 2008	A1
20080263468	Cappione et al.	Oct 2008	A1
20080267107	Rosenberg	Oct 2008	A1
20080270316	Guidotti et al.	Oct 2008	A1
20080270391	Newbold et al.	Oct 2008	A1
20080276167	Michael	Nov 2008	A1
20080278311	Grange et al.	Nov 2008	A1
20080288306	MacIntyre et al.	Nov 2008	A1
20080288425	Posse et al.	Nov 2008	A1
20080301378	Carrie	Dec 2008	A1
20080301643	Appleton et al.	Dec 2008	A1
20080313132	Hao et al.	Dec 2008	A1
20080319991	Ross	Dec 2008	A1
20090002492	Velipasalar et al.	Jan 2009	A1
20090018940	Wang et al.	Jan 2009	A1
20090024505	Patel et al.	Jan 2009	A1
20090024589	Sood et al.	Jan 2009	A1
20090027418	Maru et al.	Jan 2009	A1
20090030915	Winter et al.	Jan 2009	A1
20090031247	Walter et al.	Jan 2009	A1
20090037417	Shankar et al.	Feb 2009	A1
20090044279	Crawford et al.	Feb 2009	A1
20090055251	Shah et al.	Feb 2009	A1
20090070200	August	Mar 2009	A1
20090076845	Bellin et al.	Mar 2009	A1
20090082997	Tokman et al.	Mar 2009	A1
20090083184	Eisen	Mar 2009	A1
20090088964	Schaaf et al.	Apr 2009	A1
20090106178	Chu	Apr 2009	A1
20090106308	Killian et al.	Apr 2009	A1
20090112745	Stefanescu	Apr 2009	A1
20090119309	Gibson et al.	May 2009	A1
20090125359	Knapic	May 2009	A1
20090125369	Kloosstra et al.	May 2009	A1
20090125459	Norton et al.	May 2009	A1
20090132921	Hwangbo et al.	May 2009	A1
20090132953	Reed et al.	May 2009	A1
20090143052	Bates et al.	Jun 2009	A1
20090144262	White et al.	Jun 2009	A1
20090144274	Fraleigh et al.	Jun 2009	A1
20090150854	Elaasar et al.	Jun 2009	A1
20090164387	Armstrong et al.	Jun 2009	A1
20090164934	Bhattiprolu et al.	Jun 2009	A1
20090171939	Athsani et al.	Jul 2009	A1
20090172511	Decherd et al.	Jul 2009	A1
20090172669	Bobak et al.	Jul 2009	A1
20090172821	Daira et al.	Jul 2009	A1
20090177962	Gusmorino et al.	Jul 2009	A1
20090179892	Tsuda et al.	Jul 2009	A1
20090187464	Bai et al.	Jul 2009	A1
20090187546	Whyte et al.	Jul 2009	A1
20090187548	Ji et al.	Jul 2009	A1
20090192957	Subramanian et al.	Jul 2009	A1
20090222400	Kupershmidt et al.	Sep 2009	A1
20090222759	Drieschner	Sep 2009	A1
20090222760	Halverson et al.	Sep 2009	A1
20090234720	George et al.	Sep 2009	A1
20090240664	Dinker et al.	Sep 2009	A1
20090249244	Robinson et al.	Oct 2009	A1
20090254970	Agarwal et al.	Oct 2009	A1
20090254971	Herz	Oct 2009	A1
20090271343	Vaiciulis et al.	Oct 2009	A1
20090271359	Bayliss	Oct 2009	A1
20090271435	Yako et al.	Oct 2009	A1
20090281839	Lynn et al.	Nov 2009	A1
20090287470	Farnsworth et al.	Nov 2009	A1
20090292626	Oxford	Nov 2009	A1
20090300589	Watters et al.	Dec 2009	A1
20090307049	Elliott et al.	Dec 2009	A1
20090313223	Rantanen	Dec 2009	A1
20090313311	Hoffmann et al.	Dec 2009	A1
20090313463	Pang et al.	Dec 2009	A1
20090318775	Michelson et al.	Dec 2009	A1
20090319418	Herz	Dec 2009	A1
20090319891	MacKinlay	Dec 2009	A1
20090327208	Bittner et al.	Dec 2009	A1
20100011282	Dollard et al.	Jan 2010	A1
20100030722	Goodson et al.	Feb 2010	A1
20100031141	Summers et al.	Feb 2010	A1
20100036831	Vemuri et al.	Feb 2010	A1
20100042922	Bradateanu et al.	Feb 2010	A1
20100057622	Faith et al.	Mar 2010	A1
20100057716	Stefik et al.	Mar 2010	A1
20100070489	Aymeloglu et al.	Mar 2010	A1
20100070523	Delgo et al.	Mar 2010	A1
20100070842	Aymeloglu et al.	Mar 2010	A1
20100070845	Facemire et al.	Mar 2010	A1
20100070897	Aymeloglu et al.	Mar 2010	A1
20100076939	Iwaki et al.	Mar 2010	A1
20100077481	Polyakov et al.	Mar 2010	A1
20100077483	Stolfo et al.	Mar 2010	A1
20100082541	Kottomtharayil	Apr 2010	A1
20100088158	Pollack	Apr 2010	A1
20100098318	Anderson	Apr 2010	A1
20100100963	Mahaffey	Apr 2010	A1
20100103124	Kruzeniski et al.	Apr 2010	A1
20100106611	Paulsen et al.	Apr 2010	A1
20100106752	Eckardt et al.	Apr 2010	A1
20100114817	Broeder et al.	May 2010	A1
20100114831	Gilbert et al.	May 2010	A1
20100114887	Conway et al.	May 2010	A1
20100122152	Chamberlain et al.	May 2010	A1
20100125546	Barrett et al.	May 2010	A1
20100131457	Heimendinger	May 2010	A1
20100131502	Fordham	May 2010	A1
20100138842	Balko et al.	Jun 2010	A1
20100145909	Ngo	Jun 2010	A1
20100161565	Lee et al.	Jun 2010	A1
20100161688	Kesselman et al.	Jun 2010	A1
20100161735	Sharma	Jun 2010	A1
20100162176	Dunton	Jun 2010	A1
20100169237	Howard et al.	Jul 2010	A1
20100185691	Irmak et al.	Jul 2010	A1
20100191563	Schlaifer et al.	Jul 2010	A1
20100191884	Holenstein et al.	Jul 2010	A1
20100198684	Eraker et al.	Aug 2010	A1
20100199225	Coleman et al.	Aug 2010	A1
20100211550	Daniello et al.	Aug 2010	A1
20100211618	Anderson et al.	Aug 2010	A1
20100228812	Uomini	Sep 2010	A1
20100235606	Oreland et al.	Sep 2010	A1
20100235915	Memon et al.	Sep 2010	A1
20100250412	Wagner	Sep 2010	A1
20100262688	Hussain et al.	Oct 2010	A1
20100280857	Liu et al.	Nov 2010	A1
20100283787	Hamedi et al.	Nov 2010	A1
20100293174	Bennett et al.	Nov 2010	A1
20100306029	Jolley	Dec 2010	A1
20100306713	Geisner et al.	Dec 2010	A1
20100312837	Bodapati et al.	Dec 2010	A1
20100313119	Baldwin et al.	Dec 2010	A1
20100318838	Katano et al.	Dec 2010	A1
20100318924	Frankel et al.	Dec 2010	A1
20100321399	Ellren et al.	Dec 2010	A1
20100325526	Ellis et al.	Dec 2010	A1
20100325581	Finkelstein et al.	Dec 2010	A1
20100330801	Rouh	Dec 2010	A1
20110004498	Readshaw	Jan 2011	A1
20110029498	Ferguson et al.	Feb 2011	A1
20110029526	Knight et al.	Feb 2011	A1
20110047159	Baid et al.	Feb 2011	A1
20110047540	Williams et al.	Feb 2011	A1
20110055140	Roychowdhury	Mar 2011	A1
20110060753	Shaked et al.	Mar 2011	A1
20110061013	Bilicki et al.	Mar 2011	A1
20110066933	Ludwig	Mar 2011	A1
20110074811	Hanson et al.	Mar 2011	A1
20110078055	Faribault et al.	Mar 2011	A1
20110078173	Seligmann et al.	Mar 2011	A1
20110087519	Fordyce, III et al.	Apr 2011	A1
20110093327	Fordyce, III et al.	Apr 2011	A1
20110099133	Chang et al.	Apr 2011	A1
20110117878	Barash et al.	May 2011	A1
20110119100	Ruhl et al.	May 2011	A1
20110131122	Griffin et al.	Jun 2011	A1
20110131547	Elaasar	Jun 2011	A1
20110137766	Rasmussen et al.	Jun 2011	A1
20110153384	Horne et al.	Jun 2011	A1
20110153592	DeMarcken	Jun 2011	A1
20110161096	Buehler et al.	Jun 2011	A1
20110161132	Goel et al.	Jun 2011	A1
20110161137	Ubalde et al.	Jun 2011	A1
20110167054	Bailey et al.	Jul 2011	A1
20110167105	Ramakrishnan et al.	Jul 2011	A1
20110167493	Song et al.	Jul 2011	A1
20110170799	Carrino et al.	Jul 2011	A1
20110173032	Payne et al.	Jul 2011	A1
20110173093	Psota et al.	Jul 2011	A1
20110173619	Fish	Jul 2011	A1
20110178842	Rane et al.	Jul 2011	A1
20110181598	O'Neall et al.	Jul 2011	A1
20110184813	Barne et al.	Jul 2011	A1
20110185316	Reid et al.	Jul 2011	A1
20110196737	Vadlamani et al.	Aug 2011	A1
20110202500	Warn et al.	Aug 2011	A1
20110208565	Ross et al.	Aug 2011	A1
20110208724	Jones et al.	Aug 2011	A1
20110213655	Henkin	Sep 2011	A1
20110218934	Elser	Sep 2011	A1
20110218955	Tang	Sep 2011	A1
20110219321	Gonzalez et al.	Sep 2011	A1
20110219450	McDougal et al.	Sep 2011	A1
20110225198	Edwards et al.	Sep 2011	A1
20110225650	Margolies et al.	Sep 2011	A1
20110231223	Winters	Sep 2011	A1
20110238495	Kang	Sep 2011	A1
20110238510	Rowen et al.	Sep 2011	A1
20110238553	Raj et al.	Sep 2011	A1
20110238570	Li et al.	Sep 2011	A1
20110246229	Pacha	Oct 2011	A1
20110251951	Kolkowtiz	Oct 2011	A1
20110258158	Resende et al.	Oct 2011	A1
20110258190	Chen et al.	Oct 2011	A1
20110258242	Eidson et al.	Oct 2011	A1
20110270604	Qi et al.	Nov 2011	A1
20110270705	Parker	Nov 2011	A1
20110270812	Ruby	Nov 2011	A1
20110270834	Sokolan et al.	Nov 2011	A1
20110289397	Eastmond et al.	Nov 2011	A1
20110289407	Naik et al.	Nov 2011	A1
20110289420	Morioka et al.	Nov 2011	A1
20110291851	Whisenant	Dec 2011	A1
20110295649	Fine	Dec 2011	A1
20110307382	Siegel et al.	Dec 2011	A1
20110310005	Chen et al.	Dec 2011	A1
20110314007	Dassa et al.	Dec 2011	A1
20110314024	Chang et al.	Dec 2011	A1
20110314546	Aziz et al.	Dec 2011	A1
20120004904	Shin et al.	Jan 2012	A1
20120005581	Turner et al.	Jan 2012	A1
20120011238	Rathod	Jan 2012	A1
20120011245	Gillette et al.	Jan 2012	A1
20120019559	Siler et al.	Jan 2012	A1
20120022945	Falkenborg et al.	Jan 2012	A1
20120036013	Neuhaus et al.	Feb 2012	A1
20120036434	Oberstein	Feb 2012	A1
20120050293	Carlhian et al.	Mar 2012	A1
20120054284	Rakshit	Mar 2012	A1
20120059853	Jagota	Mar 2012	A1
20120066166	Curbera et al.	Mar 2012	A1
20120066296	Appleton et al.	Mar 2012	A1
20120072825	Sherkin et al.	Mar 2012	A1
20120075324	Cardno et al.	Mar 2012	A1
20120079363	Folting et al.	Mar 2012	A1
20120084117	Tavares et al.	Apr 2012	A1
20120084118	Bai et al.	Apr 2012	A1
20120084135	Nissan et al.	Apr 2012	A1
20120084287	Lakshminarayan et al.	Apr 2012	A1
20120084866	Stolfo	Apr 2012	A1
20120106801	Jackson	May 2012	A1
20120116828	Shannon	May 2012	A1
20120117082	Koperda et al.	May 2012	A1
20120123989	Yu et al.	May 2012	A1
20120124179	Cappio et al.	May 2012	A1
20120131107	Yost	May 2012	A1
20120131512	Takeuchi et al.	May 2012	A1
20120136804	Lucia	May 2012	A1
20120137235	TS et al.	May 2012	A1
20120144335	Abeln et al.	Jun 2012	A1
20120150791	Willson	Jun 2012	A1
20120158626	Zhu et al.	Jun 2012	A1
20120159307	Chung et al.	Jun 2012	A1
20120159312	Mital et al.	Jun 2012	A1
20120159362	Brown et al.	Jun 2012	A1
20120159399	Bastide et al.	Jun 2012	A1
20120170847	Tsukidate	Jul 2012	A1
20120173381	Smith	Jul 2012	A1
20120173985	Peppel	Jul 2012	A1
20120180002	Campbell et al.	Jul 2012	A1
20120196557	Reich et al.	Aug 2012	A1
20120196558	Reich et al.	Aug 2012	A1
20120197651	Robinson et al.	Aug 2012	A1
20120203584	Mishor et al.	Aug 2012	A1
20120203708	Psota et al.	Aug 2012	A1
20120208636	Feige	Aug 2012	A1
20120215784	King et al.	Aug 2012	A1
20120215898	Shah et al.	Aug 2012	A1
20120221511	Gibson et al.	Aug 2012	A1
20120221553	Wittmer et al.	Aug 2012	A1
20120221580	Barney	Aug 2012	A1
20120226523	Weiss	Sep 2012	A1
20120233145	Howes et al.	Sep 2012	A1
20120245976	Kumar et al.	Sep 2012	A1
20120246148	Dror	Sep 2012	A1
20120254129	Wheeler et al.	Oct 2012	A1
20120266245	McDougal et al.	Oct 2012	A1
20120278273	Fang	Nov 2012	A1
20120284345	Costenaro et al.	Nov 2012	A1
20120290879	Shibuya et al.	Nov 2012	A1
20120296907	Long et al.	Nov 2012	A1
20120304244	Xie et al.	Nov 2012	A1
20120310831	Harris et al.	Dec 2012	A1
20120310838	Harris et al.	Dec 2012	A1
20120311684	Paulsen et al.	Dec 2012	A1
20120323829	Stokes et al.	Dec 2012	A1
20120323888	Osann, Jr.	Dec 2012	A1
20120330801	McDougal et al.	Dec 2012	A1
20120330908	Stowe et al.	Dec 2012	A1
20120330973	Ghuneim et al.	Dec 2012	A1
20130006426	Healey et al.	Jan 2013	A1
20130006655	Van Arkel et al.	Jan 2013	A1
20130006668	Van Arkel et al.	Jan 2013	A1
20130006725	Simanek et al.	Jan 2013	A1
20130006916	McBride et al.	Jan 2013	A1
20130016106	Yip et al.	Jan 2013	A1
20130018796	Kolhatkar et al.	Jan 2013	A1
20130024268	Manickavelu	Jan 2013	A1
20130024307	Fuerstenberg et al.	Jan 2013	A1
20130024339	Choudhuri et al.	Jan 2013	A1
20130036346	Cicerone	Feb 2013	A1
20130046635	Grigg et al.	Feb 2013	A1
20130046783	Zhang et al.	Feb 2013	A1
20130046842	Muntz et al.	Feb 2013	A1
20130050217	Armitage	Feb 2013	A1
20130054306	Bhalla	Feb 2013	A1
20130055145	Antony et al.	Feb 2013	A1
20130057551	Ebert et al.	Mar 2013	A1
20130060742	Chang et al.	Mar 2013	A1
20130060786	Serrano et al.	Mar 2013	A1
20130061169	Pearcy et al.	Mar 2013	A1
20130073377	Heath	Mar 2013	A1
20130073454	Busch	Mar 2013	A1
20130078943	Biage et al.	Mar 2013	A1
20130086482	Parsons	Apr 2013	A1
20130096988	Grossman et al.	Apr 2013	A1
20130097130	Bingol et al.	Apr 2013	A1
20130097482	Marantz et al.	Apr 2013	A1
20130101159	Chao et al.	Apr 2013	A1
20130110746	Ahn	May 2013	A1
20130110822	Ikeda et al.	May 2013	A1
20130110877	Bonham et al.	May 2013	A1
20130111320	Campbell et al.	May 2013	A1
20130117011	Ahmed et al.	May 2013	A1
20130117651	Waldman et al.	May 2013	A1
20130150004	Rosen	Jun 2013	A1
20130151148	Parundekar et al.	Jun 2013	A1
20130151388	Falkenborg et al.	Jun 2013	A1
20130151453	Bhanot et al.	Jun 2013	A1
20130157234	Gulli et al.	Jun 2013	A1
20130159340	Blanco et al.	Jun 2013	A1
20130160120	Malaviya et al.	Jun 2013	A1
20130166348	Scotto	Jun 2013	A1
20130166480	Popescu et al.	Jun 2013	A1
20130166550	Buchmann et al.	Jun 2013	A1
20130176321	Mitchell et al.	Jul 2013	A1
20130179420	Park et al.	Jul 2013	A1
20130185245	Anderson	Jul 2013	A1
20130185307	El-Yaniv et al.	Jul 2013	A1
20130185320	Iwasaki et al.	Jul 2013	A1
20130197925	Blue	Aug 2013	A1
20130211985	Clark et al.	Aug 2013	A1
20130224696	Wolfe et al.	Aug 2013	A1
20130225212	Khan	Aug 2013	A1
20130226318	Procyk	Aug 2013	A1
20130226953	Markovich et al.	Aug 2013	A1
20130232045	Tai et al.	Sep 2013	A1
20130238616	Rose et al.	Sep 2013	A1
20130246170	Gross et al.	Sep 2013	A1
20130246537	Gaddala	Sep 2013	A1
20130246597	Iizawa et al.	Sep 2013	A1
20130251233	Yang et al.	Sep 2013	A1
20130262527	Hunter et al.	Oct 2013	A1
20130263019	Castellanos et al.	Oct 2013	A1
20130267207	Hao et al.	Oct 2013	A1
20130268520	Fisher et al.	Oct 2013	A1
20130276799	Davidson	Oct 2013	A1
20130279757	Kephart	Oct 2013	A1
20130282696	John et al.	Oct 2013	A1
20130290011	Lynn et al.	Oct 2013	A1
20130290825	Arndt et al.	Oct 2013	A1
20130297619	Chandrasekaran et al.	Nov 2013	A1
20130304770	Boero et al.	Nov 2013	A1
20130311375	Priebatsch	Nov 2013	A1
20130318060	Chang et al.	Nov 2013	A1
20130318594	Hoy et al.	Nov 2013	A1
20130318604	Coates et al.	Nov 2013	A1
20130332862	Mirra et al.	Dec 2013	A1
20130339218	Subramanian et al.	Dec 2013	A1
20130339514	Crank et al.	Dec 2013	A1
20140006109	Callioni et al.	Jan 2014	A1
20140012796	Petersen et al.	Jan 2014	A1
20140019119	Liu et al.	Jan 2014	A1
20140019936	Cohanoff	Jan 2014	A1
20140032506	Hoey et al.	Jan 2014	A1
20140033010	Richardt et al.	Jan 2014	A1
20140040371	Gurevich et al.	Feb 2014	A1
20140047319	Eberlein	Feb 2014	A1
20140047357	Alfaro et al.	Feb 2014	A1
20140058763	Zizzamia et al.	Feb 2014	A1
20140058914	Song et al.	Feb 2014	A1
20140059038	McPherson et al.	Feb 2014	A1
20140067611	Adachi et al.	Mar 2014	A1
20140068487	Steiger et al.	Mar 2014	A1
20140074855	Zhao et al.	Mar 2014	A1
20140081652	Klindworth	Mar 2014	A1
20140095273	Tang et al.	Apr 2014	A1
20140095509	Patton	Apr 2014	A1
20140108068	Williams	Apr 2014	A1
20140108380	Gotz et al.	Apr 2014	A1
20140108985	Scott et al.	Apr 2014	A1
20140123279	Bishop et al.	May 2014	A1
20140129261	Bothwell et al.	May 2014	A1
20140136285	Carvalho	May 2014	A1
20140143009	Brice et al.	May 2014	A1
20140149130	Getchius	May 2014	A1
20140149272	Hirani et al.	May 2014	A1
20140149436	Bahrami et al.	May 2014	A1
20140156484	Chan et al.	Jun 2014	A1
20140156527	Grigg et al.	Jun 2014	A1
20140157172	Peery et al.	Jun 2014	A1
20140164502	Khodorenko et al.	Jun 2014	A1
20140181833	Bird et al.	Jun 2014	A1
20140189536	Lange et al.	Jul 2014	A1
20140189870	Singla et al.	Jul 2014	A1
20140195515	Baker et al.	Jul 2014	A1
20140195887	Ellis et al.	Jul 2014	A1
20140195916	Kwan et al.	Jul 2014	A1
20140214579	Shen et al.	Jul 2014	A1
20140222521	Chait	Aug 2014	A1
20140222793	Sadkin et al.	Aug 2014	A1
20140229554	Grunin et al.	Aug 2014	A1
20140244388	Manouchehri et al.	Aug 2014	A1
20140258246	Lo Faro et al.	Sep 2014	A1
20140267294	Ma	Sep 2014	A1
20140267295	Sharma	Sep 2014	A1
20140279824	Tamayo	Sep 2014	A1
20140280293	Scanlon	Sep 2014	A1
20140283067	Call et al.	Sep 2014	A1
20140310266	Greenfield	Oct 2014	A1
20140310282	Sprague et al.	Oct 2014	A1
20140316911	Gross	Oct 2014	A1
20140317104	Isaacs et al.	Oct 2014	A1
20140324876	Konik et al.	Oct 2014	A1
20140330845	Feldschuh	Nov 2014	A1
20140331119	Dixon et al.	Nov 2014	A1
20140333651	Cervelli et al.	Nov 2014	A1
20140337772	Cervelli et al.	Nov 2014	A1
20140344230	Krause et al.	Nov 2014	A1
20140344231	Stowe et al.	Nov 2014	A1
20140344256	Bitincka et al.	Nov 2014	A1
20140351070	Christner et al.	Nov 2014	A1
20140358829	Hurwitz	Dec 2014	A1
20140366132	Stiansen et al.	Dec 2014	A1
20140379755	Kuriakose et al.	Dec 2014	A1
20140379812	Bastide et al.	Dec 2014	A1
20150019394	Unser et al.	Jan 2015	A1
20150039886	Kahol et al.	Feb 2015	A1
20150046870	Goldenberg et al.	Feb 2015	A1
20150067533	Volach	Mar 2015	A1
20150073929	Psota et al.	Mar 2015	A1
20150073954	Braff	Mar 2015	A1
20150089353	Folkening	Mar 2015	A1
20150089424	Duffield et al.	Mar 2015	A1
20150095773	Gonsalves et al.	Apr 2015	A1
20150100897	Sun et al.	Apr 2015	A1
20150100907	Erenrich et al.	Apr 2015	A1
20150106347	McGrew et al.	Apr 2015	A1
20150106379	Elliot et al.	Apr 2015	A1
20150112956	Chang et al.	Apr 2015	A1
20150112998	Shankar et al.	Apr 2015	A1
20150134666	Gattiker et al.	May 2015	A1
20150135113	Sekharan	May 2015	A1
20150135256	Hoy et al.	May 2015	A1
20150169709	Kara et al.	Jun 2015	A1
20150169726	Kara et al.	Jun 2015	A1
20150170077	Kara et al.	Jun 2015	A1
20150178825	Huerta	Jun 2015	A1
20150178877	Bogomolov et al.	Jun 2015	A1
20150186821	Wang et al.	Jul 2015	A1
20150187036	Wang et al.	Jul 2015	A1
20150188872	White	Jul 2015	A1
20150199324	Nishioka	Jul 2015	A1
20150212663	Papale et al.	Jul 2015	A1
20150213043	Ishii et al.	Jul 2015	A1
20150213134	Nie et al.	Jul 2015	A1
20150227295	Meiklejohn et al.	Aug 2015	A1
20150235334	Wang et al.	Aug 2015	A1
20150242397	Zhuang	Aug 2015	A1
20150261817	Harris et al.	Sep 2015	A1
20150309719	Ma et al.	Oct 2015	A1
20150317342	Grossman et al.	Nov 2015	A1
20150324868	Kaftan et al.	Nov 2015	A1
20150338233	Cervelli et al.	Nov 2015	A1
20150341467	Lim et al.	Nov 2015	A1
20150347903	Saxena et al.	Dec 2015	A1
20150378996	Kesin et al.	Dec 2015	A1
20150379413	Robertson et al.	Dec 2015	A1
20160004667	Chakerian et al.	Jan 2016	A1
20160004764	Chakerian et al.	Jan 2016	A1
20160034470	Sprague et al.	Feb 2016	A1
20160034545	Shankar et al.	Feb 2016	A1
20160034555	Rahut et al.	Feb 2016	A1
20160048937	Mathura et al.	Feb 2016	A1
20160062555	Ward et al.	Mar 2016	A1
20160098173	Slawinski et al.	Apr 2016	A1
20160098485	Burke et al.	Apr 2016	A1
20160147730	Cicerone	May 2016	A1
20160147769	Murphey et al.	May 2016	A1
20160180451	Visbal et al.	Jun 2016	A1
20160180557	Yousaf et al.	Jun 2016	A1
20160210195	Sinha	Jul 2016	A1
20160306965	Iyer et al.	Oct 2016	A1
20170046349	Shankar et al.	Feb 2017	A1
20180173792	Kesin	Jun 2018	A1
20190114309	Kesin et al.	Apr 2019	A1

Foreign Referenced Citations (67)

Number	Date	Country
2014206155	Dec 2015	AU
2014250678	Feb 2016	AU
102546446	Jul 2012	CN
103167093	Jun 2013	CN
102054015	May 2014	CN
102014103482	Sep 2014	DE
102014204827	Sep 2014	DE
102014204830	Sep 2014	DE
102014204834	Sep 2014	DE
102014215621	Feb 2015	DE
0652513	May 1995	EP
1191463	Mar 2002	EP
1672527	Jun 2006	EP
2487610	Aug 2012	EP
2551799	Jan 2013	EP
2555126	Feb 2013	EP
2555153	Feb 2013	EP
2560134	Feb 2013	EP
2778977	Sep 2014	EP
2835745	Feb 2015	EP
2835770	Feb 2015	EP
2838039	Feb 2015	EP
2846241	Mar 2015	EP
2851852	Mar 2015	EP
2858014	Apr 2015	EP
2858018	Apr 2015	EP
2863326	Apr 2015	EP
2863346	Apr 2015	EP
2869211	May 2015	EP
2884439	Jun 2015	EP
2884440	Jun 2015	EP
2889814	Jul 2015	EP
2891992	Jul 2015	EP
2892197	Jul 2015	EP
2911078	Aug 2015	EP
2911100	Aug 2015	EP
2940603	Nov 2015	EP
2940609	Nov 2015	EP
2963577	Jan 2016	EP
2963595	Jan 2016	EP
2985729	Feb 2016	EP
3018879	May 2016	EP
3037991	Jun 2016	EP
3037992	Jun 2016	EP
3038002	Jun 2016	EP
3038046	Jun 2016	EP
2513247	Oct 2014	GB
2516155	Jan 2015	GB
2518745	Apr 2015	GB
2012778	Nov 2014	NL
2013306	Feb 2015	NL
624557	Dec 2014	NZ
WO 2000009529	Feb 2000	WO
WO 2002065353	Aug 2002	WO
WO 2005104736	Nov 2005	WO
WO 2005116851	Dec 2005	WO
WO 2008011728	Jan 2008	WO
WO 2008064207	May 2008	WO
WO 2008113059	Sep 2008	WO
WO 2009061501	May 2009	WO
WO 2010000014	Jan 2010	WO
WO 2010030913	Mar 2010	WO
WO 2010098958	Sep 2010	WO
WO 2012025915	Mar 2012	WO
WO 2013010157	Jan 2013	WO
WO 2013102892	Jul 2013	WO
WO 2013126281	Aug 2013	WO

Non-Patent Literature Citations (413)

Entry
US 8,712,906 B1, 04/2014, Sprague et al. (withdrawn)
US 8,725,631 B1, 05/2014, Sprague et al. (withdrawn)
“A First Look: Predicting Market Demand for Food Retail using a Huff Analysis,” TRF Policy Solutions, Jul. 2012, pp. 30.
“A Quick Guide to UniProtKB Swiss-Prot & TrEMBL,” Sep. 2011, pp. 2.
“A Word About Banks and the Laundering of Drug Money,” Aug. 18, 2012, http://www.golemxiv.co.uk/2012/08/a-word-about-banks-and-the-laundering-of-drug-money/.
About 80 Minutes, “Palantir in a Number of Parts—Part 6—Graph,” Mar. 21, 2013, pp. 1-6, retrieved from the internet http://about80minutes.blogspot.nl/2013/03/palantir-in-number-of-parts-part-6-graph.html retrieved on Aug. 18, 2015.
Acklen, Laura, “Absolute Beginner's Guide to Microsoft Word 2003,” Dec. 24, 2003, pp. 15-18, 34-41, 308-316.
Alfred, Rayner “Summarizing Relational Data Using Semi-Supervised Genetic Algorithm-Based Clustering Techniques”, Journal of Computer Science, 2010, vol. 6, No. 7, pp. 775-784.
Alur et al., “Chapter 2: IBM InfoSphere DataStage Stages,” IBM InfoSphere DataStage Data Flow and Job Design, Jul. 1, 2008, pp. 35-137.
Amnet, “5 Great Tools for Visualizing Your Twitter Followers,” posted Aug. 4, 2010, http://www.amnetblog.com/componentIcontent/article/115-5-grate-tools-for-visualizing-your-twitter-followers.html.
Ananiev et al., “The New Modality API,” http://web.archive.org/web/20061211011958/http://java.sun.com/developer/technicalArticles/J2SE/Desktop/javase6/modality/ Jan. 21, 2006, pp. 8.
Anjewierden et al., “Automatic Indexing of Pdf Documents with Ontologies”, Social Science Informatics, University of Amsterdam, The Netherlands, Jun. 11, 2011, pp. 8.
Anonymous, “BackTult—JD Edwards One World Version Control System,” printed Jul. 23, 2007 in 1 page.
Antoshenkov, Gennady, “Dictionary-Based Order-Preserving String Compression”, The VLDB Journal, pp. 26-39, 1997.
“The Apache Cassandra Project,” http://cassandra.apache.org/ Printed Sep. 14, 2011 in 3 pages.
“Apache HBase,” http://hbase.apache.org/ printed Sep. 14, 2011 in 1 page.
Appacts, “Smart Thinking for Super Apps,” <http://www.appacts.com> Printed Jul. 18, 2013 in 4 pages.
Apsalar, “Data Powered Mobile Advertising,” “Free Mobile App Analytics” and various analytics related screen shots <http://apsalar.com> Printed Jul. 18, 2013 in 8 pages.
Baker et al., “Megastore: Providing Scalable, Highly Available Storage for Interactive Services”, 5th Biennial Conference on Innovative Data Systems Research (CIDR '11), Asilomar, California, Jan. 9-12, 2011.
Baker et al., “The Development of a Common Enumeration of Vulnerabilities and Exposures,” Presented at the Second International Workshop on Recent Advances in Intrusion Detection, Sep. 7-9, 1999, pp. 35.
Bernstein et al., “Hyder—A Transactional Record Manager for Shared Flash”, 5th Biennial Conference on Innovative Data Systems Research (CIDR '11), vol. 12, Asilomar, California, Jan. 9-12, 2011.
Bhosale, Safal V., “Holy Grail of Outlier Detection Technique: A Macro Level Take on the State of the Art,” International Journal of Computer Science & Information Technology, Aug. 1, 2014, retrieved from http://www.ijcsit.com/docs/Volume5/vol5issue04/ijcsit20140504226.pdf retrieved May 3, 2016.
Bluttman et al., “Excel Formulas and Functions for Dummies,” 2005, Wiley Publishing, Inc., pp. 280, 284-286.
Boyce, Jim, “Microsoft Outlook 2010 Inside Out,” Aug. 1, 2010, retrieved from the internet https://capdtron.files.wordpress.com/2013/01/outlook-2010-inside_out.pdf.
Bugzilla@Mozilla, “Bug 18726—[feature] Long-click means of invoking contextual menus not supported,” http://bugzilla.mozilla.org/show_bug.cgi?id=18726 printed Jun. 13, 2013 in 11 pages.
Canese et al., “Chapter 2: PubMed: The Bibliographic Database,” The NCBI Handbook, Oct. 2002, pp. 1-10.
Capptain—Pilot Your Apps, <http://www.capptain.com> Printed Jul. 18, 2013 in 6 pages.
Celik, Tantek, “CSS Basic User Interface Module Level 3 (CSS3 UI),” Section 8 Resizing and Overflow, Jan. 17, 2012, retrieved from internet http://www.w3.org/TR/2012/WD-c553-ui-20120117/#resizing-amp-overflow retrieved on May 18, 2015.
Chang et al., “A new multi-search engine for querying data through an Internet search service on CORBA”, Computer Networks, vol. 34, Issue 3, Sep. 2000, pp. 467-480.
Chang et al., “Bigtable: A Distributed Storage System for Structured Data”, Google, Inc., OSDI'06: Seventh Symposium on Operating System Design and Implementation, Seattle, WA, Nov. 2006.
Chaudhuri et al., “An Overview of Business Intelligence Technology,” Communications of the ACM, Aug. 2011, vol. 54, No. 8.
Chen et al., “Bringing Order to the Web: Automatically Categorizing Search Results,” CHI 2000, Proceedings of the SIGCHI conference on Human Factors in Computing Systems, Apr. 1-6, 2000, The Hague, The Netherlands, pp. 145-152.
Chung, Chin-Wan, “Dataplex: An Access to Heterogeneous Distributed Databases,” Communications of the ACM, Association for Computing Machinery, Inc., vol. 33, No. 1, Jan. 1, 1990, pp. 70-80.
Cohn, et al., “Semi-supervised clustering with user feedback,” Constrained Clustering: Advances in Algorithms, Theory, and Applications 4.1 (2003): 17-32.
Conner, Nancy, “Google Apps: The Missing Manual,” May 1, 2008, pp. 15.
Countly Mobile Analytics, <http://count.ly/> Printed Jul. 18, 2013 in 9 pages.
Definition “Identify”, downloaded Jan. 22, 2015, 1 page.
Definition “Overlay”, downloaded Jan. 22, 2015, 1 page.
Delcher et al., “Identifying Bacterial Genes and Endosymbiont DNA with Glimmer,” BioInformatics, vol. 23, No. 6, 2007, pp. 673-679.
Devanbu et al., “Authentic Third-party Data Publication”, http://www.cs.ucdavis.edu/˜devanbu/authdpub.pdf, p. 19, 2000.
Distimo—App Analytics, <http://www.distimo.com/app-analytics> Printed Jul. 18, 2013 in 5 pages.
Dramowicz, Ela, “Retail Trade Area Analysis Using the Huff Model,” Directions Magazine, Jul. 2, 2005 in 10 pages, http://www.directionsmag.com/articles/retail-trade-area-analysis-using-the-huff-model/123411.
Dreyer et al., “An Object-Oriented Data Model for a Time Series Management System,” Proceedings of the 7th International Working Conference on Scientific and Statistical Database Management, Charlottesville, Virginia USA, Sep. 28-30, 1994, pp. 12.
Elmasri et al., “Fundamentals of Database Systems”, Fourth Edition, pp. 455-491, 2004.
“The FASTA Program Package,” fasta-36.3.4, Mar. 25, 2011, pp. 29.
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-12, retrieved from the internet https://www.palantir.com/2007/09/palantir-screenshots/ retrieved on Aug. 18, 2015.
GIS-NET 3 Public Department of Regional Planning. Planning & Zoning Information for Unincorporated LA County. Retrieved Oct. 2, 2013 from http://gis.planning.lacounty.gov/GIS-NET3_Public/Viewer.html.
Golmohammadi et al., “Data Mining Applications for Fraud Detection in Securities Market,” Intelligence and Security Informatics Conference (EISIC), 2012 European, IEEE, Aug. 22, 2012, pp. 107-114.
Google Analytics Official Website—Web Analytics & Reporting, <http://www.google.com/analytics.index.html> Printed Jul. 18, 2013 in 22 pages.
Gorr et al., “Crime Hot Spot Forecasting: Modeling and Comparative Evaluation”, Grant 98-IJ-CX-K005, May 6, 2002, 37 pages.
Goswami, Gautam, “Quite Writly Said!,” One Brick at a Time, Aug. 21, 2005, pp. 7.
Griffith, Daniel A., “A Generalized Huff Model,” Geographical Analysis, Apr. 1982, vol. 14, No. 2, pp. 135-144.
Gu et al., “Record Linkage: Current Practice and Future Directions,” Jan. 15, 2004, pp. 32.
Gu et al., “BotMiner: Clustering Analysis of Network Traffice for Protocol-and-Structure-Independent Botnet Detection,” USENIX Security Symposium, 2008, 17 pages.
Hansen et al., “Analyzing Social Media Networks with NodeXL: Insights from a Connected World”, Chapter 4, pp. 53-67 and Chapter 10, pp. 143-164, published Sep. 2010.
Hardesty, “Privacy Challenges: Analysis: It's Surprisingly Easy to Identify Individuals from Credit-Card Metadata,” MIT News on Campus and Around the World, MIT News Office, Jan. 29, 2015, 3 pages.
Hibbert et al., “Prediction of Shopping Behavior Using a Huff Model Within a GIS Framework,” Healthy Eating in Context, Mar. 18, 2011, pp. 16.
Hodge et al., “A Survey of Outlier Detection Methodologies,” Artificial Intelligence Review, vol. 22, No. 2, Oct. 1, 2004.
Hogue et al., “Thresher: Automating the Unwrapping of Semantic Content from the World Wide Web,” 14th International Conference on World Wide Web, WWW 2005: Chiba, Japan, May 10-14, 2005, pp. 86-95.
Hua et al., “A Multi-attribute Data Structure with Parallel Bloom Filters for Network Services”, HiPC 2006, LNCS 4297, pp. 277-288, 2006.
Huang et al., “Systematic and Integrative Analysis of Large Gene Lists Using DAVID Bioinformatics Resources,” Nature Protocols, 4.1, 2008, 44-57.
Huff et al., “Calibrating the Huff Model Using ArcGIS Business Analyst,” ESRI, Sep. 2008, pp. 33.
Huff, David L., “Parameter Estimation in the Huff Model,” ESRI, ArcUser, Oct.-Dec. 2003, pp. 34-36.
“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.
Jelen, Bill, “Excel 2013 in Depth, Video Enhanced Edition,” Jan. 25, 2013.
Kahan et al., “Annotea: an Open RDF Infrastructure for Shared Web Annotations”, Computer Networks, Elsevier Science Publishers B.V., vol. 39, No. 5, dated Aug. 5, 2002, pp. 589-608.
Keylines.com, “An Introduction to KeyLines and Network Visualization,” Mar. 2014, <http://keylines.com/wp-content/uploads/2014/03/KeyLines-White-Paper.pdf> downloaded May 12, 2014 in 8 pages.
Keylines.com, “KeyLines Datasheet,” Mar. 2014, <http://keylines.com/wp-content/uploads/2014/03/KeyLines-datasheet.pdf> downloaded May 12, 2014 in 2 pages.
Keylines.com, “Visualizing Threats: Improved Cyber Security Through Network Visualization,” Apr. 2014, <http://keylines.com/wp-content/uploads/2014/04/Visualizing-Threats1.pdf> downloaded May 12, 2014 in 10 pages.
Kitts, Paul, “Chapter 14: Genome Assembly and Annotation Process,” The NCBI Handbook, Oct. 2002, pp. 1-21.
Klemmer et al., “Where Do Web Sites Come From? Capturing and Interacting with Design History,” Association for Computing Machinery, CHI 2002, Apr. 20-25, 2002, Minneapolis, MN, pp. 8.
Kokossi et al., “D7-Dynamic Ontoloty Management System (Design),” Information Societies Technology Programme, Jan. 10, 2002, pp. 1-27.
Kontagent Mobile Analytics, <http://www.kontagent.com/> Printed Jul. 18, 2013 in 9 pages.
Li et al., “Interactive Multimodal Visual Search on Mobile Device,” IEEE Transactions on Multimedia, vol. 15, No. 3, Apr. 1, 2013, pp. 594-607.
Li et al., “Identifying the Signs of Fraudulent Accounts using Data Mining Techniques,” Computers in Human Behavior, vol. 28, No. 3, Jan. 16, 2012.
Liu, Tianshun, “Combining GIS and the Huff Model to Analyze Suitable Locations for a New Asian Supermarket in the Minneapolis and St. Paul, Minnesota USA,” Papers in Resource Analysis, 2012, vol. 14, pp. 8.
Localytics—Mobile App Marketing & Analytics, <http://www.localytics.com/> Printed Jul. 18, 2013 in 12 pages.
Madden, Tom, “Chapter 16: The BLAST Sequence Analysis Tool,” The NCBI Handbook, Oct. 2002, pp. 1-15.
Manno et al., “Introducing Collaboration in Single-user Applications through the Centralized Control Architecture,” 2010, pp. 10.
Manske, “File Saving Dialogs,” <http://www.mozilla.org/editor/ui_specs/FileSaveDialogs.html>, Jan. 20, 1999, pp. 7.
Map Builder, “Rapid Mashup Development Tool for Google and Yahoo Maps!” <http://web.archive.org/web/20090626224734/http://www.mapbuilder.net/> printed Jul. 20, 2012 in 2 pages.
Map of San Jose, CA. Retrieved Oct. 2, 2013 from http://maps.yahoo.com.
Map of San Jose, CA. Retrieved Oct. 2, 2013 from http://maps.bing.com.
Map of San Jose, CA. Retrieved Oct. 2, 2013 from http://maps.google.com.
Mentzas et al. “An Architecture for Intelligent Assistance in the Forecasting Process,” Proceedings of the Twenty-Eighth Hawaii International Conference on System Sciences, Jan. 3-6, 1995, vol. 3, pp. 167-176.
Microsoft—Developer Network, “Getting Started with VBA in Word 2010,” Apr. 2010, <http://msdn.microsoft.com/en-us/library/ff604039%28v-office.14%29.aspx> as printed Apr. 4, 2014 in 17 pages.
Microsoft Office—Visio, “About connecting shapes,” <http://office.microsoft.com/en-us/visio-help/about-connecting-shapes-HP085050369.aspx> printed Aug. 4, 2011 in 6 pages.
Microsoft Office—Visio, “Add and glue connectors with the Connector tool,” <http://office.microsoft.com/en-us/visio-help/add-and-glue-connectors-with-the-connector-tool-HA010048532.aspx?CTT-1> printed Aug. 4, 2011 in 1 page.
Miklau et al., “Securing History: Privacy and Accountability in Database Systems,” 3 rd Biennial Conference on Innovative Data Systems Research (CIDR), Jan. 7-10, 2007, Asilomar, California, pp. 387-396.
Mixpanel—Mobile Analytics, <https://mixpanel.com/> Printed Jul. 18, 2013 in 13 pages.
Mizrachi, Ilene, “Chapter 1: GenBank: The Nuckeotide Sequence Database,” The NCBI Handbook, Oct. 2002, pp. 1-14.
“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.
Ngai et al., “The Application of Data Mining Techniques in Financial Fraud Detection: A Classification Frameworok and an Academic Review of Literature,” Decision Support Systems, Elsevier Science Publishers, Amsterdam, Netherlands, vol. 50, No. 3, Feb. 1, 2011.
Niepert et al., “A Dynamic Ontology for a Dynamic Reference Work”, Joint Conference on Digital Libraries, Jun. 17-22, 2007, Vancouver, British Columbia, Canada, pp. 1-10.
Nierman, “Evaluating Structural Similarity in XML Documents”, 6 pages, 2002.
Nolan et al., “MCARTA: A Malicious Code Automated Run-Time Analysis Framework,” Homeland Security, 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 retrieved on Aug. 19, 2015.
Palmas et al., “An Edge-Bunding Layout for Interactive Parallel Coordinates” 2014 IEEE Pacific Visualization Symposium, pp. 57-64.
Peng et al., “Large-scale Incremental Processing Using Distributed Transactions and Notifications”, Proceedings of the 9th USENIX Symposium on Operating Systems Design and Implementation, USENIX, p. 14, 2010.
Perdisci et al., “Behavioral Clustering of HTTP-Based Malware and Signature Generation Using Malicious Network Traces,” USENIX, Mar. 18, 2010, pp. 1-14.
Piwik—Free Web Analytics Software. <http://piwik.org/> Printed Jul. 19, 2013 in 18 pages.
“Potential Money Laundering Warning Signs,” snapshot taken 2003, https://web.archive.org/web/20030816090055/http:/finsolinc.com/ANTI-MONEY%20LAUNDERING%20TRAINING%20GUIDES.pdf.
Quartert FS “Managing Business Performance and Detecting Outliers in Financial Services,” Oct. 16, 2014, retrieved from https://quartetfs.com/images/pdf/white-papers/Quartet_FS_White_Paper_-_ActivePivot_Sentinel.pdf retrieved on May 3, 2016.
Quartert FS “Resource Center,” Oct. 16, 2014, retrieved from https://web.archive.org/web/20141016044306/http://quartetfs.com/resource-center/white-papers retrieved May 3, 2016.
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.
Rouse, Margaret, “OLAP Cube,” <http://searchdatamanagement.techtarget.com/definition/OLAP-cube>, Apr. 28, 2012, pp. 16.
Shah, Chintan, “Periodic Connections to Control Server Offer New Way to Detect Botnets,” Oct. 24, 2013 in 6 pages, <http://www.blogs.mcafee.com/mcafee-labs/periodic-links-to-control-server-offer-new-way-to-detect-botnets>.
Shi et al., “A Scalable Implementation of Malware Detection Based on Network Connection Behaviors,” 2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, IEEE, Oct. 10, 2013, pp. 59-66.
Sigrist, et al., “PROSITE, a Protein Domain Database for Functional Characterization and Annotation,” Nucleic Acids Research, 2010, vol. 38, pp. D161-D166.
Sirotkin et al., “Chapter 13: The Processing of Biological Sequence Data at NCBI,” The NCBI Handbook, Oct. 2002, pp. 1-11.
StatCounter—Free Invisible Web Tracker, Hit Counter and Web Stats, <http://statcounter.com/> Printed Jul. 19, 2013 in 17 pages.
Symantec Corporation, “E-Security Begins with Sound Security Policies,” Announcement Symantec, Jun. 14, 2001.
TestFlight—Beta Testing on the Fly, <http://testflightapp.com/> Printed Jul. 18, 2013 in 3 pages.
Thompson, Mick, “Getting Started with GEO,” Getting Started with GEO, Jul. 26, 2011.
Thomson et al., “The Case for Determinism in Database Systems”, The 36th International Conference on Very Large Data Bases, Proceedings of the VLDB Endowment, vol. 3, Issue No. 1, p. 11, Singapore, Sep. 13-17, 2010.
trak.io, <http://trak.io/> printed Jul. 18, 2013 in 3 pages.
Umagandhi et al., “Search Query Recommendations Using Hybrid User Profile with Query Logs,” International Journal of Computer Applications, vol. 80, No. 10, Oct. 1, 2013, pp. 7-18.
UserMetrix, <http://usermetrix.com/android-analytics> printed Jul. 18, 2013 in 3 pages.
“Using Whois Based Geolocation and Google Maps API for Support Cybercrime Investigations,” http://wseas.us/e-library/conferences/2013/Dubrovnik/TELECIRC/TELECIRC-32.pdf.
Valentini et al., “Ensembles of Learning Machines”, M. Marinaro and R. Tagliaferri (Eds.): WIRN VIETRI 2002, LNCS 2486, pp. 3-20.
Vose et al., “Help File for ModelRisk Version 5,” 2007, Vose Software, pp. 349-353. [Uploaded in 2 Parts].
Wang et al., “Research on a Clustering Data De-Duplication Mechanism Based on Bloom Filter,” IEEE 2010, 5 pages.
Wiggerts, T.A., “Using Clustering Algorithms in Legacy Systems Remodularization,” Reverse Engineering, Proceedings of the Fourth Working Conference, Netherlands, Oct. 6-8, 1997, IEEE Computer Soc., pp. 33-43.
Wikipedia, “Federated Database System,” Sep. 7, 2013, retrieved from the internet on Jan. 27, 2015 http://en.wikipedia.org/w/index.php?title-Federated_database_system&oldid=571954221.
Wikipedia, “Multimap,” Jan. 1, 2013, https://en.wikipedia.org/w/index.php?title-Multimap&oldid=530800748.
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.
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.
Wright et al., “Palantir Technologies VAST 2010 Challenge Text Records—Investigations into Arms Dealing,” Oct. 29, 2010, pp. 1-10, retrieved from the internet http://hcil2.cs.umd.edu/newvarepository/VAST%20Challenge%202010/challenges/MC1%20-%20Investigations%20into%20Arms%20Dealing/entries/Palantir%20Technologies/ retrieved on Aug. 20, 2015.
Yang et al., “HTML Page Analysis Based on Visual Cues”, A129, pp. 859-864, 2001.
Yang et al., “Retroactive Answering of Search Queries”, WWW 2006 Edinburgh, Scotland, May 23-26, 2006, pp. 457-466.
Notice of Acceptance for Australian Patent Application No. 2014250678 dated Oct. 7, 2015.
Notice of Allowance for U.S. Appl. No. 12/556,318 dated Apr. 11, 2016.
Notice of Allowance for U.S. Appl. No. 12/556,318 dated Nov. 2, 2015.
Notice of Allowance for U.S. Appl. No. 13/196,788 dated Dec. 18, 2015.
Notice of Allowance for U.S. Appl. No. 13/247,987 dated Mar. 17, 2016.
Notice of Allowance for U.S. Appl. No. 13/826,228 dated Mar. 27, 2015.
Notice of Allowance for U.S. Appl. No. 14/102,394 dated Aug. 25, 2014.
Notice of Allowance for U.S. Appl. No. 14/108,187 dated Aug. 29, 2014.
Notice of Allowance for U.S. Appl. No. 14/135,289 dated Oct. 14, 2014.
Notice of Allowance for U.S. Appl. No. 14/139,628 dated Jun. 24, 2015.
Notice of Allowance for U.S. Appl. No. 14/139,640 dated Jun. 17, 2015.
Notice of Allowance for U.S. Appl. No. 14/139,713 dated Jun. 12, 2015.
Notice of Allowance for U.S. Appl. No. 14/148,568 dated Aug. 26, 2015.
Notice of Allowance for U.S. Appl. No. 14/192,767 dated Dec. 16, 2014.
Notice of Allowance for U.S. Appl. No. 14/192,767 dated Apr. 20, 2015.
Notice of Allowance for U.S. Appl. No. 14/225,084 dated May 4, 2015.
Notice of Allowance for U.S. Appl. No. 14/264,445 dated May 14, 2015.
Notice of Allowance for U.S. Appl. No. 14/268,964 dated Dec. 3, 2014.
Notice of Allowance for U.S. Appl. No. 14/278,963 dated Sep. 2, 2015.
Notice of Allowance for U.S. Appl. No. 14/294,098 dated Dec. 29, 2014.
Notice of Allowance for U.S. Appl. No. 14/319,161 dated May 4, 2015.
Notice of Allowance for U.S. Appl. No. 14/319,765 dated Nov. 25, 2016.
Notice of Allowance for U.S. Appl. No. 14/323,935 dated Oct. 1, 2015.
Notice of Allowance for U.S. Appl. No. 14/326,738 dated Nov. 18, 2015.
Notice of Allowance for U.S. Appl. No. 14/451,221 dated Aug. 4, 2015.
Notice of Allowance for U.S. Appl. No. 14/473,552 dated Jul. 24, 2015.
Notice of Allowance for U.S. Appl. No. 14/473,860 dated Feb. 27, 2015.
Notice of Allowance for U.S. Appl. No. 14/473,860 dated Jan. 5, 2015.
Notice of Allowance for U.S. Appl. No. 14/479,863 dated Mar. 31, 2015.
Notice of Allowance for U.S. Appl. No. 14/486,991 dated May 1, 2015.
Notice of Allowance for U.S. Appl. No. 14/504,103 dated May 18, 2015.
Notice of Allowance for U.S. Appl. No. 14/552,336 dated Nov. 3, 2015.
Notice of Allowance for U.S. Appl. No. 14/579,752 dated Apr. 4, 2016.
Notice of Allowance for U.S. Appl. No. 14/581,920 dated Sep. 2, 2016.
Notice of Allowance for U.S. Appl. No. 14/616,080 dated Apr. 2, 2015.
Notice of Allowance for U.S. Appl. No. 14/734,772 dated Apr. 27, 2016.
Notice of Allowance for U.S. Appl. No. 14/746,671 dated Jan. 21, 2016.
Notice of Allowance for U.S. Appl. No. 14/849,454 dated May 25, 2016.
Notice of Allowance for U.S. Appl. No. 14/923,364 dated May 6, 2016.
Notice of Allowance for U.S. Appl. No. 14/948,009 dated May 6, 2016.
Notice of Allowance for U.S. Appl. No. 15/152,017 dated Sep. 6, 2016.
Notice of Allowance for U.S. Appl. No. 15/159,622 dated Oct. 6, 2017.
Official Communication for Australian Patent Application No. 2014201511 dated Feb. 27, 2015.
Official Communication for Australian Patent Application No. 2014202442 dated Mar. 19, 2015.
Official Communication for Australian Patent Application No. 2014210604 dated Jun. 5, 2015.
Official Communication for Australian Patent Application No. 2014210614 dated Jun. 5, 2015.
Official Communication for Australian Patent Application No. 2014213553 dated May 7, 2015.
Official Communication for Australian Patent Application No. 2014250678 dated Jun. 17, 2015.
Official Communication for European Patent Application No. 14158861.6 dated Jun. 16, 2014.
Official Communication for European Patent Application No. 14159464.8 dated Jul. 31, 2014.
Official Communication for European Patent Application No. 14159535.5 dated May 22, 2014.
Official Communication for European Patent Application No. 14180142.3 dated Feb. 6, 2015.
Official Communication for European Patent Application No. 14180281.9 dated Jan. 26, 2015.
Official Communication for European Patent Application No. 14180321.3 dated Apr. 17, 2015.
Official Communication for European Patent Application No. 14180432.8 dated Jun. 23, 2015.
Official Communication for European Patent Application No. 14186225.0 dated Feb. 13, 2015.
Official Communication for European Patent Application No. 14187739.9 dated Jul. 6, 2015.
Official Communication for European Patent Application No. 14187996.5 dated Feb. 12, 2015.
Official Communication for European Patent Application No. 14187996.5 dated Feb. 19, 2016.
Official Communication for European Patent Application No. 14189344.6 dated Feb. 20, 2015.
Official Communication for European Patent Application No. 14189344.6 dated Feb. 29, 2016.
Official Communication for European Patent Application No. 14189347.9 dated Mar. 4, 2015.
Official Communication for European Patent Application No. 14189802.3 dated May 11, 2015.
Official Communication for European Patent Application No. 14191540.5 dated May 27, 2015.
Official Communication for European Patent Application no. 14197879.1 dated Apr. 28, 2015.
Official Communication for European Patent Application No. 14197895.7 dated Apr. 28, 2015.
Official Communication for European Patent Application No. 14197938.5 dated Apr. 28, 2015.
Official Communication for European Patent Application No. 14199182.8 dated Mar. 13, 2015.
Official Communication for European Patent Application No. 14200246.8 dated May 29, 2015.
Official Communication for European Patent Application No. 14200298.9 dated May 13, 2015.
Official Communication for European Patent Application No. 15155845.9 dated Oct. 6, 2015.
Official Communication for European Patent Application No. 15155846.7 dated Jul. 8, 2015.
Official Communication for European Patent Application No. 15156004.2 dated Aug. 24, 2015.
Official Communication for European Patent Application No. 15165244.3 dated Aug. 27, 2015.
Official Communication for European Patent Application No. 15166137.8 dated Sep. 14, 2015.
Official Communication for European Patent Application No. 15175106.2 dated Nov. 5, 2015.
Official Communication for European Patent Application No. 15175151.8 dated Nov. 25, 2015.
Official Communication for European Patent Application No. 15180515.7 dated Dec. 14, 2015.
Official Communication for European Patent Application No. 15181419.1 dated Sep. 29, 2015.
Official Communication for European Patent Application No. 15183721.8 dated Nov. 23, 2015.
Official Communication for European Patent Application No. 15184764.7 dated Dec. 14, 2015.
Official Communication for European Patent Application No. 15193287.8 dated Apr. 1, 2016.
Official Communication for European Patent Application No. 15201727.3 dated May 23, 2016.
Official Communication for European Patent Application No. 15201881.8 dated May 23, 2016.
Official Communication for European Patent Application No. 15201924.6 dated Apr. 25, 2016.
Official Communication for European Patent Application No. 15202090.5 dated May 13, 2016.
Official Communication for European Patent Application No. 16152984.7 dated Mar. 24, 2016.
Official Communication for Great Britain Patent Application No. 1404457.2 dated Aug. 14, 2014.
Official Communication for Great Britain Patent Application No. 1404486.1 dated May 21, 2015.
Official Communication for Great Britain Patent Application No. 1404486.1 dated Aug. 27, 2014.
Official Communication for Great Britain Patent Application No. 1404489.5 dated May 21, 2015.
Official Communication for Great Britain Patent Application No. 1404489.5 dated Aug. 27, 2014.
Official Communication for Great Britain Patent Application No. 1404489.5 dated Oct. 6, 2014.
Official Communication for Great Britain Patent Application No. 1404499.4 dated Jun. 11, 2015.
Official Communication for Great Britain Patent Application No. 1404499.4 dated Aug. 20, 2014.
Official Communication for Great Britain Patent Application No. 1404499.4 dated Sep. 29, 2014.
Official Communication for Great Britain Patent Application No. 1404574.4 dated Dec. 18, 2014.
Official Communication for Great Britain Patent Application No. 1408025.3 dated Nov. 6, 2014.
Official Communication for Great Britain Patent Application No. 1411984.6 dated Dec. 22, 2014.
Official Communication for Great Britain Patent Application No. 1413935.6 dated Jan. 27, 2015.
Official Communication for Netherlands Patent Application No. 2012417 dated Sep. 18, 2015.
Official Communication for Netherlands Patent Application No. 2012421 dated Sep. 18, 2015.
Official Communication for Netherlands Patent Application No. 2012433 dated Mar. 11, 2016.
Official Communication for Netherlands Patent Application No. 2012436 dated Nov. 6, 2015.
Official Communication for Netherlands Patent Application No. 2012437 dated Sep. 18, 2015.
Official Communication for Netherlands Patent Application No. 2012438 dated Sep. 21, 2015.
Official Communication for Netherlands Patent Application No. 2013306 dated Apr. 24, 2015.
Official Communication for New Zealand Patent Application No. 622473 dated Jun. 19, 2014.
Official Communication for New Zealand Patent Application No. 622473 dated Mar. 27, 2014.
Official Communication for New Zealand Patent Application No. 622513 dated Apr. 3, 2014.
Official Communication for New Zealand Patent Application No. 622517 dated Apr. 3, 2014.
Official Communication for New Zealand Patent Application No. 624557 dated May 14, 2014.
Official Communication for New Zealand Patent Application No. 627962 dated Aug. 5, 2014.
Official Communication for New Zealand Patent Application No. 628161 dated Aug. 25, 2014.
Official Communication for New Zealand Patent Application No. 628263 dated Aug. 12, 2014.
Official Communication for New Zealand Patent Application No. 628495 dated Aug. 19, 2014.
Official Communication for New Zealand Patent Application No. 628585 dated Aug. 26, 2014.
Official Communication for New Zealand Patent Application No. 628840 dated Aug. 28, 2014.
Official Communication for U.S. Appl. No. 12/556,318 dated Jul. 2, 2015.
Official Communication for U.S. Appl. No. 13/196,788 dated Oct. 23, 2015.
Official Communication for U.S. Appl. No. 13/196,788 dated Nov. 25, 2015.
Official Communication for U.S. Appl. No. 13/247,987 dated Apr. 2, 2015.
Official Communication for U.S. Appl. No. 13/247,987 dated Sep. 22, 2015.
Official Communication for U.S. Appl. No. 13/827,491 dated Dec. 1, 2014.
Official Communication for U.S. Appl. No. 13/827,491 dated Jun. 22, 2015.
Official Communication for U.S. Appl. No. 13/827,491 dated Oct. 9, 2015.
Official Communication for U.S. Appl. No. 13/831,791 dated Mar. 4, 2015.
Official Communication for U.S. Appl. No. 13/831,791 dated Aug. 6, 2015.
Official Communication for U.S. Appl. No. 13/835,688 dated Jun. 17, 2015.
Official Communication for U.S. Appl. No. 13/839,026 dated Aug. 4, 2015.
Official Communication for U.S. Appl. No. 14/134,558 dated Oct. 7, 2015.
Official Communication for U.S. Appl. No. 14/141,252 dated Oct. 8, 2015.
Official Communication for U.S. Appl. No. 14/148,568 dated Oct. 22, 2014.
Official Communication for U.S. Appl. No. 14/148,568 dated Mar. 26, 2015.
Official Communication for U.S. Appl. No. 14/196,814 dated May 5, 2015.
Official Communication for U.S. Appl. No. 14/225,006 dated Sep. 10, 2014.
Official Communication for U.S. Appl. No. 14/225,006 dated Sep. 2, 2015.
Official Communication for U.S. Appl. No. 14/225,006 dated Dec. 21, 2015.
Official Communication for U.S. Appl. No. 14/225,006 dated Feb. 27, 2015.
Official Communication for U.S. Appl. No. 14/225,084 dated Sep. 11, 2015.
Official Communication for U.S. Appl. No. 14/225,084 dated Sep. 2, 2014.
Official Communication for U.S. Appl. No. 14/225,084 dated Feb. 20, 2015.
Official Communication for U.S. Appl. No. 14/225,084 dated Feb. 26, 2016.
Official Communication for U.S. Appl. No. 14/225,084 dated Jan. 4, 2016.
Official Communication for U.S. Appl. No. 14/225,160 dated Feb. 11, 2015.
Official Communication for U.S. Appl. No. 14/225,160 dated Aug. 12, 2015.
Official Communication for U.S. Appl. No. 14/225,160 dated May 20, 2015.
Official Communication for U.S. Appl. No. 14/225,160 dated Oct. 22, 2014.
Official Communication for U.S. Appl. No. 14/225,160 dated Jul. 29, 2014.
Official Communication for U.S. Appl. No. 14/251,485 dated Oct. 1, 2015.
Official Communication for U.S. Appl. No. 14/264,445 dated Apr. 17, 2015.
Official Communication for U.S. Appl. No. 14/268,964 dated Sep. 3, 2014.
Official Communication for U.S. Appl. No. 14/278,963 dated Jan. 30, 2015.
Official Communication for U.S. Appl. No. 14/289,596 dated Jul. 18, 2014.
Official Communication for U.S. Appl. No. 14/289,596 dated Jan. 26, 2015.
Official Communication for U.S. Appl. No. 14/289,596 dated Apr. 30, 2015.
Official Communication for U.S. Appl. No. 14/289,599 dated Jul. 22, 2014.
Official Communication for U.S. Appl. No. 14/289,599 dated May 29, 2015.
Official Communication for U.S. Appl. No. 14/289,599 dated Sep. 4, 2015.
Official Communication for U.S. Appl. No. 14/294,098 dated Aug. 15, 2014.
Official Communication for U.S. Appl. No. 14/294,098 dated Nov. 6, 2014.
Official Communication for U.S. Appl. No. 14/306,138 dated Sep. 14, 2015.
Official Communication for U.S. Appl. No. 14/306,138 dated Mar. 17, 2016.
Official Communication for U.S. Appl. No. 14/306,138 dated Feb. 18, 2015.
Official Communication for U.S. Appl. No. 14/306,138 dated Sep. 23, 2014.
Official Communication for U.S. Appl. No. 14/306,138 dated Dec. 24, 2015.
Official Communication for U.S. Appl. No. 14/306,138 dated May 26, 2015.
Official Communication for U.S. Appl. No. 14/306,138 dated Dec. 3, 2015.
Official Communication for U.S. Appl. No. 14/306,147 dated Feb. 19, 2015.
Official Communication for U.S. Appl. No. 14/306,147 dated Dec. 24, 2015.
Official Communication for U.S. Appl. No. 14/306,147 dated Jun. 3, 2016.
Official Communication for U.S. Appl. No. 14/306,147 dated Aug. 7, 2015.
Official Communication for U.S. Appl. No. 14/306,147 dated Sep. 9, 2014.
Official Communication for U.S. Appl. No. 14/306,154 dated Feb. 1, 2016.
Official Communication for U.S. Appl. No. 14/306,154 dated Mar. 11, 2015.
Official Communication for U.S. Appl. No. 14/306,154 dated May 15, 2015.
Official Communication for U.S. Appl. No. 14/306,154 dated Nov. 16, 2015.
Official Communication for U.S. Appl. No. 14/306,154 dated Mar. 17, 2016.
Official Communication for U.S. Appl. No. 14/306,154 dated Jul. 6, 2015.
Official Communication for U.S. Appl. No. 14/306,154 dated Sep. 9, 2014.
Official Communication for U.S. Appl. No. 14/319,161 dated Jan. 23, 2015.
Official Communication for U.S. Appl. No. 14/319,765 dated Feb. 1, 2016.
Official Communication for U.S. Appl. No. 14/319,765 dated Sep. 10, 2015.
Official Communication for U.S. Appl. No. 14/319,765 dated Jun. 16, 2015.
Official Communication for U.S. Appl. No. 14/319,765 dated Nov. 25, 2014.
Official Communication for U.S. Appl. No. 14/319,765 dated Feb. 4, 2015.
Official Communication for U.S. Appl. No. 14/323,935 dated Jun. 22, 2015.
Official Communication for U.S. Appl. No. 14/323,935 dated Nov. 28, 2014.
Official Communication for U.S. Appl. No. 14/323,935 dated Mar. 31, 2015.
Official Communication for U.S. Appl. No. 14/326,738 dated Dec. 2, 2014.
Official Communication for U.S. Appl. No. 14/326,738 dated Jul. 31, 2015.
Official Communication for U.S. Appl. No. 14/326,738 dated Mar. 31, 2015.
Official Communication for U.S. Appl. No. 14/451,221 dated Oct. 21, 2014.
Official Communication for U.S. Appl. No. 14/451,221 dated Apr. 6, 2015.
Official Communication for U.S. Appl. No. 14/463,615 dated Sep. 10, 2015.
Official Communication for U.S. Appl. No. 14/463,615 dated Nov. 13, 2014.
Official Communication for U.S. Appl. No. 14/463,615 dated May 21, 2015.
Official Communication for U.S. Appl. No. 14/463,615 dated Jan. 28, 2015.
Official Communication for U.S. Appl. No. 14/463,615 dated Dec. 9, 2015.
Official Communication for U.S. Appl. No. 14/473,552 dated Feb. 24, 2015.
Official Communication for U.S. Appl. No. 14/479,863 dated Dec. 26, 2014.
Official Communication for U.S. Appl. No. 14/483,527 dated Jun. 22, 2015.
Official Communication for U.S. Appl. No. 14/483,527 dated Jan. 28, 2015.
Official Communication for U.S. Appl. No. 14/483,527 dated Oct. 28, 2015.
Official Communication for U.S. Appl. No. 14/486,991 dated Mar. 10, 2015.
Official Communication for U.S. Appl. No. 14/490,612 dated Aug. 18, 2015.
Official Communication for U.S. Appl. No. 14/504,103 dated Mar. 31, 2015.
Official Communication for U.S. Appl. No. 14/504,103 dated Feb. 5, 2015.
Official Communication for U.S. Appl. No. 14/518,757 dated Dec. 1, 2015.
Official Communication for U.S. Appl. No. 14/518,757 dated Apr. 2, 2015.
Official Communication for U.S. Appl. No. 14/518,757 dated Jul. 20, 2015.
Official Communication for U.S. Appl. No. 14/552,336 dated Jul. 20, 2015.
Official Communication for U.S. Appl. No. 14/562,524 dated Nov. 10, 2015.
Official Communication for U.S. Appl. No. 14/562,524 dated Sep. 14, 2015.
Official Communication for U.S. Appl. No. 14/571,098 dated Nov. 10, 2015.
Official Communication for U.S. Appl. No. 14/571,098 dated Mar. 11, 2015.
Official Communication for U.S. Appl. No. 14/571,098 dated Aug. 24, 2015.
Official Communication for U.S. Appl. No. 14/571,098 dated Aug. 5, 2015.
Official Communication for U.S. Appl. No. 14/578,389 dated Oct. 21, 2015.
Official Communication for U.S. Appl. No. 14/578,389 dated Apr. 22, 2016.
Official Communication for U.S. Appl. No. 14/579,752 dated Aug. 19, 2015.
Official Communication for U.S. Appl. No. 14/579,752 dated May 26, 2015.
Official Communication for U.S. Appl. No. 14/579,752 dated Dec. 9, 2015.
Official Communication for U.S. Appl. No. 14/580,218 dated Jun. 26, 2015.
Official Communication for U.S. Appl. No. 14/580,218 dated Jun. 7, 2016.
Official Communication for U.S. Appl. No. 14/581,920 dated Mar. 1, 2016.
Official Communication for U.S. Appl. No. 14/581,920 dated Jun. 13, 2016.
Official Communication for U.S. Appl. No. 14/581,920 dated Sep. 2, 2016.
Official Communication for U.S. Appl. No. 14/581,920 dated May 3, 2016.
Official Communication for U.S. Appl. No. 14/631,633 dated Sep. 10, 2015.
Official Communication for U.S. Appl. No. 14/639,606 dated Oct. 16, 2015.
Official Communication for U.S. Appl. No. 14/639,606 dated May 18, 2015.
Official Communication for U.S. Appl. No. 14/639,606 dated Jul. 24, 2015.
Official Communication for U.S. Appl. No. 14/639,606 dated Apr. 5, 2016.
Official Communication for U.S. Appl. No. 14/645,304 dated Jan. 25, 2016.
Official Communication for U.S. Appl. No. 14/676,621 dated Oct. 29, 2015.
Official Communication for U.S. Appl. No. 14/676,621 dated Jul. 30, 2015.
Official Communication for U.S. Appl. No. 14/698,432 dated Jun. 3, 2016.
Official Communication for U.S. Appl. No. 14/726,211 dated Apr. 5, 2016.
Official Communication for U.S. Appl. No. 14/726,353 dated Mar. 1, 2016.
Official Communication for U.S. Appl. No. 14/726,353 dated Sep. 10, 2015.
Official Communication for U.S. Appl. No. 14/734,772 dated Jul. 24, 2015.
Official Communication for U.S. Appl. No. 14/734,772 dated Oct. 30, 2015.
Official Communication for U.S. Appl. No. 14/746,671 dated Nov. 12, 2015.
Official Communication for U.S. Appl. No. 14/746,671 dated Sep. 28, 2015.
Official Communication for U.S. Appl. No. 14/800,447 dated Dec. 10, 2015.
Official Communication for U.S. Appl. No. 14/800,447 dated Mar. 3, 2016.
Official Communication for U.S. Appl. No. 14/813,749 dated Sep. 28, 2015.
Official Communication for U.S. Appl. No. 14/841,338 dated Feb. 18, 2016.
Official Communication for U.S. Appl. No. 14/842,734 dated Nov. 19, 2015.
Official Communication for U.S. Appl. No. 14/857,071 dated Mar. 2, 2016.
Official Communication for U.S. Appl. No. 14/874,690 dated Jun. 1, 2016.
Official Communication for U.S. Appl. No. 14/874,690 dated Dec. 21, 2015.
Official Communication for U.S. Appl. No. 14/948,009 dated Feb. 25, 2016.
Official Communication for U.S. Appl. No. 14/961,830 dated May 20, 2016.
Official Communication for U.S. Appl. No. 14/996,179 dated May 20, 2016.
Official Communication for U.S. Appl. No. 15/072,174 dated Jun. 1, 2016.
Official Communication for U.S. Appl. No. 15/159,622 dated May 10, 2017.
Official Communication for U.S. Appl. No. 15/159,622 dated Feb. 24, 2017.
Restriction Requirement for U.S. Appl. No. 14/857,071 dated Dec. 11, 2015.
Notice of Allowance for U.S. Appl. No. 14/584,961 dated Jul. 13, 2017.
Official Communication for U.S. Appl. No. 14/584,961 dated Mar. 9, 2017.
Official Communication for U.S. Appl. No. 15/293,140 dated Jan. 11, 2018.
Notice of Allowance for U.S. Appl. No. 14/815,459 dated Sep. 23, 2016.
Official Communication for European Patent Application No. 14189344.6 dated Jun. 27, 2017.
Official Communication for European Patent Application No. 14189344.6 dated May 8, 2017.
Official Communication for European Patent Application No. 14189344.6 dated Jan. 9, 2017.
Official Communication for European Patent Application No. 15201881.8 dated Sep. 27, 2017.
Official Communication for European Patent Application No. 15201924.6 dated Oct. 9, 2017.
Official Communication for U.S. Appl. No. 14/815,459 dated Jun. 13, 2016.
Restriction Requirement for U.S. Appl. No. 13/839,026 dated Apr. 2, 2015.
Notice of Acceptance for Australian Patent Application No. 2014250637 dated Mar. 26, 2018.
Official Communication for European Patent Application No. 15201924.6 dated May 18, 2018.
Official Communication for U.S. Appl. No. 14/859,882 dated Mar. 21, 2019.
Official Communication for U.S. Appl. No. 14/859,882 dated Sep. 21, 2018.
Official Communication for U.S. Appl. No. 14/859,882 dated Feb. 8, 2018.
Official Communication for European Patent Application No. 19171133.2 dated Jun. 11, 2019.
Official Communication for U.S. Appl. No. 15/335,903 dated Jul. 16, 2019.
Official Communication for U.S. Appl. No. 15/406,195 dated Apr. 4, 2019.

Related Publications (1)

	Number	Date	Country
	20180052597 A1	Feb 2018	US

Continuations (1)

	Number	Date	Country
Parent	14584961	Dec 2014	US
Child	15782236		US

System and method of generating data points from one or more data stores of data items for chart creation and manipulation

Information

Patent Number

Date Filed

Date Issued

Inventors

Original Assignees

Examiners

Agents

CPC

Field of Search

CPC

International Classifications

Disclaimer

Term Extension

Abstract