US 8,917,274 B2Grant
Event matrix based on integrated data
Issue Date:2014-12-23
•20 Claims
•7 Drawing Sheets
Abstract
An event matrix may comprise labels and indicators corresponding to objects and links of an ontology. The objects and links may be determined from a plurality of data sources by a data integration system. Some of the labels may correspond to event objects, and may be arranged in a first spatial dimension at least in part on the basis of dates associated with said event objects. Other labels may correspond to non-event objects, and may be arranged in a second spatial dimension. Indicators may correspond to links between the event and non-event objects. An indicator for a particular link may be positioned with respect to the first and second spatial dimensions in accordance with the locations of the labels that correspond to the objects connected by the link.
Metadata
Assignee
- Palantir Technologies Inc.
Inventors
- Jason Ma
- Brian Lee
- Evan Minamoto
Application Information
Application Number:US 14/135,289
Filing Date:2013-12-19
Priority Date:2013-03-15
Art Unit:2616
Classifications
IPC:
G06T11/20
Patent Drawings (7 sheets)
Description
Cross Reference to Related Applications
[0001] This application claims priority to U.S. Provisional Application No. 61/798,581, entitled “EVENT MATRIX BASED ON INTEGRATED DATA,” which was filed Mar. 15, 2013 and is hereby incorporated by reference in its entirety.
Technical Field
[0002] The present disclosure relates to systems and techniques for data integration, analysis, and visualization. More specifically, it relates to visualization of connections between events and persons, places, things, etc.
Background
[0003] Computers enable the collection and storage of vast amounts of data in easily accessible databases. Patterns, connections, and other features of this data may provide valuable insights, but the volume of the information may present challenges for analysis. Visualizations may be used to overcome these challenges by representing aspects of the data in a visual manner, e.g., in a graph or diagram. Visualizations of a large data set may be substantially more intuitive and useful than, e.g., a textual representation of the underlying data or a set of statistics drawn from the data.
[0004] Like other aspects of large-scale data analysis, producing visualizations may be challenging when the input data is not uniformly structured. Inconsistent structure is particularly common in data drawn from many different sources, which people are increasingly interested in analyzing. Data integration platforms have been created to combine data from different sources for the purpose of analysis, but the visualization functionality they provide may be limited.
[0005] A visualization that is useful for drawing insights from one data set may not be useful for drawing insights from another data set. Therefore, some platforms may support a variety of different visualizations. Each type of visualization may have unique limitations. For example, certain visualizations may be useful for analyzing only a few specific kinds of data. Other visualizations may be useful for trained analysts following specific lines of inquiry, but may not be useful for lay persons needing an intuitive overview of relevant information. There is a need for visualizations that overcome these limits, with broad utility and intuitive readability.
Summary
[0006] Embodiments described herein may be used to produce visualizations that depict connections between objects from an integrated data set. A visualization of this sort may be organized chronologically, and may be referred to as an “event matrix.”
[0007] In one embodiment, a system for generating visualizations of integrated data comprises at least one processor, and data storage comprising instructions executable by the processor. When executed, the instructions may cause the system to receive input data from a plurality of data sources and determine a set of objects from the input data based on an ontology comprising a plurality of object types. The system may store the objects in one or more databases. The system may also identify a first subset of the determined set of objects, wherein the first subset comprises event objects; identify a second subset of the determined set of objects, wherein the second subset of objects comprises non-event objects; and identify a set of links between objects in the first subset and objects in the second subset. In addition, the system may generate first labels corresponding to the objects in the first subset, second labels corresponding to the objects in the second subset, and indicators corresponding to links in the set of links. The system may arrange the first labels in a first spatial dimension, wherein an order of the arranged first labels is based at least in part on dates and/or times associated with the event objects in the first subset; arrange the second labels in a second spatial dimension; and present a visualization comprising the labels and the indicators. Within the visualization, each indicator may have a location corresponding in the first spatial dimension to a position of one of the first labels and corresponding in the second spatial dimension to a position of one of the second labels.
[0008] In another embodiment, a method for generating visualizations of integrated data comprises receiving input data from a plurality of sources and determining a set of objects from the input data based on an ontology comprising a plurality of object types. The method further comprises identifying a first subset of the determined set of objects (wherein at least some of the objects in the first subset are associated with dates), identifying a second subset of the determined set of objects, and identifying (by a computer system having at least one computer processor) a set of links between objects in the first subset and objects in the second subset. The method also comprises determining (by the computer system) first labels corresponding to the objects in the first subset and second labels corresponding to the objects in the second subset, and generating (by the computer system) a user interface. The user interface may comprise the first labels arranged in a first spatial dimension, based at least in part on dates associated with respective objects in the first subset. The user interface may also comprise the second labels arranged in a second spatial dimension. For each link in the set of links, the user interface may further comprise an indicator positioned at a location corresponding in the first spatial dimension to a first label associated with the respective link and corresponding in the second spatial dimension to a second label associated with the respective link. As noted above, this method may be performed using one or more computer processors.
[0009] In another embodiment, non-transitory computer storage may comprise instructions for causing a computer system to generate visualizations of integrated data, as follows. The storage may comprise instructions for receiving input data from a plurality of data sources and determining a set of objects from the input data based on an ontology comprising a plurality of object types. Further instructions may be included for identifying a first subset of the determined set of objects (wherein at least some of the objects of the first subset are associated with dates), identifying a second subset of the determined set of objects, and identifying a set of links between objects in the first subset and objects in the second subset. Instructions may also be provided for determining first labels corresponding to the objects in the first subset, second labels corresponding to the objects in the second subset, and indicators corresponding to links in the set of links. In addition, instructions may be provided for arranging the first labels in a first spatial dimension and arranging the second labels in a second spatial dimension. The arrangement of the first labels may be based in part on the dates associated with the objects in the first subset. Finally, the computer storage may include instructions for presenting a visualization comprising the labels and the indicators, wherein each of the indicators has a location corresponding in the first spatial dimension to a position of one of the first labels and corresponding in the second spatial dimension to a position of one of the second labels.
Brief Description of the Drawings
[0010] FIG. 1 illustrates a sample of an event matrix.
[0011] FIG. 2 illustrates one embodiment of a database system using an ontology.
[0012] FIG. 3 illustrates one embodiment of a system for creating data in a data store using a dynamic ontology.
[0013] FIG. 4 illustrates a sample user interface using relationships described in a data store using a dynamic ontology.
[0014] FIG. 5 illustrates one embodiment of a process for creating an event matrix.
[0015] FIG. 6 illustrates a computer system with which certain methods discussed herein may be implemented.
Detailed Description of Specific Embodiments
Overview
[0016] Data integration platforms may support data with widely varying form and content. Accordingly, visualizations that require overly specific inputs may have limited utility on such platforms. However, certain features may be common enough in integrated data sets that a visualization can rely on them without substantially constraining its usefulness.
[0017] Common features of integrated data sets include connections between various pieces of data. In general, integrated data sets are integrated for a reason. Specifically, data from multiple sources is likely to be integrated because a person believes that various pieces of the data are somehow related. In other words, the person believes that connections exist within the data. Such connections may be identified explicitly with the help of the integration platform.
[0018] In addition to connections, integrated data sets commonly include date and time information (referred to hereafter as “dates” for the sake of brevity). The prevalence of dates in integrated data sets may be a result of the fact that these data sets often record occurrences in the real world. Real-world occurrences necessarily happen on particular dates, and dates are easy to ascertain automatically at the time of an occurrence. Therefore, records of real-world occurrences, and the integrated data sets that contain such records, routinely include dates.
[0019] Dates also provide a useful basis for organization. They provide a frame of reference that all people are familiar with. As a result, a visualization that is organized chronologically accordingly to a sequence of dates many be simple to understand, even for people who lack specialized training or prior familiarity with the subject matter being visualized.
[0020] An event matrix is a visualization that may be organized chronologically and used to present connections between objects from an integrated data set. It may be generated from any set of data objects with dates and connections. Because of its organization and minimal input requirements, the event matrix is broadly useful and intuitively readable.
[0021] FIG. 1 depicts an example of an event matrix. The matrix includes rows and columns with labels corresponding to particular objects. For example, label 102 corresponds to a “flight” object, and label 104 corresponds to a “person” object. At the intersection of certain rows and columns, indicators may be provided to indicate that a connection exists between the object associated with the row and the object associated with the column. For example, indicator 106 indicates that a connection exists between the flight object designated by label 102 and the person object designated by label 104. Of course, these data objects may correspond, respectively, to an actual flight and an actual person in the real world. Accordingly, the aforementioned connection may exist because the actual person (Person 3, as indicated by label 104) took the actual flight (on 12/25/11, as indicated by label 102).
[0022] The event matrix may be useful in part because it facilitates recognition of correlations and indirect connections between several objects. For example, while Person 1 and Person 2 are not directly connected in FIG. 1 , they are indirectly connected through Person 3, who shared a phone call with Person 2 on 12/26/11, and shared a payment with Person 1 on 3/2/12. The event matrix makes it easy to identify indirect connections like this, simply by “connecting the dots,” where the dots are indicators of links between objects. Similarly, a correlation might be identified, e.g., where calls between a first person and a second person are consistently followed by payments between the second person and a third person. In a scenario like this, the same geometric pattern of indicators would repeat itself multiple times within the event matrix, making the correlation relatively easy to identify.
[0023] The connections that are represented by indicators in the event matrix may be stored as links within an integrated data set. As described below, these links may be part of an ontology that includes various link types. In some cases, the existence of a particular link may be specified explicitly within a source of input data. In other cases, the integration platform may be configured to infer the existence of particular links based on a set of rules, which may be customizable. The integration platform may also make inferences in order to determine when the same object is involved in multiple relationships across multiple data sources. For example, if a person listed in a database of payment records and a person listed in a database of flight records both share the same name and date of birth, the integration platform may infer that they are the same person. Then, if the integration platform creates a link for one of the payment records and a link for one of the flight records, it may associate both link objects with the same person object. This way, all links involving the same person (or other entity) may be consolidated, and among other things, displayed in the same area of the event matrix.
[0024] As depicted in FIG. 1 , the objects corresponding to each column label may be event objects (“events”), and the objects corresponding to each row label may be non-event objects (“non-events”). Events are described in greater detail below, as are objects and object types more generally. Notably, events may be associated with specific dates or date ranges. As described earlier, dates provide an intuitive basis for organization, so the columns in an event matrix may be organized chronologically according to the dates associated with the each event. In some cases, the dates associated with an event may be unknown or incorrect, so the order may be adjusted manually by a user. For example, a user may reorder events by dragging one or more of the columns to a new position relative to the other columns in the matrix, e.g., using a computer mouse or a touch-sensitive display screen. Similarly, a user may reorder non-events by dragging one or more rows.
[0025] The scope of the present disclosure is not limited to event matrices with any particular formatting or aesthetic features. Specifically, the formatting and aesthetic features of FIG. 1 are merely illustrative. For example, labels for different objects or object types may have different icons, as shown in FIG. 1 . In some embodiments, however, some or all labels may not include any icons. Labels may be determined from properties, links, or other parts of an ontology. Labels may be customized and updated by a user. The user may also specify rules for generating labels based on information in the ontology, and rules may be applied selectively based on relevant criteria. For example, different rules may be provided for different object types. Additionally, while the link indicators discussed herein are depicted as circles, any other type of indicator may be used. Additionally, different types of indicators may be used to illustrate different correlations of event and non-event objects. Thus, a first association between a person and a call may be represented on an event matrix with a first indicator, while an association between a person and a flight may be associated with a second, different, indicator.
[0026] Indicators or indications of inter-object connections may vary, and need not bear any particular similarity to the indicators of FIG. 1 . An event matrix may be flipped, rotated, scaled, or otherwise rearranged, e.g., so that events correspond to rows rather than columns. Accordingly, objects in the event matrix may be arranged in spatial dimensions other than those illustrated in FIG. 1 . In addition to formatting and aesthetic features that are automatically generated, some aspects of an event matrix's appearance may be manually specified by a user. For example, a user may specify a particular background color for one or more rows, objects or property types, columns, time ranges, or cells, which may be useful for focusing a reader's attention. Labels, including both icons and text, may be specified manually as well.
[0027] Additional considerations and techniques relevant to the generation of event matrices are described below.
Definitions
[0028] In order to facilitate an understanding of the systems and methods discussed herein, a number of terms are defined below. The terms defined below, as well as other terms used herein, should be construed to include the provided definitions, the ordinary and customary meaning of the terms, and/or any other implied meaning for the respective terms. Thus, the definitions below do not limit the meaning of these terms, but only provide exemplary definitions.
[0029] Ontology: Stored information that provides a data model for storage of data in one or more databases. For example, the stored data may comprise definitions for object types and property types for data in a database, and how objects and properties may be related.
[0030] Database: A broad term for any data structure for storing and/or organizing data, including, but not limited to, relational databases (Oracle database, mySQL database, etc.), spreadsheets, XML files, and text file, among others.
[0031] Data Object or Object: A data container for information representing specific things in the world that have a number of definable properties. For example, a data object can represent an entity such as a person, a place, an organization, a market instrument, or other noun. A data object can represent an event that happens at a point in time or for a duration. A data object can represent a document or other unstructured data source such as an e-mail message, a news report, or a written paper or article. Each data object may be associated with a unique identifier that uniquely identifies the data object. The object's attributes (e.g. metadata about the object) may be represented in one or more properties.
[0032] Object Type: Type of a data object (e.g., Person, Event, or Document). Object types may be defined by an ontology and may be modified or updated to include additional object types. An object definition (e.g., in an ontology) may include how the object is related to other objects, such as being a sub-object type of another object type (e.g. an agent may be a sub-object type of a person object type), and the properties the object type may have.
[0033] Properties: Attributes of a data object that represent individual data items. At a minimum, each property of a data object has a property type and a value or values.
[0034] Property Type: The type of data a property is, such as a string, an integer, or a double. Property types may include complex property types, such as a series data values associated with timed ticks (e.g. a time series), etc.
[0035] Property Value: The value associated with a property, which is of the type indicated in the property type associated with the property. A property may have multiple values.
[0036] Link: A connection between two data objects, based on, for example, a relationship, an event, and/or matching properties. Links may be directional, such as one representing a payment from person A to B, or bidirectional.
[0037] Link Set: Set of multiple links that are shared between two or more data objects.
Object Centric Data Model
[0038] To provide a framework for the following discussion of specific systems and methods described herein, an example database system 210 using an ontology 205 will now be described. This description is provided for the purpose of providing an example and is not intended to limit the techniques to the example data model, the example database system, or the example database system's use of an ontology to represent information.
[0039] In one embodiment, a body of data is conceptually structured according to an object-centric data model represented by ontology 205. The conceptual data model is independent of any particular database used for durably storing one or more database(s) 209 based on the ontology 205. For example, each object of the conceptual data model may correspond to one or more rows in a relational database or an entry in Lightweight Directory Access Protocol (LDAP) database, or any combination of one or more databases.
[0040] FIG. 2 illustrates an object-centric conceptual data model according to an embodiment. An ontology 205, as noted above, may include stored information providing a data model for storage of data in the database 209. The ontology 205 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, data object 201 is a container for information representing things in the world. For example, data object 201 can represent an entity such as a person, a place, an organization, a market instrument, or other noun. Data object 201 can represent an event that happens at a point in time or for a duration. Data object 201 can represent a document or other unstructured data source such as an e-mail message, a news report, or a written paper or article. Each data object 201 is associated with a unique identifier that uniquely identifies the data object within the database system.
[0041] Different types of data objects may have different property types. For example, a “Person” data object might have an “Eye Color” property type and an “Event” data object might have a “Date” property type. Each property 203 as represented by data in the database system 210 may have a property type defined by the ontology 205 used by the database 209.
[0042] Objects may be instantiated in the database 209 in accordance with the corresponding object definition for the particular object in the ontology 205. 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 3/27/2009 (e.g., a property of type “date”) may be stored in the database 209 as an event object with associated currency and date properties as defined within the ontology 205.
[0043] The data objects defined in the ontology 205 may support property multiplicity. In particular, a data object 201 may be allowed to have more than one property 203 of the same property type. For example, a “Person” data object might have multiple “Address” properties or multiple “Name” properties.
[0044] Each link 202 represents a connection between two data objects 201. In one embodiment, the connection is either through a relationship, an event, or through matching properties. A relationship connection may be asymmetrical or symmetrical. For example, “Person” data object A may be connected to “Person” data object B by a “Child Of” relationship (where “Person” data object B has an asymmetric “Parent Of” relationship to “Person” data object A), a “Kin Of” symmetric relationship to “Person” data object C, and an asymmetric “Member Of” relationship to “Organization” data object X. The type of relationship between two data objects may vary depending on the types of the data objects. For example, “Person” data object A may have an “Appears In” relationship with “Document” data object Y or have a “Participate In” relationship with “Event” data object E. As an example of an event connection, two “Person” data objects may be connected by an “Airline Flight” data object representing a particular airline flight if they traveled together on that flight, or by a “Meeting” data object representing a particular meeting if they both attended that meeting. In one embodiment, when two data objects are connected by an event, they are also connected by relationships, in which each data object has a specific relationship to the event, such as, for example, an “Appears In” relationship.
[0045] As an example of a matching properties connection, two “Person” data objects representing a brother and a sister, may both have an “Address” property that indicates where they live. If the brother and the sister live in the same home, then their “Address” properties likely contain similar, if not identical property values. In one embodiment, a link between two data objects may be established based on similar or matching properties (e.g., property types and/or property values) of the data objects. These are just some examples of the types of connections that may be represented by a link and other types of connections may be represented; embodiments are not limited to any particular types of connections between data objects. For example, a document might contain references to two different objects. For example, a document may contain a reference to a payment (one object), and a person (a second object). A link between these two objects may represent a connection between these two entities through their co-occurrence within the same document.
[0046] Each data object 201 can have multiple links with another data object 201 to form a link set 204. For example, two “Person” data objects representing a husband and a wife could be linked through a “Spouse Of” relationship, a matching “Address” property, and one or more matching “Event” properties (e.g., a wedding). Each link 202 as represented by data in a database may have a link type defined by the database ontology used by the database.
[0047] FIG. 3 is a block diagram illustrating exemplary components and data that may be used in identifying and storing data according to an ontology. In this example, the ontology may be configured, and data in the data model populated, by a system of parsers and ontology configuration tools. In the embodiment of FIG. 3 , input data 300 is provided to parser 302. The input data may comprise data from one or more sources. For example, an institution may have one or more databases with information on credit card transactions, rental cars, and people. The databases may contain a variety of related information and attributes about each type of data, such as a “date” for a credit card transaction, an address for a person, and a date for when a rental car is rented. The parser 302 is able to read a variety of source input data types and determine which type of data it is reading.
[0048] In accordance with the discussion above, the example ontology 205 comprises stored information providing the data model of data stored in database 209, and the ontology is defined by one or more object types 310, one or more property types 316, and one or more link types 330. Based on information determined by the parser 302 or other mapping of source input information to object type, one or more data objects 201 may be instantiated in the database 209 based on respective determined object types 310, and each of the objects 201 has one or more properties 203 that are instantiated based on property types 316. Two data objects 201 may be connected by one or more links 202 that may be instantiated based on link types 330. The property types 316 each may comprise one or more data types 318, such as a string, number, etc. Property types 316 may be instantiated based on a base property type 320. For example, a base property type 320 may be “Locations” and a property type 316 may be “Home.”
[0049] In an embodiment, a user of the system uses an object type editor 324 to create and/or modify the object types 310 and define attributes of the object types. In an embodiment, a user of the system uses a property type editor 326 to create and/or modify the property types 316 and define attributes of the property types. In an embodiment, a user of the system uses link type editor 328 to create the link types 330. Alternatively, other programs, processes, or programmatic controls may be used to create link types and property types and define attributes, and using editors is not required.
[0050] In an embodiment, creating a property type 316 using the property type editor 326 involves defining at least one parser definition using a parser editor 322. A parser definition comprises metadata that informs parser 302 how to parse input data 300 to determine whether values in the input data can be assigned to the property type 316 that is associated with the parser definition. In an embodiment, each parser definition may comprise a regular expression parser 304A or a code module parser 304B. In other embodiments, other kinds of parser definitions may be provided using scripts or other programmatic elements. Once defined, both a regular expression parser 304A and a code module parser 304B can provide input to parser 302 to control parsing of input data 300.
[0051] Using the data types defined in the ontology, input data 300 may be parsed by the parser 302 to determine which object type 310 should receive data from a record created from the input data, and which property types 316 should be assigned to data from individual field values in the input data. Based on object-property mapping 301, the parser 302 selects one of the parser definitions that is associated with a property type in the input data. The parser parses an input data field using the selected parser definition, resulting in creating new or modified data 303. The new or modified data 303 is added to the database 209 according to ontology 205 by storing values of the new or modified data in a property of the specified property type. As a result, input data 300 having varying format or syntax can be created in database 209. The ontology 205 may be modified at any time using object type editor 324, property type editor 326, and link type editor 328, or under program control without human use of an editor. Parser editor 322 enables creating multiple parser definitions that can successfully parse input data 300 having varying format or syntax and determine which property types should be used to transform input data 300 into new or modified input data 303.
[0052] The properties, objects, and the links (e.g. relationships) between the objects can be visualized using a graphical user interface (GUI). For example, FIG. 4 displays a user interface showing a graph representation 403 of relationships (including relationships or links 404, 405, 406, 407, 408) between the data objects (including data objects 411, 412, 413, 414, 415, 416) that are represented as nodes in the example of FIG. 4 . In this embodiment, the data objects are person objects. In this example, the person nodes (associated with person data objects) may have relationships to other person nodes, for example, through payment objects. For example, relationship 404 is based on a payment associated with the individuals indicated in person data objects 411 and 413. The link 404 represents these shared payments (for example, the individual associated with data object 411 may have paid the individual associated with data object 413 on three occasions). These relationships may be stored as links, or in some embodiments, as properties, where a relationship may be detected between the properties. In some cases, as stated above, the links may be directional. For example, a payment link may have a direction associated with the payment, where one person object is a receiver of a payment, and another person object is the payer of payment.
[0053] In addition to visually showing relationships between the data objects, the user interface may allow various other manipulations. For example, the objects within database 108 may be searched using a search interface 420 (e.g., text string matching of object properties), inspected (e.g., properties and associated data viewed), 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.
Example Method of Generating Event Matrix
[0054] As described earlier in this disclosure, an event matrix is a particularly useful and intuitive type of visualization for integrated data. An example of an event matrix was previously presented in FIG. 1 . Turning now to FIG. 5 , an example process is presented for generating an event matrix. This process may be implemented, e.g., by a data integration platform comprising a computer system that includes the data and components of FIG. 3 . Additional disclosure related to computer systems is provided below, with respect to FIG. 6 . The process of FIG. 5 begins at block 502, where input data is received. This input data may correspond to, e.g., input data 300 of FIG. 3 . At block 504, an ontology is applied to the input data, providing an integrated interface to facilitate further analysis. This ontology may correspond to, e.g., ontology 205 of FIGS. 2 and 3 .
[0055] Continuing at block 506, events and non-event objects are identified from the ontology. Objects from the ontology may be identified based on selection by a user, e.g., using the interface of FIG. 4 . The interface may include a button, menu item, hotkey, or other means for the user to request generation of an event matrix based on the selected objects. In one example, selected objects may be dragged into a designated area to create a new event matrix, or they may be dragged into an existing matrix, which may be updated to include the selected items. Objects may also be identified automatically, in addition to or instead of being selected manually. For example, if a user presses a button to create an event matrix without selecting any objects, the event matrix may include all objects that are currently visible on the user's display, or all visible objects plus all objects that are linked to the visible objects. In certain embodiments, some of the selected objects may be excluded, e.g., based on criteria related to compatibility with an event matrix or with each other. For example, a selected object may be excluded if it is part of an object type that does not include date or time information, and if it is not connected to an object that includes date or time information.
[0056] At block 508, links between events and other objects are identified. These links may correspond to, e.g., link 202 of FIGS. 2 and 3 . A link may be determined from any association, connection, or relationship that is included explicitly or implicitly in the ontology. Some or all of the identified links may be created for the first time during the process of FIG. 5 . Any means of establishing links between objects may be used.
[0057] At block 510, an event matrix user interface, configured for display on an electronic display device and/or for printing on paper, is generated. In one embodiment, the user interface includes labels associated with each identified object and link indicators indicating links between objects. The labels and indicators may be arranged at least in part on the basis of dates and/or times associated with the events. If an event has no date or time information, it may appear at the end of the event matrix.
[0058] The arranged labels and indicators may be combined with various formatting, styling, and other aesthetic features in order to form a completed event matrix, such as the matrix of FIG. 1 . In some embodiments, one or more rows, columns, cells, labels or indicators may be highlighted. Highlighting may be added automatically, based on customizable rules, or on an ad hoc basis. In one embodiment, a user may add an object to the event matrix by dragging it from graph representation 403 of FIG. 4 . The completed event matrix may be displayed, printed, transmitted, or otherwise presented to one or more users and/or readers.
Implementation Mechanisms
[0059] According to one embodiment, the techniques described herein are implemented by one or more special-purpose computing devices. The special-purpose computing devices may be hard-wired to perform the techniques, or may include digital electronic devices such as one or more application-specific integrated circuits (ASICs) or field programmable gate arrays (FPGAs) that are persistently programmed to perform the techniques, or may include one or more general purpose hardware processors programmed to perform the techniques pursuant to program instructions in firmware, memory, other storage, or a combination. Such special-purpose computing devices may also combine custom hard-wired logic, ASICs, or FPGAs with custom programming to accomplish the techniques. The special-purpose computing devices may be desktop computer systems, server computer systems, portable computer systems, handheld devices, networking devices or any other device or combination of devices that incorporate hard-wired and/or program logic to implement the techniques.
[0060] Computing device(s) are generally controlled and coordinated by operating system software, such as iOS, Android, Chrome OS, Windows XP, Windows Vista, Windows 7, Windows 8, Windows Server, Windows CE, Unix, Linux, SunOS, Solaris, iOS, Blackberry OS, VxWorks, or other compatible operating systems. In other embodiments, the computing device may be controlled by a proprietary operating system. Conventional operating systems control and schedule computer processes for execution, perform memory management, provide file system, networking, I/O services, and provide a user interface functionality, such as a graphical user interface (“GUI”), among other things.
[0061] For example, FIG. 6 is a block diagram that illustrates a computer system 600 upon which an embodiment may be implemented. Computer system 600 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.
[0062] Computer system 600 also includes a main memory 606, such as a random access memory (RAM), cache and/or other dynamic storage devices, coupled to bus 602 for storing information and instructions to be executed by processor 604. Main memory 606 also may be used for storing temporary variables or other intermediate information during execution of instructions to be executed by processor 604. Such instructions, when stored in storage media accessible to processor 604, render computer system 600 into a special-purpose machine that is customized to perform the operations specified in the instructions.
[0063] Computer system 600 further includes a read only memory (ROM) 608 or other static storage device coupled to bus 602 for storing static information and instructions for processor 604. A storage device 610, such as a magnetic disk, optical disk, or USB thumb drive (Flash drive), etc., is provided and coupled to bus 602 for storing information and instructions.
[0064] Computer system 600 may be coupled via bus 602 to a display 612, such as a cathode ray tube (CRT) or LCD display (or touch screen), for displaying information to a computer user. An input device 614, including alphanumeric and other keys, is coupled to bus 602 for communicating information and command selections to processor 604. Another type of user input device is cursor control 616, such as a mouse, a trackball, or cursor direction keys for communicating direction information and command selections to processor 604 and for controlling cursor movement on display 612. This input device typically has two degrees of freedom in two axes, a first axis (e.g., x) and a second axis (e.g., y), that allows the device to specify positions in a plane. In some embodiments, the same direction information and command selections as cursor control may be implemented via receiving touches on a touch screen without a cursor.
[0065] Computing system 600 may include a user interface module to implement a GUI that may be stored in a mass storage device as executable software codes that are executed by the computing device(s). This and other modules may include, by way of example, components, such as software components, object-oriented software components, class components and task components, processes, functions, attributes, procedures, subroutines, segments of program code, drivers, firmware, microcode, circuitry, data, databases, data structures, tables, arrays, and variables.
[0066] In general, the word “module,” as used herein, refers to logic embodied in hardware or firmware, or to a collection of software instructions, possibly having entry and exit points, written in a programming language, such as, for example, Java, Lua, C or C++. A software module may be compiled and linked into an executable program, installed in a dynamic link library, or may be written in an interpreted programming language such as, for example, BASIC, Perl, or Python. It will be appreciated that software modules may be callable from other modules or from themselves, and/or may be invoked in response to detected events or interrupts. Software modules configured for execution on computing devices may be provided on a computer readable medium, such as a compact disc, digital video disc, flash drive, 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. The modules or computing device functionality described herein are preferably implemented as software modules, but may be represented in hardware or firmware. Generally, the modules described herein refer to logical modules that may be combined with other modules or divided into sub-modules despite their physical organization or storage
[0067] Computer system 600 may implement the techniques described herein using customized hard-wired logic, one or more ASICs or FPGAs, firmware and/or program logic which in combination with the computer system causes or programs computer system 600 to be a special-purpose machine. According to one embodiment, the techniques herein are performed by computer system 600 in response to processor(s) 604 executing one or more sequences of one or more instructions contained in main memory 606. Such instructions may be read into main memory 606 from another storage medium, such as storage device 610. Execution of the sequences of instructions contained in main memory 606 causes processor(s) 604 to perform the process steps described herein. In alternative embodiments, hard-wired circuitry may be used in place of or in combination with software instructions.
[0068] 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.
[0069] 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.
[0070] Various forms of media may be involved in carrying one or more sequences of one or more instructions to processor 604 for execution. For example, the instructions may initially be carried on a magnetic disk or solid state drive of a remote computer. The remote computer can load the instructions into its dynamic memory and send the instructions over a telephone line using a modem. A modem local to computer system 600 can receive the data on the telephone line and use an infra-red transmitter to convert the data to an infra-red signal. An infra-red detector can receive the data carried in the infra-red signal and appropriate circuitry can place the data on bus 602. Bus 602 carries the data to main memory 606, from which processor 604 retrieves and executes the instructions. The instructions received by main memory 606 may optionally be stored on storage device 610 either before or after execution by processor 604.
[0071] Computer system 600 also includes a communication interface 618 coupled to bus 602. Communication interface 618 provides a two-way data communication coupling to a network link 620 that is connected to a local network 622. For example, communication interface 618 may be an integrated services digital network (ISDN) card, cable modem, satellite modem, or a modem to provide a data communication connection to a corresponding type of telephone line. As another example, communication interface 618 may be a local area network (LAN) card to provide a data communication connection to a compatible LAN (or WAN component to communicated with a WAN). Wireless links may also be implemented. In any such implementation, communication interface 618 sends and receives electrical, electromagnetic or optical signals that carry digital data streams representing various types of information.
[0072] Network link 620 typically provides data communication through one or more networks to other data devices. For example, network link 620 may provide a connection through local network 622 to a host computer 624 or to data equipment operated by an Internet Service Provider (ISP) 626. ISP 626 in turn provides data communication services through the world wide packet data communication network now commonly referred to as the “Internet” 628. Local network 622 and Internet 628 both use electrical, electromagnetic or optical signals that carry digital data streams. The signals through the various networks and the signals on network link 620 and through communication interface 618, which carry the digital data to and from computer system 600, are example forms of transmission media.
[0073] Computer system 600 can send messages and receive data, including program code, through the network(s), network link 620 and communication interface 618. In the Internet example, a server 630 might transmit a requested code for an application program through Internet 628, ISP 626, local network 622 and communication interface 618.
[0074] The received code may be executed by processor 604 as it is received, and/or stored in storage device 610, or other non-volatile storage for later execution.
[0075] Each of the processes, methods, and algorithms described in the preceding sections may be embodied in, and fully or partially automated by, code modules executed by one or more computer systems or computer processors comprising computer hardware. The processes and algorithms may be implemented partially or wholly in application-specific circuitry.
[0076] 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.
[0077] 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.
[0078] Any process descriptions, elements, or blocks in the flow diagrams described herein and/or depicted in the attached figures should be understood as potentially representing modules, segments, or portions of code which include one or more executable instructions for implementing specific logical functions or steps in the process. Alternate implementations are included within the scope of the embodiments described herein in which elements or functions may be deleted, executed out of order from that shown or discussed, including substantially concurrently or in reverse order, depending on the functionality involved, as would be understood by those skilled in the art.
[0079] 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
Certificate of Correction present
The claims shown below may not include correction changes. Use the corrected PDF for authoritative text.
What is claimed is:
1. A system for generating visualizations of integrated data, the system comprising:
at least one computer processor,
data storage comprising instructions executable by the computer processor to cause the system to:
receive input data from a plurality of data sources;
present a graph visualization of one or more objects in a database, the one or more objects in the database each having an object type specified by an ontology comprising a plurality of object types;
receive input, via the graph visualization, from a user indicating a user selection of a set of objects;
determine the set of objects from the input data based on the ontology and the user selection of the set of objects;
identify a first subset of the determined set of objects, wherein the first subset comprises event objects, the first subset comprising a plurality of objects, the plurality of objects comprising objects of at least two distinct event types;
identify a second subset of the determined set of objects, wherein the second subset of objects comprises non-event objects, the first set of objects and the second set of objects having no overlapping objects;
identify a set of preexisting links between objects in the first subset and objects in the second subset, each link of the set of preexisting links representing relationship between an event object in the first subset, and a non-event object in the second subset;
generate first event labels corresponding to the objects in the first subset, the first event labels comprising labels for at least two distinct types of events, second non-event labels corresponding to the objects in the second subset, and indicators corresponding to links in the set of links;
arrange the first labels in a first spatial dimension, wherein an order of the arranged first labels is based at least in part on dates and/or times associated with the event objects in the first subset;
arrange the second labels in a second spatial dimension; and
present a matrix visualization of the set of objects indicated by the user selection, the matrix visualization distinct from the graph visualization, the matrix visualization comprising the labels and the indicators, wherein each of the indicators has a location corresponding in the first spatial dimension to a position of one of the first event labels and corresponding in the second spatial dimension to a position of one of the second non-event labels,
wherein the first spatial dimension is orthogonal to the second spatial dimension,
wherein each of the indicators are positioned within the matrix visualization to indicate a link in the set of links between an event labeled in the first spatial dimension and a non-event labeled in in the second spatial dimension,
wherein a lack of indicator is presented in the matrix if no link exists in the set of links between an second event labeled in the first spatial dimension and a second non-event labeled in in the second spatial dimension.
2. The system of claim 1, wherein at least one of the event objects corresponds to an economic transaction or communication.
3. The system of claim 1, wherein at least one of the non-event objects corresponds to a person or place.
4. The system of claim 1, wherein at least some of the first labels and the second labels are determined from properties of objects in the first and second determined set of objects.
5. The system of claim 1, wherein the first labels are arranged in a series of rows and the second labels are arranged in a series of columns.
6. The system of claim 5, wherein the matrix visualization is presented via an interactive user interface configured to enable a user to rearrange at least some of the rows or columns of the matrix visualization.
7. The system of claim 1, wherein the first labels are arranged in a series of columns and the second labels are arranged in a series of rows.
8. The system of claim 1, wherein the matrix visualization is presented via an interactive user interface configured to enable a user to change one or more colors associated with portions of the matrix visualization.
9. A method for generating visualizations of integrated data, the method comprising:
receiving input data from a plurality of data sources;
presenting a graph visualization of one or more objects in a database, the one or more objects in the database each having an object type specified by an ontology comprising a plurality of object types;
receiving input, via the graph visualization, from a user indicating a user selection of a set of objects;
determining the set of objects from the input data based on the ontology and the user selection of the set of objects;
identifying a first subset of the determined set of objects, wherein at least some of the objects in the first subset are associated with dates, the first subset comprising plurality of objects, the plurality of objects comprising objects of at least two distinct event types;
identifying a second subset of the determined set of objects, wherein the second subset of objects comprises non-event objects, the first set of objects and the second set of objects having no overlapping objects;
identifying, by a computer system having at least one computer processor, a set of preexisting links between objects in the first subset and objects in the second subset, each link of the set of preexisting links representing a relationship between an event object in the first subset, and a non-event object in the second subset;
determining, by the computer system, first event labels corresponding to the objects in the first subset, the first event labels comprising labels for at least two distinct types of events, second non-event labels corresponding to the objects in the second subset, and indicators corresponding to links in the set of links;
generating, by the computer system, a user interface comprising:
the first labels arranged in a first spatial dimension, wherein the arrangement is based at least in part on dates associated with respective objects in the first subset; and
the second labels arranged in a second spatial dimension;
presenting a matrix visualization of the set of objects indicated by the user selection, the matrix visualization distinct form the graph visualization the matrix visualization comprising the first labels, the second labels, and the indicators, wherein each of the indicators are positioned at a location corresponding in the first spatial dimension to a first event label associated with the respective link and corresponding in the second spatial dimension to a second non-event label associated with the respective link,
wherein the first spatial dimension is orthogonal to the second spatial dimension,
wherein each of the indicators are positioned within the matrix visualization to indicate a link in the set of links between an event labeled in the first spatial dimension and a non-event labeled in in the second spatial dimension,
wherein a lack of indicator is presented in the matrix if no link exists in the set of links between an second event labeled in the first spatial dimension and a second non-event labeled in in the second spatial dimension.
10. The method of claim 9, wherein at least one of the objects in the first subset is associated with a range of dates.
11. The method of claim 9, wherein at least some of the first labels and the second labels are determined from properties of objects in the first determined set of objects.
12. The method of claim 9, wherein the first labels are arranged in a series of rows and the second labels are arranged in a series of columns.
13. The method of claim 9, wherein the user interface is configured to enable a user to rearrange at least some of the labels and indicators.
14. The method of claim 9, wherein the user interface is configured to enable a user to change one or more colors associated with portions of the user interface.
15. Non-transitory computer storage comprising instructions for causing a computer system to generate visualizations of integrated data by:
receiving input data from a plurality of data sources;
presenting a graph visualization of one or more objects in a database, the one or more objects in the database each having an object type specified by an ontology comprising a plurality of object types;
receiving input, via the graph visualization, from a user indicating a user selection of a set of objects;
determining the set of objects from the input data based on the ontology and the user selection of the set of objects;
identifying a first subset of the determined set of objects, wherein at least some of the objects of the first subset are associated with dates, the first subset comprising a plurality of objects, the plurality of objects comprising objects of at least two distinct event types;
identifying a second subset of the determined set of objects, wherein the second subset of objects comprises non-event objects, the first set of objects and the second set of objects having no overlapping objects;
identifying a set of preexisting links between objects in the first subset and objects in the second subset, each link of the set of preexisting links representing a relationship between an event object in the first subset, and a non-event object in the second subset;
generating first event labels corresponding to the objects in the first subset, the first event labels comprising labels for at least two distinct types of events, second non-event labels corresponding to the objects in the second subset, and indicators corresponding to links in the set of links;
arranging the first labels in a first spatial dimension, wherein the order of the arranged first labels is based at least in part on the dates associated with the objects in the first subset;
arranging the second labels in a second spatial dimension; and
presenting a matrix visualization of the set of objects indicated by the user selection, the matrix visualization distinct from the graph visualization, the matrix visualization comprising the labels and the indicators, wherein each of the indicators has a location corresponding in the first spatial dimension to a position of one of the first event labels and corresponding in the second spatial dimension to a position of one of the second non-event labels,
wherein the first spatial dimension is orthogonal to the second spatial dimension,
wherein each of the indicators are positioned within the matrix visualization to indicate a link in the set of links between an event labeled in the first spatial dimension and a non-event labeled in in the second spatial dimension,
wherein a lack of indicator is presented in the matrix if no link exists in the set of links between an second event labeled in the first spatial dimension and a second non-event labeled in in the second spatial dimension.
16. The non-transitory computer storage of claim 15, wherein at least one of the objects in the first subset of objects corresponds to an economic transaction, or communication.
17. The non-transitory computer storage of claim 15, wherein at least one of the objects in the second subset of objects corresponds to a person or place.
18. The non-transitory computer storage of claim 15, wherein the first labels are arranged in a series of rows and the second labels are arranged in a series of columns.
19. The non-transitory computer storage of claim 15, wherein the matrix visualization is presented via an interactive user interface configured to enable a user to rearrange at least some of the labels and indicators of the matrix visualization.
20. The non-transitory computer storage of claim 15, wherein the matrix visualization is presented via an interactive user interface configured to enable a user to change one or more colors associated with portions of the matrix visualization.
Patent Citations (291)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US5109399(A) | 1992-04-01 | Thompson | Applicant |
| US5329108(A) | 1994-07-01 | Lamoure | Applicant |
| US5632009(A) | 1997-05-01 | Rao et al. | Applicant |
| US5670987(A) | 1997-09-01 | Doi et al. | Applicant |
| US5845300(A) | 1998-12-01 | Comer et al. | Applicant |
| US6057757(A) | 2000-05-01 | Arrowsmith et al. | Applicant |
| US6091956(A) | 2000-07-01 | Hollenberg | Applicant |
| US6161098(A) | 2000-12-01 | Wallman | Applicant |
| US6219053(B1) | 2001-04-01 | Tachibana et al. | Applicant |
| US6232971(B1) | 2001-05-01 | Haynes | Applicant |
| US6247019(B1) | 2001-06-01 | Davies | Applicant |
| US6279018(B1) | 2001-08-01 | Kudrolli et al. | Applicant |
| US6341310(B1) | 2002-01-01 | Leshem et al. | Applicant |
| US6369835(B1) | 2002-04-01 | Lin | Applicant |
| US6456997(B1) | 2002-09-01 | Shukla | Examiner |
| US6549944(B1) | 2003-04-01 | Weinberg et al. | Applicant |
| US6581068(B1) | 2003-06-01 | Bensoussan et al. | Applicant |
| US6594672(B1) | 2003-07-01 | Lampson et al. | Examiner |
| US6631496(B1) | 2003-10-01 | Li et al. | Applicant |
| US6642945(B1) | 2003-11-01 | Sharpe | Applicant |
| US6714936(B1) | 2004-03-01 | Nevin, III | Applicant |
| US6775675(B1) | 2004-08-01 | Nwabueze et al. | Applicant |
| US6839745(B1) | 2005-01-01 | Dingari et al. | Applicant |
| US6877137(B1) | 2005-04-01 | Rivette et al. | Applicant |
| US6976210(B1) | 2005-12-01 | Silva et al. | Applicant |
| US6985950(B1) | 2006-01-01 | Hanson et al. | Applicant |
| US7036085(B2) | 2006-04-01 | Barros | Applicant |
| US7043702(B2) | 2006-05-01 | Chi et al. | Applicant |
| US7055110(B2) | 2006-05-01 | Kupka et al. | Applicant |
| US7139800(B2) | 2006-11-01 | Bellotti et al. | Applicant |
| US7158878(B2) | 2007-01-01 | Rasmussen et al. | Applicant |
| US7162475(B2) | 2007-01-01 | Ackerman | Applicant |
| US7168039(B2) | 2007-01-01 | Bertram | Applicant |
| US7171427(B2) | 2007-01-01 | Witkowski et al. | Applicant |
| US7269786(B1) | 2007-09-01 | Malloy et al. | Applicant |
| US7278105(B1) | 2007-10-01 | Kitts | Applicant |
| US7290698(B2) | 2007-11-01 | Poslinski et al. | Applicant |
| US7333998(B2) | 2008-02-01 | Heckerman et al. | Applicant |
| US7370047(B2) | 2008-05-01 | Gorman | Applicant |
| US7379811(B2) | 2008-05-01 | Rasmussen et al. | Applicant |
| US7379903(B2) | 2008-05-01 | Caballero | Applicant |
| US7426654(B2) | 2008-09-01 | Adams et al. | Applicant |
| US7454466(B2) | 2008-11-01 | Bellotti et al. | Applicant |
| US7467375(B2) | 2008-12-01 | Tondreau et al. | Applicant |
| US7502786(B2) | 2009-03-01 | Liu et al. | Applicant |
| US7525422(B2) | 2009-04-01 | Bishop et al. | Applicant |
| US7529727(B2) | 2009-05-01 | Arning et al. | Applicant |
| US7558677(B2) | 2009-07-01 | Jones | Applicant |
| US7574428(B2) | 2009-08-01 | Leiserowitz et al. | Applicant |
| US7617232(B2) | 2009-11-01 | Gabbert et al. | Applicant |
| US7620628(B2) | 2009-11-01 | Kapur et al. | Applicant |
| US7627812(B2) | 2009-12-01 | Chamberlain et al. | Applicant |
| US7634717(B2) | 2009-12-01 | Chamberlain et al. | Applicant |
| US7703021(B1) | 2010-04-01 | Flam | Applicant |
| US7712049(B2) | 2010-05-01 | Williams et al. | Applicant |
| US7716077(B1) | 2010-05-01 | Mikurak | Applicant |
| US7725547(B2) | 2010-05-01 | Albertson et al. | Applicant |
| US7770100(B2) | 2010-08-01 | Chamberlain et al. | Applicant |
| US7809703(B2) | 2010-10-01 | Balabhadrapatruni et al. | Applicant |
| US7818658(B2) | 2010-10-01 | Chen | Applicant |
| US7894984(B2) | 2011-02-01 | Rasmussen et al. | Applicant |
| US7899611(B2) | 2011-03-01 | Downs et al. | Applicant |
| US7917376(B2) | 2011-03-01 | Bellin et al. | Applicant |
| US7920963(B2) | 2011-04-01 | Jouline et al. | Applicant |
| US7933862(B2) | 2011-04-01 | Chamberlain et al. | Applicant |
| US7962281(B2) | 2011-06-01 | Rasmussen et al. | Applicant |
| US7962848(B2) | 2011-06-01 | Bertram | Applicant |
| US8001465(B2) | 2011-08-01 | Kudrolli et al. | Applicant |
| US8001482(B2) | 2011-08-01 | Bhattiprolu et al. | Applicant |
| US8010545(B2) | 2011-08-01 | Stefik et al. | Applicant |
| US8015487(B2) | 2011-09-01 | Roy et al. | Applicant |
| US8024778(B2) | 2011-09-01 | Cash et al. | Applicant |
| US8036632(B1) | 2011-10-01 | Cona et al. | Applicant |
| US8103543(B1) | 2012-01-01 | Zwicky | Applicant |
| US8134457(B2) | 2012-03-01 | Velipasalar et al. | Applicant |
| US8145703(B2) | 2012-03-01 | Frishert et al. | Applicant |
| US8196184(B2) | 2012-06-01 | Amirov et al. | Examiner |
| US8214361(B1) | 2012-07-01 | Sandler et al. | Applicant |
| US8214764(B2) | 2012-07-01 | Gemmell et al. | Applicant |
| US8225201(B2) | 2012-07-01 | Michael | Applicant |
| US8229947(B2) | 2012-07-01 | Fujinaga | Applicant |
| US8230333(B2) | 2012-07-01 | Decherd et al. | Applicant |
| US8280880(B1) | 2012-10-01 | Aymeloglu et al. | Applicant |
| US8290942(B2) | 2012-10-01 | Jones et al. | Applicant |
| US8301464(B1) | 2012-10-01 | Cave et al. | Applicant |
| US8312367(B2) | 2012-11-01 | Foster | Applicant |
| US8352881(B2) | 2013-01-01 | Champion et al. | Applicant |
| US8368695(B2) | 2013-02-01 | Howell et al. | Applicant |
| US8397171(B2) | 2013-03-01 | Klassen et al. | Applicant |
| US8412707(B1) | 2013-04-01 | Mianji | Applicant |
| US8447722(B1) | 2013-05-01 | Ahuja et al. | Applicant |
| US8452790(B1) | 2013-05-01 | Mianji | Applicant |
| US8463036(B1) | 2013-06-01 | Ramesh et al. | Applicant |
| US8489331(B2) | 2013-07-01 | Kopf et al. | Applicant |
| US8489641(B1) | 2013-07-01 | Seefeld et al. | Applicant |
| US8498984(B1) | 2013-07-01 | Hwang et al. | Applicant |
| US8514082(B2) | 2013-08-01 | Cova et al. | Applicant |
| US8515207(B2) | 2013-08-01 | Chau | Applicant |
| US8554579(B2) | 2013-10-01 | Tribble et al. | Applicant |
| US8577911(B1) | 2013-11-01 | Stepinski et al. | Applicant |
| US8589273(B2) | 2013-11-01 | Creeden et al. | Applicant |
| US8620641(B2) | 2013-12-01 | Farnsworth et al. | Applicant |
| US8689108(B1) | 2014-04-01 | Duffield et al. | Applicant |
| US8713467(B1) | 2014-04-01 | Goldenberg et al. | Applicant |
| US8739278(B2) | 2014-05-01 | Varghese | Applicant |
| US8745516(B2) | 2014-06-01 | Mason et al. | Applicant |
| US8781169(B2) | 2014-07-01 | Jackson et al. | Applicant |
| US8799799(B1) | 2014-08-01 | Cervelli et al. | Applicant |
| US8812960(B1) | 2014-08-01 | Sun et al. | Applicant |
| US8832594(B1) | 2014-09-01 | Thompson et al. | Applicant |
| US8868486(B2) | 2014-10-01 | Tamayo | Applicant |
| US2001/0021936(A1) | 2001-09-01 | Bertram | Applicant |
| US2002/0091707(A1) | 2002-07-01 | Keller | Applicant |
| US2002/0095658(A1) | 2002-07-01 | Shulman et al. | Applicant |
| US2002/0116120(A1) | 2002-08-01 | Ruiz et al. | Applicant |
| US2002/0130907(A1) | 2002-09-01 | Chi et al. | Applicant |
| US2002/0174201(A1) | 2002-11-01 | Ramer et al. | Applicant |
| US2003/0028560(A1) | 2003-02-01 | Kudrolli et al. | Applicant |
| US2003/0039948(A1) | 2003-02-01 | Donahue | Applicant |
| US2003/0144868(A1) | 2003-07-01 | MacIntyre et al. | Applicant |
| US2003/0163352(A1) | 2003-08-01 | Surpin et al. | Applicant |
| US2003/0200217(A1) | 2003-10-01 | Ackerman | Applicant |
| US2003/0225755(A1) | 2003-12-01 | Iwayama et al. | Applicant |
| US2004/0064256(A1) | 2004-04-01 | Barinek et al. | Applicant |
| US2004/0085318(A1) | 2004-05-01 | Hassler et al. | Examiner |
| US2004/0095349(A1) | 2004-05-01 | Bito et al. | Examiner |
| US2004/0143602(A1) | 2004-07-01 | Ruiz et al. | Applicant |
| US2004/0163039(A1) | 2004-08-01 | Gorman | Applicant |
| US2004/0181554(A1) | 2004-09-01 | Heckerman et al. | Applicant |
| US2004/0260702(A1) | 2004-12-01 | Cragun et al. | Applicant |
| US2005/0027705(A1) | 2005-02-01 | Sadri et al. | Applicant |
| US2005/0028094(A1) | 2005-02-01 | Allyn | Applicant |
| US2005/0080769(A1) | 2005-04-01 | Gemmell et al. | Applicant |
| US2005/0086207(A1) | 2005-04-01 | Heuer et al. | Applicant |
| US2005/0125715(A1) | 2005-06-01 | Franco et al. | Applicant |
| US2005/0180330(A1) | 2005-08-01 | Shapiro | Applicant |
| US2005/0182793(A1) | 2005-08-01 | Keenan et al. | Applicant |
| US2005/0183005(A1) | 2005-08-01 | Denoue et al. | Applicant |
| US2005/0246327(A1) | 2005-11-01 | Yeung et al. | Applicant |
| US2005/0251786(A1) | 2005-11-01 | Citron et al. | Applicant |
| US2006/0026120(A1) | 2006-02-01 | Carolan et al. | Applicant |
| US2006/0026170(A1) | 2006-02-01 | Kreitler et al. | Applicant |
| US2006/0045470(A1) | 2006-03-01 | Poslinski et al. | Applicant |
| US2006/0059139(A1) | 2006-03-01 | Robinson | Applicant |
| US2006/0074866(A1) | 2006-04-01 | Chamberlain et al. | Applicant |
| US2006/0080619(A1) | 2006-04-01 | Carlson et al. | Applicant |
| US2006/0129746(A1) | 2006-06-01 | Porter | Applicant |
| US2006/0139375(A1) | 2006-06-01 | Rasmussen et al. | Applicant |
| US2006/0149596(A1) | 2006-07-01 | Surpin et al. | Applicant |
| US2006/0203337(A1) | 2006-09-01 | White | Applicant |
| US2006/0241974(A1) | 2006-10-01 | Chao et al. | Applicant |
| US2006/0271277(A1) | 2006-11-01 | Hu et al. | Applicant |
| US2007/0011150(A1) | 2007-01-01 | Frank | Applicant |
| US2007/0016363(A1) | 2007-01-01 | Huang et al. | Applicant |
| US2007/0038962(A1) | 2007-02-01 | Fuchs et al. | Applicant |
| US2007/0078832(A1) | 2007-04-01 | Ott et al. | Applicant |
| US2007/0174760(A1) | 2007-07-01 | Chamberlain et al. | Applicant |
| US2007/0192265(A1) | 2007-08-01 | Chopin et al. | Applicant |
| US2007/0208497(A1) | 2007-09-01 | Downs et al. | Applicant |
| US2007/0208498(A1) | 2007-09-01 | Barker et al. | Applicant |
| US2007/0266336(A1) | 2007-11-01 | Nojima et al. | Applicant |
| US2007/0294643(A1) | 2007-12-01 | Kyle | Applicant |
| US2008/0040684(A1) | 2008-02-01 | Crump | Applicant |
| US2008/0051989(A1) | 2008-02-01 | Welsh | Applicant |
| US2008/0052142(A1) | 2008-02-01 | Bailey et al. | Applicant |
| US2008/0077597(A1) | 2008-03-01 | Butler | Applicant |
| US2008/0077642(A1) | 2008-03-01 | Carbone et al. | Applicant |
| US2008/0104019(A1) | 2008-05-01 | Nath | Applicant |
| US2008/0126951(A1) | 2008-05-01 | Sood et al. | Applicant |
| US2008/0162616(A1) | 2008-07-01 | Gross et al. | Applicant |
| US2008/0195417(A1) | 2008-08-01 | Surpin et al. | Applicant |
| US2008/0195608(A1) | 2008-08-01 | Clover | Applicant |
| US2008/0222295(A1) | 2008-09-01 | Robinson et al. | Applicant |
| US2008/0255973(A1) | 2008-10-01 | El Wade et al. | Applicant |
| US2008/0263468(A1) | 2008-10-01 | Cappione et al. | Applicant |
| US2008/0267107(A1) | 2008-10-01 | Rosenberg | Applicant |
| US2008/0276167(A1) | 2008-11-01 | Michael | Applicant |
| US2008/0278311(A1) | 2008-11-01 | Grange et al. | Applicant |
| US2008/0288306(A1) | 2008-11-01 | MacIntyre et al. | Applicant |
| US2008/0301643(A1) | 2008-12-01 | Appleton et al. | Applicant |
| US2009/0002492(A1) | 2009-01-01 | Velipasalar et al. | Applicant |
| US2009/0027418(A1) | 2009-01-01 | Maru et al. | Applicant |
| US2009/0030915(A1) | 2009-01-01 | Winter et al. | Applicant |
| US2009/0076845(A1) | 2009-03-01 | Bellin et al. | Applicant |
| US2009/0119309(A1) | 2009-05-01 | Gibson et al. | Applicant |
| US2009/0125369(A1) | 2009-05-01 | Kloostra et al. | Applicant |
| US2009/0125459(A1) | 2009-05-01 | Norton et al. | Applicant |
| US2009/0132953(A1) | 2009-05-01 | Reed et al. | Applicant |
| US2009/0144262(A1) | 2009-06-01 | White et al. | Applicant |
| US2009/0164934(A1) | 2009-06-01 | Bhattiprolu et al. | Applicant |
| US2009/0171939(A1) | 2009-07-01 | Athsani et al. | Applicant |
| US2009/0172511(A1) | 2009-07-01 | Decherd et al. | Applicant |
| US2009/0222400(A1) | 2009-09-01 | Kupershmidt et al. | Applicant |
| US2009/0222760(A1) | 2009-09-01 | Halverson et al. | Applicant |
| US2009/0234720(A1) | 2009-09-01 | George et al. | Applicant |
| US2009/0281839(A1) | 2009-11-01 | Lynn et al. | Applicant |
| US2009/0287470(A1) | 2009-11-01 | Farnsworth et al. | Applicant |
| US2009/0292626(A1) | 2009-11-01 | Oxford | Applicant |
| US2010/0011282(A1) | 2010-01-01 | Dollard et al. | Applicant |
| US2010/0042922(A1) | 2010-02-01 | Bradateanu et al. | Applicant |
| US2010/0057716(A1) | 2010-03-01 | Stefik et al. | Applicant |
| US2010/0070523(A1) | 2010-03-01 | Delgo et al. | Applicant |
| US2010/0070897(A1) | 2010-03-01 | Aymeloglu et al. | Applicant |
| US2010/0103124(A1) | 2010-04-01 | Kruzeniski et al. | Applicant |
| US2010/0122152(A1) | 2010-05-01 | Chamberlain et al. | Applicant |
| US2010/0131457(A1) | 2010-05-01 | Heimendinger | Applicant |
| US2010/0191563(A1) | 2010-07-01 | Schlaifer et al. | Applicant |
| US2010/0198684(A1) | 2010-08-01 | Eraker et al. | Applicant |
| US2010/0199225(A1) | 2010-08-01 | Coleman et al. | Applicant |
| US2010/0250412(A1) | 2010-09-01 | Wagner | Applicant |
| US2010/0280857(A1) | 2010-11-01 | Liu et al. | Applicant |
| US2010/0293174(A1) | 2010-11-01 | Bennett et al. | Applicant |
| US2010/0306713(A1) | 2010-12-01 | Geisner et al. | Applicant |
| US2010/0321399(A1) | 2010-12-01 | Ellren et al. | Applicant |
| US2010/0325581(A1) | 2010-12-01 | Finkelstein et al. | Applicant |
| US2011/0047159(A1) | 2011-02-01 | Baid et al. | Applicant |
| US2011/0060753(A1) | 2011-03-01 | Shaked et al. | Applicant |
| US2011/0061013(A1) | 2011-03-01 | Bilicki et al. | Applicant |
| US2011/0074811(A1) | 2011-03-01 | Hanson et al. | Applicant |
| US2011/0078173(A1) | 2011-03-01 | Seligmann et al. | Applicant |
| US2011/0107196(A1) | 2011-05-01 | Foster | Applicant |
| US2011/0119100(A1) | 2011-05-01 | Ruhl et al. | Applicant |
| US2011/0137766(A1) | 2011-06-01 | Rasmussen et al. | Applicant |
| US2011/0153384(A1) | 2011-06-01 | Horne et al. | Applicant |
| US2011/0167105(A1) | 2011-07-01 | Ramakrishnan et al. | Applicant |
| US2011/0170799(A1) | 2011-07-01 | Carrino et al. | Applicant |
| US2011/0208724(A1) | 2011-08-01 | Jones et al. | Applicant |
| US2011/0291851(A1) | 2011-12-01 | Whisenant | Applicant |
| US2011/0310005(A1) | 2011-12-01 | Chen et al. | Applicant |
| US2011/0314007(A1) | 2011-12-01 | Dassa et al. | Applicant |
| US2012/0019559(A1) | 2012-01-01 | Siler et al. | Examiner |
| US2012/0036434(A1) | 2012-02-01 | Oberstein | Applicant |
| US2012/0066296(A1) | 2012-03-01 | Appleton et al. | Applicant |
| US2012/0079363(A1) | 2012-03-01 | Folting et al. | Applicant |
| US2012/0106801(A1) | 2012-05-01 | Jackson | Applicant |
| US2012/0131512(A1) | 2012-05-01 | Takeuchi et al. | Applicant |
| US2012/0144335(A1) | 2012-06-01 | Abeln et al. | Applicant |
| US2012/0159307(A1) | 2012-06-01 | Chung et al. | Applicant |
| US2012/0196557(A1) | 2012-08-01 | Reich et al. | Applicant |
| US2012/0196558(A1) | 2012-08-01 | Reich et al. | Applicant |
| US2012/0208636(A1) | 2012-08-01 | Feige | Applicant |
| US2012/0221511(A1) | 2012-08-01 | Gibson et al. | Applicant |
| US2012/0221580(A1) | 2012-08-01 | Barney | Applicant |
| US2012/0246148(A1) | 2012-09-01 | Dror | Applicant |
| US2012/0290879(A1) | 2012-11-01 | Shibuya et al. | Applicant |
| US2012/0323888(A1) | 2012-12-01 | Osann, Jr. | Applicant |
| US2012/0330973(A1) | 2012-12-01 | Ghuneim et al. | Applicant |
| US2013/0006725(A1) | 2013-01-01 | Simanek et al. | Applicant |
| US2013/0046842(A1) | 2013-02-01 | Muntz et al. | Applicant |
| US2013/0061169(A1) | 2013-03-01 | Pearcy et al. | Applicant |
| US2013/0073377(A1) | 2013-03-01 | Heath | Applicant |
| US2013/0078943(A1) | 2013-03-01 | Biage et al. | Applicant |
| US2013/0097482(A1) | 2013-04-01 | Marantz et al. | Applicant |
| US2013/0101159(A1) | 2013-04-01 | Chao et al. | Applicant |
| US2013/0111320(A1) | 2013-05-01 | Campbell et al. | Applicant |
| US2013/0150004(A1) | 2013-06-01 | Rosen | Applicant |
| US2013/0176321(A1) | 2013-07-01 | Mitchell et al. | Applicant |
| US2013/0179420(A1) | 2013-07-01 | Park et al. | Applicant |
| US2013/0224696(A1) | 2013-08-01 | Wolfe et al. | Examiner |
| US2013/0238616(A1) | 2013-09-01 | Rose et al. | Applicant |
| US2013/0246170(A1) | 2013-09-01 | Gross et al. | Applicant |
| US2013/0262527(A1) | 2013-10-01 | Hunter et al. | Applicant |
| US2013/0268520(A1) | 2013-10-01 | Fisher et al. | Applicant |
| US2013/0282696(A1) | 2013-10-01 | John et al. | Applicant |
| US2013/0290011(A1) | 2013-10-01 | Lynn et al. | Applicant |
| US2013/0290825(A1) | 2013-10-01 | Arndt et al. | Applicant |
| US2013/0297619(A1) | 2013-11-01 | Chandrasekaran et al. | Applicant |
| US2014/0019936(A1) | 2014-01-01 | Cohanoff | Applicant |
| US2014/0032506(A1) | 2014-01-01 | Hoey et al. | Applicant |
| US2014/0033010(A1) | 2014-01-01 | Richardt et al. | Applicant |
| US2014/0040371(A1) | 2014-02-01 | Gurevich et al. | Applicant |
| US2014/0047357(A1) | 2014-02-01 | Alfaro et al. | Applicant |
| US2014/0059038(A1) | 2014-02-01 | McPherson et al. | Applicant |
| US2014/0068487(A1) | 2014-03-01 | Steiger et al. | Applicant |
| US2014/0095509(A1) | 2014-04-01 | Patton | Applicant |
| US2014/0108380(A1) | 2014-04-01 | Gotz et al. | Applicant |
| US2014/0108985(A1) | 2014-04-01 | Scott et al. | Applicant |
| US2014/0157172(A1) | 2014-06-01 | Peery et al. | Applicant |
| US2014/0164502(A1) | 2014-06-01 | Khodorenko et al. | Applicant |
| US2014/0189536(A1) | 2014-07-01 | Lange et al. | Applicant |
| US2014/0195515(A1) | 2014-07-01 | Baker et al. | Applicant |
| US2014/0267295(A1) | 2014-09-01 | Sharma | Applicant |
| US2014/0279824(A1) | 2014-09-01 | Tamayo | Applicant |
| EP1672527 | 2006-06-01 | Applicant | |
| EP2551799 | 2013-01-01 | Applicant | |
| EP2778983 | 2014-09-01 | Applicant | |
| EP2779082 | 2014-09-01 | Applicant | |
| WO2005/104736 | 2005-11-01 | Applicant | |
| WO2009/061501 | 2009-05-01 | Applicant | |
| WO2010/000014 | 2010-01-01 | Applicant | |
| WO2010/030913 | 2010-03-01 | Applicant |
Non-Patent Literature (48)
- R. Alfred, “Summarizing Relational Data Using Semi-Supervised Genetic Algorithm-Based Clustering Techniques”, J. Comput. Sci., 6: 775-784, 2010.Examiner
- “A First Look: Predicting Market Demand for Food Retail using a Huff Analysis,” TRF Policy Solutions, Jul. 2012, pp. 30.Applicant
- Acklen, Laura, “Absolute Beginner's Guide to Microsoft Word 2003,” Dec. 24, 2003, pp. 15-18, 34-41, 308-316.Applicant
- Ananiev et al., “The New Modality API,” http://web.archive.org/web/20061211011958/http://java.sun.com/developer/technicalArticles/J2SE/Desktop/javase6/modality/ Jan. 2006, pp. 8.Applicant
- 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.Applicant
- 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.Applicant
- 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.Applicant
- 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.Applicant
- Griffith, Daniel A., “A Generalized Huff Model,” Geographical Analysis, Apr. 1982, vol. 14, No. 2, pp. 135-144.Applicant
- Hibbert et al., “Prediction of Shopping Behavior Using a Huff Model Within a GIS Framework,” Healthy Eating in Context Mar. 18, 2011, pp. 16.Applicant
- Huff et al., “Calibrating the Huff Model Using ArcGIS Business Analyst,” ESRI, Sep. 2008, pp. 33.Applicant
- Huff, David L., “Parameter Estimation in the Huff Model,” ESRI, ArcUser, Oct.-Dec. 2003, pp. 34-36.Applicant
- International Search Report and Written Opinion in Application No. PCT/US2009/056703, dated Mar. 15, 2010.Applicant
- 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.Applicant
- Manske, “File Saving Dialogs,” http://www.mozilla.org/editor/ui—specs/FileSaveDialogs.html, Jan. 20, 1999, pp. 7.Applicant
- Map of San Jose, CA. Retrieved Oct. 2, 2013 from http://maps.google.com.Applicant
- Map of San Jose, CA. Retrieved Oct. 2, 2013 from http://maps.bing.com.Applicant
- Map of San Jose, CA. Retrieved Oct. 2, 2013 from http://maps.yahoo.com.Applicant
- 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.Applicant
- 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.Applicant
- 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.Applicant
- “A Quick Guide to UniProtKB Swiss-Prot & TrEMBL,” Sep. 2011, pp. 2.Applicant
- Bluttman et al., “Excel Formulas and Functions for Dummies,” 2005, Wiley Publishing, Inc., pp. 280, 284-286.Applicant
- Canese et al., “Chapter 2: PubMed: The Bibliographic Database,” The NCBI Handbook, Oct. 2002, pp. 1-10.Applicant
- Conner, Nancy, “Google Apps: The Missing Manual,” Sharing and Collaborating on Documents, May 1, 2008, pp. 93-97, 106-113 & 120-121.Applicant
- Delcher et al., “Identifying Bacterial Genes and Endosymbiont DNA with Glimmer,” BioInformatics, vol. 23, No. 6, 2007, pp. 673-679.Applicant
- Goswami, Gautam, “Quite ‘Writely’ Said!” One Brick at a Time, Aug. 21, 2005, pp. 7.Applicant
- Hansen et al., “Analyzing Social Media Networks with NodeXL: Insights from a Connected World”, Elsevier Science, Sep. 2010, Ch. 4 & 10, pp. 53-67 & 143-164.Applicant
- Kahan et al., “Annotea: An Open RDF Infrastructure for Shared WEB Annotations”, Computer Networks, 2002, vol. 39, pp. 589-608.Applicant
- 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 pp.Applicant
- Keylines.com, “KeyLines Datasheet,” Mar. 2014, http://keylines.com/wp-content/uploads/2014/03/KeyLines-datasheet.pdf downloaded May 12, 2014 in 2 pages.Applicant
- 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.Applicant
- Kitts, Paul, “Chapter 14: Genome Assembly and Annotation Process,” The NCBI Handbook, Oct. 2002, pp. 1-21.Applicant
- Madden, Tom, “Chapter 16: The BLAST Sequence Analysis Tool,” The NCBI Handbook, Oct. 2002, pp. 1-15.Applicant
- Manno et al., “Introducing Collaboration in Single-user Applications through the Centralized Control Architecture,” 2010, pp. 10.Applicant
- Mizrachi, Ilene, “Chapter 1: GenBank: The Nuckeotide Sequence Database,” The NCBI Handbook, Oct. 2002, pp. 1-14.Applicant
- Rouse, Margaret, “OLAP Cube,” http://searchdatamanagement.techtarget.com/definition/OLAP-cube, Apr. 28, 2012, pp. 16.Applicant
- Sigrist, et al., “PROSITE, a Protein Domain Database for Functional Characterization and Annotation,” Nucleic Acids Research, 2010, vol. 38, pp. D161-D166.Applicant
- Sirotkin et al., “Chapter 13: The Processing of Biological Sequence Data at NCBI,” The NCBI Handbook, Oct. 2002, pp. 1-11.Applicant
- “The FASTA Program Package,” fasta-36.3.4, Mar. 25, 2011, pp. 29.Applicant
- Official Communication in European Application No. EP 14158861.6 dated Jun. 16, 2014.Applicant
- Official Communication in New Zealand Application No. 622517 dated Apr. 3, 2014.Applicant
- Official Communication in New Zealand Application No. 624557 dated May 14, 2014.Applicant
- Official Communication in New Zealand Application No. 628585 dated Aug. 26, 2014.Applicant
- Official Communication in New Zealand Application No. 628263 dated Aug. 12, 2014.Applicant
- Official Communication in Great Britain Application No. 1404457.2 dated Aug. 14, 2014.Applicant
- Official Communication in New Zealand Application No. 627962 dated Aug. 5, 2014.Applicant
- Official Communication in New Zealand Application No. 628840 dated Aug. 28, 2014.Applicant