Relationship visualizations

Information

  • Patent Grant
  • 10402054
  • Patent Number
    10,402,054
  • Date Filed
    Monday, October 31, 2016
    9 years ago
  • Date Issued
    Tuesday, September 3, 2019
    7 years ago
Abstract
Systems and techniques for accelerating relationship visualizations from data objects are described herein. The configuration and/or display of a relationship matrix may be automatically determined from the data objects. The relationship matrix may display relationships through gradient, hue, color, and/or saturation. The relationship matrix may be navigable and/or interactive to accelerate relationship visualizations.
Description
BACKGROUND

In the area of computer-based platforms, relationship visualizations may be accelerated and/or generated.


SUMMARY

The systems, methods, and devices described herein each have several aspects, no single one of which is solely responsible for its desirable attributes. Without limiting the scope of this disclosure, several non-limiting features will now be discussed briefly.


In some embodiments, a computer system for providing relationship visualizations comprises an object storage device. The object storage device may store information regarding a plurality of objects and properties of respective objects. The computer system may further comprise one or more hardware processors programmed via executable code instructions. When executed, the executable code instructions may cause the computer system to receive, from a user of the computer system, a selection of a plurality of objects. When further executed, the executable code instructions may cause the computer system to determine, based on input from the user or default settings, an action associated with the plurality of objects to include in a visualization. When further executed, the executable code instructions may cause the computer system to identify, in the object storage device, a plurality of the determined actions associated with respective objects. When further executed, the executable code instructions may cause the computer system to determine a first time unit associated with each of a plurality of sections of a first axis. When further executed, the executable code instructions may cause the computer system to determine a second time unit associated with each of a plurality of sections of a second axis. The first time unit may comprise a plurality of the second time units and each section of the first axis may intersect with a plurality of sections of the second axis. When further executed, the executable code instructions may cause the computer system to assign respective first time periods to each of the sections of the first axis based on the determined first time unit and respective second time periods to each of the section of the second axis based on the determined second time unit. For each identified action associated with respective objects, further executed code instructions may cause the computer system to determine, based on one or more properties of the respective object stored in the object storage device, an action time associated with the identified action. For each identified action associated with respective objects, further executed code instructions may cause the computer system to determine a first time period that includes the action time. For each identified action associated with respective objects, further executed code instructions may cause the computer system to determine a second time period that includes the action time. For each identified action associated with respective objects, further executed code instructions may cause the computer system to increment a count of actions associated with the determined first time period and the determined second time period. When further executed, the executable code instructions may cause the computer system to generate user interface data. The generated user interface data may be configured to display the visualization including indicators of the first time periods on respective sections of the first axis. The generated user interface data may be further configured to display the visualization including indicators of the second time periods on respective sections of the second axis. The generated user interface data may be further configured to display the visualization including count indicators at intersections of first time periods and second time periods. The count indicators may correspond to respective counts of actions associated with the respective first time period and second time period.


In some embodiments, a method for providing relationship visualizations may comprise receiving, from a user of a computer system comprising a hardware computer processor, a selection of a plurality of objects. The method may further comprise determining, based on input from the user or default settings, an action associated with the plurality of objects to include in a visualization. The method may further comprise identifying, by the computer system, a plurality of the determined actions associated with respective objects. The method may further comprise determining, by the computer system, a first time unit associated with each of a plurality of sections of a first axis. The method may further comprise determining, by the computer system, a second time unit associated with each of a plurality of sections of a second axis, wherein the first time unit comprises a plurality of the second time units and each section of the first axis intersects with a plurality of sections of the second axis. The method may further comprise assigning, by the computer system, respective first time periods to each of the sections of the first axis based on the determined first time unit and respective second time periods to each of the section of the second axis based on the determined second time unit. The method may further comprise, for each identified action associated with respective objects, determining, by the computer system, based on one or more properties of the respective object, an action time associated with the identified action. The method may further comprise, for each identified action associated with respective objects, determining, by the computer system, a first time period that includes the action time. The method may further comprise, for each identified action associated with respective objects, determining, by the computer system, a second time period that includes the action time. The method may further comprise, for each identified action associated with respective objects, incrementing, by the computer system, a count of actions associated with the determined first time period and the determined second time period. The method may further comprise, generating, by the computer system, user interface data. The generated user interface data may be configured to display the visualization including indicators of the first time periods on respective sections of the first axis. The generated user interface data may be further configured to display the visualization including indicators of the second time periods on respective sections of the second axis. The generated user interface data may be further configured to display the visualization including count indicators at intersections of first time periods and second time periods. The count indicators may correspond to respective counts of actions associated with the respective first time period and second time period.


In some embodiments, a non-transitory computer storage comprises instructions for causing a computer system to provide relationship visualizations. When executed, the code instructions may cause the computer system to receive, from a user of the computer system, a selection of a plurality of objects. When further executed, the code instructions may cause the computer system to determine, based on input from the user or default settings, an action associated with the plurality of objects to include in a visualization. When further executed, the code instructions may cause the computer system to identify a plurality of the determined actions associated with respective objects. When further executed, the code instructions may cause the computer system to determine a first time unit associated with each of a plurality of sections of a first axis. When further executed, the code instructions may cause the computer system to determine a second time unit associated with each of a plurality of sections of a second axis. The first time unit may comprise a plurality of the second time units and each section of the first axis may intersect with a plurality of sections of the second axis. When further executed, the code instructions may cause the computer system to assign respective first time periods to each of the sections of the first axis based on the determined first time unit and respective second time periods to each of the section of the second axis based on the determined second time unit. For each identified action associated with respective objects, further executed code instructions may cause the computer system to determine, based on one or more properties of the respective object, an action time associated with the identified action. For each identified action associated with respective objects, further executed code instructions may cause the computer system to determine a first time period that includes the action time. For each identified action associated with respective objects, further executed code instructions may cause the computer system to determine a second time period that includes the action time. For each identified action associated with respective objects, further executed code instructions may cause the computer system to increment a count of actions associated with the determined first time period and the determined second time period. When further executed, the code instructions may cause the computer system to generate user interface data. The generated user interface data may be configured to display the visualization including indicators of the first time periods on respective sections of the first axis. The generated user interface data may be further configured to display the visualization including indicators of the second time periods on respective sections of the second axis. The generated user interface data may be further configured to display the visualization including count indicators at intersections of first time periods and second time periods. The count indicators may correspond to respective counts of actions associated with the respective first time period and second time period.





BRIEF DESCRIPTION OF THE DRAWINGS

Certain aspects of the disclosure will become more readily appreciated as those aspects become better understood by reference to the following detailed description, when taken in conjunction with the accompanying drawings.



FIG. 1 is a block diagram illustrating an example relationship matrix system, according to some embodiments of the present disclosure.



FIG. 2 is a flowchart illustrating a relationship matrix generation process, according to some embodiments of the present disclosure.



FIG. 3A illustrates an example relationship matrix, according to some embodiments of the present disclosure.



FIG. 3B illustrates an example relationship matrix configured to update the units for the axes, according to some embodiments of the present disclosure.



FIG. 3C illustrates an example relationship matrix configured to update time periods, according to some embodiments of the present disclosure.



FIG. 3D illustrates an example relationship matrix configured to update its alignment, according to some embodiments of the present disclosure.



FIG. 3E illustrates an example relationship matrix following alignment user interaction, according to some embodiments of the present disclosure.



FIG. 3F illustrates an example relationship matrix configured to update the units of an axis, according to some embodiments of the present disclosure.



FIG. 3G illustrates an example relationship matrix configured to update the units of both axes, according to some embodiments of the present disclosure.



FIG. 4 illustrates an example relationship matrix configured to display an outliers view, according to some embodiments of the present disclosure.



FIG. 5A, illustrates an example user interface of the relationship matrix system for loading and/or viewing data objects, according to some embodiments of the present disclosure.



FIG. 5B illustrates an example user interface of the relationship matrix system for selecting data objects to generate a matrix, according to some embodiments of the present disclosure.



FIG. 6 is a block diagram illustrating an example relationship matrix system with which various methods and systems discussed herein may be implemented.





DETAILED DESCRIPTION

Relationship visualizations may be accelerated and/or generated. For example, a heat map is one type of relationship visualization that may be generated to display relationships through color, saturation, gradient, and/or hue.


Disclosed herein are systems, methods, techniques, and devices for accelerating relationship visualizations related to one or more data objects and/or properties of those data objects. Using the techniques and systems described herein, efficient, flexible, scalable, navigable, and accelerated relationship visualizations may be achieved. In one particular example implementation of the systems and methods discussed herein, data objects and/or the relationships of data objects may be displayed through a matrix visualization where some relationships are displayed through gradient, color, hue, and/or saturation. In some embodiments, the relationship matrix may comprise a time matrix. A subset of the data objects and/or a time period for display may be determined automatically by the relationship matrix system. Furthermore, the relationship matrix system may receive user interaction data to allow navigable, efficient, and/or accelerated relationship matrices.


Example Relationship Matrix Acceleration


FIG. 1 illustrates a relationship matrix system, according to some embodiments of the present disclosure. In the example embodiment of FIG. 1, the matrix environment 190 comprises a network 160, a relationship matrix system 100, a user computing device 102, and an object storage device 130. Various communications between these devices are illustrated. For example, communication of a data selection 110, user interaction 120, object data 140, and a relationship matrix 300 are illustrated in various actions 1-5 that are illustrated in the circled numbers in FIG. 1. In this embodiment, the relationship matrix system 100 includes an interaction processor 104 and a relationship matrix generator 108, each of which is described in further detail below.


In some embodiments, the matrix environment 190 may not comprise a network. For example, the user computing device 102, the relationship matrix system 100, and/or the object storage device 130 may reside on the same computing device.


As shown in FIG. 1, at action one, a data selection 110 is transmitted from the user computing device 102 to the interaction processor 104 of the relationship matrix system 100. The data selection may occur through a user interface. FIG. 5A, for example, illustrates an example user interface 500 of a software application configured to display data objects and to allow the user to select one or more of the data objects. The example user interface 500 comprises a search box 502, an object display area 504, and a menu bar 506. A human operator, e.g., the user of the user computing device 102 of FIG. 1, by typing and/or entering data into the search box 502 may load, lookup, and/or retrieve one or more data objects. For example, by typing the name of a person, such as “John Doe,” the person object 510 may be displayed in the object display area 504. The other person objects 512 (including objects 512A, 512B, and/or 512C) may be displayed automatically and/or after user interaction by the human operator with the person object 510. For example, a human operator may select the person object 510 and select an option to display associates and/or persons related to the person object 510. The links 514A, 514B, and/or 514C may display relationships between the person object 510 and related person objects 512A, 512B, and/or 512C, respectively. For example, the person objects 412 may be related to the person object 410, such as, but not limited to, associates, acquaintances, and/or family members. The links 514A, 514B, and/or 514C may comprise one or more meetings between the person object 510 and related person objects 512A, 512B, and/or 512C, respectively. For example, link 514B may display that there were 10 meetings between person object 510 and related person object 512B. The links 514A, 514B, and/or 514C may represent meeting data objects. The user interface 500 may be capable of displaying any type of data object and/or may not be limited to displaying person and meeting data objects.


In some embodiments, the data objects in the object display area 504 may be selectable through mouse clicks, touch input, and/or any other input mechanism.


In some embodiments, the user interface 500 may display objects and/or other data in clusters, which may correspond to the systems, methods, and/or techniques disclosed in the Ontology and/or Cluster references.


In addition to visually searching and/or showing data objects and/or relationships between data objects, the user interface 500 may allow various other manipulations. For example, data objects may be inspected (e.g., by viewing properties and/or associated data of the data objects), filtered (e.g., narrowing the universe of objects into sets and subsets by properties or relationships), and statistically aggregated (e.g., numerically summarized based on summarization criteria), among other operations and visualizations.


When a human operator has loaded the data objects, the user may then generate a relationship matrix from some or all of those data objects and/or from related data objects. For example, FIG. 5B illustrates the user interface 500 of FIG. 5A comprising a matrix menu option to generate a matrix based on the loaded data objects (such as the one or more of the data objects displayed in this embodiment). In this example, the human operator has the option of selecting the “All Objects” menu item 524A or the “Selected Objects” menu item 524B by accessing the “View” menu 520, selecting the “Matrix” menu item 522, and then choosing a matrix menu item 524. For example, a matrix may be generated from all of the data objects presented by the user interface when the “All Objects” menu item 524A is selected. In some embodiments, the user interface 500 may allow the human operator to select individual and/or one or more groups of data objects, whether or not those objects remain viewable in the display area 404. Thus, upon selecting the “Selected Objects” menu item 524B a matrix may be generated from the selected data objects and/or related data objects. The example user interface 500 allows the human operator to send a data selection 110 to the interaction processor 104 and/or the relationship matrix system 100 of FIG. 1 through selecting and/or loading of data objects and/or selection of menu items 524.


Returning to FIG. 1, the interaction processor 104 may receive the data selection 110 from the user computing device 102 through the network 160. The interaction processor 104 may then process the data selection 110. For example, the interaction processor 104 may identify and/or interpret the data objects selected from FIG. 5B. At action two, the interaction processor 104 may then send data, including the interpreted, modified, and/or unmodified data selection 110, to the relationship matrix generator 108. At action three, the relationship matrix generator 108 may request, receive, and/or load information and/or data regarding the data objects, such as, but not limited to, object data 140, identified in the data selection 110 and/or related to the data selection 110 from the object storage device 130.


In some embodiments, the relationship matrix system may determine one or more additional data objects based on the one or more selected objects. For example, meeting objects and/or event objects for a selected person object may be determined programmatically, such as by using techniques discussed in the Cluster references. For example, the selected person data object, which may correspond to the data selection 1110 of FIG. 1, may be a starting point to determine one or more additional related data objects. The additional related data objects may then be processed by the relationship matrix system.


The relationship matrix generator 108 may generate the relationship matrix 300 from the requested and/or received object data 140, which is discussed further with reference to FIG. 2. At action four, the relationship matrix 300 may be sent to the user computing device 102 through the network 160. For example, FIG. 3A illustrates an example relationship matrix 300. The relationship matrix 300 of FIG. 3A may have been generated from the selected data objects of FIG. 5B and/or related data objects. The relationship matrix 300 may comprise a time matrix. The relationship blocks 312 (including blocks 312A, 312B, 312C, and/or 312D) may represent relationships between the Y and/or vertical axis 302 and the X and/or horizontal axis 304. For example, the block 312A may represent a relationship between “7 AM” on the X axis and “Thur” on the Y axis. In the example, the intersection at blocks 312 between the X and Y axes may correspond to the meeting objects that were shown in FIG. 5B. The gradient, color, hue, and/or saturation at blocks 312 may further represent and/or indicate relationships between the X and/or Y axes and/or display summary information regarding the objects being represented. For example, block 312A may be a darker and/or more concentrated color, hue, and/or saturation than block 312B. In the example, a darker and/or more concentrated color, hue, and/or saturation may represent a greater number of objects and/or instances at a particular intersection. Therefore, there may be more meetings and/or events at Thursday at 7 AM than Wednesday at 6 AM as indicated by block 312A in comparison to block 312B because block 312A may be a darker and/or more concentrated color, hue, and/or saturation than block 312B.


The relationship matrix 300 may display other relationship information and/or data and/or accelerate visualizations of relationships. The relationship matrix 300 may display a portion and/or subselection of the selected data objects from FIG. 5B. For example, the macro unit indicator 306 may indicate a time unit that is currently being displayed. In the example, the macro unit indicator 306 may display “WEEK 2,” which may indicate to the human operator that only objects from the second week of the year are being shown. The portion and/or subselection of the selected data objects from FIG. 5B may be determined by default settings and/or the relationship matrix generator 108 of FIG. 1. For example, the relationship matrix generator 108 may analyze the selected meeting objects from FIG. 5B to determine a time period to show the highest concentration of meeting objects. The meeting objects may comprise an action time and/or event time property. The action time and/or event time property may correspond to the time at which a meeting occurred. For example, if ninety out of the one hundred meetings occurred during the second week of year, then the relationship matrix generator 108 of FIG. 1 may determine that the second week of the year should be displayed initially as shown in FIG. 3A. In the example relationship matrix of FIG. 3A, the relationship matrix generator 108 of FIG. 1 may have determined that the second week of the year had the highest concentration of objects, and, therefore, displayed the second week of the year. In some embodiments, the initial time period shown may be determined by default settings.


The relationship matrix may automatically and/or based on default settings determine configurations and/or accelerate visualizations of relationships. The relationship matrix may indicate that the human operator is “BROWSING ‘Day of Week’ OF 2013 BY ‘Hour of day.’” The “Day of Week” text may comprise a Y axis selector 308, which may allow the human operator to select different units for the Y axis. Similarly, the “Hour of Day” text may comprise an X axis selector 310, which may allow human operator to select different units for the X axis. For example, the available time units for the axes may comprise the options, such as, but not limited to: “Hour of Day,” “Day of Week,” “Day of Month,” “Week of Month,” “Month of Year.” Similar to the displayed time period, the time units of the axes that are initially displayed may be based on default settings and/or may be determined by the relationship matrix generator 108 of FIG. 1. The relationship matrix generator 108 may analyze the selected and/or determined meeting objects from FIG. 5B to determine an X time unit and/or a Y time unit to show the highest concentration of meeting objects in a time period. For example, the relationship matrix generator 108 of FIG. 1 may have determined that “Day of Week” for the Y axis should be displayed to accelerate visualizations of relationships by the human operator. In some embodiments, the relationship matrix generator 108 of FIG. 1 may display a subset and/or portion of the X and/or Y axes. For example, FIG. 3B illustrates an example relationship matrix 300 with different time units. In the example, the Y axis selector 308 may be set to “Day of Month” and/or the X axis selector 310 may be set to “Day of Week.” In some embodiments, the vertical ellipsis 390 along the Y axis may indicate that only the time units of February 1 through February 7 are shown. The relationship matrix generator 108 of FIG. 1 may have determined that the highest concentration of objects occurred in that time period and, therefore, selected the time period of February 1 through February 7 to display. In some embodiments, the relationship matrix system 100 and/or the relationship matrix generator 108 may be configured to display the lowest concentration of objects. In some embodiments, the vertical ellipsis 390 of FIG. 3B may indicate that all of the days of the month February are displayed to the human operator. In some embodiments, the relationship matrix system 100 and/or the relationship matrix generator 108 of FIG. 1 may automatically determine other features and/or characteristics of the relationship matrix 300 of FIG. 3 based on the selected, determined, and/or related data objects, such as the objects from FIG. 5B.


Returning to FIG. 1, at action five, the human operator may interact with the relationship matrix 300, which may cause the user computing device 102 to send user interaction data 120 to the interaction processor 104 and/or the relationship matrix system 100 through the network 160. For example, the human operator may interact with the relationship matrix 300 of FIG. 3A. The human operator may select and/or change the Y axis selector 308 and/or X axis selector 310 through a mouse click, touch input, and/or some other input mechanism. For example, as shown in FIG. 3B, a human operator may have changed the Y axis selector 308 to “Day of Month” and/or may have changed the X axis selector 310 to “Day of week.” The change by the human operator may cause the user computing device 102 to send the user interaction data 120 of FIG. 1, which may correspond to the Y axis selector 308 change and/or X axis selector 310 change. As a result, actions two, three, four, or a subset thereof, may be performed and/or repeated to generated a relationship matrix 300 as shown in FIG. 3B. For example, the relationship matrix generator 108 may receive the user interaction data 120 and/or data based on the user interaction data 120 from the interaction processor 104. The relationship matrix generator 108 may optionally request, receive, and/or load data objects from the object storage device 130. The relationship matrix generator 108 may then generate the relationship matrix 300, as shown in FIG. 3B, based on the user interaction of modifying the Y axis selector 308 and/or X axis selector 310.


Example Relationship Matrix Generation Process


FIG. 2 is a flowchart illustrating a relationship matrix generation process, according to some embodiments of the present disclosure. The method of FIG. 2 may be performed by the relationship matrix system 100 of FIG. 1, such as the various components of FIG. 1 that are discussed above, including the relationship matrix generator 108 and/or interaction processor 104. Depending on the embodiment, the method of FIG. 2 may include fewer or additional blocks and/or the blocks may be performed in order different than is illustrated.


Beginning at block 204, data selection and/or interaction input data is received. Data selection may comprise one or more data objects selected and/or determined from the user interface. For example, user interaction input data may be received after human operator interaction illustrated in FIG. 3B and/or other interactions disclosed herein. In the example, the user interaction input data may comprise a change to the Y axis selector 308 and/or X axis selector 310.


At block 206, the interaction input data is processed. In some embodiments, the interaction input data may be transformed. The user interaction data 120 received from the user computing device of FIG. 1 may comprise a format such as, but not limited to XML, JSON, HTML response/request format, a file format that is proprietary to the relationship matrix system, or any other format. For example, the user interaction data 120 may comprise an XML data format initially and be processed and/or transformed into another data format, such as, but not limited to, an object data format. The user interaction data may be transformed and/or incorporated into an object representing the relationship matrix user interface. Therefore, the properties of the relationship matrix, such as the user interactions, may be accessed by the relationship matrix system 100 and/or relationship matrix generator 108 of FIG. 1.


At block 208, one or more data objects and/or properties of one or more data objects are accessed. For example, a meeting object, including some or all of the properties of that meeting object, may be accessed by the relationship system 100. The meeting object may comprise one or more, time objects, time properties, a location, a link to other person data objects, and other data. In some embodiments, as previously discussed, a data object may be a starting point to load additional related data objects, such as, but not limited to, loading all the meeting and/or event objects corresponding to a person object.


At block 210, relationship properties from the one or more data objects are identified. For example, time objects and/or time properties may comprise relationship properties that are identified. In some embodiments, relationship properties of person data objects are accessed. For example, a person data object may comprise a meetings property that comprises all of the meetings the person data object had with other person data objects. In some embodiments, actions and/or action objects may be identified for respective objects. For example, meeting objects may be determined for person objects. A time and/or action time property may be associated with the meeting objects. Thus, in one example, a user selects one or more object properties of interest (e.g., all “meeting” events associated with a particular person object), and those event objects matching the properties are located (“matched”) for inclusion in the relationship matrix.


At block 212, the relationship matrix is generated based on the interaction input data and/or the relationship properties accessed from the data objects. For example, the matrix 300 of FIG. 3B may be generated from user interaction data and/or relationship properties of data objects. The user interaction input data comprising the “Day of Month” selection from the Y axis input selector may be used to generate the relationship matrix 300 of FIG. 3B. For example, since “Day of Month” was selected, the Y axis may comprise time units of days of the months, such as, February 1, 2, 3, etc., as illustrated by FIG. 3B. Similarly, the user interaction input comprising the “Day of Week” selection from the X axis input selector may be used to generate the labels on the X axis comprising “Sunday,” “Monday,” etc., as illustrated by FIG. 3B. The relationship blocks 320 (including blocks 320A, 320B, and/or 320C) may be generated based on data objects and/or relationship properties of data objects. For example, meeting data objects may be filtered by a month, such as, the month February as shown in FIG. 3B. Additionally, meeting data objects may be categorized by a day of the week property (e.g., Monday, Tuesday, Wednesday) and/or day of the month property (e.g., February 1, 2, etc.). The relationship blocks 320A, 320B, and/or 320C may correspond to groups of meeting data objects with time properties corresponding to the intersection of the X and Y axes. For example, the relationship block at 320A may comprise time properties corresponding to Feb. 5, 2013, which was a Tuesday. Additionally, as previously discussed, the relative gradient, color, hue, and/or saturation may correspond to the number of objects with the particular time properties at a given intersection. In the example, there may be more meeting data objects corresponding to relationship block 320A than relationship block 320B, which may correspond to the relative gradient, color, hue, and/or saturation between the two blocks.


In some embodiments, time properties may be accessed and/or used to generate the relationship matrix. For example, as discussed above, a first time period and/or second time period may be automatically determined corresponding to the time units associated with the X and/or Y axes of the generated relationship matrix. As illustrated above, time units and/or periods, such as “Day of Month,” “Month of Year,” the month “January,” and/or second week of the year, may be automatically determined to show the highest concentration of objects in the relationship matrix.


Data Objects


In some embodiments, data is conceptually structured according to an object data model represented by an ontology. The conceptual data model may be independent of any particular and/or specific type of data store. For example, each object of the conceptual data model may correspond to one or more rows in a relational database, an object in an in-memory cache, and/or some combination thereof.


In some embodiments, an ontology, as noted above, may include stored information providing a data model for storage of data in a data store. The ontology may be defined by one or more object types, which may each be associated with one or more property types. At the highest level of abstraction, a data object is a container for information representing things and/or events in the physical world. For example, a data object may represent an entity such as a person, a place, an organization, a market instrument, and/or some other noun. Data objects may represent an event that happens at a point in time and/or for a duration. Data objects may represent a document and/or other unstructured data source such as an e-mail message, a news report, a written paper, and/or a written article. Each data object may be associated with a unique identifier that uniquely identifies the data object within the data store.


Different types of data objects may have different property types. For example, a “Person” data object may have an “Eye Color” property type and an “Event” data object may have a “Date” property type. Each property as represented by data in the data store may have a property type defined by the ontology used by the data store.


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


The data objects defined in the ontology may support property multiplicity. For example, a data object may be allowed to have more than one property of the same property type. For example, a “Person” data object may have multiple “Address” properties. In another example, a “Meeting” data object may have multiple “Name” properties.


In some embodiments, the data objects the template system receives may correspond to an ontology according to the systems, methods, and/or techniques disclosed in the Ontology reference.


Example Relationship Matrix User Interactions


FIG. 3 (including FIGS. 3A-3G) illustrates example user interactions of relationship matrices. Relationship matrices may support other user interactions and the following actions are illustrative and/or non-limiting of the user interactions contemplated by the present disclosure for accelerating relationship visualizations.


In some embodiments, as previously illustrated, a human operator may change the Y axis selector 308 and/or X axis selector 310 of FIG. 3A to automatically update and/or generate the relationship matrix 300 of FIG. 3B. For example, a change to the Y axis selector 308 of FIG. 3A from “Day of Week” to “Day of Month” may cause an automatic update to the labels of the Y axis 302 from “Sun, Mon, etc.” to “February 1, February 2, etc.” as shown in FIG. 3B. Similarly, a change to the X axis selector 310 may cause an automatic update to the labels of the X axis 304 of FIG. 3A to the labels of FIG. 3B. Changes to the one or more of the axis selectors may cause other changes. For example, the macro unit indicator 306 of FIG. 3A may change from “Week 2” to “February” as illustrated by FIG. 3B. Similarly, different relationship blocks at the intersections between the Y axis 302 and X axis 304 may automatically appear and/or update following a change to one or more of the axis selectors (e.g., compare the relationship blocks 312 of FIG. 3A with the relationship blocks 320 of FIG. 3B).



FIG. 3C illustrates an example relationship matrix configured to update time periods and/or unit periods based on user interaction. For example, the relationship matrix 300 may be configured to display relationship blocks for the time period of February, as illustrated by macro unit indicator 306. A human operator may interact through user interaction input, such as, but not limited to, touch input, mouse input, and/or any other kind of interaction input, with the relationship matrix 300 to update time periods and/or unit periods. For example, the human operator may place a finger 330, hold a mouse click, or any other input mechanism, at a starting point 332A on the relationship grid. The human operator may then drag their finger 330 or move the mouse to ending point 332B. As a result of the user interaction, the relationship matrix may update the time period and/or unit period. In the example, relationship matrix 300 may update to the month of March, which may include updating the macro unit indicator 306, the labels of the Y axis 302, and/or the relationship blocks of the grid.


In some embodiments, there may be variations for updating the time periods and/or unit periods of the relationship matrix. For example, a swiping motion and/or mouse click from point 332B to 332A may cause the relationship matrix 300 to update to the month of January (a decrement and/or change of the time period). In some embodiments, the swiping motions to increment and/or decrement the unit periods may be reversed and/or configurable by the human operator. For example, instead of the vertical swiping motion illustrated in FIG. 3C, the swiping motion may be horizontal, configurable between the two motions, and/or some combination thereof. In some embodiments, there may be a minimum and/or maximum threshold for the relative distance between points 332A and 332B to register and/or cause an update to the unit periods.


In some embodiments, changing time periods and or unit periods may depend on the time and/or unit periods being displayed. For example, the swiping motion illustrated in FIG. 3B may cause the week to change in FIG. 3A. “Week 2” is displayed in FIG. 3A and a swiping motion and/or mouse drag may cause the week displayed to increment or decrement to “Week 3” or “Week 1,” respectively.



FIG. 3D illustrates an example relationship matrix configured to update the alignment of its grid based on user interaction. Similar to the touch, mouse, and/or other input mechanisms illustrated in FIG. 3C, a human operator may interact with the relationship matrix 300 to update the alignment of the grid of the relationship matrix 300 of FIG. 3D. For example, similar to the interaction of FIG. 3C, the human operator may drag a finger and/or hold a mouse click from starting point 334A to ending point 334B on the relationship grid of FIG. 3D. Receipt of the horizontal input data by the relationship matrix system may cause the relationship matrix 300 to update as illustrated by the grid alignment of FIG. 3E.



FIG. 3E illustrates the relationship matrix 300 following the alignment user interaction of FIG. 3D. For example, the first label of the X axis 304 is “Thursday” in FIG. 3E, which is different from the first label of the X axis 304, “Sunday,” of FIG. 3D. The position and/or location of the relationship blocks of the relationship matrix may also update corresponding to the alignment of the grid. For example, relationship block 320C, which may have been positioned at the edge of the grid in FIG. 3D, may be re-positioned as illustrated by FIG. 3E based on the alignment interaction. The alignment motion and/or interaction from starting point 334A to 334B may correspond to at least three relationship block widths and/or distances. As a result, relationship block 320C and/or the corresponding label on the Y axis 304 may move and/or update at least three relationship block widths and/or distances as illustrated by FIGS. 3D and 3E.


In some embodiments, there may be variations and/or additional user interactions to align and/or realign the relationship matrix. For example, a vertical user interaction, similar to the interaction illustrated by FIG. 3C, may cause the relationship matrix to realign along the Y axis. In some embodiments, the speed and/or time between a vertical user interaction (e.g., the time between user interaction at points 332A and 332B of FIG. 3C) may differentiate and/or distinguish between a time and/or unit period change of FIG. 3C and an alignment change as illustrated by FIGS. 3D and 3E. For example, there may be a time threshold (e.g., five hundred milliseconds), where a faster movement causes a time and/or unit period change and a slower movement causes a realignment of the grid.



FIG. 3F illustrates an example relationship matrix configured to update the units of an axis based on user interaction. For example, the human operator may place fingers 340A and 340B or any other input mechanism at starting points 342A and 342B, respectively, along the Y axis 302. The human operator may then move and/or drag fingers 340A and 340B or any other input mechanism to ending points 344A and 344B, respectively. As a result of the illustrated “zooming in” motion, the human operator may change and/or update the units of the Y axis. For example, the zooming in user interaction may update the Y axis unit of “Day of Month” to “Day of Week” or “Hour of Day.” The relationship matrix system may update the units of an axis following user interaction input based on the other axis that wasn't changed. For example, since the X axis of the relationship matrix 300 of FIG. 3F may be “Day of Week,” the relationship matrix system may update the Y axis to “Hour of Day” to avoid the same units for both axes following user interaction input. Similar to the user interaction with fingers 340, a human operator may perform a “zooming out” action as illustrated by fingers 346A and 346B and their corresponding directional arrows along the X axis 304. The zooming out action may change and/or update the units of the X axis 304 (e.g., the X axis unit of “Day of Week” may update to “Day of Month.”) Similar to some of the illustrated user interactions in this disclosure, a zooming in and/or zooming out interaction may update the relationship blocks displayed in relationship matrix 300, the Y axis selector 308, the X axis selector 310, and/or other elements of the relationship matrix 300 accordingly.


In some embodiments, there may be some variations of updating the units of an axis of the relationship matrix. In some embodiments, the relative distance of a zooming in and/or zooming out interaction may cause different updates. For example, the zooming in action illustrated by fingers 346 may cause the X axis units to change to “Day of Month,” “Week of Month,” and/or “Month of Year” based on the relative distance dragged and/or indicated. In some embodiments, a zooming in and/or zooming out user interaction may cause the relationship matrix 300 to update automatically. For example, as a human operator drags their fingers 346 the Y axis may update to “Day of Month,” “Week of Month,” and “Month of Year” (in that order) corresponding to the greater and/or longer distance that their fingers 346A. Additionally, the relationship blocks shown in the relationship matrix may update automatically as the units of one or more of the axes change.


In some embodiments, the zooming in and/or zooming out actions may be configured for different results. For example, the results of actions by fingers 340 and 346 that were previously described may be reversed.



FIG. 3G illustrates an example relationship matrix configured to update the units of both axes simultaneously based on user interaction. The user interaction illustrated by fingers 350 (including finger 350A and/or finger 350B) and their directional arrows may be similar to the zooming in action illustrated by fingers 340 of FIG. 3F. However, one difference between FIGS. 3F and 3G may be the placement of fingers 350 on the grid of relationship matrix 300 instead of the placement of fingers on an axis. Similar to the user interaction of fingers 340 of FIG. 3F, which may have updated one axis, the zooming in action of fingers 350 may cause both axes to update simultaneously. For example, both the Y axis 302 units and the X axis 304 units may change to “Day of Week” and “Hour of Day,” respectively. Similarly, the zooming out and/or pinching motion of fingers 356 may cause both axes to update simultaneously (e.g., the Y axis 302 units and X axis 304 units may change to “Week of Month” and “Day of Month,” respectively.)


In some embodiments, the variations of interactions illustrated by FIG. 3F may be available for the zooming in and/or out interactions illustrated by FIG. 3G. For example, the relative distance of the user interaction may impact and/or affect the change in the units of the axes. In some embodiments, while the directional arrows of FIG. 3G are shown at a diagonal, the relative orientation of the zooming in and/or zooming out actions do not matter. For example, the direction of the interactions by the fingers and/or other input mechanisms may be horizontal or vertical.


Outliers View


Certain of the relationship matrices illustrated herein may be configured to display a “patterns” or “outlier” view. The relationship matrix 300 of FIG. 3 displays a “patterns” view, while the user interface of FIG. 4 illustrates an example of an “outliers” view. The patterns view may comprise displaying relationships with gradient, color, hue, and/or saturation. In contrast, the outliers view shown in the relationship matrix 300 of FIG. 4 may comprise displaying relationships through one or more dots, visual indicators, and/or binary visualizations. Similar to the relationship blocks 312 of FIG. 3A, relationship blocks 412 (including blocks 412A, 412B, 412C, and/or 412D) may represent relationships between the axes. For example, the relationship block 412A may indicate multiple meetings and/or events at the intersection of “Thursday” and “7 AM” for the second week of 2013. Additionally, the relative number of dots of relationship blocks may further indicate information. For example, block 412A may comprise more dots and/or visual indicators than block 412B (which may be similar to the relative gradient, color, hue, and/or saturation of relationship blocks 312 of FIG. 3A). In the example, a greater number of dots and/or visual indicators may represent a greater number of objects and/or events at a particular intersection.


There may be advantages and/or benefits of the outliers view of a relationship matrix, such as, but not limited to, accelerating and/or facilitating human recognition of outlier relationships. In some of the previous examples, since the relationship matrix 300 of FIG. 3 may use a patterns view, a relationship may be difficult for a human to recognize based on relative gradient, color, hue, and/or saturation. For example, the relationship block of 312D of FIG. 3A may be difficult for a human operator to visually recognize because the gradient, color, hue, and/or saturation may be very light and/or difficult to see on a computer monitor and/or display. The particular viewing device and/or monitor being used may affect the ability to view pattern visualizations. Therefore, with a binary relationship, dot, and/or black/white visual indicators, an outlier may be quickly recognized by a human operator. For example, relationship block 412D may comprise a single black dot, which may be easily recognized by a human operator.


In some embodiments, the relationship matrix may be configured to receive user interaction input to switch between a patterns and outliers view. For example, the relationship matrix 300 may comprise an outliers button 402 and a patterns button 404. A human operator may toggle between the outliers view illustrated by FIG. 4 and the patterns view illustrated by FIG. 3A by pressing, touching, and/or clicking the outliers button 402 and the patterns button 404, respectively. The relationship matrix 300 may display the same relationship objects (e.g., meeting and/or event objects) but with a different view and/or representation of the relationship objects.


In some embodiments, the user interactions illustrated for the relationship matrix of FIG. 3 may be available for the relationship matrix of FIG. 4.


In some embodiments, there may variations of the formulas to configure the display of the one or more dots, visual indicators, and/or binary visualizations. The number of objects to be displayed as visual indicators may be calculated by various formulas, such as, but not limited to, linear, exponential, logarithmic, any other type of equation, and/or some combination thereof. For example:







D


-



Dots
.




O



-



Objects
.





D
1



=

CEILING


(

O
10

)






In some embodiments, which use the D1 formula, if the number of objects to be displayed at a relationship block is twenty-five, three dots may be displayed. Using the same formula, if there are five objects, one dot may be displayed. Another example formula is the following:

D2=CEILING(√{square root over (O)})


In some embodiments, using the D2 formula, if the number of objects to be displayed at a relationship block is twenty-five, five dots may be displayed. Using the same formula, if there are five hundred objects, twenty-three dots may be displayed.


In some embodiments, there may be some variations of the display of the relationship blocks illustrated as dots of FIG. 4 and/or gradient, color, hue, and/or saturation of FIG. 3. The dots, gradient, color, hue, and/or saturation may be configurable by the human operator. For example, a human operator may select various hues of the color green or red to be displayed in the relationship blocks of FIG. 3. In other examples, a human operator may select different shapes instead of dots for the outliers view of FIG. 4. In some embodiments, positive and/or negative numbers may be displayed by different colors. For example, positive representations of objects as relationship blocks may be blue and/or negative representations of objects as relationship blocks may be red.


In some embodiments, the formulas and/or similar formulas for calculating outliers view representations may be used to determine representations of gradient, hue, color, and/or saturation in the patterns view.


Other Types of Relationship Matrices


While some example relationship matrices of the present disclosure comprise time matrices, there may be other types of relationship matrices. In some embodiments, relationship matrices may be generated and/or accelerated where one or more axes of the relationship matrices comprises units that are hierarchical, scalar, classifications, and/or otherwise logically related and/or grouped. For example, in a time matrix, one or more axes may comprise time units such as, but not limited to, “Month of Year,” “Week of Month,” “Day of Month,” “Day of Week,” “Hour of Day.” Time units may be hierarchical because months comprise a year, days comprise a month, hours comprise a day, and so forth. In some embodiments, an axis of a relationship matrix may comprise geographical units. For example the geographical units of an axis may be the following: “Country,” “State,” “City,” “Zip Code,” and/or “Street.” Similar to the hierarchy of time units, states may comprise a country, cities may comprise a state, a city may be comprised of zip codes, and so forth. A relationship matrix and the units of the axes of a relationship matrix may be highly configurable because it may be based on a data object model and/or ontology, which may correspond to the systems, methods, and/or techniques disclosed in the Ontology reference.


Implementation Mechanisms


The various computing device(s) discussed herein, such as the relationship matrix system 100 of FIG. 1, are generally controlled and coordinated by operating system software, such as, but not limited to, iOS, Android, Chrome OS, Windows XP, Windows Vista, Windows 7, Windows 8, Windows Server, Windows CE, Unix, Linux, SunOS, Solaris, Macintosh OS X, VxWorks, or other compatible operating systems. In other embodiments, the computing devices may be controlled by a proprietary operating system. Conventional operating systems control and schedule computer processes for execution, perform memory management, provide file system, networking, I/O services, and provide a user interface functionality, such as a graphical user interface (“GUI”), among other things. The relationship matrix system 100 may be hosted and/or executed on one or more computing devices with one or more hardware processors and with any of the previously mentioned operating system software.



FIG. 6 is a block diagram that illustrates example components of the relationship matrix system 100. While FIG. 6 refers to the relationship matrix system 100, any of the other computing devices discussed herein may have some or all of the same or similar components.


The relationship matrix system 100 may execute software, e.g., standalone software applications, applications within browsers, network applications, etc., whether by the particular application, the operating system, or otherwise. Any of the systems discussed herein may be performed by the relationship matrix system 100 and/or a similar computing system having some or all of the components discussed with reference to FIG. 6.


The relationship matrix system 100 includes a bus 602 or other communication mechanism for communicating information, and a hardware processor, or multiple processors, 604 coupled with bus 602 for processing information. Hardware processor(s) 604 may be, for example, one or more general purpose microprocessors.


The relationship matrix system 100 also includes a main memory 606, such as a random access memory (RAM), cache and/or other dynamic storage devices, coupled to bus 602 for storing information and instructions to be executed by processor(s) 604. Main memory 606 also may be used for storing temporary variables or other intermediate information during execution of instructions to be executed by processor(s) 604. Such instructions, when stored in storage media accessible to processor(s) 604, render the relationship matrix system 100 into a special-purpose machine that is customized to perform the operations specified in the instructions. Such instructions, as executed by hardware processors, may implement the methods and systems described herein for sharing security information.


The relationship matrix system 100 further includes a read only memory (ROM) 608 or other static storage device coupled to bus 602 for storing static information and instructions for processor(s) 604. A storage device 610, such as a magnetic disk, optical disk, or USB thumb drive (Flash drive), etc., is provided and coupled to bus 602 for storing information and instructions. The object storage device 130 of FIG. 1 may be stored on the main memory 606 and/or the storage device 610.


In some embodiments, the object storage device 130 of FIG. 1 is a file system, relational database such as, but not limited to, MySql, Oracle, Sybase, or DB2, and/or a distributed in memory caching system such as, but not limited to, Memcache, Memcached, or Java Caching System, and/or some combination thereof.


The relationship matrix system 100 may be coupled via bus 602 to a display 612, such as a cathode ray tube (CRT) or LCD display or touch screen, for displaying information to a computer user. An input device 614 is coupled to bus 602 for communicating information and command selections to processor 604. One type of input device 614 is a keyboard including alphanumeric and other keys. Another type of input device 614 is a touch screen. Another type of user input device is cursor control 616, such as a mouse, a trackball, a touch screen, or cursor direction keys for communicating direction information and command selections to processor 604 and for controlling cursor movement on display 612. This input device may have two degrees of freedom in two axes, a first axis (e.g., x) and a second axis (e.g., y), that allows the device to specify positions in a plane. In some embodiments, the same direction information and command selections as cursor control may be implemented via receiving touches on a touch screen without a cursor.


The relationship matrix system 100 may include a user interface unit to implement a GUI, for example, FIGS. 3, 4, and/or 5, which may be stored in a mass storage device as executable software codes that are executed by the computing device(s). This and other units 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.


The relationship matrix system 100 and/or the relationship matrix 300 of FIG. 1 may be configured to be compatible with web browsers such as, but not limited to, Firefox, Internet Explorer, Safari, and/or Chrome.


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


The relationship matrix system 100, or components of it, such as the interaction processor 104 and/or the relationship matrix generator 108 of FIG. 1 and/or FIG. 6, may be programmed, via executable code instructions, in a programming language.


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


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


Various forms of media may be involved in carrying one or more sequences of one or more instructions to processor(s) 604 for execution. For example, the instructions may initially be carried on a magnetic disk or solid state drive of a remote computer. The remote computer may load the instructions into its dynamic memory and send the instructions over a telephone or cable line using a modem. A modem local to the relationship matrix system 100 may receive the data on the telephone or cable line and use an infra-red transmitter to convert the data to an infra-red signal. An infra-red detector can receive the data carried in the infra-red signal and appropriate circuitry can place the data on bus 602. Bus 602 carries the data to main memory 606, from which the processor(s) 604 retrieves and executes the instructions. The instructions received by main memory 606 may retrieve and execute the instructions. The instructions received by main memory 606 may optionally be stored on storage device 610 either before or after execution by processor(s) 604.


The relationship matrix system 100 also includes a communication interface 618 coupled to bus 602. Communication interface 618 provides a two-way data communication coupling to a network link 620 that is connected to a local network 622. For example, communication interface 618 may be an integrated services digital network (ISDN) card, cable modem, satellite modem, or a modem to provide a data communication connection to a corresponding type of telephone line. As another example, communication interface 618 may be a local area network (LAN) card to provide a data communication connection to a compatible LAN (or WAN component to be communicated with a WAN). Wireless links may also be implemented. In any such implementation, communication interface 618 sends and receives electrical, electromagnetic or optical signals that carry digital data streams representing various types of information.


Network link 620 typically provides data communication through one or more networks to other data devices. For example, network link 620 may provide a connection through local network 622 to a host computer 624 or to data equipment operated by an Internet Service Provider (ISP) 626. ISP 626 in turn provides data communication services through the world wide packet data communication network now commonly referred to as the “Internet” 628. Local network 622 and Internet 628 both use electrical, electromagnetic or optical signals that carry digital data streams. The signals through the various networks and the signals on network link 620 and through communication interface 618, which carry the digital data to and from the relationship matrix system 100, are example forms of transmission media.


A network, such as the network 160 of FIG. 1, may comprise, but is not limited to, one or more local area networks, wide area network, wireless local area network, wireless wide area network, the Internet, or any combination thereof.


The relationship matrix system 100 can send messages and receive data, including program code, through the network(s), network link 620 and communication interface 618. In the Internet example, a server 630 might transmit a requested code for an application program through Internet 628, ISP 626, local network 622 and communication interface 618.


The received code may be executed by processor(s) 604 as it is received, and/or stored in storage device 610, or other non-volatile storage for later execution.


Each of the processes, methods, and algorithms described in the preceding sections may be embodied in, and fully or partially automated by, code instructions executed by one or more computer systems or computer processors comprising computer hardware. The processes and algorithms may be implemented partially or wholly in application-specific circuitry.


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


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


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


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

Claims
  • 1. A system comprising: one or more computer hardware processors programmed, via executable code instructions, to: retrieve a plurality of objects;receive first user input data comprising a first time unit;receive second user input data comprising a second time unit different from the first time unit;determine a first time period associated with the first time unit;determine a second time period associated with the second time unit;determine a first count of at least two objects from the plurality of objects within the first time period and the second time period; andcause presentation, in a user interface, of a first visualization comprising: a first indicator corresponding to the first time period and the first time unit along a first axis,a second indicator corresponding to the second time period and the second time unit along a second axis, anda third indicator of the first count at an intersection of the first indicator and the second indicator,wherein the third indicator comprises a visual representation of the first count as at least one of a color, a gradient, a hue, a saturation, or a binary visualization.
  • 2. The system of claim 1, wherein the first time unit comprises a day of week, a day of month, an hour of day, a month of year, a week of month, or a week of year.
  • 3. The system of claim 1, wherein the one or more computer hardware processors is further programmed, via executable code instructions, to: determine, from the plurality of objects, a link between a first object and a second object, the first object from the at least two objects; andcause presentation, in the user interface, of a graph visualization comprising a visual representation of the first object as linked with the second object.
  • 4. The system of claim 1, wherein determining the first count further comprises: determining, from a first object of the plurality of objects, at least one of a date property or a time property; anddetermining that the at least one of the date property or the time property is within the first time period and the second time period.
  • 5. The system of claim 1, wherein the one or more computer hardware processors is further programmed, via executable code instructions, to: determine a first plurality of time periods associated with the first time unit;determine a second plurality of time periods associated with the second time unit; andfor each combination of respective time periods from the first plurality of time periods and the second plurality of time periods, determine a respective count of one or more objects from the plurality of objects within a respective combination of the first plurality of time periods and the second plurality of time periods,wherein the first visualization further comprises: first indicators corresponding to respective time periods from the first plurality of time periods along the first axis,second indicators corresponding to respective time periods from the second plurality of time periods along the second axis, andthird indicators corresponding to at least some of the respective counts at intersections of the first indicators and the second indicators.
  • 6. A system comprising: one or more computer hardware processors programmed, via executable code instructions, to: retrieve a plurality of objects;receive first user input data comprising a first time unit;receive second user input data comprising a second unit different from the first time unit;determine a first time period associated with the first time unit;determine a second value associated with the second unit;determine a first count of at least two objects from the plurality of objects within the first time period and comprising a respective property value corresponding to the second value; andcause presentation, in a user interface, of a first visualization comprising: a first indicator corresponding to the first time period and the first time unit along a first axis,a second indicator corresponding to the second value and the second unit along a second axis, anda third indicator of the first count at an intersection of the first indicator and the second indicator,wherein the third indicator comprises a visual representation of the first count as at least one of a color, a gradient, a hue, a saturation, or a binary visualization.
  • 7. The system of claim 6, wherein the second unit comprises a geographical unit.
  • 8. The system of claim 7, wherein the geographical unit comprises at least one of a city, a state, a country, a zip code, or a street.
  • 9. The system of claim 8, wherein the second value comprises at least one of a particular city, a particular state, a particular country, a particular zip code, or a particular street corresponding to the geographical unit.
  • 10. The system of claim 6, wherein the second unit comprises a second time unit.
  • 11. The system of claim 10, wherein the second time unit comprises a day of week, a day of month, an hour of day, a month of year, a week of month, or a week of year.
  • 12. The system of claim 10, wherein the one or more computer hardware processors is further programmed, via executable code instructions, to: determine a first plurality of time periods associated with the first time unit;determine a second plurality of time periods associated with the second time unit; andfor each combination of respective time periods from the first plurality of time periods and the second plurality of time periods, determine a respective count of one or more objects from the plurality of objects within a respective combination of the first plurality of time periods and the second plurality of time periods,wherein the first visualization further comprises: first indicators corresponding to respective time periods from the first plurality of time periods along the first axis,second indicators corresponding to respective time periods from the second plurality of time periods along the second axis, andthird indicators corresponding to at least some of the respective counts at intersections of the first indicators and the second indicators.
  • 13. The system of claim 6, wherein the one or more computer hardware processors is further programmed, via executable code instructions, to: determine, from the plurality of objects, a link between a first object and a second object, the first object from the at least two objects; andcause presentation, in the user interface, of a graph visualization comprising a visual representation of the first object as linked with the second object.
  • 14. The system of claim 6, wherein determining the first count further comprises: determining, from a first object of the plurality of objects, at least one of a date property or a time property; anddetermining that the at least one of the date property or the time property is within the first time period.
  • 15. A system comprising: one or more computer hardware processors programmed, via executable code instructions, to: retrieve a plurality of objects;determine a first time period associated with a first axis and a first time unit;determine a second time period associated with a second axis and a second time unit different from the first time unit;determine a first count of at least two objects from the plurality of objects within the first time period and the second time period; andcause presentation of a first indicator corresponding to the first time period and the first time unit along the first axis, a second indicator corresponding to the second time period and the second time unit along the second axis, anda third indicator of the first count at an intersection of the first indicator and the second indicator, wherein the third indicator comprises a visual representation of the first count as at least one of a color, a gradient, a hue, a saturation, or a binary visualization.
  • 16. The system of claim 15, wherein the first time unit comprises a day of week, a day of month, an hour of day, a month of year, a week of month, or a week of year.
  • 17. The system of claim 15, wherein the one or more computer hardware processors is further programmed, via executable code instructions, to: determine, from the plurality of objects, a link between a first object and a second object, the first object from the at least two objects; andcause presentation of a graph visualization comprising a visual representation of the first object as linked with the second object.
  • 18. The system of claim 15, wherein determining the first count further comprises: determining, from a first object of the plurality of objects, at least one of a date property or a time property; anddetermining that the at least one of the date property or the time property is within the first time period and the second time period.
  • 19. The system of claim 15, wherein the one or more computer hardware processors is further programmed, via executable code instructions, to: determine a first plurality of time periods associated with the first time unit;determine a second plurality of time periods associated with the second time unit;for each combination of respective time periods from the first plurality of time periods and the second plurality of time periods, determine a respective count of one or more objects from the plurality of objects within a respective combination of the first plurality of time periods and the second plurality of time periods; andcause presentation of: first indicators corresponding to respective time periods from the first plurality of time periods along the first axis,second indicators corresponding to respective time periods from the second plurality of time periods along the second axis, andthird indicators corresponding to at least some of the respective counts at intersections of the first indicators and the second indicators.
INCORPORATION BY REFERENCE TO ANY PRIORITY APPLICATIONS

Any and all applications for which a foreign or domestic priority claim is identified in the Application Data Sheet as filed with the present application are hereby incorporated by reference under 37 CFR 1.57. This application is a continuation of U.S. patent application Ser. No. 14/320,236 entitled “Relationship Visualizations” filed Jun. 30, 2014, which claims benefit of U.S. Provisional Patent Application Ser. No. 61/942,540 entitled “Relationship Visualizations” filed Feb. 20, 2014. Each of these applications are hereby incorporated by reference herein in their entireties. This application is related to but does not claim priority from U.S. Pat. No. 8,489,623 entitled “Creating Data In A Data Store Using A Dynamic Ontology” filed May 12, 2011, which is hereby incorporated by reference in its entirety and referred to herein as the “Ontology reference.” This application is related to but does not claim priority from U.S. patent application Ser. No. 13/968,265 entitled “Generating Data Clusters With Customizable Analysis Strategies” filed Aug. 15, 2013, and U.S. patent application Ser. No. 13/968,213 entitled “Prioritizing Data Clusters With Customizable Scoring Strategies” filed Aug. 15, 2013, which are hereby incorporated by reference in their entireties and collectively referred to herein as the “Cluster references.”

US Referenced Citations (597)
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
6167405 Rosensteel, Jr. et al. 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
6674434 Chojnacki et al. Jan 2004 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
7451397 Weber et al. Nov 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
7546245 Surpin et al. Jun 2009 B2
7558677 Jones Jun 2009 B2
7574409 Patinkin Aug 2009 B2
7574428 Leiserowitz et al. Aug 2009 B2
7579965 Bucholz Aug 2009 B2
7596285 Brown et al. Sep 2009 B2
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
7640173 Surpin et al. Dec 2009 B2
7703021 Flam Apr 2010 B1
7706817 Bamrah et al. Apr 2010 B2
7712049 Williams et al. May 2010 B2
7716067 Surpin 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
7941321 Greenstein et al. May 2011 B2
7962281 Rasmussen et al. Jun 2011 B2
7962495 Jain et al. Jun 2011 B2
7962848 Bertram Jun 2011 B2
7970240 Chao et al. Jun 2011 B1
7971150 Raskutti et al. Jun 2011 B2
7984374 Caro et al. Jun 2011 B2
8001465 Kudrolli et al. Aug 2011 B2
8001482 Bhattiprolu et al. Aug 2011 B2
8010545 Stefik et al. Aug 2011 B2
8015487 Roy et al. Sep 2011 B2
8024778 Cash et al. Sep 2011 B2
8036632 Cona et al. Oct 2011 B1
8082172 Chao et al. Dec 2011 B2
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
8196184 Amirov et al. Jun 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
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
8489623 Jain 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
8560413 Quarterman Oct 2013 B1
8577911 Stepinski et al. Nov 2013 B1
8589273 Creeden et al. Nov 2013 B2
8595234 Siripuapu et al. Nov 2013 B2
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
8744890 Bernier Jun 2014 B1
8745516 Mason et al. Jun 2014 B2
8781169 Jackson et al. Jul 2014 B2
8787939 Papakipos et al. Jul 2014 B2
8788407 Singh et al. Jul 2014 B1
8799799 Cervelli et al. Aug 2014 B1
8812960 Sun Aug 2014 B1
8830322 Nerayoff et al. Sep 2014 B2
8832594 Thompson et al. Sep 2014 B1
8868486 Tamayo Oct 2014 B2
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
9009171 Grossman et al. Apr 2015 B1
9009827 Albertson et al. Apr 2015 B1
9021260 Falk et al. Apr 2015 B1
9021384 Beard et al. Apr 2015 B1
9043696 Meiklejohn et al. May 2015 B1
9043894 Dennison et al. May 2015 B1
9069842 Melby Jun 2015 B2
9116975 Shankar et al. Aug 2015 B2
9146954 Boe et al. Sep 2015 B1
9202249 Cohen et al. Dec 2015 B1
9223773 Isaacson Dec 2015 B2
9229952 Meacham et al. Jan 2016 B1
9250759 Commons Feb 2016 B1
9256664 Chakerian et al. Feb 2016 B2
9298678 Chakerian et al. Mar 2016 B2
9319288 Somaiya Apr 2016 B2
9367872 Visbal et al. Jun 2016 B1
9483162 Mingione Nov 2016 B2
9514205 Yazicioglu Dec 2016 B1
9626088 Ma et al. Apr 2017 B2
9646396 Sharma et al. May 2017 B2
D802000 Grossman Nov 2017 S
D808991 Poor Jan 2018 S
D826269 Llorca Aug 2018 S
20010021936 Bertram Sep 2001 A1
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
20020130907 Chi et al. Sep 2002 A1
20020174201 Ramer et al. Nov 2002 A1
20020194119 Wright et al. Dec 2002 A1
20030028560 Kudrolli et al. Feb 2003 A1
20030036848 Sheha 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
20030172014 Quackenbush et al. Sep 2003 A1
20030200217 Ackerman Oct 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
20040103124 Kupkova 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
20040160309 Stilp Aug 2004 A1
20040163039 Gorman Aug 2004 A1
20040181554 Heckerman et al. Sep 2004 A1
20040193600 Kaasten et al. Sep 2004 A1
20040205524 Richter et al. Oct 2004 A1
20040221223 Yu et al. Nov 2004 A1
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
20050078858 Yao et al. Apr 2005 A1
20050080769 Gemmell Apr 2005 A1
20050086207 Heuer et al. Apr 2005 A1
20050125715 Franco et al. Jun 2005 A1
20050143602 Yada et al. Jun 2005 A1
20050154628 Eckart et al. Jul 2005 A1
20050154769 Eckart et al. Jul 2005 A1
20050162523 Darrell et al. Jul 2005 A1
20050166144 Gross Jul 2005 A1
20050180330 Shapiro Aug 2005 A1
20050182793 Keenan et al. Aug 2005 A1
20050183005 Denoue et al. Aug 2005 A1
20050210409 Jou Sep 2005 A1
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
20060045470 Poslinski et al. Mar 2006 A1
20060059139 Robinson Mar 2006 A1
20060074866 Chamberlain et al. Apr 2006 A1
20060074881 Vembu et al. Apr 2006 A1
20060080619 Carlson et al. Apr 2006 A1
20060093222 Saffer et al. May 2006 A1
20060129746 Porter Jun 2006 A1
20060139375 Rasmussen et al. Jun 2006 A1
20060142949 Helt Jun 2006 A1
20060143034 Rothermel Jun 2006 A1
20060149596 Surpin et al. Jul 2006 A1
20060184889 Molander Aug 2006 A1
20060203337 White Sep 2006 A1
20060209085 Wong et al. Sep 2006 A1
20060218637 Thomas et al. Sep 2006 A1
20060241974 Chao et al. Oct 2006 A1
20060242040 Rader Oct 2006 A1
20060242630 Koike et al. Oct 2006 A1
20060271277 Hu et al. Nov 2006 A1
20060279630 Aggarwal et al. Dec 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
20070233709 Abnous Oct 2007 A1
20070240062 Christena et al. Oct 2007 A1
20070250784 Riley Oct 2007 A1
20070266336 Nojima et al. Nov 2007 A1
20070294200 Au Dec 2007 A1
20070294643 Kyle Dec 2007 A1
20080016216 Worley et al. Jan 2008 A1
20080040275 Paulsen et al. Feb 2008 A1
20080040684 Crump Feb 2008 A1
20080051989 Welsh Feb 2008 A1
20080052142 Bailey et al. Feb 2008 A1
20080077597 Butler Mar 2008 A1
20080077642 Carbone et al. Mar 2008 A1
20080082486 Lermant et al. Apr 2008 A1
20080104019 Nath May 2008 A1
20080126951 Sood et al. May 2008 A1
20080148398 Mezack et al. Jun 2008 A1
20080155440 Trevor et al. Jun 2008 A1
20080162616 Worley et al. Jul 2008 A1
20080195417 Surpin et al. Aug 2008 A1
20080195608 Clover Aug 2008 A1
20080222295 Robinson et al. Sep 2008 A1
20080243711 Aymeloglu et al. Oct 2008 A1
20080249983 Meisels et al. Oct 2008 A1
20080255973 El Wade et al. Oct 2008 A1
20080263468 Cappione et al. Oct 2008 A1
20080267107 Rosenberg Oct 2008 A1
20080276167 Michael Nov 2008 A1
20080278311 Grange et al. Nov 2008 A1
20080281819 Tenenbaum et al. Nov 2008 A1
20080288306 MacIntyre et al. Nov 2008 A1
20080288475 Kim et al. Nov 2008 A1
20080294994 Kruger Nov 2008 A1
20080301643 Appleton et al. Dec 2008 A1
20090002492 Velipasalar et al. Jan 2009 A1
20090027418 Maru et al. Jan 2009 A1
20090030915 Winter et al. Jan 2009 A1
20090055251 Shah et al. Feb 2009 A1
20090070162 Leonelli et al. Mar 2009 A1
20090076845 Bellin et al. Mar 2009 A1
20090088964 Schaaf et al. Apr 2009 A1
20090094166 Aymeloglu et al. Apr 2009 A1
20090119309 Gibson et al. May 2009 A1
20090125359 Knapic May 2009 A1
20090125369 Kloosstra et al. May 2009 A1
20090125459 Norton et al. May 2009 A1
20090132921 Hwangbo et al. May 2009 A1
20090132953 Reed et al. May 2009 A1
20090143052 Bates et al. Jun 2009 A1
20090144262 White et al. Jun 2009 A1
20090144274 Fraleigh et al. Jun 2009 A1
20090150854 Elaasar et al. Jun 2009 A1
20090164934 Bhattiprolu et al. Jun 2009 A1
20090171939 Athsani et al. Jul 2009 A1
20090172511 Decherd et al. Jul 2009 A1
20090172821 Daira et al. Jul 2009 A1
20090177962 Gusmorino et al. Jul 2009 A1
20090179892 Tsuda et al. Jul 2009 A1
20090187464 Bai et al. Jul 2009 A1
20090192957 Subramanian Jul 2009 A1
20090222400 Kupershmidt et al. Sep 2009 A1
20090222759 Drieschner Sep 2009 A1
20090222760 Halverson et al. Sep 2009 A1
20090234720 George et al. Sep 2009 A1
20090249244 Robinson et al. Oct 2009 A1
20090254970 Agarwal et al. Oct 2009 A1
20090281839 Lynn et al. Nov 2009 A1
20090287470 Farnsworth et al. Nov 2009 A1
20090292626 Oxford Nov 2009 A1
20090327208 Bittner et al. Dec 2009 A1
20100011282 Dollard et al. Jan 2010 A1
20100030722 Goodson et al. Feb 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
20100100963 Mahaffey Apr 2010 A1
20100103124 Kruzeniski et al. Apr 2010 A1
20100106752 Eckardt et al. Apr 2010 A1
20100114887 Conway et al. May 2010 A1
20100122152 Chamberlain et al. May 2010 A1
20100131457 Heimendinger May 2010 A1
20100162176 Dunton Jun 2010 A1
20100185691 Irmak et al. Jul 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
20100306029 Jolley Dec 2010 A1
20100306713 Geisner et al. Dec 2010 A1
20100313119 Baldwin et al. Dec 2010 A1
20100318924 Frankel et al. Dec 2010 A1
20100321399 Ellren et al. Dec 2010 A1
20100325526 Ellis et al. Dec 2010 A1
20100325581 Finkelstein et al. Dec 2010 A1
20100330801 Rouh Dec 2010 A1
20110004498 Readshaw Jan 2011 A1
20110029526 Knight et al. Feb 2011 A1
20110047159 Baid et al. Feb 2011 A1
20110060753 Shaked et al. Mar 2011 A1
20110061013 Bilicki et al. Mar 2011 A1
20110066933 Ludwig Mar 2011 A1
20110074811 Hanson et al. Mar 2011 A1
20110078055 Faribault et al. Mar 2011 A1
20110078173 Seligmann et al. Mar 2011 A1
20110093327 Fordyce et al. Apr 2011 A1
20110107196 Foster May 2011 A1
20110113348 Twiss et al. May 2011 A1
20110117878 Barash et al. May 2011 A1
20110119100 Ruhl et al. May 2011 A1
20110131547 Elaasar Jun 2011 A1
20110137766 Rasmussen et al. Jun 2011 A1
20110153384 Horne et al. Jun 2011 A1
20110161096 Buehler et al. Jun 2011 A1
20110161137 Ubalde 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
20110181598 O'Neall 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
20110219321 Gonzalez et al. Sep 2011 A1
20110219450 McDougal et al. Sep 2011 A1
20110225198 Edwards et al. Sep 2011 A1
20110238495 Kang Sep 2011 A1
20110238553 Raj et al. Sep 2011 A1
20110251951 Kolkowtiz Oct 2011 A1
20110252351 Sikora et al. Oct 2011 A1
20110258158 Resende et al. 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
20120004904 Shin et al. Jan 2012 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
20120075324 Cardno et al. Mar 2012 A1
20120079363 Folting et al. Mar 2012 A1
20120084118 Bai et al. Apr 2012 A1
20120106801 Jackson May 2012 A1
20120116828 Shannon May 2012 A1
20120117082 Koperda et al. May 2012 A1
20120131139 Siripurapu et al. May 2012 A1
20120131512 Takeuchi et al. May 2012 A1
20120137235 Ts et al. May 2012 A1
20120144335 Abeln et al. Jun 2012 A1
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
20120180002 Campbell et al. Jul 2012 A1
20120196557 Reich et al. Aug 2012 A1
20120196558 Reich et al. Aug 2012 A1
20120197651 Robinson et al. Aug 2012 A1
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
20120323888 Osann, Jr. Dec 2012 A1
20120330801 McDougal et al. Dec 2012 A1
20120330973 Ghuneim et al. Dec 2012 A1
20130006426 Healey et al. Jan 2013 A1
20130006725 Simanek et al. Jan 2013 A1
20130006916 McBride et al. Jan 2013 A1
20130018796 Kolhatkar et al. Jan 2013 A1
20130024268 Manickavelu Jan 2013 A1
20130046635 Grigg et al. Feb 2013 A1
20130046842 Muntz et al. Feb 2013 A1
20130050217 Armitage 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
20130086482 Parsons Apr 2013 A1
20130097482 Marantz et al. Apr 2013 A1
20130106860 De Pauw et al. May 2013 A1
20130110822 Ikeda et al. May 2013 A1
20130110877 Bonham et al. May 2013 A1
20130111320 Campbell et al. May 2013 A1
20130117011 Ahmed et al. May 2013 A1
20130117651 Waldman et al. May 2013 A1
20130101159 Rosen 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
20130169666 Pacheco Jul 2013 A1
20130176321 Mitchell et al. Jul 2013 A1
20130179420 Park et al. Jul 2013 A1
20130224696 Wolfe et al. Aug 2013 A1
20130225212 Khan Aug 2013 A1
20130226318 Procyk Aug 2013 A1
20130226953 Markovich et al. Aug 2013 A1
20130232045 Tai Sep 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
20130276000 Neeman 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
20130335419 Bondeson et al. Dec 2013 A1
20140006938 Black et al. Jan 2014 A1
20140019461 Bredenberg Jan 2014 A1
20140019936 Cohanoff Jan 2014 A1
20140032506 Hoey et al. Jan 2014 A1
20140033010 Richardt et al. Jan 2014 A1
20140040371 Gurevich et al. Feb 2014 A1
20140046934 Zhou et al. Feb 2014 A1
20140047319 Eberlein Feb 2014 A1
20140047357 Alfaro et al. Feb 2014 A1
20140059038 McPherson et al. Feb 2014 A1
20140059498 McCormack Feb 2014 A1
20140067611 Adachi et al. Mar 2014 A1
20140068487 Steiger et al. Mar 2014 A1
20140074855 Zhao 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
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
20140222521 Chait Aug 2014 A1
20140244388 Manouchehri et al. Aug 2014 A1
20140258246 Lo Faro et al. Sep 2014 A1
20140267294 Ma Sep 2014 A1
20140267295 Sharma Sep 2014 A1
20140279824 Tamayo Sep 2014 A1
20140282177 Wang et al. Sep 2014 A1
20140310266 Greenfield Oct 2014 A1
20140316911 Gross Oct 2014 A1
20140333651 Cervelli et al. Nov 2014 A1
20140337772 Cervelli et al. Nov 2014 A1
20140344230 Krause et al. Nov 2014 A1
20140351070 Christner et al. Nov 2014 A1
20150019394 Unser et al. Jan 2015 A1
20150046870 Goldenberg et al. Feb 2015 A1
20150073929 Psota et al. Mar 2015 A1
20150081370 Lo Mar 2015 A1
20150089424 Duffield et al. Mar 2015 A1
20150100897 Sun et al. Apr 2015 A1
20150100907 Erenrich et al. Apr 2015 A1
20150134371 Shivakumar May 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
20150178690 May et al. Jun 2015 A1
20150178825 Huerta Jun 2015 A1
20150178877 Bogomolov et al. Jun 2015 A1
20150186821 Wang et al. Jul 2015 A1
20150187036 Wang et al. Jul 2015 A1
20150213631 Vander Broek Jul 2015 A1
20150227295 Meiklejohn et al. Aug 2015 A1
20150227847 Noel Aug 2015 A1
20150229532 Somaiya Aug 2015 A1
20150229546 Somaiya Aug 2015 A1
20150234549 Mingione Aug 2015 A1
20150242401 Liu Aug 2015 A1
20150254878 Sharma et al. Sep 2015 A1
20150309719 Ma et al. Oct 2015 A1
20150317342 Grossman et al. Nov 2015 A1
20150324868 Kaftan et al. Nov 2015 A1
20150341212 Hsiao et al. Nov 2015 A1
20150347903 Saxena et al. Dec 2015 A1
20150363478 Haynes Dec 2015 A1
20150378996 Kesin et al. Dec 2015 A1
20160004667 Chakerian et al. Jan 2016 A1
20160006749 Cohen et al. Jan 2016 A1
20160034545 Shankar et al. Feb 2016 A1
20160098173 Slawinski et al. Apr 2016 A1
20160162497 Cho Jun 2016 A1
20170109910 Sharma et al. Apr 2017 A1
20170116294 Ma et al. Apr 2017 A1
Foreign Referenced Citations (42)
Number Date Country
2014250678 Feb 2016 AU
102014103482 Sep 2014 DE
102014215621 Feb 2015 DE
1191463 Mar 2002 EP
1672527 Jun 2006 EP
2551799 Jan 2013 EP
2560134 Feb 2013 EP
2778977 Sep 2014 EP
2778983 Sep 2014 EP
2779082 Sep 2014 EP
2835745 Feb 2015 EP
2835770 Feb 2015 EP
2838039 Feb 2015 EP
2846241 Mar 2015 EP
2851852 Mar 2015 EP
2858014 Apr 2015 EP
2858018 Apr 2015 EP
2863326 Apr 2015 EP
2863346 Apr 2015 EP
2869211 May 2015 EP
2884439 Jun 2015 EP
2884440 Jun 2015 EP
2891992 Jul 2015 EP
2911078 Aug 2015 EP
2911100 Aug 2015 EP
2940603 Nov 2015 EP
2940609 Nov 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 2010098958 Sep 2010 WO
WO 2013010157 Jan 2013 WO
WO 2013102892 Jul 2013 WO
Non-Patent Literature Citations (274)
Entry
Alfred, Rayner “Summarizing Relational Data Using Semi-Supervised Genetic Algorithm-Based Clustering Techniques”, Journal of Computer Science, 2010, vol. 6, No. 7, pp. 775-784.
Janssen, Jan-Keno, “Wo bist'n du?—Googles Geodienst Latitude,” Jan. 17, 2011, pp. 86-88, retrieved from the internet on Jul. 30, 2015 http://www.heise.de/artikel-archiv/ct/2011/03/086/#00250#/ct.11.03.086-088.pdf.
Jelen, Bill, “Excel 2013 in Depth, Video Enhanced Edition,” Jan. 25, 2013.
Map Builder, “Rapid Mashup Development Tool for Google and Yahoo Maps!” <http://web.archive.org/web/20090626224734/http://www.mapbuilder.net/> printed Jul. 20, 2012 in 2 pages.
Ocull, Heather, “Timelines Everywhere: See and share your work with ease in SharePoint and PWA,” Office Blogs, published Sep. 7, 2012, in 8 pages.
Psaltis, Andrew G., “Streaming Data—Designing the Real-Time Pipeline,” Jan. 16, 2015, vol. MEAP VO3, pp. 0-12.
Wikipedia, “Mobile Web,” Jan. 23, 2015, retrieved from the internet on Mar. 15, 2016 https://en.wikipedia.org/w/index.php?title=Mobile_Web&oldid=643800164.
Windley, Phillip J., “The Live Web: Building Event-Based Connections in the Cloud,” Dec. 21, 2011, pp. 10, 216.
IBM—Data analysis—i2 Analyst's Notebook, http://www.03.ibm.com/software/products/en/analysts-notebook, as printed Feb. 16, 2017 in 2 pages.
Visual Analysis, “Overview of merging timeline charts and creating hybrid charts,” available at https://www.youtube.com/watch?v-dl6jzNtEVpA, as published on Mar. 9, 2015.
IBM Analytics, “IBM i2 Intelligence Analysis Portfolio Overview,” available at https://www.youtube.com/watch?v=ElFu_oUiaBY, as published on Sep. 24, 2015.
IBM Corporation, “IBM i2 Analyst's Notebook,” Aug. 2015, in 4 pages.
IBM Corporation, “IBM i2 Analyst's Notebook Connector for Esri,” May 2012, in 3 pages.
i2 A ChoicePoint Company, “i2 Analyst's Notebook 7 User Guide: Creating Charts” Jun. 2007, 373 pages.
Gatewaynews, “New Crime Fighting Tool ‘Coplink’” available at https://www.youtube.com/watch?v=GbU6E0grnTw, as published on Mar. 8, 2008.
Coplink, “Incident Analyzer User Guide,” created Nov. 5, 2010 (as indicated by the PDF file metadata), 14 pages.
International Search Report and Written Opinion in Application No. PCT/US2009/056703 dated Mar. 15, 2010.
Notice of Allowance for U.S. Appl. No. 14/192,767 dated Apr. 20, 2015.
Notice of Allowance for U.S. Appl. No. 14/320,236 dated Jun. 29, 2016.
Notice of Allowance for U.S. Appl. No. 14/323,935 dated Oct. 1, 2015.
Notice of Allowance for U.S. Appl. No. 14/473,860 dated Feb. 27, 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/596,552 dated Dec. 23, 2016.
Notice of Allowance for U.S. Appl. No. 14/570,914 dated Jan. 31, 2017.
Notice of Allowance for U.S. Appl. No. 14/923,364 dated May 6, 2016.
Notice of Allowance for U.S. Appl. No. 14/948,009 dated May 6, 2016.
Notice of Allowance for U.S. Appl. No. 15/092,456 dated Jul. 14, 2017.
Notice of Allowance for U.S. Appl. No. 15/392,624 dated Jun. 1, 2017.
Official Communication for Australian Patent Application No. 2014202442 dated Mar. 19, 2015.
Official Communication for European Patent Application No. 14189344.6 dated Feb. 29, 2016.
Official Communication for European Patent Application No. 15155846.7 dated May 19, 2016.
Official Communication for European Patent Application No. 15166137.8 dated Sep. 14, 2015.
Official Communication for European Patent Application No. 16152984.7 dated Mar. 24, 2016.
Official Communication for Great Britain Patent Application No. 1411984.6 dated Dec. 22, 2014.
Official Communication for U.S. Appl. No. 13/831,791 dated Feb. 11, 2016.
Official Communication for U.S. Appl. No. 14/102,394 dated Mar. 27, 2014.
Official Communication for U.S. Appl. No. 14/108,187 dated Apr. 17, 2014.
Official Communication for U.S. Appl. No. 14/108,187 dated Mar. 20, 2014.
Official Communication for U.S. Appl. No. 14/135,289 dated Oct. 14, 2014.
Official Communication for U.S. Appl. No. 14/135,289 dated Apr. 16, 2014.
Official Communication for U.S. Appl. No. 14/135,289 dated Jul. 7, 2014.
Official Communication for U.S. Appl. No. 14/148,568 dated Mar. 27, 2014.
Official Communication for U.S. Appl. No. 14/148,559 dated Jun. 16, 2014.
Official Communication for U.S. Appl. No. 14/148,559 dated Apr. 2, 2014.
Official Communication for U.S. Appl. No. 14/192,767 dated Sep. 24, 2014.
Official Communication for U.S. Appl. No. 14/192,767 dated May 6, 2014.
Official Communication for U.S. Appl. No. 14/225,006 dated Dec. 21, 2015.
Official Communication for U.S. Appl. No. 14/225,084 dated Feb. 26, 2016.
Official Communication for U.S. Appl. No. 14/225,084 dated Jan. 4, 2016.
Official Communication for U.S. Appl. No. 14/225,160 dated Jan. 25, 2016.
Official Communication for U.S. Appl. No. 14/268,964 dated Jul. 11, 2014.
Official Communication for U.S. Appl. No. 14/289,596 dated Aug. 5, 2015.
Official Communication for U.S. Appl. No. 14/319,765 dated Jun. 16, 2015.
Official Communication for U.S. Appl. No. 14/306,147 dated Jun. 3, 2016.
Official Communication for U.S. Appl. No. 14/326,738 dated Jul. 31, 2015.
Official Communication for U.S. Appl. No. 14/473,860 dated Nov. 4, 2014.
Official Communication for U.S. Appl. No. 14/570,914 dated Sep. 16, 2016.
Official Communication for U.S. Appl. No. 14/570,914 dated Dec. 19, 2016.
Official Communication for U.S. Appl. No. 14/596,552 dated Oct. 5, 2016.
Official Communication for U.S. Appl. No. 14/596,552 dated Sep. 23, 2016.
Official Communication for U.S. Appl. No. 14/631,633 dated Sep. 10, 2015.
Official Communication for U.S. Appl. No. 14/696,069 dated Jul. 3, 2017.
Official Communication for U.S. Appl. No. 15/092,456 dated Nov. 4, 2016.
Official Communication for U.S. Appl. No. 15/092,456 dated Mar. 21, 2017.
Official Communication for U.S. Appl. No. 15/392,624 dated Mar. 10, 2017.
Official Communication for U.S. Appl. No. 15/397,562 dated Mar. 14, 2017.
Official Communication for U.S. Appl. No. 15/397,562 dated May 24, 2017.
Notice of Allowance for U.S. Appl. No. 14/696,069 dated Aug. 29, 2017.
Notice of Allowance for U.S. Appl. No. 15/397,562 dated Aug. 16, 2017.
“A First Look: Predicting Market Demand for Food Retail using a Huff Analysis,” TRF Policy Solutions, Jul. 2012, pp. 30.
“A Quick Guide to UniProtKB Swiss-Prot & TrEMBL,” Sep. 2011, pp. 2.
“A Word About Banks and the Laundering of Drug Money,” Aug. 18, 2012, http://www.golemxiv.co.uk/2012/08/a-word-about-banks-and-the-laundering-of-drug-money/.
“Money Laundering Risks and E-Gaming: A European Overview and Assessment,” 2009, http://www.cf.ac.uk/socsi/resources/Levi_Final_Money_Laundering_Risks_egaming.pdf.
“Potential Money Laundering Warning Signs,” snapshot taken 2003, 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.
“Using Whois Based Geolocation and Google Maps API for Support Cybercrime Investigations,” http://wseas.us/e-library/conferences/2013/Dubrovnik/TELECIRC/TELECIRC-32.pdf.
About 80 Minutes, “Palantir in a Number of Parts—Part 6—Graph,” Mar. 21, 2013, pp. 1-6, retrieved from the internet http://about80minutes.blogspot.nl/2013/03/palantir-in-number-of-parts-part-6-graph.html retrieved on Aug. 18, 2015.
Acklen, Laura, “Absolute Beginner's Guide to Microsoft Word 2003,” Dec. 24, 2003, pp. 15-18, 34-41, 308-316.
Alur et al., “Chapter 2: IBM InfoSphere DataStage Stages,” IBM InfoSphere DataStage Data Flow and Job Design, Jul. 1, 2008, pp. 35-137.
Amnet, “5 Great Tools for Visualizing Your Twitter Followers,” posted Aug. 4, 2010, http://www.amnetblog.com/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.
Gesher, Ari, “Palantir Screenshots in the Wild: Swing Sightings,” The Palantir Blog, Sep. 11, 2007, pp. 1-12, retrieved from the internet https://www.palantir.com/2007/09/palantir-screenshots/ retrieved on Aug. 18, 2015.
GIS-NET 3 Public_Department of Regional Planning. Planning & Zoning Information for Unincorporated LA County. Retrieved Oct. 2, 2013 from http://gis.planning.lacounty.gov/GIS-NET3_Public/Viewer.html.
Goswami, Gautam, “Quite Writely 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: Its 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.
Huang et al., “Systematic and Integrative Analysis of Large Gene Lists Using David Bioinformatics Resources,” Nature Protocols, 4.1, 2008, 44-57.
Huff et al., “Calibrating the Huff Model Using ArcGIS Business Analyst,” ESRI, Sep. 2008, pp. 33.
Huff, David L., “Parameter Estimation in the Huff Model,” ESRI, ArcUser, Oct.-Dec. 2003, pp. 34-36.
Kahan et al., “Annotea: an Open RDF Infrastructure for Shared Web Annotations”, Computer Networks, Elsevier Science Publishers B.V., vol. 39, No. 5, dated Aug. 5, 2002, pp. 589-608.
Keylines.com, “An Introduction to KeyLines and Network Visualization,” Mar. 2014, <http://keylines.com/wp-content/uploads/2014/03/KeyLines-White-Paper.pdf> downloaded May 12, 2014 in 8 pages.
Keylines.com, “KeyLines Datasheet,” Mar. 2014, <http://keylines.com/wp-content/uploads/2014/03/KeyLines-datasheetpdf> 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.
Nolan et al., “MCARTA: A Malicious Code Automated Run-Time Analysis Framework,” Homeland Security, 2012 IEEE Conference on Technologies for, Nov. 13, 2012, pp. 13-17.
Olanoff, Drew, “Deep Dive with the New Google Maps for Desktop with Google Earth Integration, It's More than Just a Utility,” May 15, 2013, pp. 1-6, retrieved from the internet: http://web.archive.org/web/20130515230641/http://techcrunch.com/2013/05/15/deep-dive-with-the-new-google-maps-for-desktop-with-google-earth-integration-its-more-than-just-a-utility/.
Palantir Technolgies, “Palantir Labs—Timeline,” Oct. 1, 2010, retrieved from the internet https://www.youtube.com/watch?v=JCgDW5bru9M retrieved on Aug. 19, 2015.
Palmas et al., “An Edge-Bunding Layout for Interactive Parallel Coordinates” 2014 IEEE Pacific Visualization Symposium, pp. 57-64.
Perdisci et al., “Behavioral Clustering of HTTP-Based Malware and Signature Generation Using Malicious Network Traces,” USENIX, Mar. 18, 2010, pp. 1-14.
Quest, “Toad for ORACLE 11.6—Guide to Using Toad,” Sep. 24, 2012, pp. 1-162.
Rouse, Margaret, “OLAP Cube,” <http://searchdatamanagement.techtarget.com/definition/OLAP-cube>, Apr. 28, 2012, pp. 16.
Shi et al., “A Scalable Implementation of Malware Detection Based on Network Connection Behaviors,” 2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery, IEEE, Oct. 10, 2013, pp. 59-66.
Sigrist, et al., “PROSITE, a Protein Domain Database for Functional Characterization and Annotation,” Nucleic Acids Research, 2010, vol. 38, pp. D161-D166.
Sirotkin et al., “Chapter 13: The Processing of Biological Sequence Data at NCBI,” The NCBI Handbook, Oct. 2002, pp. 1-11.
Symantec Corporation, “E-Security Begins with Sound Security Policies,” Announcement Symantec, Jun. 14, 2001.
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.
Vose et al., “Help File for ModelRisk Version 5,” 2007, Vose Software, pp. 349-353. [Uploaded in 2 Parts].
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.
Wright et al., “Palantir Technologies VAST 2010 Challenge Text Records—Investigations into Arms Dealing,” Oct. 29, 2010, pp. 1-10, retrieved from the internet http://hcil2.cs.umd.edu/newvarepository/VAST%20Challenge%202010/challenges/MC1%20-%20Investigations%20into%20Arms%20Dealing/entries/Palantir%20Technologies/ retrieved on Aug. 20, 2015.
Yang et al., “HTML Page Analysis Based on Visual Cues”, A129, pp. 859-864, 2001.
Notice of Acceptance for Australian Patent Application No. 2014250678 dated Oct. 7, 2015.
Notice of Allowance for U.S. Appl. No. 12/556,318 dated Nov. 2, 2015.
Notice of Allowance for U.S. Appl. No. 13/247,987 dated Mar. 17, 2016.
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/148,568 dated Aug. 26, 2015.
Notice of Allowance for U.S. Appl. No. 14/192,767 dated Dec. 16, 2014.
Notice of Allowance for U.S. Appl. No. 14/225,084 dated May 4, 2015.
Notice of Allowance for U.S. Appl. No. 14/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/326,738 dated Nov. 18, 2015.
Notice of Allowance for U.S. Appl. No. 14/473,552 dated Jul. 24, 2015.
Notice of Allowance for U.S. Appl. No. 14/473,860 dated Jan. 5, 2015.
Notice of Allowance for U.S. Appl. No. 14/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. 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. 14197938.5 dated Apr. 28, 2015.
Official Communication for European Patent Application No. 14199182.8 dated Mar. 13, 2015.
Official Communication for European Patent Application No. 15155845.9 dated Oct. 6, 2015.
Official Communication for European Patent Application No. 15155846.7 dated Jul. 8, 2015.
Official Communication for European Patent Application No. 15165244.3 dated Aug. 27, 2015.
Official Communication for European Patent Application No. 15175106.2 dated Nov. 5, 2015.
Official Communication for European Patent Application No. 15175151.8 dated Nov. 25, 2015.
Official Communication for European Patent Application No. 15183721.8 dated Nov. 23, 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. 1413935.6 dated Jan. 27, 2015.
Official Communication for Netherlands Patent Application No. 2012437 dated Sep. 18, 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. 28, 2014.
Official Communication for U.S. Appl. No. 12/556,318 dated Jul. 2, 2015.
Official Communication for U.S. Appl. No. 13/247,987 dated Apr. 2, 2015.
Official Communication for U.S. Appl. No. 13/247,987 dated Sep. 22, 2015.
Official Communication for U.S. Appl. No. 13/831,791 dated Mar. 4, 2015.
Official Communication for U.S. Appl. No. 13/831,791 dated Aug. 6, 2015.
Official Communication for U.S. Appl. No. 13/835,688 dated Jun. 17, 2015.
Official Communication for U.S. Appl. No. 13/839,026 dated Aug. 4, 2015.
Official Communication for U.S. Appl. No. 14/134,558 dated Oct. 7, 2015.
Official Communication for U.S. Appl. No. 14/148,568 dated Oct. 22, 2014.
Official Communication for U.S. Appl. No. 14/148,568 dated Mar. 26, 2015.
Official Communication for U.S. Appl. No. 14/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. 11, 2015.
Official Communication for U.S. Appl. No. 14/225,084 dated Sep. 2, 2014.
Official Communication for U.S. Appl. No. 14/225,084 dated Feb. 20, 2015.
Official Communication for U.S. Appl. No. 14/225,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/289,599 dated Sep. 4, 2015.
Official Communication for U.S. Appl. No. 14/294,098 dated Aug. 15, 2014.
Official Communication for U.S. Appl. No. 14/294,098 dated Nov. 6, 2014.
Official Communication for U.S. Appl. No. 14/306,138 dated Sep. 14, 2015.
Official Communication for U.S. Appl. No. 14/306,138 dated Mar. 17, 2016.
Official Communication for U.S. Appl. No. 14/306,138 dated Feb. 18, 2015.
Official Communication for U.S. Appl. No. 14/306,138 dated Sep. 23, 2014.
Official Communication for U.S. Appl. No. 14/306,138 dated Dec. 24, 2015.
Official Communication for U.S. Appl. No. 14/306,138 dated May 26, 2015.
Official Communication for U.S. Appl. No. 14/306,138 dated Dec. 3, 2015.
Official Communication for U.S. Appl. No. 14/306,147 dated Feb. 19, 2015.
Official Communication for U.S. Appl. No. 14/306,147 dated Dec. 24, 2015.
Official Communication for U.S. Appl. No. 14/306,147 dated Aug. 7, 2015.
Official Communication for U.S. Appl. No. 14/306,147 dated Sep. 9, 2014.
Official Communication for U.S. Appl. No. 14/306,154 dated Feb. 1, 2016.
Official Communication for U.S. Appl. No. 14/306,154 dated Mar. 11, 2015.
Official Communication for U.S. Appl. No. 14/306,154 dated May 15, 2015.
Official Communication for U.S. Appl. No. 14/306,154 dated Nov. 16, 2015.
Official Communication for U.S. Appl. No. 14/306,154 dated Mar. 17, 2016.
Official Communication for U.S. Appl. No. 14/306,154 dated Jul. 6, 2015.
Official Communication for U.S. Appl. No. 14/306,154 dated Sep. 9, 2014.
Official Communication for U.S. Appl. No. 14/319,765 dated Feb. 1, 2016.
Official Communication for U.S. Appl. No. 14/319,765 dated Sep. 10, 2015.
Official Communication for U.S. Appl. No. 14/319,765 dated 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 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/490,612 dated Aug. 18, 2015.
Official Communication for U.S. Appl. No. 14/504,103 dated Mar. 31, 2015.
Official Communication for U.S. Appl. No. 14/504,103 dated Feb. 5, 2015.
Official Communication for U.S. Appl. No. 14/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/639,606 dated Oct. 16, 2015.
Official Communication for U.S. Appl. No. 14/639,606 dated May 18, 2015.
Official Communication for U.S. Appl. No. 14/639,606 dated Jul. 24, 2015.
Official Communication for U.S. Appl. No. 14/645,304 dated Jan. 25, 2016.
Official Communication for U.S. Appl. No. 14/726,353 dated Sep. 10, 2015.
Official Communication for U.S. Appl. No. 14/813,749 dated Sep. 28, 2015.
Official Communication for U.S. Appl. No. 14/874,690 dated Jun. 1, 2016.
Official Communication for U.S. Appl. No. 14/874,690 dated Dec. 21, 2015.
Official Communication for U.S. Appl. No. 14/948,009 dated Feb. 25, 2016.
Restriction Requirement for U.S. Appl. No. 13/839,026 dated Apr. 2, 2015.
Related Publications (1)
Number Date Country
20170109030 A1 Apr 2017 US
Provisional Applications (1)
Number Date Country
61942540 Feb 2014 US
Continuations (1)
Number Date Country
Parent 14320236 Jun 2014 US
Child 15338842 US