Storing logical units of program code generated using a dynamic programming notebook user interface

Information

  • Patent Grant
  • 10127021
  • Patent Number
    10,127,021
  • Date Filed
    Wednesday, December 28, 2016
    7 years ago
  • Date Issued
    Tuesday, November 13, 2018
    5 years ago
Abstract
The programming notebook system, methods, and user interfaces described herein provide software developers with enhanced tools by which a programming notebook workflow and session history associated with code cells in a programming notebook may be tracked and maintained. As a developer progresses through a development workflow, the developer can select an option to save a program code card representing some or all of the program code cell inputs. A card editor user interface may present an aggregated listing of all program code the developer has provided across multiple code cells during the current session which the developer can edit, refine, and/or comment. The card editor may also allow the developer to add associated user interface code to display a UI component associated with the program code card, and allow the developer to add a description and tags for the card so that the card can be searched for and reused.
Description

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.


BACKGROUND

Programming notebooks have become a valuable asset in a software developer's toolkit. A programming notebook, such as the popular iPython Notebook, allows a developer to more rapidly develop and test code, typically by enabling a dynamic command-line shell interface which the developer can use to input, execute, and view associated outputs for lines of program code in a read-execute-print loop (“REPL”). Programming notebook outputs can be provided in various formats, such as a JavaScript Object Notation (“JSON,” which is a lightweight data-interchange format) document containing an ordered list of input/output cells which can contain code, text, mathematics, plots and rich media. Programming notebook outputs can also be converted to a number of open standard output formats (HTML, HTML presentation slides, LaTeX, PDF, ReStructuredText, Markdown, Python, etc.).


Typically, a programming notebook consists of a sequence of cells. A cell is a multi-line text input field, and its contents can be executed by the developer using the programming notebook interface. Code cells allow the developer to edit and write code and can provide features such as syntax highlighting and tab completion. When a cell is executed using a backend system associated with the programming notebook, results are displayed in the notebook as the cell's output. Output can be displayed in a variety of formats such as text, data plots, and tables.


In a normal programming notebook workflow, the developer can edit cells in-place multiple times until a desired output or result is obtained, rather than having to re-run separate scripts. The programming notebook interface enables the developer to work on complex computational programs in discrete and manageable pieces. The developer can organize related programming ideas into cells and work progressively forward as various pieces are working correctly. Once a developer has completed a workflow, the programming notebook can be saved or downloaded into a format which, among other things, may remove output results and convert some cell contents (e.g., some contents may be converted to non-executable comments in an output programming language).


SUMMARY

One embodiment comprises a computing system for providing a programming notebook, the computing system comprising: one or more hardware computer processors configured to execute software code; a non-transitory storage medium storing software modules configured for execution by the one or more hardware computer processors. The software modules may comprise at least: a code compiler and execution module configured to: receive, on behalf of a user interacting with a programming notebook user interface in a programming session, a request to execute a unit of program code associated with a program cell in the programming notebook user interface, wherein the unit of program code comprises one or more lines of program code; execute, on behalf of the user, the unit of program code; provide an output result associated with the execution of the unit of program code, wherein the output result is configured for display in association with the program cell in the programming notebook user interface; and a program code card management module configured to: maintain a session history of requests to execute units of program code and associated output results; receive a request to generate a program code card for the programming session; provide a program code card editor user interface including at least an aggregate listing of the lines associated with respective units of program code associated with the session history; receive, via the program code card editor user interface, user input comprising a selection of program code for the program code card; and generate the program code card based at least in part on the user input.


In another embodiment, the user input further comprises at least some user interface code. In another embodiment, the user input further comprises at least a description or a tag for the program code card. In another embodiment, providing the output result associated with the execution of the unit of program code comprises: analyzing the output result to determine a data type associated with the data type; selecting a data visualization user interface component to include with the output result based at least in part on the data type; generating, based on the output result, a data visualization user interface component; and provide the data visualization user interface component with the output result. In another embodiment, the data visualization user interface component is one of a time series, a scatter plot, a histogram, a chart, a bar graph, or a table. In another embodiment, based on a determination that the data type is a date the data visualization user interface component is a time series. In another embodiment, based on a determination that the data type is a geographic unit of measurement, the data visualization user interface component is a map.


Another embodiment comprises a computer-implemented method comprising: under control of a hardware computing device configured with specific computer executable instructions: maintaining a session history of requests to execute units of program code received in association with a programming notebook user interface in a programming session, wherein respective units of program code are associated with respective program cells in the programming notebook user interface; receiving a request to generate a program code card for the programming session; providing a program code card editor user interface including at least an aggregate listing of the units of program code associated with the session history, wherein the aggregate listing includes, for each unit of program code, an indicator label of the associated program cell in the programming notebook user interface; receiving, via the program code card editor user interface, user input comprising a selection of program code for the program code card; and generating the program code card based at least in part on the user input.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 illustrates an example programming workflow user interface for a programming notebook including a program code card component, as generated using one embodiment of the programming notebook system of FIG. 6.



FIG. 2 illustrates an example card editor user interface for a programming notebook, as generated using one embodiment of the programming notebook system of FIG. 6.



FIG. 3 illustrates an example programming workflow user interface for a programming notebook including one or more automatically generated data visualizations, as generated using one embodiment of the programming notebook system of FIG. 6.



FIG. 4 is a flowchart for one embodiment of an example process for generating and storing logical units of program code using a dynamic programming notebook user interface, as used in one embodiment of the programming notebook system of FIG. 6.



FIG. 5 is a flowchart for one embodiment of an example process for automatically determining one or more data visualizations to provide with output results generated in response to a program code execution request, as used in one embodiment of the programming notebook system of FIG. 6.



FIG. 6 is a block diagram of an implementation of an illustrative programming notebook system.





DETAILED DESCRIPTION OF SPECIFIC EMBODIMENTS

Overview


One drawback to existing programming notebook user interfaces and workflows is that the final output tends to be static, susceptible to inadvertent edits and difficult to reverse format corruption if manually edited, and generally does not lend itself well to facilitating re-use, re-execution, or sharing of code developed using the programming notebook interface. For example, using traditional programming notebook user interfaces a developer, in order to re-use code or logic a developer is often required to resort to copying-and-pasting blocks of program logic or code from one notebook to another. As a result, if a bug in the program logic or code is identified, it may only be fixed once in the location it is found; the other “copy” would not be automatically updated, and in many cases the developer that identified and fixed the bug may be unaware that a copy in another notebook may also need to be fixed or updated accordingly. It may never be clear which version of the program logic or code is the “canonical” or master version, and the developer may not even know that other copies of the program logic or code exist in one or more other notebooks.


As another example of how traditional programming notebook user interfaces are deficient relates to reordering or deleting of cells of program logic in the notebook. Using these functions, a developer may perform some logic development and analysis, and then reorder or delete cells in the analysis workflow such that the notebook may become inconsistent, and in some cases may no longer be “run” from top to bottom because the logic has become inconsistent, invalid, or even corrupt. Other programming environments which utilize or support a REPL-type interface and copying/pasting of code logic may suffer similar failings.


The programming notebook system, methods, and user interfaces described in this disclosure provide the developer with an enhanced tool by which the workflow and session history associated with code cells in a programming notebook are tracked and maintained. As the developer progresses through a development workflow, when desired outcome results are achieved, the developer can select an option to save a program code card representing some or all of the code cell inputs. A card editor user interface may provide the developer with a code editor input panel which presents an aggregated listing of all program code the developer has provided across multiple code cells during the current session. The developer can edit, refine, comment, and/or otherwise clean-up the aggregated code listing, such as by removing intermediate lines of code which were rendered unnecessary by other lines of code, editing code to refine definitions, adding comments to document the code and what it does, and so on. The card editor may also allow the developer to add associated user interface code to display a UI component associated with the program code card. The card editor may also allow the developer to add a description and tags for the card so that the card can be searched for and reused by other developers using the programming notebook system.


Once a program code card has been generated and stored by the programming notebook system it is added to a searchable card library. Developers can then search for and add cards to their own programming notebook workflows and leverage the work done by other developers. Cards may be used within a cell in the workflow, for example directly as a call to a function defined by the card or by interaction with an associated UI component defined by the card. For example, a UI component may expose one or more text input boxes corresponding to input parameters for a function defined by the card.


One potential benefit of enabling re-use of cards in the workflow is that cards can be built on top of each other and saved into new cards, which include or reference program code defined in previous cards. Then, an end user can request to import a program code card into a programming session or workflow. The programming notebook system then imports the program code card into the programming session or workflow, such that the end user can execute, by providing user input to the programming notebook user interface, a unit of program code associated with the program code card.


Another feature provided by the programming notebook system described herein is enhanced output results which are provided based on introspection of the output results. For example, additional output results may be suggested based on data attributes associated with the output results and/or input parameters. Additional output results might include one or more interactive data visualization thumbnail images and UI controls presenting the output results, or a portion thereof, in various different formats (e.g., a time series, a histogram, a table, a heat map, etc.). Whether and which data visualization thumbnail images and UI controls are displayed may be based on the attributes and/or values of the data output. For example, if data attributes or values indicate the data includes map coordinates, a geographic map data visualization thumbnail image and UI control may be displayed. Or, in another example, if data attributes or values indicate the data includes dates and times, a time series data visualization thumbnail image and UI control may be displayed. Each interactive data visualization thumbnail image and UI control may be generated based on the actual output results be fully interactive such that, for example, if the developer selects the thumbnail a corresponding full or larger size data visualization may be displayed in the programming notebook user interface. Among other benefits this proactive prediction of data visualizations which may be relevant or useful to the developer can help streamline and improve the developer's workflow. For example, being able to quickly review output results can aid the developer in determining whether the program code used to generate the output results may need to be modified and in what ways in order to move closer to or achieve a desired result.


In one example, an introspection algorithm may be implemented as follows. A visualization may define a set of rules defining what the visualization requires of the underlying data. For example, for a heat map, the rules may specify that (1) the data must be in a tabular format, and (2) the table of data must contain two numeric columns, which are in correct, specified ranges for latitude and longitude (e.g., from negative 90 to positive 90 degrees, from negative 180 to positive 180 degrees). Or, as another example, for a line chart, the rules may specify that, in order to correctly plot a line, (1) if the data is a list of scalars, then the data must contain a set of numbers, or (2) if the data is a list of pairs, then the value of the first coordinate of each pair must be increasing over the list of pairs. Or, as yet another example, for a timeseries plot (e.g., one or more line charts overlaid with a time axis), the rules may specify that (1) the data must be in a tabular format and (2) one column in the table must be in a date-time format or parseable to a date-time format (e.g., an ISO 8601 date format). The rules for each data visualization may then be responsible for providing the data in a normalized form (e.g., for a timeseries, explicit ticks for values on the time axis may be specified). In addition, the rules may be “fuzzy” such that data can be matched to the rules (or the data may satisfy the criteria specified by the rules) in differing degrees. The visualizations may then be ranked based on the degree of match between the data and the rules. (For example, for a heat map, if the names of the columns identified in the table as providing latitude and longitude contain the substrings “lat” or “Ion” then this may increase the confidence that a heat map is a valid visualization). The foregoing provides but one example of an introspection algorithm; other approaches may also be used, including various machine learning algorithms which may, for example, be implemented to train or learn over time which particular thumbnail a user actually picks.


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 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.


For purposes of this disclosure, certain aspects, advantages, and novel features of various embodiments are described herein. It is to be understood that not necessarily all such advantages may be achieved in accordance with any particular embodiment of the invention. Thus, for example, those skilled in the art will recognize that one embodiment may be carried out in a manner that achieves one advantage or group of advantages as taught herein without necessarily achieving other advantages as may be taught or suggested herein.


Example User Interfaces


FIGS. 1, 2, and 3 illustrate example programming notebook user interfaces, as used in one or more embodiments of the programming notebook system 100 of FIG. 6. The sample user interfaces may be displayed, for example, via a web browser (e.g., as a web page), a mobile application, or a standalone application. However, in some embodiments, the sample user interfaces shown in FIGS. 1, 2, and 3 may also be displayed on any suitable computer device, such as a cell/smart phone, tablet, wearable computing device, portable/mobile computing device, desktop, laptop, or personal computer, and are not limited to the samples as described herein. The user interfaces include examples of only certain features that a programming notebook system may provide. In other embodiments, additional features may be provided, and they may be provided using various different user interfaces and software code. Depending on the embodiment, the user interfaces and functionality described with reference to FIGS. 1, 2, and 3 may be provided by software executing on the individual's computing device, by a programming notebook system located remotely that is in communication with the computing device via one or more networks, and/or some combination of software executing on the computing device and the programming notebook system. In other embodiments, analogous interfaces may be presented using audio or other forms of communication. In an embodiment, the interfaces shown in FIGS. 1, 2, and 3 are configured to be interactive and respond to various user interactions. Such user interactions may include clicks with a mouse, typing with a keyboard, touches and/or gestures on a touch screen, voice commands, physical gestures made within a proximity of a user interface, and/or the like.



FIG. 1 (split across illustrates an example programming workflow user interface 1000 for a programming notebook including a program code card component, as generated using one embodiment of the programming notebook system of FIG. 6. The programming workflow user interface 1000 may be displayed in association with a programming session and enable a developer to quickly and interactively compose and execute lines of program code and view associated output results.


The programming workflow user interface 1000 of FIG. 1 includes several illustrative program cells. Program cell 102 includes two lines of program code and respective printouts of results from execution of the two lines of program code. Each program cell may also include, for example, an execution time status indicator to indicate how long the program code took to execute. Each program cell may also include a submenu of available actions with respect to the program cell, which may include for example a label descriptor to describe a type of code or mode associated with the program cell (e.g., a programming language indicator such as “Scala,” “python,” “HTML,” “JavaScript,” “markdown,” “sql,” and so on; a card mode indicator to indicate that the program cell is being used to display or invoke a card; and other similar types of modes). The program cell submenu may also include an option to execute the program code in the cell, an option to edit the cell (e.g., the developer may return to a previous cell, edit the program cell contents, and re-run the program cell to produce updated output results); an option to expand the size of the input box (e.g., if the developer wishes to add more lines of code than available space allows); and an option to delete, remove, or otherwise discard the program cell from the current session.


Program cell 104 represents a program code card which has been added to the current session and invoked by the developer to call a particular function defined by the logic in the program code card. In this example the card in program cell 104 has an associated UI control 105, which may optionally be specified by a user when the card is created or edited. For example, the card included at program cell 104 displays a function label; three text input boxes for the input parameters used by the function; and a function call preview displaying the function to be called with the provided input parameters (e.g., “cardFunction(input1,input2)”) when the program cell is executed. The UI control 105 for the card at program cell 104 also includes a “Run” button which the developer can select in order to run the card's program code. In some embodiments more advanced UI controls and inputs may be provided for the card, as specified by the developer using the card editor user interface (such as the one shown in FIG. 2). In other embodiments, no UI control 105 may be provided and the developer using the card may type the function call and input parameters (e.g., “card.cardFunction(input1,input2)”) directly into the default text box provided by the program cell.


The programming workflow user interface 1000 may include a main menu 107 providing additional features for the programming notebook. For example, the programming notebook system 100 may support or enable the developer to launch multiple sessions and switch between them. Thus, a “new session” option may cause the programming notebook system 100 to display a clean copy of the programming workflow user interface 1000 (e.g., including one empty program cell for the developer to begin a new session workflow). Additionally, a “change session” option may allow the developer to switch between multiple active sessions. User selection of this option may cause the programming notebook system 100 to display a copy of the programming workflow user interface 1000 for the changed-to session (e.g., including any program cell(s) and result outputs associated with the changed-to session for the developer to continue the changed-to session workflow).


The main menu 107 in FIG. 1 may also include a transcript option for the developer to view a transcript of program code for the current session. The transcript can include an aggregate listing of the lines of program code input by the developer across all program cells for the current session, without the result outputs associated with each program cell. The transcript may be generated to automatically insert program cell identifiers as code comments to identify or delimit the contents of each respective program cell (e.g., “// cell 1,” “// cell 2,” etc.). In certain embodiments in which the developer has imported a program code card in the programming workflow user interface, the transcript view may be generated to include (1) the function or code used to invoke the underlying code associated with the card, (2) the underlying code, and/or (3) an option to toggle or switch between (1) and (2).


As the developer progresses through a workflow and the number of program cells used in the current session increases, the transcript may be updated to reflect the current session. If a developer returns to or re-uses a program cell, the program cell identifiers may indicate this in some manner, such as with a revised identification, timestamp, or other way. For instance, a revised and/or re-executed program cell may be added as a new cell in the session history and associated transcript.


The main menu in FIG. 1 may also include a card menu option for the developer to create a new card from program code used in the current session, and/or to search for and add cards from a library of cards which have been created by the developer and/or other developers using the programming notebook system of FIG. 6. An example card editor user interface is illustrated and described in more detail with reference to FIG. 2. Saved cards may be stored, searched, and accessed, for example, from the program code card repository 122. Cards may be searched based on a name, a description, and/or one or more tags, as well as other searchable attributes (including in some cases the underlying code associated with the card) provided by the developer when the card is created or edited.


The programming workflow user interface 1000 may also include a session UI panel 106 which lists, for the current session, variables and their current values and/or functions which have been defined. For example, the session panel 106 listing includes, among other things, variables for “sc” and “sq” and a sql function “<function1>.” The programming workflow user interface 1000 may also include a REPL UI panel which lists a summary of result outputs for the current session. The session panel and the REPL UI panels provide the developer with useful at-a-glance information to aid the developer's workflow and code refinement process.



FIG. 2 illustrates an example card editor user interface 2000 for a programming notebook, as generated using one embodiment of the programming notebook system of FIG. 6. The card editor user interface 2000 may be displayed in response to the developer's selection of an option to create a new card based on the current session. The card editor user interface 2000 may be initialized by the programming notebook system 100 to include program code content associated with the current session in the main programming workflow UI. In particular, the program code may be accessed from the transcript associated with the current session and displayed in a first user-editable text area 202 by which the developer can edit the program code (e.g., add or remove lines, insert code comments and specifications, and other general code clean up and maintenance). In one embodiment the entire contents of the current session transcript may be displayed in the card editor for the developer to edit. In another embodiment, the main programming workflow user interface may include user-selectable options for the developer to select one or more program code cells from which to extract program code for the card editor.


The card editor user interface 2000 may also include a second user-editable text area 204 by which the developer may optionally provide user interface code to be associated with the program code logic of the card. For example, as shown in FIG. 2, HTML and JavaScript may be input by the developer to generate a web-based UI component for the card. Then, when the card is used in subsequent programming notebook sessions, the programming notebook system 100 can interpret the UI code for the card in order to cause display of the UI component directly within the programming notebook UI (for example, as show in program cell 104 of the programming workflow user interface in FIG. 1).


The card editor user interface 2000 also provides options for the developer to provide a description and one or more tags to be associated with the card when it is saved. The description and/or tags may be searchable by other users of the programming notebook system 100 to facilitate re-use of cards across many developer sessions. When the developer is satisfied with the card's settings, a save option may be selected in order to save the card, for example in the program code card repository 170. After the card is saved, the card editor user interface 3000 may be closed (automatically or manually) and the developer can return to the main programming workflow UI. If the developer desires, one or more program cells (for example, those that were used as inputs to the card) may be removed from the workflow by using the respective delete options. However, in some embodiments, the program cell may not also be removed from the transcript. That is, in some instances, the transcript is implemented as immutable log of everything that happens in the workflow, including deletion events. Thus, deletion of a program cell may be more like hiding, in that the transcript still maintains a copy of the deleted cell. Then, the transcript view could be augmented to show or indicate when an entry in the transcript no longer exists in the main programming workflow UI (e.g., this may be visually indicated to the user via some formatting change, an icon, and so on).



FIG. 3 illustrates an example programming workflow user interface 3000 for a programming notebook including one or more automatically generated data visualizations, such as example visualizations 302A, 302B, and 302C of FIG. 3, as generated using one embodiment of the programming notebook system of FIG. 6. The data visualizations may be of particular benefit to the developer in the context of database queries in order to quickly view query results and assess whether the query needs to be revised or tweaked to improve the quality of the output results. The data visualizations 302 (including 302A, 302B, and 302C) shown in user interface 3000 are user-selectable image thumbnails or miniaturized visualizations of the actual output results. In response to the user selecting one of the data visualizations, a larger corresponding version of the same data may be displayed in the main workflow of the user interface 3000 to enable the developer to explore the output results. A variety of data visualizations, ranging from thumbnail to normal to large sized, may be generated and displayed, including but not limited to time series, histograms, tables, graphics, heat maps, and other types of data charts and visualizations.


The data visualizations 302 shown in user interface 3000 may be generated, for example, in accordance with the process 500 illustrated and described with reference to FIG. 5 herein. In particular, the data visualizations may be automatically selected for generation and generated based at least in part on an analysis of the type of data returned with the output results. For example, the programming notebook system 100 may analyze the output results, determine that the output results include geographic data (such as latitude and longitude coordinates), and generate a map data visualization, such as visualization 302A, for display with the output results in the main programming workflow user interface


Examples of Processes Performed by Programming Notebook Systems


FIGS. 4 and 5 are flowcharts illustrating various embodiments of programming notebook system processes. In some implementations, the processes are performed by embodiments of the programming notebook system 100 described with reference to FIG. 6 and/or by one of its components, such as the such as the code compiler and execution module 122, the program code card management module 126, or the data (column) introspection module 128. For ease of explanation, the following describes the services as performed by the programming notebook system 100. The example scenarios are intended to illustrate, but not to limit, various aspects of the programming notebook system 100. In one embodiment, the processes can be dynamic, with some procedures omitted and others added.


Generating Logical Units of Program Code



FIG. 4 is a flowchart illustrating one embodiment of a process 400 for generating and storing logical units of program code using a dynamic programming notebook user interface, as used in one embodiment of the programming notebook system 100 of FIG. 6. Depending on the embodiment, the method of FIG. 4 may include fewer or additional blocks and the blocks may be performed in an order that is different than illustrated.


The process 400 begins at block 405 where the programming notebook system receives a request to execute user input program code for a cell, such as input provided by a developer interacting with the programming workflow user interface 1000. This aspect of the process may be referred to as the “read” part of a read-eval-print loop (REPL). The request to execute program code may include one or more lines of program code of varying complexity and may include operations such as, but not limited to, initiating a database connection, submitting queries to the database, defining variables and functions, inserting code comments and markup, and so on. The programming notebook system 100 may be configured to support a wide variety of programming languages, including but not limited to Scala, Python, HTML, JavaScript, Ruby, and so on.


At block 410, the programming notebook system 100 executes the program code associated with the request. This may be, for example, the “eval” part of REPL. The program code received with the request is evaluated and executed to produce output results. The output results may include a wide range of programmatic outputs including no output (e.g., a simple return), a Boolean value, a variable, a value, search query results, and the like. As discussed further herein, the output results may further include, or be analyzed to include, one or more data visualizations which may be of possible interest to the developer based on any inputs in the program code and/or based on the output results.


At block 415, the programming notebook system 100 provides the output results associated with execution of the program code, e.g., as produced at block 410. This aspect of the process corresponds to the “print” part of the REPL. The output results may be presented or configured for presentation in the programming workflow user interface 1000, for example below the program cell used by the developer to input the program code for the request.


At block 420 the programming notebook system 100 maintains the session history of program code cell execution requests and the associated output results. The session history may be maintained and used by the programming notebook system 100 in memory 130 (e.g., for the duration of the current session or as the developer switches between multiple sessions) or stored for later access and retrieval (e.g., in one of the other data sources 174 of FIG. 6). The session history may be used to, for example, generate a transcript of the current session in response to the user's selection of the view transcript option (see, e.g., FIG. 1). The session history may be used to generate or initialize a card editor user interface, as further described below.


At block 425 the programming notebook system 100 determines whether a request to generate a program code card has been received. If such a request has not been received, then the process 400 may return to block 405 and continue processing program code execution requests in the REPL from blocks 405 to 415 as many times as the developer would like.


In response to a request to generate a program code card has been received, the process may proceed to block 430. At block 430, the maintained session history is provided to allow the user to select and/or edit program code for the program code card. For example, the maintained session history may include all program code, organized by respective cells, which the user provides as input for the current session. The program code may be displayed, for example, as a listing of program code in a user-editable text area within a card editor user interface, such as the card editor user interface 2000 of FIG. 2. As discussed with reference to FIG. 2, the card editor UI may also enable the user to add additional program code for an associated UI component for the card.


When the user has completed editing of the program code, associated UI code, description, and/or tags, she can select the “Save” (or similar) option. In response, at block 435, the programming notebook system 100 generates the program code card comprising one or more user selected and/or edited lines of program code. Once the program card code has been generated the programming notebook system 100 can store the program code card, for example at the program code card repository 170.


Determining Data Visualizations to Provide with Program Code Output Results



FIG. 5 is a flowchart illustrating one embodiment of a process 500 for automatically determining one or more data visualizations to provide with output results generated in response to a program code execution request, as used in one embodiment of the programming notebook system 100 of FIG. 6. Depending on the embodiment, the method of FIG. 5 may include fewer or additional blocks and the blocks may be performed in an order that is different than illustrated.


The process 500 begins at block 505 where the programming notebook system 100 analyzes parameters associated with the program code provided by the user at a cell in the main programming workflow UI to determine one or more potential data type attributes associated with the input parameters. For example, the program code to be executed might include one or more input parameters of a particular data type which may suggest what type of data the output results will be.


At block 510, the programming notebook system 100 analyzes the output results associated with execution of the program code for the cell to determine one or more potential data type attributes associated with the output results. For example, if the output results comprise a table of data (e.g., rows and columns) then the columns and/or data values may be analyzed to identify the type of data associated with each column. For example, if the output results table of data includes column headers, these headers may contain contextual information to indicate the type of data (e.g., a column labeled with the word “DATE” is likely to be a date data attribute, a column labeled with the word “CITY” is likely to be a geographical data attribute, and so on). Further, the output results data table values may be parsed and analyzed to determine probable data types, in particular if no column headings or other metadata is available. For example, values in the format “####-##-##” may be analyzed and interpreted by the programming notebook system 100 to indicate that the value is likely to be a date data attribute. In other examples standard formats may be analyzed and compared to results data to identify probable matches or data types including latitude and longitude coordinates, geographic abbreviations, special symbols which may indicate the data type (e.g., currency symbols).


At block 515, the programming notebook system 100 generates one or more interactive data visualization thumbnails based on the potential data types identified at blocks 505 and 510. The data visualization thumbnails may include one or more of a time series, a histogram, a table, a heat map, a geographic map, a scatter plot, a line graph, a pie chart, or any other type of data visualization. Whether and which data visualization thumbnails are selected may depend on the detected data types (and/or probable data types) and/or combinations of data types. For example, if geographic data types are identified, a geographic map may be generated as one of the data visualizations. Or, if date and time data types are identified, a time series or a calendar may be generated as data visualizations. The data visualizations may be generated based on the actual output results to provide an accurate view of the data.


At block 520, the programming notebook system 100 provides the interactive data visualization thumbnails with the output results. The interactive data visualizations may then be displayed with the output results, for example in the programming workflow user interface 3000 above or below the program cell used by the developer to input the program code for the request. The data visualizations may be configured to respond to user interaction by, for example, causing display of a larger non-thumbnail version of the data visualization in the programming workflow user interface 3000. The larger non-thumbnail version may be fully interactive and support user functionality such as zooming in our out, manipulating parameters, selecting portions of the visualization to filter results, and so on.


Example System Implementation and Architecture


FIG. 6 is a block diagram of one embodiment of a programming notebook system 100 in communication with a network 160 and various systems, such as client computing systems(s) 168, program code card repository 170, and/or other data source(s) 172. The programming notebook system 100 may be used to implement systems and methods described herein, including, but not limited to the processes 400 of FIG. 4 and the process 500 of FIG. 5.


Programming Notebook System


In the embodiment of FIG. 6, the programming notebook system 100 includes a code compiler and execution module 122, a program code card management module 126, a data (column) introspection module 128, and a user interface module 124 that may be stored in the mass storage device 120 as executable software codes that are executed by the CPU 150. These and other modules in the programming notebook system 100 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 the embodiment shown in FIG. 6, the programming notebook system 100 is configured to execute the modules recited above to perform the various methods and/or processes herein (such as the processes described with respect to FIGS. 4 and 5 herein).


The code compiler and execution module 122 provides capabilities related to execution of program code associated with requests received by the programming notebook system 100, for example as described by the process 400 of FIG. 4. The program code card management module 126 provides capabilities related to storing and searching program code cards, some aspects of which are described by the process 400 of FIG. 4 and/or the user interface 1000 of FIG. 1. The data (column) introspection module 128 provides capabilities related to analyzing inputs and outputs associated with executed program code to automatically identify potential data visualizations which may be of use to the end user, for example as described by the process 500 of FIG. 5. The user interface module 124 provides capabilities related to generation and presentation of one or more user interfaces, such as the sample user interfaces illustrated with reference to FIGS. 1, 2, and 3 herein.


The programming notebook system 100 includes, for example, a server, workstation, or other computing device. In one embodiment, the exemplary programming notebook system 100 includes one or more central processing units (“CPU”) 150, which may each include a conventional or proprietary microprocessor. The programming notebook system 100 further includes one or more memories 130, such as random access memory (“RAM”) for temporary storage of information, one or more read only memories (“ROM”) for permanent storage of information, and one or more mass storage device 120, such as a hard drive, diskette, solid state drive, or optical media storage device. Typically, the modules of the programming notebook system 100 are connected to the computer using a standard based bus system. In different embodiments, the standard based bus system could be implemented in Peripheral Component Interconnect (“PCI”), Microchannel, Small Computer System Interface (“SCSI”), Industrial Standard Architecture (“ISA”), and Extended ISA (“EISA”) architectures, for example. In addition, the functionality provided for in the components and modules of programming notebook system 100 may be combined into fewer components and modules or further separated into additional components and modules.


The programming notebook system 100 is generally controlled and coordinated by operating system software, such as Windows XP, Windows Vista, Windows 7, Windows 8, Windows Server, UNIX, Linux, SunOS, Solaris, iOS, Blackberry OS, or other compatible operating systems. In Macintosh systems, the operating system may be any available operating system, such as MAC OS X. In other embodiments, the programming notebook system 100 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, such as a graphical user interface (“GUI”), among other things.


The exemplary programming notebook system 100 may include one or more commonly available input/output (I/O) devices and interfaces 110, such as a keyboard, mouse, touchpad, and printer. In one embodiment, the I/O devices and interfaces 110 include one or more display devices, such as a monitor, that allows the visual presentation of data to a user. More particularly, a display device provides for the presentation of GUIs, application software data, and multimedia analytics, for example. The programming notebook system 100 may also include one or more multimedia devices 140, such as speakers, video cards, graphics accelerators, and microphones, for example.


Network


In the embodiment of FIG. 6, the I/O devices and interfaces 110 provide a communication interface to various external devices. In the embodiment of FIG. 6, the programming notebook system 100 is electronically coupled to a network 160, which comprises one or more of a LAN, WAN, and/or the Internet, for example, via a wired, wireless, or combination of wired and wireless, communication link. The network 160 communicates with various computing devices and/or other electronic devices via wired or wireless communication links.


According to FIG. 6, in some embodiments information may be provided to or accessed by the programming notebook system 100 over the network 160 from one or more program code card repository 170 and/or other data source(s) 172. The program code card repository 170 may store, for example, logical units of program code (e.g., “cards”) generated using the methods described herein. The program code card repository 170 and/or other data source(s) 172 may include one or more internal and/or external data sources. In some embodiments, one or more of the databases or data sources may be implemented using a relational database, such as Sybase, Oracle, CodeBase, MySQL, and Microsoft® SQL Server as well as other types of databases such as, for example, a flat file database, an entity-relationship database, and object-oriented database, and/or a record-based database


Other Embodiments

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 code modules may be stored on any type of non-transitory computer-readable medium or computer storage device, such as hard drives, solid state memory, optical disc, and/or the like. The systems and modules may also be transmitted as generated data signals (for example, as part of a carrier wave or other analog or digital propagated signal) on a variety of computer-readable transmission mediums, including wireless-based and wired/cable-based mediums, and may take a variety of forms (for example, as part of a single or multiplexed analog signal, or as multiple discrete digital packets or frames). The processes and algorithms may be implemented partially or wholly in application-specific circuitry. The results of the disclosed processes and process steps may be stored, persistently or otherwise, in any type of non-transitory computer storage such as, for example, volatile or non-volatile storage.


In general, the word “module,” as used herein, refers to logic embodied in hardware or firmware, or to a collection of software instructions, possibly having entry and exit points, written in a programming language, such as, for example, Java, 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, or any other tangible medium. Such software code may be stored, partially or fully, on a memory device of the executing computing device, such as the programming notebook system 100, for execution by the computing device. Software instructions may be embedded in firmware, such as an EPROM. It will be further appreciated that hardware modules may be comprised of connected logic units, such as gates and flip-flops, and/or may be comprised of programmable units, such as programmable gate arrays or processors. The modules described herein are preferably implemented as software modules, but may be represented in hardware or firmware. Generally, the modules described herein refer to logical modules that may be combined with other modules or divided into sub-modules despite their physical organization or storage.


The 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 used herein, such as, among others, “can,” “could,” “might,” “may,” “for example,” and the like, 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 author input or prompting, whether these features, elements and/or steps are included or are to be performed in any particular embodiment. The terms “comprising,” “including,” “having,” and the like are synonymous and are used inclusively, in an open-ended fashion, and do not exclude additional elements, features, acts, operations, and so forth. Also, the term “or” is used in its inclusive sense (and not in its exclusive sense) so that when used, for example, to connect a list of elements, the term “or” means one, some, or all of the elements in the list. Conjunctive language such as the phrase “at least one of X, Y and Z,” unless specifically stated otherwise, is otherwise understood with the context as used in general to convey that an item, term, etc. may be either X, Y or Z. Thus, such conjunctive language is not generally intended to imply that certain embodiments require at least one of X, at least one of Y and at least one of Z to each be present.


While certain example embodiments have been described, these embodiments have been presented by way of example only, and are not intended to limit the scope of the disclosure. Thus, nothing in the foregoing description is intended to imply that any particular element, feature, characteristic, step, module, or block is necessary or indispensable. Indeed, the novel methods and systems described herein may be embodied in a variety of other forms; furthermore, various omissions, substitutions, and changes in the form of the methods and systems described herein may be made without departing from the spirit of the inventions disclosed herein. The accompanying claims and their equivalents are intended to cover such forms or modifications as would fall within the scope and spirit of certain of the inventions disclosed herein.


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.


All of the methods and processes described above may be embodied in, and partially or fully automated via, software code modules executed by one or more general purpose computers. For example, the methods described herein may be performed by the programming notebook system 100 and/or any other suitable computing device. The methods may be executed on the computing devices in response to execution of software instructions or other executable code read from a tangible computer readable medium. A tangible computer readable medium is a data storage device that can store data that is readable by a computer system. Examples of computer readable mediums include read-only memory, random-access memory, other volatile or non-volatile memory devices, CD-ROMs, magnetic tape, flash drives, and optical data storage devices.


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

Claims
  • 1. A computer-implemented method of generating displayable data visualizations, the computer-implemented method comprising: by one or more hardware computer processors executing program code: receiving an indication of a set of data items;automatically analyzing at least some data items of the set of data items to determine one or more attributes of the set of data items;automatically selecting, based at least in part on the one or more attributes of the set of data items, a first one or more data visualization types of a plurality of data visualization types, wherein the plurality of data visualization types comprise a plurality of built in formats for displaying and visualizing sets of data items, and wherein the plurality of data visualization types includes at least one of: time series, scatter plot, histogram, chart, graph, table, map, heat map, or geographic map;applying the set of data items to the first one or more data visualization types to generate a first plurality of displayable data visualizations;causing display of the first plurality of displayable data visualizations, wherein: at least a first displayable data visualization of the first plurality of displayable data visualizations is interactive and includes at least part of the applied set of data items,at least a second displayable data visualization of the first plurality of displayable data visualizations is interactive and includes at least part of the applied set of data items,at least the second displayable data visualization that is interactive is selectable to cause display of an enlarged version of the second displayable data visualization that is also interactive and includes at least part of the applied set of data items,at least the first and second displayable data visualizations are displayed simultaneously, andat least some of the first plurality of displayable data visualizations are displayed as interactive thumbnails;receiving a user input modifying the set of data items that are represented in the plurality of displayable data visualizations;in response to the user input, transforming the set of data items into an updated set of data items;automatically analyzing at least some data items of the updated set of data items to determine one or more attributes of the updated set of data items;automatically selecting, based at least in part on the one or more attributes of the updated set of data items, a second one or more data visualization types of the plurality of data visualization types;applying the updated set of data items to the second one or more data visualization types to generate a second one or more displayable data visualizations; andcausing display of the second one or more displayable data visualizations, wherein at least one displayable data visualization of the second one or more displayable data visualizations is interactive.
  • 2. The computer-implemented method of claim 1, wherein modifying the set of data items includes combining the set of data items with one or more other data items.
  • 3. The computer-implemented method of claim 1, wherein the one or more attributes include a type of the set of data items.
  • 4. The computer-implemented method of claim 1, wherein the user input modifying the set of data items comprises providing an updated query of the set of data items.
  • 5. The computer-implemented method of claim 4, wherein the updated query comprises a selection, from the set of data items, of particular data items or types of data items of interest to the user.
  • 6. The computer-implemented method of claim 1, wherein the user input is received via an enlarged version of one of the plurality of displayable data visualizations.
  • 7. A computer system configured to generate displayable data visualizations, the computer system comprising: one or more hardware computer processors configured to execute code in order to cause the one or more hardware computer processors to: receive a set of data items, wherein the set of data items includes one or more column headers;automatically analyze at least some of the one or more column headers to determine contextual information associated with the set of data items;automatically select, based at least in part on the contextual information associated with the set of data items, a first one or more data visualization types of a plurality of data visualization types, wherein the plurality of data visualization types comprise a plurality of built in formats for displaying and visualizing sets of data items, and wherein the plurality of data visualization types includes at least one of: time series, scatter plot, histogram, chart, graph, table, map, heat map, or geographic map;apply the set of data items to the first one or more data visualization types to generate a first plurality of displayable data visualizations;cause display of the first plurality of displayable data visualizations, wherein: at least a first displayable data visualization of the first plurality of displayable data visualizations is interactive and includes at least part of the applied set of data items,at least a second displayable data visualization of the first plurality of displayable data visualizations is interactive and includes at least part of the applied set of data items,at least the second displayable data visualization that is interactive is selectable to cause display of an enlarged version of the second displayable data visualization that is also interactive and includes at least part of the applied set of data items,at least the first and second displayable data visualizations are displayed simultaneously, andat least some of the first plurality of displayable data visualizations are displayed as interactive thumbnails;receive a user input modifying the set of data items that are represented in the plurality of displayable data visualizations;in response to the user input, transform the set of data items into an updated set of data items, wherein the updated set of data items includes one or more updated column headers;automatically analyze at least some of the one or more updated column headers to determine contextual information associated with the updated set of data items;automatically select, based at least in part on the contextual information associated with the updated set of data items, a second one or more data visualization types of the plurality of data visualization types;apply the updated set of data items to the second one or more data visualization types to generate a second one or more displayable data visualizations; andcause display of the second one or more displayable data visualizations, wherein at least one displayable data visualization of the second one or more displayable data visualizations is interactive.
  • 8. The computer system of claim 7, wherein modifying the set of data items includes combining the set of data items with one or more other data items.
  • 9. The computer system of claim 7, wherein the contextual information associated with the set of data items includes at least a type of the one or more data items.
  • 10. The computer system of claim 7, wherein the user input modifying the set of data items comprises providing an updated query of the set of data items.
  • 11. The computer system of claim 10, wherein the updated query comprises a selection, from the set of data items, of particular data items or types of data items of interest to the user.
  • 12. The computer system of claim 7, wherein the user input is received via an enlarged version of one of the plurality of displayable data visualizations.
  • 13. A computer system configured to generate displayable data visualizations, the computer system comprising: one or more hardware computer processors configured to execute code in order to cause the one or more hardware computer processors to: receive an indication of a set of data items;automatically analyze at least some data items of the set of data items to determine one or more attributes of the set of data items;automatically select, based at least in part on the one or more attributes of the set of data items, a first one or more data visualization types of a plurality of data visualization types, wherein the plurality of data visualization types comprise a plurality of built in formats for displaying and visualizing sets of data items, and wherein the plurality of data visualization types includes at least one of: time series, scatter plot, histogram, chart, graph, table, map, heat map, or geographic map;apply the set of data items to the first one or more data visualization types to generate a first plurality of displayable data visualizations;cause display of the first plurality of displayable data visualizations, wherein: at least a first displayable data visualization of the first plurality of displayable data visualizations is interactive and includes at least part of the applied set of data items,at least a second displayable data visualization of the first plurality of displayable data visualizations is interactive and includes at least part of the applied set of data items,at least the second displayable data visualization that is interactive is selectable to cause display of an enlarged version of the second displayable data visualization that is also interactive and includes at least part of the applied set of data items,at least the first and second displayable data visualizations are displayed simultaneously, andat least some of the first plurality of displayable data visualizations are displayed as interactive thumbnails;receive a user input modifying the set of data items that are represented in the plurality of displayable data visualizations;in response to the user input, transform the set of data items into an updated set of data items;automatically analyze at least some data items of the updated set of data items to determine one or more attributes of the updated set of data items;automatically select, based at least in part on the one or more attributes of the updated set of data items, a second one or more data visualization types of the plurality of data visualization types;apply the updated set of data items to the second one or more data visualization types to generate a second one or more displayable data visualizations; andcause display of the second one or more displayable data visualizations, wherein at least one displayable data visualization of the second one or more displayable data visualizations is interactive.
  • 14. The computer system of claim 13, wherein modifying the set of data items includes combining the set of data items with one or more other data items.
  • 15. The computer system of claim 13, wherein the one or more attributes include a type of the set of data items.
  • 16. The computer system of claim 13, wherein the user input modifying the set of data items comprises providing an updated query of the set of data items.
  • 17. The computer system of claim 16, wherein the updated query comprises a selection, from the set of data items, of particular data items or types of data items of interest to the user.
  • 18. The computer system of claim 13, wherein the user input is received via an enlarged version of one of the plurality of displayable data visualizations.
CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No. 14/845,001, filed on Sep. 3, 2015, which claims priority from provisional U.S. Patent Application No. 62/097,388, filed on Dec. 29, 2014. The entire disclosure of each of the above items 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.

US Referenced Citations (475)
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
5781704 Rossmo Jul 1998 A
5798769 Chiu et al. Aug 1998 A
5845300 Comer Dec 1998 A
6057757 Arrowsmith et al. May 2000 A
6091956 Hollenberg Jul 2000 A
6161098 Wallman Dec 2000 A
6219053 Tachibana et al. Apr 2001 B1
6232971 Haynes May 2001 B1
6247019 Davies Jun 2001 B1
6279018 Kudrolli et al. Aug 2001 B1
6341310 Leshem et al. Jan 2002 B1
6366933 Ball et al. Apr 2002 B1
6369835 Lin Apr 2002 B1
6456997 Shukla Sep 2002 B1
6549944 Weinberg et al. Apr 2003 B1
6560620 Ching May 2003 B1
6581068 Bensoussan et al. Jun 2003 B1
6594672 Lampson et al. Jul 2003 B1
6631496 Li et al. Oct 2003 B1
6642945 Sharpe Nov 2003 B1
6714936 Nevin, III Mar 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
6976210 Silva et al. 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
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
7269786 Malloy et al. Sep 2007 B1
7278105 Kitts Oct 2007 B1
7290698 Poslinski et al. Nov 2007 B2
7333998 Heckerman et al. Feb 2008 B2
7370047 Gorman May 2008 B2
7379811 Rasmussen et al. May 2008 B2
7379903 Caballero et al. May 2008 B2
7426654 Adams et al. Sep 2008 B2
7454466 Bellotti et al. Nov 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
7730082 Sah et al. Jun 2010 B2
7730109 Rohrs et al. Jun 2010 B2
7770100 Chamberlain et al. Aug 2010 B2
7805457 Viola et al. Sep 2010 B1
7809703 Balabhadrapatruni 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
7917376 Bellin et al. Mar 2011 B2
7920963 Jouline et al. Apr 2011 B2
7933862 Chamberlain et al. Apr 2011 B2
7962281 Rasmussen et al. Jun 2011 B2
7962495 Jain et al. Jun 2011 B2
7962848 Bertram Jun 2011 B2
7970240 Chao et al. Jun 2011 B1
7971150 Raskutti et al. Jun 2011 B2
7984374 Caro et al. Jun 2011 B2
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
8024666 Thompson Sep 2011 B2
8024778 Cash et al. Sep 2011 B2
8036632 Cona et al. Oct 2011 B1
8103543 Zwicky Jan 2012 B1
8134457 Velipasalar et al. Mar 2012 B2
8145703 Frishert et al. Mar 2012 B2
8185819 Sah et al. May 2012 B2
8214361 Sandler et al. Jul 2012 B1
8214764 Gemmell et al. Jul 2012 B2
8225201 Michael Jul 2012 B2
8229947 Fujinaga Jul 2012 B2
8230333 Decherd et al. Jul 2012 B2
8271461 Pike et al. Sep 2012 B2
8280880 Aymeloglu 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
8312367 Foster Nov 2012 B2
8312546 Alme Nov 2012 B2
8352881 Champion et al. Jan 2013 B2
8368695 Howell et al. Feb 2013 B2
8397171 Klassen et al. Mar 2013 B2
8412707 Mianji Apr 2013 B1
8434068 Wrighton et al. Apr 2013 B2
8447722 Ahuja et al. May 2013 B1
8452790 Mianji May 2013 B1
8463036 Ramesh et al. Jun 2013 B1
8489331 Kopf et al. Jul 2013 B2
8489641 Seefeld et al. Jul 2013 B1
8498984 Hwang et al. Jul 2013 B1
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
8577911 Stepinski et al. Nov 2013 B1
8589273 Creeden et al. Nov 2013 B2
8595234 Siripuapu et al. Nov 2013 B2
8620641 Farnsworth et al. Dec 2013 B2
8639757 Zang et al. Jan 2014 B1
8646080 Williamson et al. Feb 2014 B2
8676857 Adams et al. Mar 2014 B1
8689108 Duffield et al. Apr 2014 B1
8713467 Goldenberg et al. Apr 2014 B1
8726379 Stiansen et al. May 2014 B1
8739278 Varghese May 2014 B2
8742934 Sarpy et al. Jun 2014 B1
8745516 Mason et al. Jun 2014 B2
8781169 Jackson et al. Jul 2014 B2
8787939 Papakipos et al. Jul 2014 B2
8799799 Cervelli et al. Aug 2014 B1
8812947 Maoz Aug 2014 B1
8812960 Sun et al. Aug 2014 B1
8830322 Nerayoff et al. Sep 2014 B2
8832594 Thompson et al. Sep 2014 B1
8868537 Colgrove et al. Oct 2014 B1
8917274 Ma et al. Dec 2014 B2
8924872 Bogomolov et al. Dec 2014 B1
8937619 Sharma et al. Jan 2015 B2
8938686 Erenrich et al. Jan 2015 B1
8972899 Carlsson Mar 2015 B2
8990686 Lin et al. Mar 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
9116975 Shankar et al. Aug 2015 B2
9299173 Rope Mar 2016 B2
20020033848 Sciammarella et al. Mar 2002 A1
20020065708 Senay et al. May 2002 A1
20020091707 Keller Jul 2002 A1
20020095658 Shulman Jul 2002 A1
20020116120 Ruiz et al. Aug 2002 A1
20020174201 Ramer et al. Nov 2002 A1
20020194119 Wright et al. Dec 2002 A1
20030028560 Kudrolli et al. Feb 2003 A1
20030039948 Donahue Feb 2003 A1
20030140106 Raguseo Jul 2003 A1
20030144868 MacIntyre et al. Jul 2003 A1
20030163352 Surpin et al. Aug 2003 A1
20030225755 Iwayama et al. Dec 2003 A1
20030229848 Arend et al. Dec 2003 A1
20040032432 Baynger 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
20040126840 Cheng et al. Jul 2004 A1
20040143602 Ruiz et al. Jul 2004 A1
20040143796 Lerner et al. Jul 2004 A1
20040163039 Gorman Aug 2004 A1
20040193600 Kaasten et al. Sep 2004 A1
20040221223 Yu et al. Nov 2004 A1
20040260702 Cragun et al. Dec 2004 A1
20040267746 Marcjan et al. Dec 2004 A1
20050027705 Sadri et al. Feb 2005 A1
20050028094 Allyn Feb 2005 A1
20050039119 Parks et al. Feb 2005 A1
20050065811 Chu et al. Mar 2005 A1
20050080769 Gemmell Apr 2005 A1
20050086207 Heuer et al. Apr 2005 A1
20050125715 Di Franco et al. Jun 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
20050246327 Yeung et al. Nov 2005 A1
20050251786 Citron et al. Nov 2005 A1
20060026120 Carolan et al. Feb 2006 A1
20060026170 Kreitler et al. Feb 2006 A1
20060059139 Robinson Mar 2006 A1
20060074881 Vembu et al. Apr 2006 A1
20060080619 Carlson et al. Apr 2006 A1
20060129746 Porter Jun 2006 A1
20060139375 Rasmussen et al. Jun 2006 A1
20060142949 Helt Jun 2006 A1
20060149596 Surpin et al. Jul 2006 A1
20060203337 White Sep 2006 A1
20060218637 Thomas et al. Sep 2006 A1
20060241974 Chao et al. Oct 2006 A1
20060242040 Rader et al. Oct 2006 A1
20060242630 Koike et al. Oct 2006 A1
20070011150 Frank Jan 2007 A1
20070016363 Huang et al. Jan 2007 A1
20070038646 Thota Feb 2007 A1
20070038962 Fuchs et al. Feb 2007 A1
20070057966 Ohno et al. Mar 2007 A1
20070078832 Ott et al. Apr 2007 A1
20070083541 Fraleigh et al. Apr 2007 A1
20070094389 Nussey et al. Apr 2007 A1
20070150369 Zivin Jun 2007 A1
20070174760 Chamberlain et al. Jul 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
20070240062 Christena et al. Oct 2007 A1
20070266336 Nojima et al. Nov 2007 A1
20070294643 Kyle Dec 2007 A1
20080005677 Thompson Jan 2008 A1
20080040684 Crump Feb 2008 A1
20080051989 Welsh Feb 2008 A1
20080052142 Bailey et al. Feb 2008 A1
20080077597 Butler Mar 2008 A1
20080077642 Carbone et al. Mar 2008 A1
20080104019 Nath May 2008 A1
20080126951 Sood et al. May 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
20080222295 Robinson et al. Sep 2008 A1
20080255973 El Wade et al. Oct 2008 A1
20080263468 Cappione et al. Oct 2008 A1
20080267107 Rosenberg Oct 2008 A1
20080276167 Michael Nov 2008 A1
20080278311 Grange et al. Nov 2008 A1
20080288306 MacIntyre et al. Nov 2008 A1
20080301643 Appleton et al. Dec 2008 A1
20090002492 Velipasalar et al. Jan 2009 A1
20090018994 Hajdukiewicz Jan 2009 A1
20090027418 Maru et al. Jan 2009 A1
20090030915 Winter et al. Jan 2009 A1
20090055251 Shah et al. Feb 2009 A1
20090088964 Schaaf et al. Apr 2009 A1
20090119309 Gibson et al. 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
20090164934 Bhattiprolu et al. Jun 2009 A1
20090171939 Athsani et al. Jul 2009 A1
20090172511 Decherd 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
20090222400 Kupershmidt et al. Sep 2009 A1
20090222760 Halverson et al. Sep 2009 A1
20090234720 George et al. Sep 2009 A1
20090249244 Robinson et al. Oct 2009 A1
20090281839 Lynn et al. Nov 2009 A1
20090287470 Farnsworth et al. Nov 2009 A1
20090292626 Oxford Nov 2009 A1
20100011282 Dollard et al. Jan 2010 A1
20100017788 Bronkhorst et al. Jan 2010 A1
20100042922 Bradateanu et al. Feb 2010 A1
20100057716 Stefik 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
20100083172 Breeds Apr 2010 A1
20100100963 Mahaffey Apr 2010 A1
20100103124 Kruzeniski et al. Apr 2010 A1
20100107146 Wrighton et al. Apr 2010 A1
20100114887 Conway et al. May 2010 A1
20100122152 Chamberlain et al. May 2010 A1
20100131457 Heimendinger May 2010 A1
20100162176 Dunton Jun 2010 A1
20100191563 Schlaifer et al. Jul 2010 A1
20100198684 Eraker et al. Aug 2010 A1
20100199225 Coleman et al. Aug 2010 A1
20100228812 Uomini Sep 2010 A1
20100250412 Wagner Sep 2010 A1
20100280857 Liu et al. Nov 2010 A1
20100293174 Bennett et al. Nov 2010 A1
20100306713 Geisner et al. Dec 2010 A1
20100313119 Baldwin et al. Dec 2010 A1
20100313157 Carlsson 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
20110029526 Knight et al. Feb 2011 A1
20110047159 Baid et al. Feb 2011 A1
20110060753 Shaked Mar 2011 A1
20110061013 Bilicki et al. Mar 2011 A1
20110074811 Hanson et al. Mar 2011 A1
20110078055 Faribault et al. Mar 2011 A1
20110078173 Seligmann et al. Mar 2011 A1
20110093327 Fordyce, III et al. Apr 2011 A1
20110117878 Barash et al. May 2011 A1
20110119100 Ruhl et al. May 2011 A1
20110137766 Rasmussen et al. Jun 2011 A1
20110153384 Horne et al. Jun 2011 A1
20110154295 Aharoni et al. Jun 2011 A1
20110161096 Buehler et al. Jun 2011 A1
20110167105 Ramakrishnan et al. Jul 2011 A1
20110170799 Carrino et al. Jul 2011 A1
20110173032 Payne et al. Jul 2011 A1
20110185316 Reid et al. Jul 2011 A1
20110208724 Jones et al. Aug 2011 A1
20110213655 Henkin Sep 2011 A1
20110218934 Elser Sep 2011 A1
20110219450 McDougal et al. Sep 2011 A1
20110225198 Edwards et al. Sep 2011 A1
20110238553 Raj et al. Sep 2011 A1
20110258158 Resende et al. Oct 2011 A1
20110258560 Mercuri Oct 2011 A1
20110270705 Parker 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
20110310005 Chen et al. Dec 2011 A1
20110314007 Dassa et al. Dec 2011 A1
20120019559 Siler et al. Jan 2012 A1
20120036013 Neuhaus et al. Feb 2012 A1
20120036434 Oberstein Feb 2012 A1
20120050293 Carlhian et al. Mar 2012 A1
20120066296 Appleton et al. Mar 2012 A1
20120072825 Sherkin et al. Mar 2012 A1
20120079363 Folting et al. Mar 2012 A1
20120084118 Bai et al. Apr 2012 A1
20120106801 Jackson May 2012 A1
20120117082 Koperda et al. May 2012 A1
20120131512 Takeuchi et al. May 2012 A1
20120144335 Abeln et al. Jun 2012 A1
20120159307 Chung et al. Jun 2012 A1
20120159362 Brown et al. Jun 2012 A1
20120159399 Bastide et al. Jun 2012 A1
20120170847 Tsukidate Jul 2012 A1
20120173985 Peppel Jul 2012 A1
20120196557 Reich et al. Aug 2012 A1
20120196558 Reich et al. Aug 2012 A1
20120203708 Psota et al. Aug 2012 A1
20120208636 Feige Aug 2012 A1
20120221511 Gibson et al. Aug 2012 A1
20120221553 Wittmer et al. Aug 2012 A1
20120221580 Barney Aug 2012 A1
20120245976 Kumar et al. Sep 2012 A1
20120246148 Dror Sep 2012 A1
20120254129 Wheeler et al. Oct 2012 A1
20120284345 Costenaro et al. Nov 2012 A1
20120290879 Shibuya et al. Nov 2012 A1
20120296907 Long et al. Nov 2012 A1
20120311684 Paulsen et al. Dec 2012 A1
20120313947 Rope Dec 2012 A1
20120323888 Osann, Jr. Dec 2012 A1
20120330973 Ghuneim et al. Dec 2012 A1
20130006426 Healey et al. Jan 2013 A1
20130006725 Simanek et al. Jan 2013 A1
20130006916 McBride et al. Jan 2013 A1
20130018796 Kolhatkar et al. Jan 2013 A1
20130046635 Grigg et al. Feb 2013 A1
20130046842 Muntz et al. Feb 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
20130097482 Marantz et al. Apr 2013 A1
20130103677 Chakra Apr 2013 A1
20130110822 Ikeda et al. May 2013 A1
20130110877 Bonham et al. May 2013 A1
20130111319 Lin et al. May 2013 A1
20130111320 Campbell et al. May 2013 A1
20130117651 Waldman et al. May 2013 A1
20130101159 Chao et al. Jun 2013 A1
20130150004 Rosen Jun 2013 A1
20130151148 Parundekar et al. Jun 2013 A1
20130151388 Falkenborg et al. Jun 2013 A1
20130157234 Gulli 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
20130224696 Wolfe et al. Aug 2013 A1
20130226953 Markovich et al. Aug 2013 A1
20130238616 Rose et al. Sep 2013 A1
20130246170 Gross 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
20130275904 Bhaskaran 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 Chandarsekaran et al. Nov 2013 A1
20130311375 Priebatsch Nov 2013 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
20140047357 Alfaro 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
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
20140129261 Bothwell et al. May 2014 A1
20140149436 Bahrami et al. May 2014 A1
20140156527 Grigg et al. Jun 2014 A1
20140157172 Peery et al. Jun 2014 A1
20140164502 Khodorenko et al. Jun 2014 A1
20140164964 Cannon et al. Jun 2014 A1
20140189536 Lange et al. Jul 2014 A1
20140195515 Baker et al. Jul 2014 A1
20140195887 Ellis et al. Jul 2014 A1
20140214579 Shen et al. Jul 2014 A1
20140267294 Ma Sep 2014 A1
20140267295 Sharma Sep 2014 A1
20140279824 Tamayo Sep 2014 A1
20140281730 Chazan et al. Sep 2014 A1
20140316911 Gross Oct 2014 A1
20140333651 Cervelli et al. Nov 2014 A1
20140337772 Cervelli et al. Nov 2014 A1
20140344230 Krause et al. Nov 2014 A1
20150019394 Unser et al. Jan 2015 A1
20150026622 Roaldson et al. Jan 2015 A1
20150046870 Goldenberg et al. Feb 2015 A1
20150089424 Duffield et al. Mar 2015 A1
20150100897 Sun et al. Apr 2015 A1
20150100907 Erenrich et al. Apr 2015 A1
20150112969 Prabhu Apr 2015 A1
20150134666 Gattiker 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
20150178877 Bogomolov et al. Jun 2015 A1
20150186821 Wang et al. Jul 2015 A1
20150187036 Wang et al. Jul 2015 A1
20150227295 Meiklejohn et al. Aug 2015 A1
20160092084 Dyar Mar 2016 A1
20160092090 Stojanovic Mar 2016 A1
Foreign Referenced Citations (35)
Number Date Country
102014103482 Sep 2014 DE
102014215621 Feb 2015 DE
1672527 Jun 2006 EP
2551799 Jan 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
2881868 Jun 2015 EP
2884439 Jun 2015 EP
2884440 Jun 2015 EP
2891992 Jul 2015 EP
2911100 Aug 2015 EP
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 2008064207 May 2008 WO
WO 2009061501 May 2009 WO
WO 2010000014 Jan 2010 WO
WO 2010030913 Mar 2010 WO
WO 2013010157 Jan 2013 WO
WO 2013102892 Jul 2013 WO
Non-Patent Literature Citations (194)
Entry
Aigner et al. “Visual methods for analyzing time-oriented data.” IEEE transactions on visualization and computer graphics 14.1 (2008): 47-60. Retrieved on [Jun. 8, 2018]. Retrieved from the Internet: URL<https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4359494>.
Bavoil et al. “Vistrails: Enabling interactive multiple-view visualizations.” Visualization, 2005. VIS 05. IEEE. IEEE, 2005. Retrieved on [Jun. 8, 2018] Retrieved from the Internet: URL<https://ieeexplore.ieee.org/document/1532788/#full-text-section>.
Notice of Allowance for U.S. Appl. No. 14/148,568 dated Aug. 26, 2015.
Official Communication for U.S. Appl. No. 14/845,001 dated Jun. 2, 2017.
Official Communication for U.S. Appl. No. 14/845,001 dated Nov. 23, 2016.
Official Communication for U.S. Appl. No. 14/845,001 dated Jun. 30, 2016.
“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/.
“Potential Money Laundering Warning Signs,” snapshot taken 2003, http://web.archive.org/web/20030816090055/http://finsolinc.com/ANTI-MONEY%20LAUNDERING%20TRAINING%20GUIDES.pdf.
“Refresh CSS Ellipsis When Resizing Container—Stack Overflow,” Jul. 31, 2013, retrieved from internet http://stackoverflow.com/questions/17964681/refresh-css-ellipsis-when-resizing-container, retrieved on May 18, 2015.
“The FASTA Program Package,” fasta-36.3.4, Mar. 25, 2011, pp. 29.
Acklen, Laura, “Absolute Beginner's Guide to Microsoft Word 2003,” Dec. 24, 2003, pp. 15-18, 34-41, 308-316.
AMNET, “5 Great Tools for Visualizing Your Twitter Followers,” posted Aug. 4, 2010, http://www.amnetblog.com/component/content/article/115-5-grate-tools-for-visualizing-your-twitter-followers.html.
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.
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.
Celik, Tantek, “CSS Basic User Interface Module Level 3 (CSS3 UI),” Section 8 Resizing and Overflow, Jan. 17, 2012, retrieved from internet http://www.w3.org/TR/2012/WD-css3-ui-20120117/#resizing-amp-overflow retrieved on May 18, 2015.
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.
Conner, Nancy, “Google Apps: The Missing Manual,” May 1, 2008, pp. 15.
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.
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.
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.
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.
Hansen et al., “Analyzing Social Media Networks with NodeXL: Insights from a Connected World”, Chapter 4, pp. 53-67 and Chapter 10, pp. 143-164, published Sep. 2010.
Hardesty, “Privacy Challenges: Analysis: It's Surprisingly Easy to Identify Individuals from Credit-Card Metadata,” MIT News on Campus and Around the World, MIT News Office, Jan. 29, 2015, 3 pages.
Hibbert et al., “Prediction of Shopping Behavior Using a Huff Model Within a GIS Framework,” Healthy Eating in Context, Mar. 18, 2011, pp. 16.
Hogue et al., “Thresher: Automating the Unwrapping of Semantic Content from the World Wide Web,” 14th International Conference on World Wide Web, WWW 2005: Chiba, Japan, May 10-14, 2005, pp. 86-95.
Huff et al., “Calibrating the Huff Model Using ArcGIS Business Analyst,” ESRI, Sep. 2008, pp. 33.
Huff, David L., “Parameter Estimation in the Huff Model,” ESRI, ArcUser, Oct.-Dec. 2003, pp. 34-36.
Kahan et al., “Annotea: an Open RDF Infrastructure for Shared Web Annotations”, Computer Networks, Elsevier Science Publishers B.V., vol. 39, No. 5, dated Aug. 5, 2002, pp. 589-608.
Keylines.com, “An Introduction to KeyLines and Network Visualization,” Mar. 2014, <http://keylines.com/wp-content/uploads/2014/03/KeyLines-White-Paper.pdf> downloaded May 12, 2014 in 8 pages.
Keylines.com, “KeyLines Datasheet,” Mar. 2014, <http://keylines.com/wp-content/uploads/2014/03/KeyLines-datasheet.pdf> downloaded May 12, 2014 in 2 pages.
Keylines.com, “Visualizing Threats: Improved Cyber Security Through Network Visualization,” Apr. 2014, <http://keylines.com/wp-content/uploads/2014/04/Visualizing-Threats1.pdf> downloaded May 12, 2014 in 10 pages.
Kitts, Paul, “Chapter 14: Genome Assembly and Annotation Process,” The NCBI Handbook, Oct. 2002, pp. 1-21.
Li et al., “Interactive Multimodal Visual Search on Mobile Device,” IEEE Transactions on Multimedia, vol. 15, No. 3, Apr. 1, 2013, pp. 594-607.
Liu, Tianshun, “Combining GIS and the Huff Model to Analyze Suitable Locations for a New Asian Supermarket in the Minneapolis and St. Paul, Minnesota USA,” Papers in Resource Analysis, 2012, vol. 14, pp. 8.
Madden, Tom, “Chapter 16: The BLAST Sequence Analysis Tool,” The NCBI Handbook, Oct. 2002, pp. 1-15.
Manno et al., “Introducing Collaboration in Single-user Applications through the Centralized Control Architecture,” 2010, pp. 10.
Manske, “File Saving Dialogs,” <http://www.mozilla.org/editor/ui_specs/FileSaveDialogs.html>, Jan. 20, 1999, pp. 7.
Map of San Jose, CA. Retrieved Oct. 2, 2013 from http://maps.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.
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.
Mizrachi, Ilene, “Chapter 1: GenBank: The Nuckeotide Sequence Database,” The NCBI Handbook, Oct. 2002, pp. 1-14.
Nierman, “Evaluating Structural Similarity in XML Documents”, 6 pages, 2002.
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/.
Palmas et al., “An Edge-Bunding Layout for Interactive Parallel Coordinates” 2014 IEEE Pacific Visualization Symposium, pp. 57-64.
Rouse, Margaret, “OLAP Cube,” <http://searchdatamanagement.techtarget.com/definition/OLAP-cube>, Apr. 28, 2012, pp. 16.
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.
Thompson, Mick, “Getting Started with GEO,” Getting Started with GEO, Jul. 26, 2011.
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.
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.
Yang et al., “HTML Page Analysis Based on Visual Cues”, A129, pp. 859-864, 2001.
IBM Cognos software—Business Intelligence, https://www.ibm.com/analytics/us/en/technology/cognos-software/, as printed Feb. 15, 2017 in 7 pages.
IBM Cognos Analytics, https://www-03.ibm.com/software/products/en/cognos-analytics, as printed Feb. 15, 2017 in 2 pages.
WebsterAnalytics, “Presenting IBM Cognos Analytics,” available at https://www.youtube.com/watch?v=_cLwCyDzfY, as published on Nov. 29, 2015.
IBM Cognos Analytics, “Quick Dashboard Creation with Cognos Analytics,” available at https://www.youtube.com/watch?v=8OVXkKDol.8Y, as published on Oct. 26, 2015.
Senturus, “Getting Started with IBM Cognos BI,” available at https://www.youtube.com/watch?v=SCEXlckRaAl, as published on Mar. 20, 2015.
IBM Cognos Analytics, “Cognos Dynamic Cubes,” available at https://www.youtube.com/watch?v=T1HrJjWBrfE, as published on Dec. 3, 2014.
IBM Knowledge Center, “Maps,” https://www.ibm.com/support/knowledgecenter/SSRL5J_1.0.1/com.ibm.swg.ba.cognos.ug_cr_rptstd.10.1.1.doc/c_cr_rptstd_reptyp_maps.html, as printed Feb. 16, 2017 in 1 page.
IBM Knowledge Center, “IBM Cognos Analytics new features 11.0,” http://www.ibm.com/support/knowledgecenter/en/SSEP7J_11.0.0/com.ibm.swg.ba.coggnos.ca_new.doc/c_ca_nf_11_0_x.html, as printed Mar. 6, 2017 in 8 pages.
IBM Knowledge Center, “IBM Cognos Analytics | Visualizations,” https://www.ibm.com/support/knowledgecenter/en/SSSEP7J_11.0.0/com.ibm.swg.ba.cognos.ug_ca_dshb.doc/wa_an_visualizations_intro.html, as printed Mar. 6, 2017 in 2 pages.
IBM Knowledge Center, “Creating a data module,” https://www.ibm.com/support/knowledgecenter/SSEP7J_11.1./com.ibm.swg.ba.cognos.ca_mdig.doc/c_data_modules.html, as printed Mar. 6, 2017 in 1 page.
IBM Support, “Software lifecycle—Cognos Analytics 11.0.x,” https://www-01.ibm.com/software/support/lifecycleapp/PLCDetail.wss?g45=K177789J28225R03, as printed Mar. 7, 2017 in 1 page.
IBM Predictive Analytics, https://www.ibm.com/analytics/us/en/technology/predictive-analytics/, as printed Feb. 15, 2017 in 12 pages.
IBM SPSS Modeler, https://www.ibm.com/us-en/marketplace/spss-modeler, as printed Feb. 15, 2017 in 5 pages.
IBM Analytics, “IBM SPSS software and Watson Analytics: A powerful combo for the cognitive age,” available at https://www.youtube.com/watch?v-AvYctzFf8gc, as published on Apr. 14, 2016.
Armand Ruiz, “Watson Analytics, SPSS Modeler and ESRI ArcGIS,” available at https://www.youtube.com/watch?v=fk49hw4OrN4, as published on Jul. 28, 2015.
IBM Knowledge Center, “Merge Node,” https://www.ibm.com/support/knowledgecenter/en/SS3RA7_15.0.0/com.ibm.spss.modeler.help/merge_overview.htm[ib.com], as printed Feb. 14, 2017 in 1 page.
IBM Knowledge Center, “New features in IBM SPSS Modeler Professional,” https://www.ibm.com/support/knowledgecenter/en/SS3RA7_15.0.0/com.ibm.spss.modeler.help/whatsnew_features_pro.htm[ibm.com], as printed Feb. 14, 2017 in 2 pages.
IBM Knowledge Center, “Overview—What's new in IBM Watson Explorer Content Analytics Version 10.0,” https://www.ibm.com/support/knowledgecenter.en/SS8NLW_10.0.0/com.ibm.discovery.es.nav.doc/iiysawhatsnew.htm, as printed Mar. 6, 2017 in 4 pages.
Yates, Rob, “Introducing the IBM Watson Natural Language Classifier,” IBM developerWorks/Developer Centers, posted Jul. 10, 2015 in 4 pages, https://developer.ibm.com/watson/blog/2015/07/10/the-ibm-watson-natural-language-classfier/.
Goyal, Manish, “Announcing our largest release of Watson Developer Cloud services,” IBM developerWorks/Developer Centers, posted Sep. 24, 2015 in 6 pages, https://developer.ibm.com/watson/bog/2015/09/24/announcing-our-largest-release-of-watson-developer-cloud-services/.
IBM Analytics Communities, “Is IBM SPSS statistics now integrated to WatsonAnalytics?” https://community.watsonanalytics.com/discussions/questions/1464/is-ibm-spss-statistics-now-intergrated-to-watsonana.html, as printed Mar. 7, 2017 in 2 pages.
IBM Support, “Software lifecycle—Watson Explorer 10.0.0,” https://www-01.ibm.com/software/support/lifecycleapp/PLCDetail.wss?g45=T283072T66911H98, as printed Mar. 7, 2017 in 1 page.
IBM Analytics Communities, “Creating a map visualization for UK coordinates,” https://community.watsonanalytics.com/discussions/questions/3753/creating-a-map-visualisation-for-uk-coordinates.html, as printed Mar. 9, 2017 in 1 page.
Esri News, “IBM and Esri Team Up to Offer Cognitive Analyrics and IoT in the IBM Cloud,” http://www.esri.com/esri-news/releases/16-4gtr/ibm-and-esri-team-up-to-offer-cognitive-analytics-and-iot-in-the-ibm-cloud, as published on Oct. 26, 2016, in 2 pages.
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/192,767 dated Dec. 16, 2014.
Notice of Allowance for U.S. Appl. No. 14/225,084 dated May 4, 2015.
Notice of Allowance for U.S. Appl. No. 14/268,964 dated Dec. 3, 2014.
Notice of Allowance for U.S. Appl. No. 14/294,098 dated Dec. 29, 2014.
Notice of Allowance for U.S. Appl. No. 14/473,552 dated Jul. 24, 2015.
Notice of Allowance for U.S. Appl. No. 14/473,860 dated Jan. 5, 2015.
Notice of Allowance for U.S. Appl. No. 14/504,103 dated May 18, 2015.
Notice of Allowance for U.S. Appl. No. 14/616,080 dated Apr. 2, 2015.
Official Communication for Australian Patent Application No. 2014201511 dated Feb. 27, 2015.
Official Communication for Australian Patent Application No. 2014202442 dated Mar. 19, 2015.
Official Communication for Australian Patent Application No. 2014210604 dated Jun. 5, 2015.
Official Communication for Australian Patent Application No. 2014210614 dated Jun. 5, 2015.
Official Communication for Australian Patent Application No. 2014213553 dated May 7, 2015.
Official Communication for Australian Patent Application No. 2014250678 dated Jun. 17, 2015.
Official Communication for European Patent Application No. 14158861.6 dated Jun. 16, 2014.
Official Communication for European Patent Application No. 14159464.8 dated Jul. 31, 2014.
Official Communication for European Patent Application No. 14180142.3 dated Feb. 6, 2015.
Official Communication for European Patent Application No. 14180281.9 dated Jan. 26, 2015.
Official Communication for European Patent Application No. 14180321.3 dated Apr. 17, 2015.
Official Communication for European Patent Application No. 14180432.8 dated Jun. 23, 2015.
Official Communication for European Patent Application No. 14186225.0 dated Feb. 13, 2015.
Official Communication for European Patent Application No. 14187739.9 dated Jul. 6, 2015.
Official Communication for European Patent Application No. 14187996.5 dated Feb. 12, 2015.
Official Communication for European Patent Application No. 14189344.6 dated Feb. 20, 2015.
Official Communication for European Patent Application No. 14189347.9 dated Mar. 4, 2015.
Official Communication for European Patent Application No. 14189802.3 dated May 11, 2015.
Official Communication for European Patent Application No. 14191540.5 dated May 27, 2015.
Official Communication for European Patent Application No. 14197879.1 dated Apr. 28, 2015.
Official Communication for European Patent Application No. 14197895.7 dated Apr. 28, 2015.
Official Communication for European Patent Application No. 14199182.8 dated Mar. 13, 2015.
Official Communication for Great Britain Patent Application No. 1404457.2 dated Aug. 14, 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. 2013306 dated Apr. 24, 2015.
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. 26, 2014.
Official Communication for U.S. Appl. No. 12/556,318 dated Jul. 2, 2015.
Official Communication for U.S. Appl. No. 13/247,987 dated Apr. 2, 2015.
Official Communication for U.S. Appl. No. 13/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/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 Feb. 27, 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,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/268,964 dated Sep. 3, 2014.
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/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 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 May 26, 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 Aug. 7, 2015.
Official Communication for U.S. Appl. No. 14/306,147 dated Sep. 9, 2014.
Official Communication for U.S. Appl. No. 14/306,154 dated Mar. 11, 2015.
Official Communication for U.S. Appl. No. 14/306,154 dated May 15, 2015.
Official Communication for U.S. Appl. No. 14/306,154 dated Jul. 6, 2015.
Official Communication for U.S. Appl. No. 14/306,154 dated Sep. 9, 2014.
Official Communication for U.S. Appl. No. 14/319,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/473,552 dated Feb. 24, 2015.
Official Communication for U.S. Appl. No. 14/486,991 dated Mar. 10, 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/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/631,633 dated Sep. 10, 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.
Notice of Allowance for U.S. Appl. No. 14/486,991 dated May 1, 2015.
Notice of Allowance for U.S. Appl. No. 14/845,001 dated Sep. 27, 2017.
Perez et al., “IPython: A System for Interactive Scientific Computing,” Computing in Science & Engineering 9.3 (2007), retrieved from https://pdfs.semanticscholar.org/409d/3f740518eafcfaadb054d9239009f3f34600.pdf on Sep. 13, 2017.
Sanner, Michel F. “Python: A Programming Language for Software Integration and Development,” J Mol Graph Model 17.1 (1999): 57-61, retrieved from https://pdfs.semanticscholar.org/409d/3f740518eafcfaadb054d9239009f3f34600.pdf on Sep. 13, 2017.
Provisional Applications (1)
Number Date Country
62097388 Dec 2014 US
Continuations (1)
Number Date Country
Parent 14845001 Sep 2015 US
Child 15392168 US