US 9,256,664 B2Grant
System and method for news events detection and visualization
Issue Date:2016-02-09
•23 Claims
•6 Drawing Sheets
Abstract
Systems and methods are disclosed for news events detection and visualization. In accordance with one implementation, a method is provided for news events detection and visualization. The method includes, for example, obtaining a document, obtaining from the document a plurality of tokens, obtaining a document vector based on a plurality of frequencies associated with the plurality of tokens, obtaining one or more clusters of documents, each cluster associated with a plurality of documents and a cluster vector, determining a matching cluster from the one or more clusters based at least on the similarity between the document vector and the cluster vector of the matching cluster, and updating a database to associate the document with the matching cluster.
Metadata
Assignee
- Palantir Technologies Inc.
Inventors
- John Chakerian
- Robert Fink
- Mark Schafer
- James Thompson
- Marvin Sum
- Allen Cai
Application Information
Application Number:US 14/323,935
Filing Date:2014-07-03
Priority Date:2014-07-03
Art Unit:2154
Classifications
IPC:
G06F7/02G06F17/30
Field of Search:
G06F 17/30011G06F 17/30598G06F 17/30705G06F 17/3071G06F 17/30699G06F 17/30386G06F 17/30
Patent Drawings (6 sheets)
Description
Background
[0001] Vast amounts of data are readily available to readers, analysts, and researchers today, on the one hand allowing them to perform more complicated and detailed data analyses than ever, but on the other hand making it more difficult to quickly sort through the data. Automatically characterizing, grouping, and visually presenting the data in a concise and informative way can help users to identify data that is most relevant for their particular needs.
Brief Description of the Drawings
[0002] Reference will now be made to the accompanying drawings, which illustrate exemplary embodiments of the present disclosure. In the drawings:
[0003] FIG. 1 is a block diagram of an exemplary electronic device, consistent with embodiments of the present disclosure;
[0004] FIG. 2 is a flowchart of an exemplary method for clustering documents, consistent with embodiments of the present disclosure;
[0005] FIG. 3 is a flowchart of an exemplary method for adding a new cluster to a matching megacluster, consistent with embodiments of the present disclosure;
[0006] FIG. 4 illustrates an exemplary user interface, consistent with embodiments of the present disclosure; and
[0007] FIG. 5 illustrates another exemplary user interface, consistent with embodiments of the present disclosure.
Description of Exemplary Embodiments
[0008] Reference will now be made in detail to several exemplary embodiments of the present disclosure, including those illustrated in the accompanying drawings. Whenever possible, the same reference numbers will be used throughout the drawings to refer to the same or like parts.
[0009] Embodiments disclosed herein are directed to, among other things, to systems and methods that can analyze large volumes of documents (e.g., news articles), automatically group the documents into clusters (e.g., news events), further group the clusters into megaclusters (e.g., news storylines), and present the documents, the clusters, and the megaclusters to the user in a concise and informative manner. For example, the systems and methods can obtain a document, obtain from the document a plurality of tokens, obtain a document vector based on a plurality of frequencies associated with the plurality of tokens, obtain one or more clusters of documents, each cluster associated with a plurality of documents and a cluster vector, determine a matching cluster from the one or more clusters based at least on the similarity between the document vector and the cluster vector of the matching cluster, and update a database to associate the document with the matching cluster.
[0010] According to some embodiments, the operations, techniques, and/or components described herein can be implemented by an electronic device, which can include one or more special-purpose computing devices. The special-purpose computing devices can be hard-wired to perform the operations, techniques, and/or components described herein, or can 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 operations, techniques and/or components described herein, or can include one or more hardware processors programmed to perform such features of the present disclosure pursuant to program instructions in firmware, memory, other storage, or a combination. Such special-purpose computing devices can also combine custom hard-wired logic, ASICs, or FPGAs with custom programming to accomplish the technique and other features of the present disclosure. The special-purpose computing devices can be desktop computer systems, portable computer systems, handheld devices, networking devices, or any other device that incorporates hard-wired and/or program logic to implement the techniques and other features of the present disclosure.
[0011] The one or more special-purpose computing devices can be generally controlled and coordinated by operating system software, such as iOS, Android, Blackberry, Chrome OS, Windows XP, Windows Vista, Windows 7, Windows 8, Windows Server, Windows CE, Unix, Linux, SunOS, Solaris, VxWorks, or other compatible operating systems. In other embodiments, the computing device can be controlled by a proprietary operating system. 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.
[0012] By way of example, FIG. 1 is a block diagram that illustrates an implementation of an electronic device 110, which, as described above, can comprise one or more electronic devices. Electronic device 110 includes a bus 102 or other communication mechanism for communicating information, and one or more hardware processors 104, coupled with bus 102 for processing information. One or more hardware processors 104 can be, for example, one or more microprocessors.
[0013] Electronic device 110 also includes a main memory 106, such as a random access memory (RAM) or other dynamic storage device, coupled to bus 102 for storing information and instructions to be executed by processor 104. Main memory 106 also can be used for storing temporary variables or other intermediate information during execution of instructions to be executed by processor 104. Such instructions, when stored in non-transitory storage media accessible to one or more processors 104, render electronic device 110 into a special-purpose machine that is customized to perform the operations specified in the instructions.
[0014] Electronic device 110 further includes a read only memory (ROM) 108 or other static storage device coupled to bus 102 for storing static information and instructions for processor 104. A storage device 150, such as a magnetic disk, optical disk, or USB thumb drive (Flash drive), etc., is provided and coupled to bus 102 for storing information and instructions.
[0015] Electronic device 110 can be coupled via bus 102 to a display 112, such as a cathode ray tube (CRT), an LCD display, or a touchscreen, for displaying information to a computer user. An input device 114, including alphanumeric and other keys, is coupled to bus 102 for communicating information and command selections to processor 104. Another type of user input device is cursor control 116, such as a mouse, a trackball, or cursor direction keys for communicating direction information and command selections to processor 104 and for controlling cursor movement on display 112. The input device typically has two degrees of freedom in two axes, a first axis (for example, x) and a second axis (for example, 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.
[0016] Electronic device 110 can 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 one or more computing devices. 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.
[0017] 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, and C++. A software module can be compiled and linked into an executable program, installed in a dynamic link library, or written in an interpreted programming language such as, for example, BASIC, Perl, Python, or Pig. It will be appreciated that software modules can be callable from other modules or from themselves, and/or can be invoked in response to detected events or interrupts. Software modules configured for execution on computing devices can 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 can be originally stored in a compressed or installable format that requires installation, decompression, or decryption prior to execution). Such software code can be stored, partially or fully, on a memory device of the executing computing device, for execution by the computing device. Software instructions can be embedded in firmware, such as an EPROM. It will be further appreciated that hardware modules can be comprised of connected logic units, such as gates and flip-flops, and/or can 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 can 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.
[0018] Electronic device 110 can implement the techniques and other features described herein using customized hard-wired logic, one or more ASICs or FPGAs, firmware and/or program logic which in combination with the electronic device causes or programs electronic device 110 to be a special-purpose machine. According to some embodiments, the techniques and other features described herein are performed by electronic device 110 in response to one or more processors 104 executing one or more sequences of one or more instructions contained in main memory 106. Such instructions can be read into main memory 106 from another storage medium, such as storage device 150. Execution of the sequences of instructions contained in main memory 106 causes processor 104 to perform the process steps described herein. In alternative embodiments, hard-wired circuitry can be used in place of or in combination with software instructions.
[0019] The term “non-transitory media” as used herein refers to any media storing data and/or instructions that cause a machine to operate in a specific fashion. Such non-transitory media can comprise non-volatile media and/or volatile media. Non-volatile media includes, for example, optical or magnetic disks, such as storage device 150. Volatile media includes dynamic memory, such as main memory 106. 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.
[0020] Non-transitory media is distinct from, but can be used in conjunction with, transmission media. Transmission media participates in transferring information between storage media. For example, transmission media includes coaxial cables, copper wire and fiber optics, including the wires that comprise bus 102. Transmission media can also take the form of acoustic or light waves, such as those generated during radio-wave and infra-red data communications.
[0021] Various forms of media can be involved in carrying one or more sequences of one or more instructions to processor 104 for execution. For example, the instructions can 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 electronic device 110 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 102. Bus 102 carries the data to main memory 106, from which processor 104 retrieves and executes the instructions. The instructions received by main memory 106 can optionally be stored on storage device 150 either before or after execution by processor 104.
[0022] Electronic device 110 also includes a communication interface 118 coupled to bus 102. Communication interface 118 provides a two-way data communication coupling to a network link 120 that is connected to a local network 122. For example, communication interface 118 can 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 118 can be a local area network (LAN) card to provide a data communication connection to a compatible LAN. Wireless links can also be implemented. In any such implementation, communication interface 118 sends and receives electrical, electromagnetic or optical signals that carry digital data streams representing various types of information.
[0023] Network link 120 typically provides data communication through one or more networks to other data devices. For example, network link 120 can provide a connection through local network 122 to a host computer 124 or to data equipment operated by an Internet Service Provider (ISP) 126. ISP 126 in turn provides data communication services through the world wide packet data communication network now commonly referred to as the “Internet” 128. Local network 122 and Internet 128 both use electrical, electromagnetic or optical signals that carry digital data streams. The signals through the various networks and the signals on network link 120 and through communication interface 118, which carry the digital data to and from electronic device 110, are example forms of transmission media.
[0024] Electronic device 110 can send messages and receive data, including program code, through the network(s), network link 120 and communication interface 118. In the Internet example, a server 130 might transmit a requested code for an application program through Internet 128, ISP 126, local network 122 and communication interface 118.
[0025] The received code can be executed by processor 104 as it is received, and/or stored in storage device 150, or other non-volatile storage for later execution.
[0026] FIG. 2 shows a flowchart representing an exemplary method 200 for clustering documents. In some embodiments, method 200 can be performed by a client application (e.g., a web browser, a plug-in to a web browser, a standalone executable application, etc.) running on a client device, by a server (e.g., a web server), or it can have some steps or parts thereof executed on the client device, and some steps or parts thereof executed on the server. Thus, method 200 can be performed by one or more electronic devices, such as electronic device 110. And while method 200 and the other following embodiments described herein can be performed by multiple electronic devices each having one or more processors, for purposes of simplicity and without limitation, these embodiments will be explained with respect to a single electronic device (e.g., electronic device 110). While the flowchart discloses the following steps in a particular order, it is appreciated that at least some of the steps can be moved, modified, or deleted where appropriate, consistent with the teachings of the present disclosure.
[0027] Referring to FIG. 2 , at step 210, the electronic device obtains a new document. The electronic device can obtain the new document from one or more databases that can be stored locally at the electronic device and/or on one or more remote devices. The document can be of any type of digital format (e.g., HTML, PDF, MS Word, Email, or any other format containing digital text) and can originate from any public or private source, for example, from an Internet webpage, a library archive, a proprietary subscription-based archive such as IEEE Xplore® digital library, Dow Jones's Factiva collection of news articles, or any other source of information. The document can also be obtained from search results returned by a search engine in response to a search query.
[0028] In some embodiments, the electronic device can obtain the document by periodically (e.g., once a day, once a week, once a month, etc.) searching a document database for any updates including new documents not previously processed by the electronic device. In other embodiments, the document can be submitted or pushed to the electronic device by a source system (e.g., blablubb). In other embodiments, the electronic device can obtain the document responsive to an input received from the user, the input identifying the requested document. In some embodiments, the obtained document can be associated, among other things, with a title, a URL, a revision number, provenance information, and a date, such as the date of its publication, the date of its most recent update, and so forth.
[0029] In some embodiments, the document can also be associated with one or more entities, such as one or more companies, persons, political parties, organizations, groups, or industries, or any other concept or topic, such as geographic locations. For example, the document can be associated with one or more tags, codes, or other types of metadata that describes products, companies, and/or industries related to the document, for example, all products, companies, and/or industries discussed in the document, or only key products, companies, and/or industries to which the document was directed. As an example, a news article discussing a new iPhone® device being released by Apple Inc., can be pre-tagged (e.g., automatically or manually by a person) with one or more tags or codes such as “iPhone,” “Apple,” “AAPL,” “consumer electronics,” and the like. The document may also be associated with tags or codes from the source system marking subject, document types, document importance, etc. In some embodiments, the document can be stored in a data structure indexed by document ID.
[0030] At step 220, the electronic device can preprocess the obtained document. For example, the electronic device can obtain the text of the document and break it down into tokens. In some embodiments, each token can include one word. In other embodiments, each token can include parts of word, a transformed or a canonicalized word, or sequences of two or more words. In some embodiments, the electronic device can discard any tokens that do not correspond to predetermined types of speech. For example, the electronic device can keep only those tokens that correspond to nouns and verbs, and discard all other tokens such as adjectives, adverbs, prepositions, articles, etc. In some embodiments, the electronic device can also normalize the document by reducing each token to its morphological root or lemma, using any suitable stemming and/or lemmatization methods.
[0031] At step 230, the electronic device can calculate a document vector representing the document. In some embodiments, the electronic device calculates the document vector by analyzing the preprocessed tokens and calculates, for each preprocessed token, a frequency value. In some embodiments, the frequency value can be calculated as a term frequency-inverse document frequency ratio (TF/IDF) where TF can reflect the number of times a token occurs in the obtained document. TF can be represented as a frequency, a Boolean frequency, a logarithmically scaled frequency, or an augmented frequency. IDF can reflect how common or rare the term is across a large corpus of documents. Accordingly, the TF/IDF measure can reflect how important a particular token is to a document because it increases proportionally to the number of times a token appears in the document, but is offset by the frequency of the token in the corpus, which helps to control for the fact that some tokens are generally more common than others.
[0032] In some embodiments, the electronic device can obtain the IDF portion of the TF/IDF ratio from a statistical model that reflects frequencies of various tokens in a corpus of documents. In some embodiments, multiple statistical models can be available (e.g., stored on or remotely accessible by the electronic device), each statistical model associated with and generated based on a different corpus of documents, where each corpus of documents can be associated with a particular entity, such as a particular person, company, industry, etc. For example, a corpus of documents can contain only documents that were tagged or coded with a code corresponding to a particular entity. As another example, the corpus of documents can contain search results corresponding to a search query related to a particular entity. In these embodiments, the electronic device can select, among the various statistical models, a statistical model that is associated with (was generated based on) a corpus of documents associated with an entity with which the obtained document is associated. For example, if the obtained document is coded with a code “AAPL,” the electronic device can calculate the IDF value based on a statistical model generated based on a corpus of documents also coded with the code “AAPL.” In some embodiments, the electronic device can also update the statistical model to reflect the segment frequencies in the obtained document, if it does not already reflect them.
[0033] Still referring to step 230, the electronic device can calculate frequency values for all non-discarded tokens in the document, the frequency values together constituting, for example, a vector of frequency values, the vector representing the document.
[0034] At step 240, the electronic device can find a matching cluster of documents to which the obtained document can be added, or to create a new cluster if no matching cluster is found. The electronic device can access, for example, a database of document clusters (hereinafter, “clusters”) which can be stored remotely and/or on the electronic device, in a volatile memory (e.g., in main memory 106) and/or in a non-volatile memory (e.g., in storage device 150). In some embodiments, each cluster can represent or be associated with one or more documents, such as documents previously processed by the electronic device. In some embodiments, the database can store, for each cluster, information identifying the documents contained in the cluster (e.g., title, publication date, URL, etc.) and a vector representing a hypothetical, idiosyncratic document of the cluster. The vector representing the cluster can be, for example, a centroid vector of the vectors of all the documents within the cluster, or any other vector or expression that provides a good approximation of the vectors of the documents in the cluster. In some embodiments, the database can also store, for each cluster, the individual vectors for each of the documents and/or the similarities (e.g., cosine similarities) between the individual vectors and the representative vector. In some embodiments, the electronic device can also store, for each cluster, the cluster's weight, the cluster's score, and whether the cluster is active or inactive, as further discussed below.
[0035] Finding a matching cluster for the obtained document can include calculating similarities between each of the active clusters and the obtained document. To calculate similarities, the electronic device can calculate, for example, similarities between the vector of the document and the representative vector of each of the active clusters. In some embodiments, the electronic device can calculate the similarity between the vector of the document and each of the stored vectors for the cluster, combining each of the similarities with some function. A level of similarity between two vectors can be measured, for example, using cosine similarity, or any other suitable distance of similarity measure between vectors.
[0036] In some embodiments, each cluster can also be associated with (or represented by) a weight. For example, when a new cluster is created, the electronic device can assign a default weight to the new cluster. The electronic device can then periodically (e.g., on a daily basis) decrease each cluster's weight by a predetermined decay factor or according to some other function. In some embodiments, when a cluster's weight falls below a predetermined minimal weight, the electronic device can either keep that cluster in the database but mark it as inactive or, in some embodiments, remove the cluster from the database. In some embodiments, when a new document is added to a cluster, the electronic device can increase the cluster's weight, for example, by a predetermined additive value. The value can be a fixed number, it can be proportionately related to the total number of documents added to the cluster on the same day, or some other function. Thus, clusters to which no or few documents are added for some period of time are likely to drop in weight below a minimal weight and become inactive over time. On the other hand, clusters to which documents are frequently added will remain active for a longer period of time. Because in some embodiments new documents cannot be added to inactive clusters, and are unlikely to be added to active clusters with low weights, for reasons discussed below, the periodic weight decrease mechanism described above causes the clustering of documents that are not only similar in content but are also temporally local, e.g., published around the same time.
[0037] In some embodiments, after calculating the similarities between the obtained document and the active clusters, the electronic device can assign the document to one or more clusters based at least on the clusters' similarities and weights. For example, electronic device can calculate a match value for each active cluster, the match value being in direct relation (e.g., directly proportional) to the cluster's similarity to the obtained document (assuming higher similarity values represent higher levels of similarity) and also in direct relation (e.g., directly proportional) to the cluster's weight. For example, each match value can be a product of the cluster's similarity and weight, a linear combination of the cluster's similarity and weight, and so forth. Accordingly, in some embodiments, a document is being matched with a cluster based on how similar the document's content is to the contents of the documents in the cluster, and based on how temporally local the document is to the documents in the cluster. The higher the similarity between the document and the cluster, the less temporally local the document needs to be to still be added to the cluster, and vice versa; the more temporally local the document is with the cluster, the less similar it needs to be to still be added to the cluster.
[0038] In some embodiments, the electronic device can select as the matching cluster a cluster having the highest match value, or a cluster having the highest match value above a predetermined match threshold. In other embodiments, the electronic device can first preselect one or more clusters having match values above a predetermined threshold, and then select, among the preselected clusters, a cluster having the highest similarity value. Because of the predetermined threshold, it is possible, in some embodiments, that no cluster is determined by the electronic device to be a matching cluster.
[0039] At step 250, the electronic device can add the obtained document to the matching cluster found at step 240, or to a new cluster if no matching cluster was found. In some embodiments, after the electronic device adds the obtained document to a cluster, it can update the database, for example, by updating information identifying documents contained in the cluster and by updating the vector representing the cluster (e.g., a centroid vector) based on the obtained document's vector, such that the updated vector accurately represents all documents in the cluster, including the newly added document. Accordingly, if a new cluster was created and currently only includes the obtained document, that cluster's initial representative vector can be set by the electronic device to be the same as the vector of the obtained document.
[0040] After updating the representative vector, the electronic device can also recalculate and update the similarities between the representative vector and each individual document in the cluster, if those similarities are stored in the database. Also, as discussed above, the cluster's weight can be increased by a predetermined additive value, or a default weight can be assigned to the cluster if the cluster was just created.
[0041] At step 260, the electronic device can update the score of the cluster to which the obtained document was added. In some embodiments, the score can be based on a combination (e.g., a linear combination) of the following factors: the number of documents contained in the cluster, the similarities (e.g., the average or the total of all cosine similarities) between the cluster's documents and the representative vector, the number of documents that are annotated with special tags indicating their importance (e.g., “contract document”, “frontpage article”, “frequently accessed document”, etc.), or any other factors.
[0042] In some embodiments, a cluster's score can also be calculated based on a similarity between a low-IDF vector and the representative vector, where the low-IDF vector can be constructed or obtained by the electronic device from the database or from the statistical model, and can include all tokens within the corpus of documents that are extremely common (and therefore heavily penalized by the IDF term), e.g., whose IDF value is lower than a predetermined threshold. High similarities between the low-IDF vector and cluster's representative vector can indicate that the cluster is well aligned to the overall corpus of documents, and is therefore less likely to be an outlier, and vice versa. Accordingly, in some embodiments, the cluster's score can be in direct relationship with (e.g., directly proportional to) the similarity between the low-IDF vector and the cluster's representative vector.
[0043] While in some embodiments each document obtained at step 210 can have a publication date that is more recent that all previously processed documents (e.g., the electronic device can pre-sort the documents by date before performing method 200), in some embodiments, some documents can have a publication date that is older than some previously processed documents. In these embodiments, instead of using the current (most recent) weights and representative vectors in the above-described steps of method 200, the electronic device can use historical weights and vectors corresponding to the state of the clusters on the date of the document's publication. In these embodiments, the electronic device can store, in association with each cluster, its weight, its representative vector, and any other relevant data (e.g., the cluster's score) each time that data is modified, allowing the electronic device to later check these historical data. In some embodiments, historical data can be stored as a series of snapshots, in which each snapshot can represent the entirety of the cluster state (e.g., cluster weight, representative vector, cluster score, which documents are in which cluster, etc.) for each historical date. In other embodiments, historical data can be stored relative to each historical date. For example, historical data can be stored as an incremental delta. When historical data is stored incrementally, the electronic device can determine the cluster state for the next historical date from the cluster state of the previous historical date and the incremental delta.
[0044] In some embodiments, method 200 can be performed in parallel for a plurality documents and a plurality of corpora. For example, at step 210, method 200 can obtain a plurality of documents in different corpora. In some embodiments a document can be associated with multiple corpora. The plurality of documents can be preprocessed, e.g. parsed into tokens, independent of the document's corpus. Each document can be associated with a corpus and a representative vector can be determined based on the parsed document and the TF/IDF state for the corpus. Independently for each corpus, method 200 can proceed with steps 240-260 described above to match each document with a cluster in its associated corpus (or open a new cluster), add the document to the cluster, and update the cluster state of the each corpus, e.g. cluster score.
[0045] In some embodiments, the electronic device can further group clusters into groups of one or more clusters, hereinafter referred to as megaclusters. FIG. 3 shows a flowchart representing an exemplary method 300 for adding a new cluster to a matching megacluster. In some embodiments, method 300 can be performed by a client application (e.g., a web browser, a plug-in to a web browser, a standalone executable application, etc.) running on a client device, by a server (e.g., a web server), or it can have some steps or parts thereof executed on the client device, and some steps or parts thereof executed on the server. Thus, method 300 can be performed by one or more electronic devices, such as electronic device 110. And while method 300 and the other following embodiments described herein can be performed by multiple electronic devices each having one or more processors, for purposes of simplicity and without limitation, these embodiments will be explained with respect to a single electronic device (e.g., electronic device 110). While the flowchart discloses the following steps in a particular order, it is appreciated that at least some of the steps can be moved, modified, or deleted where appropriate, consistent with the teachings of the present disclosure.
[0046] In some embodiments, method 300 can be performed for a cluster after a new document has been added to the cluster. In some embodiments, method 300 can also be performed periodically (e.g., daily, weekly, etc.) for all clusters that are active at the time or that have changed since the last time that method 300 was performed. At step 310, the electronic device obtains the new cluster to be added to a matching megacluster.
[0047] At step 320, the electronic device can obtain the next megacluster (or the first megacluster if step 320 is performed for the first time). The electronic device can obtain the next megacluster, for example, from a database of megaclusters, which can be stored remotely and/or on the electronic device, in a volatile memory (e.g., in main memory 106) and/or in a non-volatile memory (e.g., in storage device 150). In some embodiments, each megacluster can represent or be associated with one or more clusters. In some embodiments, the database can store, for each megacluster, information identifying the clusters contained in the cluster, the number of clusters, the total number of documents contained in all the clusters, and so forth.
[0048] At step 330, the electronic device can calculate an acceptance threshold for the obtained megacluster. In some embodiments, the acceptance threshold can be in direct relationship (e.g., directly proportional) to the megacluster's size (e.g., the number of clusters and/or documents contained in the megacluster), thereby making the acceptance threshold higher for larger megaclusters and lower for smaller megaclusters. In other embodiments, the acceptance threshold can be a fixed predetermined number. In some embodiments, the acceptance threshold can be time-independent, e.g., it may be independent of the megacluster's creation date or publication dates associated with documents contained in the megacluster's clusters.
[0049] At step 340, the electronic device can calculate a sum of similarities between the obtained cluster with each cluster in the megacluster (or only with some clusters in the megacluster), for example, using cosine similarities between the cluster's representative vectors. In some embodiments, instead of adding the similarities together, another function (e.g., a linear combination) representing all the similarities can be used.
[0050] At step 350, the electronic device can determine whether the sum of similarities is greater than the acceptance threshold of the obtained megacluster. In some embodiments (not shown in FIG. 3 ) if the answer is “yes,” the electronic device can add the obtained cluster to the obtained megacluster and method 300 can end. In some embodiments, however, if the answer at step 350 is “yes,” the electronic device can proceed to step 360 where it can preselect the obtained megacluster and then proceed to step 370. If the sum of similarities is not greater than the acceptance threshold of the obtained megacluster, the electronic device can proceed to step 370 directly, without preselecting the megacluster.
[0051] At step 370, the electronic device determines whether there are additional megaclusters in the database, and if so, it proceeds to step 320. Otherwise, the method proceeds to step 380. At step 380, the electronic device can analyze the preselected megaclusters (if any). If only one megacluster has been preselected, then the electronic device can add the obtained cluster to the preselected megacluster. If more than one megacluster has been preselected, then the electronic device can join the preselected megaclusters into a single megacluster, and can add the obtained cluster to the joined megacluster. To prevent the formation of a single megacluster containing all of clusters, the electronic device can also increase the acceptance threshold for the megacluster. If no megacluster has been preselected, e.g., if no megacluster was similar enough to cause the sum of similarities to exceed the acceptance threshold, the electronic device can open a new megacluster and add the obtained cluster to the new megacluster.
[0052] In some embodiments, the electronic device can also calculate a score for each megacluster. A score of a megacluster can be, for example, the highest, the average, or the median score among the clusters of the megacluster. The megacluster's score can also depend on the size of the megacluster, or it can be independent of the size of the megacluster. The megacluster's score can also be based on other properties of the clusters or the documents within those clusters, e.g. low-IDF vector similarity or any other factor that can be used to score the cluster.
[0053] While the above-described methods can be performed on any types of documents, in some embodiments, the documents can include news articles, where each news article is associated with one or more entities (e.g., Apple, Inc.). As discussed above, an article can have one or more codes or tags (e.g., stock tickers) attached to it, either manually or automatically, where the codes can indicate, for example, which entities are being discussed in the article. In these embodiments, by grouping (e.g., using method 200) news articles that are related to the same entity, that are similar in content, and that are temporally local into the same cluster, the resulting cluster can include mostly or only news articles that are likely to discuss the same particular news event, such as a release of a new iPhone® device. Thus, the electronic device can assist a user who is analyzing vast numbers of news articles (or other documents) by grouping all articles related to the same event.
[0054] In addition, by further grouping (e.g., using method 300) similar, but not necessarily temporally local, clusters into megaclusters, the electronic device can further assist the user by grouping different but related events into storylines. Accordingly, for purposes of simplicity, but without limitation, the following examples refer to clusters as “events” and to megaclusters as “storylines.”
[0055] In some embodiments, grouping documents into clusters (e.g., using method 200) and/or grouping clusters into megaclusters (e.g., using method 300) can be performed by the electronic device responsive to receiving a user input. For example, the user can enter an input requesting information about a particular entity and the electronic device can, responsive to the input, obtain a plurality of documents associated with the particular entity, group those documents into clusters and megaclusters, and present them to the user, e.g., using user interface 400 discussed below.
[0056] In some embodiments, however, the electronic device can obtain a corpus of documents and group them into clusters and megaclusters offline (e.g., periodically) before the user specifically requested to group and present that corpus. In some embodiments, the electronic device can place the corpus of documents in a queue. The electronic device can process the queue asynchronously to group the corpus into clusters and megaclusters. For example, the electronic device can periodically obtain a corpus of documents associated with a particular entity (e.g., each document being coded with that entity's code), perform methods 200 and 300 to group that corpus of documents into clusters and megaclusters, and store the results in a local or remote database. In some embodiments, the electronic device can process each document in the queue based on the document's priority. For example, the electronic device can perform separate methods 200 and 300 for documents with different levels of priority, e.g. high-priority and low-priority. To ensure sequential access to cluster state, the electronic device can block the low-priority methods from accessing the cluster state until the high-priority methods are complete. The electronic device can perform such periodic pre-calculations for any entity (e.g., any company or any person), for example, for all companies traded on a particular stock exchange, or only to most popular (e.g., most frequently requested) companies, as determined, for example, by previous requests of a particular user or a plurality of users. The frequency that the electronic device can perform these pre-calculations of clusters or megaclusters can depend on the relative importance of the corpus of documents and the rate at which the electronic device receives these documents. In some embodiments, the electronic device can use, for example, a priority queue to determine which corpus to update the cluster state.
[0057] In some embodiments, the electronic device can merge clusters and megaclusters from different corpora. For example, the electronic device can perform a full text search of all the documents in the corpora and determine the most common entities in those corpora. The electronic device can determine which clusters and megaclusters are tagged with these entities and combine clusters or megaclusters with sufficient article overlap.
[0058] FIG. 4 illustrates an exemplary user interface 400 provided by the electronic device (e.g., electronic device 110) for display (e.g., display 112) in accordance with some embodiments. User interface 400 can include, for example, an entity selection widget 410, allowing the user to enter text identifying a particular entity (e.g., a person, a company, an industry, etc.) and/or to select a particular entity from a precompiled list of entities, such as dropdown list. In some embodiments, the electronic device can determine which entity the user is interested in without receiving express identification input by the user. Instead, the electronic device can determine the entity of interest based on user behavior, for example, based on the user's most recent search query, or based on display context, for example, based on which articles are currently being displayed on the display. In some embodiments, the electronic device can determine the entity of interest based on the curation of an editor who, for example, can select relevant or interesting entities based on his or her judgment.
[0059] User interface 400 can also include a date selection widget 430, allowing the user to select a desired date (or time) range. In some embodiments, date selection widget 430 can include preselected date ranges such as “today,” “last week,” “last month,” “last year,” etc. In some embodiments, the electronic device can preset the date range to a default range, such as a range that includes all articles available for the particular entity.
[0060] In some embodiments, after the user identifies a desired entity and a desired date range, or after the electronic devices determines the entity and/or the date range automatically as discussed above, the electronic device can automatically obtain a plurality of articles corresponding to that entity (e.g., coded with the entity's code) and corresponding to that date range (e.g., published or last updated within that date range). The electronic device can then group the obtained plurality of articles into events and storylines, for example, by performing method 200 for each article to add that article to a matching event, and then performing method 300 for each event to add that event to a matching storyline. As discussed above, in some embodiments, the electronic device can group all articles for a particular entity into events or storylines ahead of time, and store the event and storyline information in the database, in which case methods 200 and 300 may not need to be performed in real time, allowing the electronic device to display the results faster, e.g., almost instantaneously.
[0061] In some embodiments, the electronic device can display the obtained articles, events, and storylines, on a timeline 440. For example, for each obtained storyline the electronic device can display its own graph (e.g., graphs 450a and 450b), each graph being visually distinct from other graphs (e.g., having a different color and/or shading), and the spikes in the graphs representing the volume of documents from that storyline that are associated with (e.g., published on) a particular day. In some embodiments, the user can select a particular storyline, for example, by clicking on or pointing at the corresponding graph with a mouse or another pointing device. When a particular storyline is selected, the electronic device can emphasize its graph and/or de-emphasize graphs of other storylines, e.g., by saturating and/or de-saturating their colors, respectively.
[0062] In some embodiments, the electronic device can display next to the timeline and/or next to the graph, events 460 of the selected storyline. For example, each event can be represented by a shape, such as a circle, whose size indicates some measure of the importance of the event (e.g., the score of the corresponding cluster). In some embodiments, event circles can be hidden based on certain criteria. For example, if two clusters are temporally local, the electronic device can display only the circle representing the cluster with the higher cluster score. Events can also be represented by event titles 470, which can be obtained by the electronic device, for example, by finding, within the articles of the corresponding event, tokens having the highest frequencies (e.g., TF/IDF frequency where term frequencies are taken for the set of documents in the cluster instead of for single documents) and then finding a phrase or a sentence containing a majority of those tokens. In some embodiments, events can be represented by the title of one of the articles, for example, by the title that is the most grammatically correct or the most concise, by the title of the earliest document in the cluster, by a title selected by which publication the document appears in using a ranked list of preferences of publication, or by a title based on scoring other codes or tags on the document, or by a title that is selected by a combination (e.g., linear combination) of these criteria. In some embodiments, the electronic device can hide titles. For example, if two clusters are temporally local, the electronic device can display only the title representing the cluster with the higher cluster score.
[0063] In some embodiments, the user can also select a particular event within a storyline, for example, by clicking on or pointing at the corresponding event 460 or a spike in the graph corresponding to the event with a mouse or another pointing device. The electronic device can then display information regarding articles 490 included in the selected event, for example, in the article preview window 480. For example, the electronic device can display in article preview window 480 the publication date and the title of each article. In some embodiments, the user can select a particular article 490 (e.g., by clicking), and the electronic device can then display the full article to the user, for example, by opening a new window containing that article. In some embodiments, some articles 490 can be associated with a hyperlink, and the electronic device can open the hyperlink corresponding to the selected article in a browser window. In some embodiments, the articles can be sorted by similarity to the representative vector of the event (cluster), by publication date, by number of clicks or reads of the article, by special tags, e.g., “frontpage article,” by social media recommendations, e.g. “Facebook Likes,” or by any other sortable category.
[0064] In some embodiments, user interface 400 can also include an event density widget 420. The density widget 420 can be a slider, allowing the user to set a range of cluster scores, a range of storyline scores, or both. In some embodiments, the density widget 420 can allow the user to set a range of percentiles, a range of densities, or both. The electronic device can be configured to only display events and storylines that are within the corresponding range of scores. Thus, if too many events and/or storylines are originally displayed by the electronic device, the user can increase the minimum score, and the electronic device will eliminate from display any events and/or storylines, whose score is below the minimum score. In some embodiments, the density widget 420 can be preset to display a fraction of the number of events and stories or a fixed number of events and storylines, e.g., ten. In other embodiments, the density can be preset to display a predefined number of overlapping events, e.g. three.
[0065] FIG. 5 illustrates another exemplary user interface 500 provided by the electronic device (e.g., electronic device 110) for display (e.g., display 112) in accordance with some embodiments. User interface 500 does not show the entity selection widget and the date selection widget. Those widgets can be displayed, for example, in a separate window (e.g., at a webpage) and user interface 500 can be displayed, for example, after the user used those widgets to select an entity (e.g., “Yahoo! Inc.”) and a date range (e.g., “last three months”), and after the electronic device has obtained the articles, events, and storylines, associated with the entity and date range. In some embodiments, the entity selection widget, the date selection widget, and/or the event density widget can be included in user interface 500.
[0066] User interface 500 can contain a title box 510 indicating, for example, the selected entity and date range. In some embodiments, the electronic device can allow the user to change the selected entity and/or date range from title box 510.
[0067] User interface 500 can also include one or more storyline preview windows 520, for example, located side by side in a row or in two or more rows (not shown), each storyline preview window 520 including information related to one of the storylines. The information can include the storyline's title, which, in some embodiments, can be the title of the highest-scored event (cluster) within the storyline (megacluster), where the event title can be obtained using methods discussed above. The information can also include a graph representing the articles within the storyline's events, each spike representing some function of the number of articles published on a particular date or the properties of the articles or their clusters (to account for normalization or incorporating scores).
[0068] The user can select one of the storyline preview windows, for example, by clicking on or pointing at it with a pointing device. When the user selects a storyline preview window, the electronic device can display one or more event preview boxes 530, positioned, for example, one over another in a column below or above the storyline preview windows 520. Each event preview box 530 can include information about the event, such as the event's title, the event's score (e.g., indicated by a size of a shape displayed in or next to the box), the dates of the earliest and the latest published article within the event, and so forth.
[0069] The user can select an event, for example, by clicking on or pointing at the corresponding event preview box with a pointing device, or by clicking on or pointing, in the corresponding storyline preview window, at a date containing articles included in the event. After the user selects an event, the electronic device can display information regarding articles included in the selected event, for example, in the article preview window 540, positioned, for example, next to event preview boxes 530 and below or above storyline preview windows 520. For example, the electronic device can display in article preview window 540 the publication date, the source, and the title of each article, or any other information related to the article. In some embodiments, as discussed above in connection with user interface 400, the user can select a particular article (e.g., by clicking), and the electronic device can then display the full article to the user, for example, by opening a new window containing that article. In some embodiments, some articles can be associated with a hyperlink, and the electronic device can open the hyperlink corresponding to the selected article in a browser window.
[0070] Embodiments of the present disclosure have been described herein with reference to numerous specific details that can vary from implementation to implementation. Certain adaptations and modifications of the described embodiments can be made. Other embodiments can be apparent to those skilled in the art from consideration of the specification and practice of the embodiments disclosed herein. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the present disclosure being indicated by the following claims. It is also intended that the sequence of steps shown in figures are only for illustrative purposes and are not intended to be limited to any particular sequence of steps. As such, it is appreciated that these steps can be performed in a different order while implementing the exemplary methods or processes disclosed herein.
Claims
What is claimed is:
1. An electronic device comprising:
one or more computer-readable storage media configured to store instructions; and
one or more processors configured to execute the instructions to cause the electronic device to:
obtain a document;
obtain from the document a plurality of tokens;
obtain a document vector based on a plurality of frequencies associated with the plurality of tokens;
obtain one or more clusters of documents, each cluster being associated with a plurality of documents, a cluster vector, a cluster weight, and a score;
mark a cluster of the one or more clusters as inactive if the cluster weight of the cluster is below a predetermined weight;
determine a matching cluster from the one or more clusters based at least on the similarity between the document vector and the cluster vector of the matching cluster;
update a database to associate the document with the matching cluster; and
update the score of the matching cluster based at least on a plurality of documents associated with the matching cluster.
2. The electronic device of claim 1, wherein each of the obtained one or more clusters is associated with an entity, and wherein the one or more processors are further configured to execute the instructions to cause the electronic device to:
after receiving a user input identifying the entity, display cluster information of the matching cluster and document information associated with the document.
3. The electronic device of claim 1, wherein the determination of the matching cluster is further based on the cluster weight of the matching cluster, and wherein the one or more processors are further configured to execute the instructions to cause the electronic device to:
periodically decrease the cluster weights of each of the one or more clusters.
4. The electronic device of claim 1, wherein the one or more processors are further configured to execute the instructions to cause the electronic device to:
update the cluster vector of the matching cluster based on the document vector.
5. The electronic device of claim 1, wherein the one or more processors are further configured to execute the instructions to cause the electronic device to:
obtain a plurality of megaclusters, each megacluster associated with one or more clusters;
determine a matching megacluster from the plurality of megaclusters based at least on the similarities between the cluster vector of the matching cluster and cluster vectors of the matching megacluster.
6. The electronic device of claim 5, wherein each of the obtained one or more clusters is associated with an entity, and wherein the one or more processors are further configured to execute the instructions to cause the electronic device to:
after receiving a user input identifying the entity, display megacluster information of the matching megacluster, cluster information of the matching cluster, and document information associated with the document.
7. The electronic device of claim 1, wherein the one or more processors are further configured to execute the instructions to cause the electronic device to:
after receiving a user input, display cluster information of the matching cluster and document information associated with the document, wherein the cluster information of the matching cluster includes the score of the matching cluster.
8. The electronic device of claim 1, wherein the one or more clusters are stored in the database and marking a cluster of the one or more clusters as inactive includes removing the cluster from the database.
9. A method performed by one or more processors, the method comprising:
obtaining a document;
obtaining from the document a plurality of tokens;
obtaining a document vector based on a plurality of frequencies associated with the plurality of tokens;
obtaining one or more clusters of documents, each cluster associated with a plurality of documents, a cluster vector, a cluster weight, and a score;
marking a cluster of the one or more clusters as inactive if the cluster weight of the cluster is below a predetermined weight;
determining a matching cluster from the one or more of clusters based at least on the similarity between the document vector and the cluster vector of the matching cluster;
updating a database to associate the document with the matching cluster; and
updating the score of the matching cluster based at least on a plurality of documents associated with the matching cluster.
10. The method of claim 9, wherein each of the obtained one or more clusters is associated with an entity, and wherein the method further comprises:
after receiving a user input identifying the entity, displaying cluster information of the matching cluster and document information associated with the document.
11. The method of claim 10, wherein the one or more clusters are stored in the database and marking a cluster of the one or more clusters as inactive includes removing the cluster from the database.
12. The method of claim 9, wherein the determination of the matching cluster is further based on the cluster weight of the matching cluster, and wherein the method further comprises:
periodically decreasing the cluster weights of each of the one or more clusters.
13. The method of claim 9, further comprising:
updating the cluster vector of the matching cluster based on the document vector.
14. The method of claim 9, further comprising:
obtaining a plurality of megaclusters, each megacluster associated with one or more clusters;
determining a matching megacluster from the plurality of megaclusters based at least on the similarities between the cluster vector of the matching cluster and cluster vectors of the matching megacluster.
15. The method of claim 14, wherein each of the obtained one or more clusters is associated with an entity, and wherein the method further comprises:
after receiving a user input identifying the entity, displaying megacluster information of the matching megacluster, cluster information of the matching cluster, and document information associated with the document.
16. The method of claim 9, wherein the method further comprises:
after receiving a user input, displaying cluster information of the matching cluster and document information associated with the document, wherein the cluster information of the matching cluster includes the score of the matching cluster.
17. A non-transitory computer-readable medium storing a set of instructions that are executable by one or more processors of one or more electronic devices to cause the one or more electronic devices to perform a method, the method comprising:
obtaining a document;
obtaining from the document a plurality of tokens;
obtaining a document vector based on a plurality of frequencies associated with the plurality of tokens;
obtaining one or more clusters of documents, each cluster associated with a plurality of documents, a cluster vector, a cluster weight, and a score;
marking a cluster of the one or more clusters as inactive if the cluster weight of the cluster is below a predetermined weight;
determining a matching cluster from the one or more clusters based at least on the similarity between the document vector and the cluster vector of the matching cluster;
providing an update to a database to associate the document with the matching cluster; and
updating the score of the matching cluster based at least on a plurality of documents associated with the matching cluster.
18. The non-transitory computer-readable medium of claim 17, wherein each of the obtained one or more clusters is associated with an entity, the non-transitory computer-readable medium further comprising instructions executable by the one or more electronic devices to cause the one or more electronic devices to perform:
after receiving a user input identifying the entity, displaying cluster information of the matching cluster and document information associated with the document.
19. The non-transitory computer-readable medium of claim 17, wherein the determination of the matching cluster is further based on the cluster weight of the matching cluster, the non-transitory computer-readable medium further comprising instructions executable by the one or more electronic devices to cause the one or more electronic devices to perform:
periodically decreasing the cluster weights of each of the one or more clusters.
20. The non-transitory computer-readable medium of claim 19, wherein the one or more clusters are stored in the database and marking a cluster of the one or more clusters as inactive includes removing the cluster from the database.
21. The non-transitory computer-readable medium of claim 17, further comprising instructions executable by the one or more electronic devices to cause the one or more electronic devices to perform:
updating the cluster vector of the matching cluster based on the document vector.
22. The non-transitory computer-readable medium of claim 17, further comprising instructions executable by the one or more electronic devices to cause the one or more electronic devices to perform:
obtaining a plurality of megaclusters, each megacluster associated with one or more clusters;
determining a matching megacluster from the plurality of megaclusters based at least on the similarities between the cluster vector of the matching cluster and cluster vectors of the matching megacluster.
23. The non-transitory computer-readable medium of claim 22, wherein each of the obtained one or more clusters is associated with an entity, the non-transitory computer-readable medium further comprising instructions executable by the one or more electronic devices to cause the one or more electronic devices to perform:
after receiving a user input identifying the entity, displaying megacluster information of the matching megacluster, cluster information of the matching cluster, and document information associated with the document.
Patent Citations (495)
| 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 |
| US5632987(A) | 1997-05-01 | Rao et al. | Applicant |
| US5670987(A) | 1997-09-01 | Doi et al. | Applicant |
| US5781704(A) | 1998-07-01 | Rossmo | Applicant |
| US5798769(A) | 1998-08-01 | Chiu et al. | Applicant |
| US5845300(A) | 1998-12-01 | Comer | 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 |
| US6366933(B1) | 2002-04-01 | Ball et al. | Applicant |
| US6369835(B1) | 2002-04-01 | Lin | Applicant |
| US6456997(B1) | 2002-09-01 | Shukla | Applicant |
| US6549944(B1) | 2003-04-01 | Weinberg et al. | Applicant |
| US6560620(B1) | 2003-05-01 | Ching | Applicant |
| US6581068(B1) | 2003-06-01 | Bensoussan et al. | Applicant |
| US6594672(B1) | 2003-07-01 | Lampson et al. | Applicant |
| 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 |
| US6820135(B1) | 2004-11-01 | Dingman | Applicant |
| US6828920(B2) | 2004-12-01 | Owen 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 |
| US6980984(B1) | 2005-12-01 | Huffman 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 | 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 et al. | Applicant |
| US7426654(B2) | 2008-09-01 | Adams et al. | Applicant |
| US7451397(B2) | 2008-11-01 | Weber et al. | Applicant |
| US7454466(B2) | 2008-11-01 | Bellotti et al. | Applicant |
| US7467375(B2) | 2008-12-01 | Tondreau et al. | Applicant |
| US7487139(B2) | 2009-02-01 | Fraleigh 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 |
| US7529734(B2) | 2009-05-01 | Dirisala | Applicant |
| US7558677(B2) | 2009-07-01 | Jones | Applicant |
| US7574409(B2) | 2009-08-01 | Patinkin | Applicant |
| US7574428(B2) | 2009-08-01 | Leiserowitz et al. | Applicant |
| US7579965(B2) | 2009-08-01 | Bucholz | Applicant |
| US7596285(B2) | 2009-09-01 | Brown et al. | Applicant |
| US7614006(B2) | 2009-11-01 | Molander | 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 |
| US7706817(B2) | 2010-04-01 | Bamrah et al. | Applicant |
| US7712049(B2) | 2010-05-01 | Williams et al. | Applicant |
| US7716077(B1) | 2010-05-01 | Mikurak | Applicant |
| US7725530(B2) | 2010-05-01 | Sah et al. | Applicant |
| US7725547(B2) | 2010-05-01 | Albertson et al. | Applicant |
| US7730082(B2) | 2010-06-01 | Sah et al. | Applicant |
| US7730109(B2) | 2010-06-01 | Rohrs et al. | Applicant |
| US7770100(B2) | 2010-08-01 | Chamberlain et al. | Applicant |
| US7805457(B1) | 2010-09-01 | Viola et al. | Applicant |
| US7809703(B2) | 2010-10-01 | Balabhadrapatruni et al. | Applicant |
| US7818658(B2) | 2010-10-01 | Chen | Applicant |
| US7870493(B2) | 2011-01-01 | Pall et al. | 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 |
| US7941321(B2) | 2011-05-01 | Greenstein et al. | Applicant |
| US7962281(B2) | 2011-06-01 | Rasmussen et al. | Applicant |
| US7962495(B2) | 2011-06-01 | Jain et al. | Applicant |
| US7962848(B2) | 2011-06-01 | Bertram | Applicant |
| US7970240(B1) | 2011-06-01 | Chao et al. | Applicant |
| US7971150(B2) | 2011-06-01 | Raskutti et al. | Examiner |
| US7984374(B2) | 2011-07-01 | Caro et al. | 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 |
| US8185819(B2) | 2012-05-01 | Sah et al. | Applicant |
| US8196184(B2) | 2012-06-01 | Amirov et al. | Applicant |
| 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 |
| US8271461(B2) | 2012-09-01 | Pike et al. | Applicant |
| US8280880(B1) | 2012-10-01 | Aymeloglu et al. | Applicant |
| US8290926(B2) | 2012-10-01 | Ozzie et al. | Applicant |
| US8290942(B2) | 2012-10-01 | Jones et al. | Applicant |
| US8301464(B1) | 2012-10-01 | Cave et al. | Applicant |
| US8301904(B1) | 2012-10-01 | Gryaznov | Applicant |
| US8312367(B2) | 2012-11-01 | Foster | Applicant |
| US8312546(B2) | 2012-11-01 | Alme | 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 |
| US8510743(B2) | 2013-08-01 | Hackborn 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 |
| US8554653(B2) | 2013-10-01 | Falkenborg et al. | Applicant |
| US8554709(B2) | 2013-10-01 | Goodson et al. | Applicant |
| US8577911(B1) | 2013-11-01 | Stepinski et al. | Applicant |
| US8589273(B2) | 2013-11-01 | Creeden et al. | Applicant |
| US8595234(B2) | 2013-11-01 | Siripurapu et al. | Examiner |
| US8620641(B2) | 2013-12-01 | Farnsworth et al. | Applicant |
| US8639757(B1) | 2014-01-01 | Zang et al. | Applicant |
| US8646080(B2) | 2014-02-01 | Williamson et al. | Applicant |
| US8676857(B1) | 2014-03-01 | Adams et al. | Applicant |
| US8689108(B1) | 2014-04-01 | Duffield et al. | Applicant |
| US8713467(B1) | 2014-04-01 | Goldenberg et al. | Applicant |
| US8726379(B1) | 2014-05-01 | Stiansen et al. | Applicant |
| US8739278(B2) | 2014-05-01 | Varghese | Applicant |
| US8742934(B1) | 2014-06-01 | Sarpy et al. | Applicant |
| US8745516(B2) | 2014-06-01 | Mason et al. | Applicant |
| US8781169(B2) | 2014-07-01 | Jackson et al. | Applicant |
| US8787939(B2) | 2014-07-01 | Papakipos et al. | Applicant |
| US8799799(B1) | 2014-08-01 | Cervelli et al. | Applicant |
| US8812960(B1) | 2014-08-01 | Sun et al. | Applicant |
| US8830322(B2) | 2014-09-01 | Nerayoff et al. | Applicant |
| US8832594(B1) | 2014-09-01 | Thompson et al. | Applicant |
| US8868537(B1) | 2014-10-01 | Colgrove et al. | Applicant |
| US8917274(B2) | 2014-12-01 | Ma et al. | Applicant |
| US8924872(B1) | 2014-12-01 | Bogomolov et al. | Applicant |
| US8937619(B2) | 2015-01-01 | Sharma et al. | Applicant |
| US8938686(B1) | 2015-01-01 | Erenrich et al. | Applicant |
| US9009171(B1) | 2015-04-01 | Grossman et al. | Applicant |
| US9009827(B1) | 2015-04-01 | Albertson et al. | Applicant |
| US9021260(B1) | 2015-04-01 | Falk et al. | Applicant |
| US9021384(B1) | 2015-04-01 | Beard et al. | Applicant |
| US9043696(B1) | 2015-05-01 | Meiklejohn et al. | Applicant |
| US9043894(B1) | 2015-05-01 | Dennison et al. | Applicant |
| US9116975(B2) | 2015-08-01 | Shankar et al. | Applicant |
| US2002/0033848(A1) | 2002-03-01 | Sciammarella et al. | Applicant |
| US2002/0065708(A1) | 2002-05-01 | Senay et al. | Applicant |
| US2002/0091707(A1) | 2002-07-01 | Keller | Applicant |
| US2002/0095658(A1) | 2002-07-01 | Shulman | Applicant |
| US2002/0116120(A1) | 2002-08-01 | Ruiz et al. | Applicant |
| US2002/0174201(A1) | 2002-11-01 | Ramer et al. | Applicant |
| US2002/0194119(A1) | 2002-12-01 | Wright et al. | Applicant |
| US2003/0028560(A1) | 2003-02-01 | Kudrolli et al. | Applicant |
| US2003/0039948(A1) | 2003-02-01 | Donahue | Applicant |
| US2003/0140106(A1) | 2003-07-01 | Raguseo | Applicant |
| US2003/0144868(A1) | 2003-07-01 | MacIntyre et al. | Applicant |
| US2003/0163352(A1) | 2003-08-01 | Surpin et al. | Applicant |
| US2003/0225755(A1) | 2003-12-01 | Iwayama et al. | Applicant |
| US2003/0229848(A1) | 2003-12-01 | Arend et al. | Applicant |
| US2004/0032432(A1) | 2004-02-01 | Baynger | Applicant |
| US2004/0064256(A1) | 2004-04-01 | Barinek et al. | Applicant |
| US2004/0085318(A1) | 2004-05-01 | Hassler et al. | Applicant |
| US2004/0095349(A1) | 2004-05-01 | Bito et al. | Applicant |
| US2004/0111410(A1) | 2004-06-01 | Burgoon et al. | Applicant |
| US2004/0126840(A1) | 2004-07-01 | Cheng et al. | Applicant |
| US2004/0143602(A1) | 2004-07-01 | Ruiz et al. | Applicant |
| US2004/0143796(A1) | 2004-07-01 | Lerner et al. | Applicant |
| US2004/0163039(A1) | 2004-08-01 | Gorman | Applicant |
| US2004/0193600(A1) | 2004-09-01 | Kaasten et al. | Applicant |
| US2004/0205524(A1) | 2004-10-01 | Richter et al. | Applicant |
| US2004/0221223(A1) | 2004-11-01 | Yu et al. | Applicant |
| US2004/0260702(A1) | 2004-12-01 | Cragun et al. | Applicant |
| US2004/0267746(A1) | 2004-12-01 | Marcjan et al. | Applicant |
| US2005/0027705(A1) | 2005-02-01 | Sadri et al. | Applicant |
| US2005/0028094(A1) | 2005-02-01 | Allyn | Applicant |
| US2005/0039119(A1) | 2005-02-01 | Parks et al. | Applicant |
| US2005/0065811(A1) | 2005-03-01 | Chu et al. | 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/0162523(A1) | 2005-07-01 | Darrell et al. | Applicant |
| US2005/0166144(A1) | 2005-07-01 | Gross | 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/0210409(A1) | 2005-09-01 | Jou | 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/0059139(A1) | 2006-03-01 | Robinson | Applicant |
| US2006/0074881(A1) | 2006-04-01 | Vembu 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/0142949(A1) | 2006-06-01 | Helt | Applicant |
| US2006/0149596(A1) | 2006-07-01 | Surpin et al. | Applicant |
| US2006/0203337(A1) | 2006-09-01 | White | Applicant |
| US2006/0209085(A1) | 2006-09-01 | Wong et al. | Applicant |
| US2006/0218637(A1) | 2006-09-01 | Thomas et al. | Applicant |
| US2006/0241974(A1) | 2006-10-01 | Chao et al. | Applicant |
| US2006/0242040(A1) | 2006-10-01 | Rader | Applicant |
| US2006/0242630(A1) | 2006-10-01 | Koike et al. | Applicant |
| US2006/0271277(A1) | 2006-11-01 | Hu et al. | Applicant |
| US2006/0279630(A1) | 2006-12-01 | Aggarwal et al. | Applicant |
| US2007/0011150(A1) | 2007-01-01 | Frank | Applicant |
| US2007/0016363(A1) | 2007-01-01 | Huang et al. | Applicant |
| US2007/0038646(A1) | 2007-02-01 | Thota | Applicant |
| US2007/0038962(A1) | 2007-02-01 | Fuchs et al. | Applicant |
| US2007/0057966(A1) | 2007-03-01 | Ohno et al. | Applicant |
| US2007/0078832(A1) | 2007-04-01 | Ott et al. | Applicant |
| US2007/0083541(A1) | 2007-04-01 | Fraleigh et al. | Applicant |
| US2007/0094389(A1) | 2007-04-01 | Nussey et al. | Applicant |
| US2007/0150369(A1) | 2007-06-01 | Zivin | Applicant |
| US2007/0174760(A1) | 2007-07-01 | Chamberlain et al. | Applicant |
| US2007/0192265(A1) | 2007-08-01 | Chopin et al. | Applicant |
| US2007/0198571(A1) | 2007-08-01 | Ferguson et al. | Applicant |
| US2007/0208497(A1) | 2007-09-01 | Downs et al. | Applicant |
| US2007/0208498(A1) | 2007-09-01 | Barker et al. | Applicant |
| US2007/0208736(A1) | 2007-09-01 | Tanigawa et al. | Applicant |
| US2007/0240062(A1) | 2007-10-01 | Christena 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/0155440(A1) | 2008-06-01 | Trevor 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/0055251(A1) | 2009-02-01 | Shah et al. | Applicant |
| US2009/0088964(A1) | 2009-04-01 | Schaaf 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/0132921(A1) | 2009-05-01 | Hwangbo et al. | Applicant |
| US2009/0132953(A1) | 2009-05-01 | Reed et al. | Applicant |
| US2009/0143052(A1) | 2009-06-01 | Bates et al. | Applicant |
| US2009/0144262(A1) | 2009-06-01 | White et al. | Applicant |
| US2009/0144274(A1) | 2009-06-01 | Fraleigh 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/0177962(A1) | 2009-07-01 | Gusmorino et al. | Applicant |
| US2009/0179892(A1) | 2009-07-01 | Tsuda et al. | Applicant |
| US2009/0187464(A1) | 2009-07-01 | Bai 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/0249244(A1) | 2009-10-01 | Robinson 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/0070842(A1) | 2010-03-01 | Aymeloglu et al. | Applicant |
| US2010/0070845(A1) | 2010-03-01 | Facemire et al. | Applicant |
| US2010/0070897(A1) | 2010-03-01 | Aymeloglu et al. | Applicant |
| US2010/0100963(A1) | 2010-04-01 | Mahaffey | Applicant |
| US2010/0103124(A1) | 2010-04-01 | Kruzeniski et al. | Applicant |
| US2010/0114887(A1) | 2010-05-01 | Conway et al. | Applicant |
| US2010/0122152(A1) | 2010-05-01 | Chamberlain et al. | Applicant |
| US2010/0131457(A1) | 2010-05-01 | Heimendinger | Applicant |
| US2010/0162176(A1) | 2010-06-01 | Dunton | 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/0228812(A1) | 2010-09-01 | Uomini | 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/0313119(A1) | 2010-12-01 | Baldwin et al. | Applicant |
| US2010/0318924(A1) | 2010-12-01 | Frankel et al. | Applicant |
| US2010/0321399(A1) | 2010-12-01 | Ellren et al. | Applicant |
| US2010/0325526(A1) | 2010-12-01 | Ellis et al. | Applicant |
| US2010/0325581(A1) | 2010-12-01 | Finkelstein et al. | Applicant |
| US2010/0330801(A1) | 2010-12-01 | Rouh | Applicant |
| US2011/0029526(A1) | 2011-02-01 | Knight et al. | Examiner |
| 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/0078055(A1) | 2011-03-01 | Faribault et al. | Applicant |
| US2011/0078173(A1) | 2011-03-01 | Seligmann et al. | Applicant |
| US2011/0093327(A1) | 2011-04-01 | Fordyce, III et al. | Applicant |
| US2011/0117878(A1) | 2011-05-01 | Barash et al. | Applicant |
| US2011/0119100(A1) | 2011-05-01 | Ruhl et al. | Applicant |
| US2011/0131547(A1) | 2011-06-01 | Elaasar | Applicant |
| US2011/0137766(A1) | 2011-06-01 | Rasmussen et al. | Applicant |
| US2011/0153384(A1) | 2011-06-01 | Horne et al. | Applicant |
| US2011/0161096(A1) | 2011-06-01 | Buehler et al. | Applicant |
| US2011/0167105(A1) | 2011-07-01 | Ramakrishnan et al. | Applicant |
| US2011/0170799(A1) | 2011-07-01 | Carrino et al. | Applicant |
| US2011/0173032(A1) | 2011-07-01 | Payne et al. | Applicant |
| US2011/0185316(A1) | 2011-07-01 | Reid et al. | Applicant |
| US2011/0208724(A1) | 2011-08-01 | Jones et al. | Applicant |
| US2011/0213655(A1) | 2011-09-01 | Henkin | Applicant |
| US2011/0218934(A1) | 2011-09-01 | Elser | Applicant |
| US2011/0219450(A1) | 2011-09-01 | McDougal et al. | Applicant |
| US2011/0225198(A1) | 2011-09-01 | Edwards et al. | Applicant |
| US2011/0238553(A1) | 2011-09-01 | Raj et al. | Applicant |
| US2011/0258158(A1) | 2011-10-01 | Resende et al. | Applicant |
| US2011/0270705(A1) | 2011-11-01 | Parker | Applicant |
| US2011/0289397(A1) | 2011-11-01 | Eastmond et al. | Applicant |
| US2011/0289407(A1) | 2011-11-01 | Naik et al. | Applicant |
| US2011/0289420(A1) | 2011-11-01 | Morioka 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. | Applicant |
| US2012/0036013(A1) | 2012-02-01 | Neuhaus et al. | Applicant |
| US2012/0036434(A1) | 2012-02-01 | Oberstein | Applicant |
| US2012/0050293(A1) | 2012-03-01 | Carlhian et al. | Applicant |
| US2012/0066296(A1) | 2012-03-01 | Appleton et al. | Applicant |
| US2012/0072825(A1) | 2012-03-01 | Sherkin et al. | Applicant |
| US2012/0079363(A1) | 2012-03-01 | Folting et al. | Applicant |
| US2012/0084118(A1) | 2012-04-01 | Bai et al. | Applicant |
| US2012/0106801(A1) | 2012-05-01 | Jackson | Applicant |
| US2012/0117082(A1) | 2012-05-01 | Koperda et al. | Examiner |
| 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/0159362(A1) | 2012-06-01 | Brown et al. | Applicant |
| US2012/0159399(A1) | 2012-06-01 | Bastide et al. | Applicant |
| US2012/0170847(A1) | 2012-07-01 | Tsukidate | Applicant |
| US2012/0173985(A1) | 2012-07-01 | Peppel | Applicant |
| US2012/0196557(A1) | 2012-08-01 | Reich et al. | Applicant |
| US2012/0196558(A1) | 2012-08-01 | Reich et al. | Applicant |
| US2012/0203708(A1) | 2012-08-01 | Psota et al. | Applicant |
| US2012/0208636(A1) | 2012-08-01 | Feige | Applicant |
| US2012/0221511(A1) | 2012-08-01 | Gibson et al. | Applicant |
| US2012/0221553(A1) | 2012-08-01 | Wittmer et al. | Applicant |
| US2012/0221580(A1) | 2012-08-01 | Barney | Applicant |
| US2012/0245976(A1) | 2012-09-01 | Kumar et al. | Applicant |
| US2012/0246148(A1) | 2012-09-01 | Dror | Applicant |
| US2012/0254129(A1) | 2012-10-01 | Wheeler et al. | Applicant |
| US2012/0284345(A1) | 2012-11-01 | Costenaro et al. | Applicant |
| US2012/0290879(A1) | 2012-11-01 | Shibuya et al. | Applicant |
| US2012/0296907(A1) | 2012-11-01 | Long et al. | Examiner |
| US2012/0311684(A1) | 2012-12-01 | Paulsen et al. | Applicant |
| US2012/0323888(A1) | 2012-12-01 | Osann, Jr. | Applicant |
| US2012/0330973(A1) | 2012-12-01 | Ghuneim et al. | Applicant |
| US2013/0006426(A1) | 2013-01-01 | Healey et al. | Applicant |
| US2013/0006725(A1) | 2013-01-01 | Simanek et al. | Applicant |
| US2013/0006916(A1) | 2013-01-01 | McBride et al. | Applicant |
| US2013/0018796(A1) | 2013-01-01 | Kolhatkar et al. | Applicant |
| US2013/0046635(A1) | 2013-02-01 | Grigg et al. | Applicant |
| US2013/0046842(A1) | 2013-02-01 | Muntz et al. | Applicant |
| US2013/0060786(A1) | 2013-03-01 | Serrano et al. | Applicant |
| US2013/0061169(A1) | 2013-03-01 | Pearcy et al. | Applicant |
| US2013/0073377(A1) | 2013-03-01 | Heath | Applicant |
| US2013/0073454(A1) | 2013-03-01 | Busch | 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/0110822(A1) | 2013-05-01 | Ikeda et al. | Applicant |
| US2013/0110877(A1) | 2013-05-01 | Bonham et al. | Applicant |
| US2013/0111320(A1) | 2013-05-01 | Campbell et al. | Applicant |
| US2013/0117651(A1) | 2013-05-01 | Waldman et al. | Applicant |
| US2013/0150004(A1) | 2013-06-01 | Rosen | Applicant |
| US2013/0151148(A1) | 2013-06-01 | Parundekar et al. | Applicant |
| US2013/0151388(A1) | 2013-06-01 | Falkenborg et al. | Applicant |
| US2013/0157234(A1) | 2013-06-01 | Gulli et al. | Applicant |
| US2013/0166550(A1) | 2013-06-01 | Buchmann et al. | 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. | Applicant |
| US2013/0226953(A1) | 2013-08-01 | Markovich et al. | Applicant |
| US2013/0238616(A1) | 2013-09-01 | Rose et al. | Applicant |
| US2013/0246170(A1) | 2013-09-01 | Gross et al. | Applicant |
| US2013/0251233(A1) | 2013-09-01 | Yang et al. | Applicant |
| US2013/0262527(A1) | 2013-10-01 | Hunter et al. | Applicant |
| US2013/0263019(A1) | 2013-10-01 | Castellanos et al. | Applicant |
| US2013/0267207(A1) | 2013-10-01 | Hao et al. | Applicant |
| US2013/0268520(A1) | 2013-10-01 | Fisher et al. | Applicant |
| US2013/0279757(A1) | 2013-10-01 | Kephart | 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 | Chandarsekaran et al. | Applicant |
| US2013/0311375(A1) | 2013-11-01 | Priebatsch | 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/0067611(A1) | 2014-03-01 | Adachi et al. | Applicant |
| US2014/0068487(A1) | 2014-03-01 | Steiger et al. | Applicant |
| US2014/0095273(A1) | 2014-04-01 | Tang et al. | Applicant |
| US2014/0095509(A1) | 2014-04-01 | Patton | Applicant |
| US2014/0108068(A1) | 2014-04-01 | Williams | Applicant |
| US2014/0108380(A1) | 2014-04-01 | Gotz et al. | Applicant |
| US2014/0108985(A1) | 2014-04-01 | Scott et al. | Applicant |
| US2014/0129261(A1) | 2014-05-01 | Bothwell et al. | Applicant |
| US2014/0149436(A1) | 2014-05-01 | Bahrami et al. | Applicant |
| US2014/0156527(A1) | 2014-06-01 | Grigg 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/0195887(A1) | 2014-07-01 | Ellis et al. | Applicant |
| US2014/0214579(A1) | 2014-07-01 | Shen et al. | Applicant |
| US2014/0267294(A1) | 2014-09-01 | Ma | Applicant |
| US2014/0267295(A1) | 2014-09-01 | Sharma | Applicant |
| US2014/0279824(A1) | 2014-09-01 | Tamayo | Applicant |
| US2014/0316911(A1) | 2014-10-01 | Gross | Examiner |
| US2014/0333651(A1) | 2014-11-01 | Cervelli et al. | Applicant |
| US2014/0337772(A1) | 2014-11-01 | Cervelli et al. | Applicant |
| US2014/0344230(A1) | 2014-11-01 | Krause et al. | Applicant |
| US2015/0019394(A1) | 2015-01-01 | Unser et al. | Applicant |
| US2015/0046870(A1) | 2015-02-01 | Goldenberg et al. | Applicant |
| US2015/0089424(A1) | 2015-03-01 | Duffield et al. | Applicant |
| US2015/0100897(A1) | 2015-04-01 | Sun et al. | Applicant |
| US2015/0100907(A1) | 2015-04-01 | Erenrich et al. | Applicant |
| US2015/0134666(A1) | 2015-05-01 | Gattiker et al. | Examiner |
| US2015/0169709(A1) | 2015-06-01 | Kara et al. | Applicant |
| US2015/0169726(A1) | 2015-06-01 | Kara et al. | Applicant |
| US2015/0170077(A1) | 2015-06-01 | Kara et al. | Applicant |
| US2015/0178877(A1) | 2015-06-01 | Bogomolov et al. | Applicant |
| US2015/0186821(A1) | 2015-07-01 | Wang et al. | Applicant |
| US2015/0187036(A1) | 2015-07-01 | Wang et al. | Applicant |
| US2015/0227295(A1) | 2015-08-01 | Meiklejohn et al. | Applicant |
| DE102014103482 | 2014-09-01 | Applicant | |
| DE102014215621 | 2015-02-01 | Applicant | |
| EP1672527 | 2006-06-01 | Applicant | |
| EP2551799 | 2013-01-01 | Applicant | |
| EP2560134 | 2013-02-01 | Applicant | |
| EP2778977 | 2014-09-01 | Applicant | |
| EP2835745 | 2015-02-01 | Applicant | |
| EP2835770 | 2015-02-01 | Applicant | |
| EP2838039 | 2015-02-01 | Applicant | |
| EP2846241 | 2015-03-01 | Applicant | |
| EP2851852 | 2015-03-01 | Applicant | |
| EP2858014 | 2015-04-01 | Applicant | |
| EP2858018 | 2015-04-01 | Applicant | |
| EP2863326 | 2015-04-01 | Applicant | |
| EP2863346 | 2015-04-01 | Applicant | |
| EP2869211 | 2015-05-01 | Applicant | |
| EP2881868 | 2015-06-01 | Applicant | |
| EP2884439 | 2015-06-01 | Applicant | |
| EP2884440 | 2015-06-01 | Applicant | |
| EP2891992 | 2015-07-01 | Applicant | |
| EP2911100 | 2015-08-01 | Applicant | |
| GB2516155 | 2015-01-01 | Applicant | |
| GB2518745 | 2015-04-01 | Applicant | |
| NL2012778 | 2014-11-01 | Applicant | |
| NL2013306 | 2015-02-01 | Applicant | |
| NZ624557 | 2014-12-01 | Applicant | |
| WO/09529 | 2000-02-01 | Applicant | |
| WO2/065353 | 2002-08-01 | Applicant | |
| WO2005/104736 | 2005-11-01 | Applicant | |
| WO2008/064207 | 2008-05-01 | Applicant | |
| WO2009/061501 | 2009-05-01 | Applicant | |
| WO2010/000014 | 2010-01-01 | Applicant | |
| WO2010/030913 | 2010-03-01 | Applicant | |
| WO2013/010157 | 2013-01-01 | Applicant | |
| WO2013/102892 | 2013-07-01 | Applicant |
Non-Patent Literature (165)
- 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.Applicant
- 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.Applicant
- Definition “Identify” downloaded Jan. 22, 2015, 1 page.Applicant
- Definition “Overlay” downloaded Jan. 22, 2015, 1 page.Applicant
- Hardesty, “Privacy Challenges: Analysis: It's Surprisingly Easy to Identify Individuals from Credit-Card Metadata,” MIT News on Campus and Around the World, MIT News Office, Jan. 29, 2015, 3 pages.Applicant
- 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.Applicant
- Li et al., “Interactive Multimodal Visual Search on Mobile Device,” IEEE Transactions on Multimedia, vol. 15, No. 3, Apr. 1, 2014, pp. 594-607.Applicant
- Nierman, “Evaluating Structural Similarity in XML Documents,” 2002, 6 pages.Applicant
- Olanoff, Drew, “Deep Dive with the New Google Maps for Desktop with Google Earth Integration, Its 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/.Applicant
- 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.Applicant
- 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.Applicant
- Yang et al., “HTML Page Analysis Based on Visual Cues,” 2001, pp. 859-864.Applicant
- Official Communication for Australian Patent Application No. 2014201511 dated Feb. 27, 2015.Applicant
- Official Communication for Australian Patent Application No. 2014202442 dated Mar. 19, 2015.Applicant
- Official Communication for European Patent Application No. 14180281.9 dated Jan. 26, 2015.Applicant
- Official Communication for European Patent Application No. 14180142.3 dated Feb. 6, 2015.Applicant
- Official Communication for European Patent Application No. 14187996.5 dated Feb. 12, 2015.Applicant
- Official Communication for European Patent Application No. 14186225.0 dated Feb. 13, 2015.Applicant
- Official Communication for European Patent Application No. 14189344.6 dated Feb. 20, 2015.Applicant
- Official Communication for European Patent Application No. 14189347.9 dated Mar. 4, 2015.Applicant
- Official Communication for European Patent Application No. 14199182.8 dated Mar. 13, 2015.Applicant
- Official Communication for European Patent Application No. 14180321.3 dated Apr. 17, 2015.Applicant
- Official Communication for European Patent Application No. 14197879.1 dated Apr. 28, 2015.Applicant
- Official Communication for European Patent Application No. 14197895.7 dated Apr. 28, 2015.Applicant
- Official Communication for European Patent Application No. 14189802.3 dated May 11, 2015.Applicant
- Official Communication for Great Britain Patent Application No. 1404574.4 dated Dec. 18, 2014.Applicant
- Official Communication for Great Britain Patent Application No. 1411984.6 dated Dec. 22, 2014.Applicant
- Official Communication for Great Britain Patent Application No. 1413935.6 dated Jan. 27, 2015.Applicant
- Notice of Allowance for U.S. Appl. No. 14/192,767 dated Dec. 16, 2014.Applicant
- Notice of Allowance for U.S. Appl. No. 14/294,098 dated Dec. 29, 2014.Applicant
- Notice of Allowance for U.S. Appl. No. 14/473,860 dated Jan. 5, 2015.Applicant
- Notice of Allowance for U.S. Appl. No. 14/616,080 dated Apr. 2, 2015.Applicant
- Notice of Allowance for U.S. Appl. No. 14/486,991 dated May 1, 2015.Applicant
- Notice of Allowance for U.S. Appl. No. 14/225,084 dated May 4, 2015.Applicant
- Notice of Allowance for U.S. Appl. No. 14/504,103 dated May 18, 2015.Applicant
- Official Communication for U.S. Appl. No. 14/289,596 dated Jan. 26, 2015.Applicant
- Official Communication for U.S. Appl. No. 14/319,765 dated Feb. 4, 2015.Applicant
- Official Communication for U.S. Appl. No. 14/504,103 dated Feb. 5, 2015.Applicant
- Official Communication for U.S. Appl. No. 14/225,160 dated Feb. 11, 2015.Applicant
- Official Communication for U.S. Appl. No. 14/306,138 dated Feb. 18, 2015.Applicant
- Official Communication for U.S. Appl. No. 14/306,147 dated Feb. 19, 2015.Applicant
- Official Communication for U.S. Appl. No. 14/225,084 dated Feb. 20, 2015.Applicant
- Official Communication for U.S. Appl. No. 14/473,552 dated Feb. 24, 2015.Applicant
- Official Communication for U.S. Appl. No. 14/225,006 dated Feb. 27, 2015.Applicant
- Official Communication for U.S. Appl. No. 13/831,791 dated Mar. 4, 2015.Applicant
- Official Communication for U.S. Appl. No. 14/486,991 dated Mar. 10, 2015.Applicant
- Official Communication for U.S. Appl. No. 14/306,154 dated Mar. 11, 2015.Applicant
- Official Communication for U.S. Appl. No. 14/148,568 dated Mar. 26, 2015.Applicant
- Official Communication for U.S. Appl. No. 14/504,103 dated Mar. 31, 2015.Applicant
- Official Communication for U.S. Appl. No. 14/323,935 dated Mar. 31, 2015.Applicant
- Official Communication for U.S. Appl. No. 14/326,738 dated Mar. 31, 2015.Applicant
- Official Communication for U.S. Appl. No. 13/247,987 dated Apr. 2, 2015.Applicant
- Restriction Requirement for U.S. Appl. No. 13/839,026 dated Apr. 2, 2015.Applicant
- “A First Look: Predicting Market Demand for Food Retail using a Huff Analysis,” TRF Policy Solutions, Jul. 2012, pp. 30.Applicant
- “A Quick Guide to UniProtKB Swiss-Prot & TrEMBL,” Sep. 2011, pp. 2.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. 21, 2006, pp. 8.Applicant
- Bluttman et al., “Excel Formulas and Functions for Dummies,” 2005, Wiley Publishing, Inc., pp. 280, 284-286.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
- Canese et al., “Chapter 2: PubMed: The Bibliographic Database,” The NCBI Handbook, Oct. 2002, pp. 1-10.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
- Conner, Nancy, “Google Apps: The Missing Manual,” May 1, 2008, pp. 15.Applicant
- Delcher et al., “Identifying Bacterial Genes and Endosymbiont DNA with Glimmer,” BioInformatics, vol. 23, No. 6, 2007, pp. 673-679.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-mode1/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
- Goswami, Gautam, “Quite Writly Said!,” One Brick at a Time, Aug. 21, 2005, pp. 7.Applicant
- Griffith, Daniel A., “A Generalized Huff Model,” Geographical Analysis, Apr. 1982, vol. 14, No. 2, pp. 135-144.Applicant
- 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.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
- Kahan et al., “Annotea: an open RDF infrastructure for shared WEB annotations”, Computer Networks 39, pp. 589-608, 2002.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 pages.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
- 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
- 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
- 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.bing.com.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.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
- Mizrachi, Ilene, “Chapter 1: GenBank: The Nuckeotide Sequence Database,” The NCBI Handbook, Oct. 2002, pp. 1-14.Applicant
- Palmas et al., “An Edge-Bunding Layout for Interactive Parallel Coordinates” 2014 IEEE Pacific Visualization Symposium, 2014, pp. 57-64.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
- Vose et al., “Help File for ModelRisk Version 5,” 2007, Vose Software, pp. 349-353. [Uploaded in 2 Parts].Applicant
- Issue Notification for U.S. Appl. No. 13/917,571 dated Aug. 5, 2014.Applicant
- Notice of Allowance for U.S. Appl. No. 14/102,394 dated Aug. 25, 2014.Applicant
- Notice of Allowance for U.S. Appl. No. 14/108,187 dated Aug. 29, 2014.Applicant
- Notice of Allowance for U.S. Appl. No. 14/135,289 dated Oct. 14, 2014.Applicant
- Notice of Allowance for U.S. Appl. No. 14/268,964 dated Dec. 3, 2014.Applicant
- Official Communication for New Zealand Patent Application No. 624557 dated May 14, 2014.Applicant
- Official Communication for New Zealand Patent Application No. 628585 dated Aug. 26, 2014.Applicant
- Official Communication for European Patent Application No. 14158861.6 dated Jun. 16, 2014.Applicant
- Official Communication for New Zealand Patent Application No. 622517 dated Apr. 3, 2014.Applicant
- Official Communication for New Zealand Patent Application No. 628263 dated Aug. 12, 2014.Applicant
- Official Communication for Great Britain Patent Application No. 1404457.2 dated Aug. 14, 2014.Applicant
- Official Communication for New Zealand Patent Application No. 627962 dated Aug. 5, 2014.Applicant
- Official Communication for European Patent Application No. 14159464.8 dated Jul. 31, 2014.Applicant
- Official Communication for European Patent Application No. 14159464.8 dated Aug. 20, 2014.Applicant
- Official Communication for European Patent Application No. 14159464.8 dated Sep. 22, 2014.Applicant
- Official Communication for New Zealand Patent Application No. 628840 dated Aug. 28, 2014.Applicant
- Official Communication in New Zealand Application No. 628495 dated Aug. 19, 2014.Applicant
- Official Communication for United Kingdom Patent Application No. 1408025.3 dated Nov. 6, 2014.Applicant
- Official Communication for New Zealand Patent Application No. 622513 dated Apr. 3, 2014.Applicant
- Official Communication for New Zealand Patent Application No. 628161 dated Aug. 25, 2014.Applicant
- Official Communication for U.S. Appl. No. 14/289,596 dated Jul. 18, 2014.Applicant
- Official Communication for U.S. Appl. No. 14/289,599 dated Jul. 22, 2014.Applicant
- Official Communication for U.S. Appl. No. 14/225,160 dated Jul. 29, 2014.Applicant
- Official Communication for U.S. Appl. No. 14/268,964 dated Sep. 3, 2014.Applicant
- Official Communication for U.S. Appl. No. 14/225,084 dated Sep. 2, 2014.Applicant
- Official Communication for U.S. Appl. No. 14/294,098 dated Aug. 15, 2014.Applicant
- Official Communication for U.S. Appl. No. 14/148,568 dated Oct. 22, 2014.Applicant
- Official Communication for U.S. Appl. No. 14/225,006 dated Sep. 10, 2014.Applicant
- Official Communication for U.S. Appl. No. 14/294,098 dated Nov. 6, 2014.Applicant
- Official Communication for U.S. Appl. No. 14/306,138 dated Sep. 23, 2014.Applicant
- Official Communication for U.S. Appl. No. 14/306,154 dated Sep. 9, 2014.Applicant
- Official Communication for U.S. Appl. No. 14/306,147 dated Sep. 9, 2014.Applicant
- Official Communication for U.S. Appl. No. 14/319,765 dated Nov. 25, 2014.Applicant
- Official Communication for U.S. Appl. No. 14/323,935 dated Nov. 28, 2014.Applicant
- Official Communication for U.S. Appl. No. 14/326,738 dated Dec. 2, 2014.Applicant
- Official Communication for U.S. Appl. No. 14/225,160 dated Oct. 22, 2014.Applicant
- “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/.Applicant
- 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.Applicant
- 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.Applicant
- “Potential Money Laundering Warning Signs,” snapshot taken 2003, https://web.archive.org/web/20030816090055/http:/finsolinc.com/ANTI-MONEY%20LAUNDERING%20TRAINING%20GUIDES.pdf.Applicant
- “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.Applicant
- Thompson, Mick, “Getting Started with GEO,” Getting Started with GEO, Jul. 26, 2011.Applicant
- Official Communication for Australian Patent Application No. 2014213553 dated May 7, 2015.Applicant
- Official Communication for Australian Patent Application No. 2014210604 dated Jun. 5, 2015.Applicant
- Official Communication for Australian Patent Application No. 2014210614 dated Jun. 5, 2015.Applicant
- Official Communication for Australian Patent Application No. 2014250678 dated Jun. 17, 2015.Applicant
- Official Communication for European Patent Application No. 14191540.5 dated May 27, 2015.Applicant
- Official Communication for European Patent Application No. 14180432.8 dated Jun. 23, 2015.Applicant
- Official Communication for European Patent Application No. 14187739.9 dated Jul. 6, 2015.Applicant
- Official Communication for Netherlands Patent Application No. 2013306 dated Apr. 24, 2015.Applicant
- Notice of Allowance for U.S. Appl. No. 14/473,552 dated Jul. 24, 2015.Applicant
- Official Communication for U.S. Appl. No. 14/196,814 dated May 5, 2015.Applicant
- Official Communication for U.S. Appl. No. 14/639,606 dated May 18, 2015.Applicant
- Official Communication for U.S. Appl. No. 14/579,752 dated May 26, 2015.Applicant
- Official Communication for U.S. Appl. No. 14/306,154 dated May 15, 2015.Applicant
- Official Communication for U.S. Appl. No. 14/289,599 dated May 29, 2015.Applicant
- Official Communication for U.S. Appl. No. 14/225,160 dated May 20, 2015.Applicant
- Official Communication for U.S. Appl. No. 14/306,138 dated May 26, 2015.Applicant
- Official Communication for U.S. Appl. No. 14/289,596 dated Apr. 30, 2015.Applicant
- Official Communication for U.S. Appl. No. 14/319,765 dated Jun. 16, 2015.Applicant
- Official Communication for U.S. Appl. No. 13/835,688 dated Jun. 17, 2015.Applicant
- Official Communication for U.S. Appl. No. 14/306,154 dated Jul. 6, 2015.Applicant
- Official Communication for U.S. Appl. No. 12/556,318 dated Jul. 2, 2015.Applicant
- Official Communication for U.S. Appl. No. 14/639,606 dated Jul. 24, 2015.Applicant
- Official Communication for U.S. Appl. No. 14/326,738 dated Jul. 31, 2015.Applicant
- Official Communication for U.S. Appl. No. 14/306,147 dated Aug. 7, 2015.Applicant
- Official Communication for U.S. Appl. No. 13/839,026 dated Aug. 4, 2015.Applicant
- Official Communication for U.S. Appl. No. 14/225,160 dated Aug. 12, 2015.Applicant
- Official Communication for U.S. Appl. No. 14/579,752 dated Aug. 19, 2015.Applicant
- Official Communication for U.S. Appl. No. 14/225,006 dated Sep. 2, 2015.Applicant
- Official Communication for U.S. Appl. No. 14/631,633 dated Sep. 10, 2015.Applicant
- Official Communication for U.S. Appl. No. 13/831,791 dated Aug. 6, 2015.Applicant