Patent Grant
9384285
The disclosure herein relates generally to identifying related documents. In file systems and other types of electronic document storage systems, users often spend a lot of time curating their documents. One example of a way in which users curate documents is by organizing the documents into collections. For example, a user may place a group of related documents in a folder, and give the folder a meaningful title that describes the documents.
Previous document storage systems have implemented many different types of collections. Examples of collections include folder based collections, tag based collections, and keyword based collections. In some document storage systems, a document can be a part of only one collection, while in other document storage systems, a document can be a part of multiple collections. A common goal of many types of collections, however, is to group related documents.
Some previous efforts have attempted to automatically group related documents based on words or phrases that appear in the documents or in their titles. Although the presence of common words or phrases in a group of documents may provide some insight as to whether those documents are related, false positive results may be generated in situations where a user's documents include unrelated documents that are directed to similar subject matter, and related documents may not always include common keywords.
The disclosure relates to identifying related documents.
One aspect of the disclosed embodiments is a method that includes receiving, at a storage system, usage pattern information regarding each document from two or more documents that are stored at the storage system. The method also includes determining whether the two or more documents are likely to be related documents based at least in part on the usage pattern information. The method also includes defining, at the storage system, a collection including the two or more documents if it is determined that the documents are likely to be related documents.
Another aspect of the disclosed embodiments is a storage medium including program instructions that are executable by one or more processors. When executed, the program instructions cause the one or more processors to perform operations. The operations include receiving, at a storage system, usage pattern information regarding each document from two or more documents that are stored at the storage system. The operations also include determining whether the two or more documents are likely to be related documents based at least in part on the usage pattern information. The operations also include defining, at the storage system, a collection including the two or more documents if it is determined that the documents are likely to be related documents.
Another aspect of the disclosed embodiments is an apparatus that includes one or more processors; and one or more memory devices for storing program instructions used by the one or more processors. The program instructions, when executed by the one or more processors, cause the one or more processors to receive usage pattern information regarding each document from two or more documents that are stored at a storage system, determine whether the two or more documents are likely to be related documents based at least in part on the usage pattern information, and define, at the storage system, a collection including the two or more documents if it is determined that the documents are likely to be related documents.
The description herein makes reference to the accompanying drawings wherein like reference numerals refer to like parts throughout the several views, and wherein:
The disclosure herein relates identifying related documents based on usage pattern information. When working on a project or task, users often create, edit, or view multiple documents that are related to the project or task. During a relatively short time period, the user may simultaneously open two or more documents, switch back and forth between two or more documents, perform copy and paste operations between two or more documents, or engage in other similar usage patterns that can be used as a basis for inferring that the documents are related. As examples, the usage pattern information can include information representing transactions or events that occur with respect to the documents by one or more users, such as creating, accessing, viewing, and editing the documents. The usage pattern information can be used in isolation to determine whether documents are related, or can be combined with other signals that provide a basis for inferring that the documents are related. The other signals can include, but are not limited to, the content of the documents, and the identities of persons who have been granted access to view and/or modify the documents in the context of a shared workspace in which documents are edited collaboratively.
The document storage and editing system 110 can be implemented in the form of one or more host computing devices 150 that implement a document storage system that is associated with a document editing system. These systems are associated at least by the ability of the document editing system to receive, view, edit and save documents that are stored at and/or managed by the document storage system. The document storage system and document editing system can be implemented by separate servers or groups of servers. The document storage system and the document editing system need not be physically co-located with one another, but rather, can be implemented by servers that are at remote locations with respect to each other, and which communicate via the network 140. The document storage system and the document editing system can be operated by a single entity or by different entities. In some implementations, the document storage and editing system 110 is part of a shared workspace in which documents can be edited collaboratively by multiple users who have been granted access to view and/or modify the documents by the owner of the documents. In some implementations, the document editing system can include multiple document editing systems that, for example, each perform a different type of editing task or are operable to edit different types of documents.
One or more items 152 can be stored at the document storage and editing system 110. As examples, the items 152 can include data files, documents such as word processing documents, spreadsheet documents, presentations, diagrams, images, video files, and audio files. One or more metadata attributes 154 can be associated with each of the items 152. As examples, the metadata attributes 154 can include the identities of one or more owners of the items 152, the identities of one or more collections in which the items 152 are included, the identities of non-owner third-party users that are allowed to view and/or access the items 152, and any other type of data that is or can be tracked with respect to the items 152.
The host computing device 150 can include memory 220, such as a random access memory device (RAM). Any other suitable type of storage device can be used as the memory 220. The memory 220 can include code and data 222 that can be accessed by the CPU 210 using a bus 230. The memory 220 can further include one or more application programs 224 and an operating system 226. The application programs 224 can include software components in the form of computer executable program instructions that cause the CPU 210 to perform the operations and methods described herein.
A storage device 240 can be optionally provided in the form of any suitable computer readable medium, such as a hard disc drive, a memory device, a flash drive or an optical drive. One or more input devices 250, such as a keyboard, a mouse, or a gesture sensitive input device, receive user inputs and can output signals or data indicative of the user inputs to the CPU 210. One or more output devices can be provided, such as a display device 260. The display device 260, such as liquid crystal display (LCD) or a cathode-ray tube (CRT), allows output to be presented to a user, for example, in response to receiving a video signal.
Although
In this example, a plurality of interface tabs 310 allow the user to switch the current view between a document list interface view 320 and a plurality of document editing interface views, such as a first document editing interface view 330 and a second document editing interface view 340.
The document list interface view 320 can include a document list 322 that displays a list of documents that are accessible by the user. The user can select one or more of the documents that is represented in the document list 322 in order to perform operations with respect to the document or documents, such as opening the document, moving the document into a folder, modifying a metadata attribute associated with the document, and/or deleting the document. Other types of operations could be performed with respect to the one or more selected documents in the context of the document list 322.
The document list interface view can include a navigation area 324. The navigation area 324 can include one or more user operable interface elements that allow the user to navigate between different views. For example, the navigation area 324 can include a first plurality of navigation buttons 326 that correspond to folder-based collections and cause the document list interface view 320 to display the documents associated with the respective folder-based collection when operated by the user. The navigation area 324 can also include one or more non-folder-based collection navigation buttons 328 that cause the document list interface view 320 to display one or more documents that are associated with a non-folder-based collection of one or more documents when operated by the user.
The first document editing interface view 330 and second document editing interface view 340 can each correspond to one of the documents that are represented in the document list 322. Each of the first document editing interface view 330 and the second document editing interface view 340 can include one or more user interface elements that can be utilized to view and/or edit the document. Examples of these user operable interface elements include scroll bars, text entry fields, and buttons that implement editing and/or formatting functions such as copying, pasting, highlighting, and text formatting.
The document storage and editing system 110 can receive and track usage pattern information that describes the actions that the user is performing with respect to one or more documents. This information can include the document being opened, the document being closed, information indicating that the document is being viewed, and information describing editing operations that are performed with respect to the document. The information indicating that the document is being viewed can represent any action or operation that is performed by the user and which provides a suitable basis from which to infer that the document is being viewed, such as a tab or window gaining focus, scrolling operations, highlighting operations, and editing operations. Editing operations can include any manner of action taken by the user with respect to the contents of the document including cut and paste operations, text entry operations, and formatting operations. Information regarding these operations can be received at the document storage and editing system 110 and can be stored as usage pattern information in association with time stamps or other information indicating the time at which the operations occurred.
Based at least in part on the usage pattern information for two or more of the documents, the document storage and editing system 110 can determine whether the two or more documents are likely to be related documents. The usage pattern information can be utilized as the sole basis for making this determination, or the usage pattern information can be considered in combination with other signals that provide a basis from which to infer that the documents are related documents.
If the two or more documents are likely to be related documents, for example, when a likelihood that the two or more documents are related exceeds a threshold value, a collection including the two or more documents can be defined at the document storage and editing system 110.
In operation 510, two or more documents are stored at the document storage and editing system 110. At operation 520, the document storage and editing system 110 receives usage pattern information regarding usage of the two or more documents that were stored at the document storage and editing system 110 in operation 510. The usage pattern information can include information representing transactions or events that occur with respect to the documents by one or more users, such as creating, accessing, viewing, and editing the documents. The usage pattern information can reflect the usage patterns of a single user with respect to the documents or can reflect the usage patterns of multiple users with respect to the documents. Usage pattern information can be collected independently for each document from the two or more documents.
At operation 530, a determination is made regarding whether the two or more documents are likely to be related. This determination can be made based at least in part on the usage pattern information. Other signals can be used as part of the basis for determining that the two or more documents are likely to be related documents. This determination can be made in any suitable matter. As one example, a rating can be made for each of a plurality of factors, including some factors that are based on the usage pattern information, a weighted average of those rankings can be made, and the documents can be determined to be related if the likelihood value exceeds a threshold value. Examples of processes for determining whether documents are likely to be related are described with respect to
If, at operation 530, it is determined that the documents are related documents, the process can advance to operation 540. At operation 540, the documents can be added to a collection. Adding the documents to a collection can include prompting the user to request confirmation that the documents are related documents prior to creating the collection, wherein the collection is created upon receiving confirmation from the user that the documents are related documents. Adding the documents to a collection can also include prompting the user for information describing the collection, such as a name. Adding the documents to a collection can also include identifying at least one existing collection that is associated with at least one of the documents, prompting the user to determine whether the documents should be added to the existing collection, and modifying the existing collection to include the documents upon receiving confirmation from the user that the documents should be added to the existing collection. As an example, an existing collection can be associated with a document when the document is already included in the existing collection. After the documents are added to a collection at operation 540, the process ends.
If, at operation 530, it is determined that the documents are not related documents, the process ends.
The operations described in connection with the first example process 600 can be performed at one or more computers, such as at the host computing device 150. When an operation is performed by one or more computers, it is completed when it is performed by one computer. The operations described in connection with the first example process 600 can be embodied as a non-transitory computer readable storage medium including program instructions executable by one or more processors that, when executed, cause the one or more processors to perform the operations. For example, the operations described in connection with the first example process 600 could be stored at the memory 220 of the host computing device 150 and be executable by the CPU 210 of the respective host computing device 150.
At operation 610, a determination is made as to whether two or more documents are open concurrently by a single user at the document storage and editing system. If it is determined that two or more documents are not open concurrently by a single user, the process ends. If it is determined that two or more documents are open concurrently by a single user, the process advances to operation 620.
At operation 620, a determination is made as to whether a time threshold is satisfied with respect to two or more of the concurrently open documents. As one example, the threshold can exclude any individual document that has been open less than a threshold time. As another example, the threshold can be applied to exclude pairs of documents as potential related documents if they have been open concurrently by a single user for less than a threshold time. If the time threshold is not satisfied, the process ends. If the time threshold is satisfied, the process advances to operation 630.
At operation 630 the documents are identified as related documents. This determination can be utilized, for example, in the process 500 at operation 530. The process then ends.
The operations described in connection with the second example process 700 can be performed at one or more computers, such as at the host computing device 150. When an operation is performed by one or more computers, it is completed when it is performed by one computer. The operations described in connection with the second example process 700 can be embodied as a non-transitory computer readable storage medium including program instructions executable by one or more processors that, when executed, cause the one or more processors to perform the operations. For example, the operations described in connection with the second example process 700 could be stored at the memory 220 of the host computing device 150 and be executable by the CPU 210 of the respective host computing device 150.
At operation 710, a determination is made as to whether two or more documents are open concurrently by a single user at the document storage and editing system. If it is determined that two or more documents are not open concurrently by a single user, the process ends. If it is determined that two or more documents are open concurrently by a single user, the process advances to operation 720.
At operation 720, a determination is made as to whether a secondary relatedness threshold is satisfied. As one example, a secondary relatedness threshold can be satisfied where a threshold number of users are identified as collaborators with respect to each of the documents being considered. Users can be identified as collaborators, for example, if the users have been granted access to the document, if the users have accessed the document, and/or if the users have modified the document. As another example, a secondary relatedness threshold can be satisfied based on the content of the documents, such as the presence of common keywords or subject matter. If the secondary relatedness threshold is not satisfied, the process ends. If the secondary relatedness threshold is satisfied, the process advances to operation 730.
At operation 730 the documents are identified as related documents. This determination can be utilized, for example, in the process 500 at operation 530. The process then ends.
The operations described in connection with the third example process 800 can be performed at one or more computers, such as at the host computing device 150. When an operation is performed by one or more computers, it is completed when it is performed by one computer. The operations described in connection with the third example process 800 can be embodied as a non-transitory computer readable storage medium including program instructions executable by one or more processors that, when executed, cause the one or more processors to perform the operations. For example, the operations described in connection with the third example process 800 could be stored at the memory 220 of the host computing device 150 and be executable by the CPU 210 of the respective host computing device 150.
At operation 810, a determination is made as to whether two or more documents are open concurrently by a single user at the document storage and editing system. If it is determined that two or more documents are not open concurrently by a single user, the process ends. If it is determined that two or more documents are open concurrently by a single user, the process advances to operation 820.
At operation 820, a determination is made as to whether a time threshold is satisfied with respect to two or more of the concurrently open documents. As one example, the threshold can exclude any individual document that has been open less than a threshold time. As another example, the threshold can be applied to exclude pairs of documents as potential related documents if they have been open concurrently by a single user for less than a threshold time. If the time threshold is not satisfied, the process ends. If the time threshold is satisfied, the process advances to operation 830.
At operation 830, a determination is made as to whether a secondary relatedness threshold is satisfied. As one example, a secondary relatedness threshold can be satisfied where a threshold number of users are identified as collaborators with respect to each of the documents being considered. Users can be identified as collaborators, for example, if the users have been granted access to the document, if the users have accessed the document, and/or if the users have modified the document. As another example, a secondary relatedness threshold can be satisfied based on the content of the documents, such as the presence of common keywords or subject matter. If the secondary relatedness threshold is not satisfied, the process ends. If the secondary relatedness threshold is satisfied, the process advances to operation 840.
At operation 840 the documents are identified as related documents. This determination can be utilized, for example, in the process 500 at operation 530. The process then ends.
In the first example process 600, the second example process 700 and the third example process 800, a determination is made as to whether documents are open concurrently, at operation 610, operation 710, and operation 810, respectively. As an alternative, usage information based criteria that include analyzing the usage pattern information regarding each document from two or more documents during a temporal window could be utilized in lieu of these operations. As one example, a beginning time and an ending time for a working session could be determined, and documents could be considered to be related if they are opened during the same working session. The beginning and ending times for a working session can be judged by any suitable criteria, such as the time period during which the user is logged in to the document storage system and/or the document editing system. As another example, the beginning time and the ending time for a working session can be judged based on the time period during which a user has any document open at the document storage system and/or the document editing system. As another alternative, usage information based criteria could include determining whether two or more documents have been viewed sequentially by a single user.
In the first example process 600, the second example process 700 and the third example process 800, the usage pattern information can be associated with a single user, or can be associated with a plurality of users.
In the first example process 600, the second example process 700 and the third example process 800, criteria relating to usage, collaborators, and document content are applied in the form of thresholds. In other implementations, these criteria can be applied in other manners. As an example, these criteria can be implemented in a factor-based analysis. In one example of a factor-based analysis, usage patterns, collaborators, document content, and other signals can each be modeled as a factor with a value ranging from a minimum to a maximum, based on the degree to which that individual factors indicate that the documents are likely to be related.
For example, instead of treating the fact that documents are open concurrently as a simple threshold, the value of a usage pattern based factor can be based on usage pattern information such as the number of document editing transactions that are performed with respect to each document within a temporal window. Some document editing transactions could be weighted differently than others. For example, a copy-and-paste operation the copies material from a first document into a second document can be weighted heavily in favor of a determination that the documents are related.
In a factor-based analysis, the factors can be combined, for example, by a weighted average, where the weighting factors are assigned in any desired manner, and represent, for example, an assessment of the probative value of the factor relative to whether the documents are related. The factors are then combined, and can be compared to a threshold value in order to determine whether the documents are related. The weightings and thresholds in a factor-based analysis can, but need not be, assigned such that a single factor is dispositive. For example, documents could be identified as related where the usage pattern information strongly suggests relatedness and no secondary relatedness factors are present.
As used herein, information, signals, or data are received by transmission or accessing the information, signals, or data in any form, such as receiving by transmission over a network, receiving by accessing from a storage device, or receiving by user operation of an input device.
The foregoing description describes only some exemplary implementations of the described techniques. Other implementations are available. For example, the particular naming of the components, capitalization of terms, the attributes, data structures, or any other programming or structural aspect is not mandatory or significant, and the mechanisms that implement the systems and methods described herein or their features may have different names, formats, or protocols. Further, the system may be implemented via a combination of hardware and software, as described, or entirely in hardware elements. Also, the particular division of functionality between the various system components described herein is merely exemplary, and not mandatory; functions performed by a single system component may instead be performed by multiple components, and functions performed by multiple components may instead performed by a single component.
The words “example” or “exemplary” are used herein to mean serving as an example, instance, or illustration. Any aspect or design described herein as “example” or “exemplary” is not necessarily to be construed as preferred or advantageous over other aspects or designs. Rather, use of the words “example” or “exemplary” is intended to present concepts in a concrete fashion. As used in this application, the term “or” is intended to mean an inclusive “or” rather than an exclusive “or”. That is, unless specified otherwise, or clear from context, “X includes A or B” is intended to mean any of the natural inclusive permutations. That is, if X includes A; X includes B; or X includes both A and B, then “X includes A or B” is satisfied under any of the foregoing instances. In addition, the articles “a” and “an” as used in this application and the appended claims should generally be construed to mean “one or more” unless specified otherwise or clear from context to be directed to a singular form. Moreover, use of the term “an embodiment” or “one embodiment” or “an implementation” or “one implementation” throughout is not intended to mean the same embodiment or implementation unless described as such.
The implementations of the computer devices (e.g., clients and servers) described herein can be realized in hardware, software, or any combination thereof. The hardware can include, for example, computers, intellectual property (IP) cores, application-specific integrated circuits (ASICs), programmable logic arrays, optical processors, programmable logic controllers, microcode, microcontrollers, servers, microprocessors, digital signal processors or any other suitable circuit. In the claims, the term “processor” should be understood as encompassing any of the foregoing hardware, either singly or in combination. The terms “signal” and “data” are used interchangeably. Further, portions of each of the clients and each of the servers described herein do not necessarily have to be implemented in the same manner.
Operations that are described as being performed by a single processor, computer, or device can be distributed across a number of different processors, computers or devices. Similarly, operations that are described as being performed by different processors, computers, or devices can, in some cases, be performed by a single processor, computer or device.
Although features may be described above or claimed as acting in certain combinations, one or more features of a combination can in some cases be excised from the combination, and the combination may be directed to a sub-combination or variation of a sub-combination.
The systems described herein, such as client computers and server computers, can be implemented using general purpose computers/processors with a computer program that, when executed, carries out any of the respective methods, algorithms and/or instructions described herein. In addition or alternatively, for example, special purpose computers/processors can be utilized which can contain specialized hardware for carrying out any of the methods, algorithms, or instructions described herein.
Some portions of above description include disclosure presented in terms of algorithms and symbolic representations of operations on information. These algorithmic descriptions and representations are the means used by those skilled in the data processing arts to most effectively convey the substance of their work to others skilled in the art. These operations, while described functionally or logically, are understood to be implemented by computer programs. Furthermore, it has also proven convenient at times, to refer to these arrangements of operations as modules or by functional names, without loss of generality. It should be noted that the process steps and instructions of implementations of this disclosure could be embodied in software, firmware or hardware, and when embodied in software, could be downloaded to reside on and be operated from different platforms used by real time network operating systems.
Unless specifically stated otherwise as apparent from the above discussion, it is appreciated that throughout the description, discussions utilizing terms such as “processing” or “computing” or “calculating” or “determining” or “displaying” or the like, refer to the action and processes of a computer system, or similar electronic computing device, that manipulates and transforms data represented as physical (electronic) quantities within the computer system memories or registers or other such information storage, transmission or display devices.
At least one implementation of this disclosure relates to an apparatus for performing the operations herein. This apparatus may be specially constructed for the required purposes, or it may comprise a general-purpose computer selectively activated or reconfigured by a computer program stored on a computer readable storage medium that can be accessed by the computer.
All or a portion of the embodiments of the disclosure can take the form of a computer program product accessible from, for example, a non-transitory computer-usable or computer-readable medium. The computer program, when executed, can carry out any of the respective techniques, algorithms and/or instructions described herein. A non-transitory computer-usable or computer-readable medium can be any device that can, for example, tangibly contain, store, communicate, or transport the program for use by or in connection with any processor. The non-transitory medium can be, for example, any type of disk including floppy disks, optical disks, CD-ROMs, magnetic-optical disks, read-only memories (ROMs), random access memories (RAMs), EPROMs, EEPROMs, magnetic or optical cards, application specific integrated circuits (ASICs), or any type of media suitable for tangibly containing, storing, communicating, or transporting electronic instructions.
It is to be understood that the disclosure is not to be limited to the disclosed embodiments but, on the contrary, is intended to cover various modifications and equivalent arrangements included within the spirit and scope of the appended claims.
| Number | Name | Date | Kind |
|---|---|---|---|
| 5280367 | Zuniga | Jan 1994 | A |
| 5448695 | Douglas et al. | Sep 1995 | A |
| 5544049 | Henderson et al. | Aug 1996 | A |
| 5600778 | Swanson et al. | Feb 1997 | A |
| 5613163 | Marron et al. | Mar 1997 | A |
| 5721849 | Amro | Feb 1998 | A |
| 5790127 | Anderson et al. | Aug 1998 | A |
| 5821928 | Melkus et al. | Oct 1998 | A |
| 5826015 | Schmidt | Oct 1998 | A |
| 5845300 | Comer et al. | Dec 1998 | A |
| 5859640 | de Judicibus | Jan 1999 | A |
| 5877763 | Berry et al. | Mar 1999 | A |
| 5883626 | Glaser et al. | Mar 1999 | A |
| 5905991 | Reynolds | May 1999 | A |
| 5966121 | Hubbell et al. | Oct 1999 | A |
| 6005575 | Colleran et al. | Dec 1999 | A |
| 6018341 | Berry et al. | Jan 2000 | A |
| 6272490 | Yamakita | Aug 2001 | B1 |
| 6295542 | Corbin | Sep 2001 | B1 |
| 6301573 | McIlwaine et al. | Oct 2001 | B1 |
| 6377965 | Hachamovitch et al. | Apr 2002 | B1 |
| 6421678 | Smiga et al. | Jul 2002 | B2 |
| 6463078 | Engstrom et al. | Oct 2002 | B1 |
| 6546393 | Khan | Apr 2003 | B1 |
| 6564213 | Ortega et al. | May 2003 | B1 |
| 6647383 | August et al. | Nov 2003 | B1 |
| 6654038 | Gajewska et al. | Nov 2003 | B1 |
| 6751604 | Barney et al. | Jun 2004 | B2 |
| 6789251 | Johnson | Sep 2004 | B1 |
| 6820075 | Shanahan et al. | Nov 2004 | B2 |
| 6865714 | Liu et al. | Mar 2005 | B1 |
| 6889337 | Yee | May 2005 | B1 |
| 6907447 | Cooperman et al. | Jun 2005 | B1 |
| 6980977 | Hoshi et al. | Dec 2005 | B2 |
| 7003506 | Fisk et al. | Feb 2006 | B1 |
| 7003737 | Chiu et al. | Feb 2006 | B2 |
| 7031963 | Bae | Apr 2006 | B1 |
| 7051277 | Kephart et al. | May 2006 | B2 |
| 7073129 | Robarts et al. | Jul 2006 | B1 |
| 7103835 | Yankovich et al. | Sep 2006 | B1 |
| 7127674 | Carroll et al. | Oct 2006 | B1 |
| 7146422 | Marlatt et al. | Dec 2006 | B1 |
| 7295995 | York et al. | Nov 2007 | B1 |
| 7353252 | Yang et al. | Apr 2008 | B1 |
| 7353397 | Herbach | Apr 2008 | B1 |
| 7370274 | Stuple et al. | May 2008 | B1 |
| 7380218 | Rundell | May 2008 | B2 |
| 7386789 | Chao et al. | Jun 2008 | B2 |
| 7392249 | Harris et al. | Jun 2008 | B1 |
| 7395507 | Robarts et al. | Jul 2008 | B2 |
| 7406659 | Klein et al. | Jul 2008 | B2 |
| 7451389 | Huynh et al. | Nov 2008 | B2 |
| 7480715 | Barker et al. | Jan 2009 | B1 |
| 7487145 | Gibbs et al. | Feb 2009 | B1 |
| 7499919 | Meyerzon et al. | Mar 2009 | B2 |
| 7499940 | Gibbs | Mar 2009 | B1 |
| 7647312 | Dai | Jan 2010 | B2 |
| 7664786 | Oh et al. | Feb 2010 | B2 |
| 7685144 | Katragadda | Mar 2010 | B1 |
| 7685516 | Fischer | Mar 2010 | B2 |
| 7716236 | Sidhu et al. | May 2010 | B2 |
| 7734627 | Tong | Jun 2010 | B1 |
| 7756935 | Gaucas | Jul 2010 | B2 |
| 7761788 | McKnight et al. | Jul 2010 | B1 |
| 7769579 | Zhao et al. | Aug 2010 | B2 |
| 7774328 | Hogue et al. | Aug 2010 | B2 |
| 7779355 | Erol et al. | Aug 2010 | B1 |
| 7783965 | Dowd et al. | Aug 2010 | B1 |
| 7818678 | Massand | Oct 2010 | B2 |
| 7836044 | Kamvar et al. | Nov 2010 | B2 |
| 7917848 | Harmon et al. | Mar 2011 | B2 |
| 8020003 | Fischer | Sep 2011 | B2 |
| 8020112 | Ozzie et al. | Sep 2011 | B2 |
| 8027974 | Gibbs | Sep 2011 | B2 |
| 8051088 | Tibbetts et al. | Nov 2011 | B1 |
| 8086960 | Gopalakrishna et al. | Dec 2011 | B1 |
| 8091020 | Kuppusamy et al. | Jan 2012 | B2 |
| 8117535 | Beyer et al. | Feb 2012 | B2 |
| 8185448 | Myslinski | May 2012 | B1 |
| 8224802 | Hogue | Jul 2012 | B2 |
| 8229795 | Myslinski | Jul 2012 | B1 |
| 8239751 | Rochelle et al. | Aug 2012 | B1 |
| 8260785 | Hogue et al. | Sep 2012 | B2 |
| 8261192 | Djabarov | Sep 2012 | B2 |
| 8346620 | King et al. | Jan 2013 | B2 |
| 8346877 | Turner | Jan 2013 | B2 |
| 8359550 | Meyer et al. | Jan 2013 | B2 |
| 8370275 | Bhattacharya et al. | Feb 2013 | B2 |
| 8386914 | Baluja et al. | Feb 2013 | B2 |
| 8453066 | Ozzie et al. | May 2013 | B2 |
| 8458046 | Myslinski | Jun 2013 | B2 |
| 8572388 | Boemker et al. | Oct 2013 | B2 |
| 8595174 | Gao et al. | Nov 2013 | B2 |
| 8621222 | Das | Dec 2013 | B1 |
| 8666961 | Qureshi et al. | Mar 2014 | B1 |
| 8667394 | Spencer | Mar 2014 | B1 |
| 8782516 | Dozier | Jul 2014 | B1 |
| 8799765 | MacInnis et al. | Aug 2014 | B1 |
| 8856640 | Barr et al. | Oct 2014 | B1 |
| 8856645 | Vandervort et al. | Oct 2014 | B2 |
| 8904284 | Grant et al. | Dec 2014 | B2 |
| 20010025287 | Okabe et al. | Sep 2001 | A1 |
| 20020010725 | Mo | Jan 2002 | A1 |
| 20020029337 | Sudia et al. | Mar 2002 | A1 |
| 20020035714 | Kikuchi et al. | Mar 2002 | A1 |
| 20020069223 | Goodisman et al. | Jun 2002 | A1 |
| 20020070977 | Morcos et al. | Jun 2002 | A1 |
| 20020103914 | Dutta et al. | Aug 2002 | A1 |
| 20020129100 | Dutta et al. | Sep 2002 | A1 |
| 20020152255 | Smith, Jr. et al. | Oct 2002 | A1 |
| 20020161839 | Colasurdo et al. | Oct 2002 | A1 |
| 20020187815 | Deeds et al. | Dec 2002 | A1 |
| 20030046263 | Castellanos et al. | Mar 2003 | A1 |
| 20030058286 | Dando | Mar 2003 | A1 |
| 20030069877 | Grefenstette et al. | Apr 2003 | A1 |
| 20030156130 | James et al. | Aug 2003 | A1 |
| 20030172353 | Cragun | Sep 2003 | A1 |
| 20030200192 | Bell et al. | Oct 2003 | A1 |
| 20030234822 | Spisak | Dec 2003 | A1 |
| 20040061716 | Cheung et al. | Apr 2004 | A1 |
| 20040062213 | Koss | Apr 2004 | A1 |
| 20040122846 | Chess et al. | Jun 2004 | A1 |
| 20040139465 | Matthews, III et al. | Jul 2004 | A1 |
| 20040140901 | Marsh | Jul 2004 | A1 |
| 20040145607 | Alderson | Jul 2004 | A1 |
| 20040153973 | Horwitz | Aug 2004 | A1 |
| 20040164991 | Rose | Aug 2004 | A1 |
| 20040177319 | Horn | Sep 2004 | A1 |
| 20050024487 | Chen | Feb 2005 | A1 |
| 20050028081 | Arcuri et al. | Feb 2005 | A1 |
| 20050034060 | Kotler et al. | Feb 2005 | A1 |
| 20050039191 | Hewson et al. | Feb 2005 | A1 |
| 20050044132 | Campbell et al. | Feb 2005 | A1 |
| 20050044369 | Anantharaman | Feb 2005 | A1 |
| 20050055416 | Heikes et al. | Mar 2005 | A1 |
| 20050120308 | Gibson et al. | Jun 2005 | A1 |
| 20050144162 | Liang | Jun 2005 | A1 |
| 20050144573 | Moody et al. | Jun 2005 | A1 |
| 20050160065 | Seeman | Jul 2005 | A1 |
| 20050183001 | Carter et al. | Aug 2005 | A1 |
| 20050183006 | Rivers-Moore et al. | Aug 2005 | A1 |
| 20050198589 | Heikes et al. | Sep 2005 | A1 |
| 20050210256 | Meier et al. | Sep 2005 | A1 |
| 20050246653 | Gibson et al. | Nov 2005 | A1 |
| 20060005142 | Karstens | Jan 2006 | A1 |
| 20060010865 | Walker | Jan 2006 | A1 |
| 20060041836 | Gordon et al. | Feb 2006 | A1 |
| 20060047682 | Black et al. | Mar 2006 | A1 |
| 20060080303 | Sargent et al. | Apr 2006 | A1 |
| 20060106778 | Baldwin | May 2006 | A1 |
| 20060136552 | Krane et al. | Jun 2006 | A1 |
| 20060150087 | Cronenberger et al. | Jul 2006 | A1 |
| 20060190435 | Heidloff et al. | Aug 2006 | A1 |
| 20060213993 | Tomita | Sep 2006 | A1 |
| 20060248070 | Dejean et al. | Nov 2006 | A1 |
| 20070005581 | Arrouye et al. | Jan 2007 | A1 |
| 20070005697 | Yuan et al. | Jan 2007 | A1 |
| 20070033200 | Gillespie | Feb 2007 | A1 |
| 20070143317 | Hogue et al. | Jun 2007 | A1 |
| 20070150800 | Betz et al. | Jun 2007 | A1 |
| 20070156761 | Smith | Jul 2007 | A1 |
| 20070162907 | Herlocker | Jul 2007 | A1 |
| 20070168355 | Dozier et al. | Jul 2007 | A1 |
| 20070198952 | Pittenger | Aug 2007 | A1 |
| 20070220259 | Pavlicic | Sep 2007 | A1 |
| 20070280205 | Howell et al. | Dec 2007 | A1 |
| 20070291297 | Harmon et al. | Dec 2007 | A1 |
| 20080022107 | Pickles et al. | Jan 2008 | A1 |
| 20080028284 | Chen | Jan 2008 | A1 |
| 20080034213 | Boemker et al. | Feb 2008 | A1 |
| 20080059539 | Chin et al. | Mar 2008 | A1 |
| 20080077571 | Harris | Mar 2008 | A1 |
| 20080082907 | Sorotokin et al. | Apr 2008 | A1 |
| 20080120319 | Drews et al. | May 2008 | A1 |
| 20080172608 | Patrawala et al. | Jul 2008 | A1 |
| 20080208969 | Van Riel | Aug 2008 | A1 |
| 20080239413 | Vuong et al. | Oct 2008 | A1 |
| 20080320397 | Do et al. | Dec 2008 | A1 |
| 20090006936 | Parker et al. | Jan 2009 | A1 |
| 20090013244 | Cudich et al. | Jan 2009 | A1 |
| 20090044143 | Karstens | Feb 2009 | A1 |
| 20090044146 | Patel et al. | Feb 2009 | A1 |
| 20090083245 | Ayotte et al. | Mar 2009 | A1 |
| 20090094178 | Aoki | Apr 2009 | A1 |
| 20090132560 | Vignet | May 2009 | A1 |
| 20090192845 | Gudipaty et al. | Jul 2009 | A1 |
| 20090198670 | Shiffer et al. | Aug 2009 | A1 |
| 20090204818 | Shin et al. | Aug 2009 | A1 |
| 20090282144 | Sherrets et al. | Nov 2009 | A1 |
| 20090292673 | Carroll | Nov 2009 | A1 |
| 20100070448 | Omoigui | Mar 2010 | A1 |
| 20100070881 | Hanson et al. | Mar 2010 | A1 |
| 20100076946 | Barker et al. | Mar 2010 | A1 |
| 20100100743 | Ali et al. | Apr 2010 | A1 |
| 20100121888 | Cutting et al. | May 2010 | A1 |
| 20100131523 | Yu et al. | May 2010 | A1 |
| 20100180200 | Donneau-Golencer et al. | Jul 2010 | A1 |
| 20100191744 | Meyerzon et al. | Jul 2010 | A1 |
| 20100198821 | Loritz et al. | Aug 2010 | A1 |
| 20100223541 | Clee et al. | Sep 2010 | A1 |
| 20100251086 | Haumont et al. | Sep 2010 | A1 |
| 20100268700 | Wissner et al. | Oct 2010 | A1 |
| 20100269035 | Meyer et al. | Oct 2010 | A1 |
| 20100275109 | Morrill | Oct 2010 | A1 |
| 20100281353 | Rubin | Nov 2010 | A1 |
| 20110016106 | Xia | Jan 2011 | A1 |
| 20110023022 | Harper et al. | Jan 2011 | A1 |
| 20110043652 | King et al. | Feb 2011 | A1 |
| 20110060584 | Ferrucci et al. | Mar 2011 | A1 |
| 20110072338 | Caldwell | Mar 2011 | A1 |
| 20110082876 | Lu et al. | Apr 2011 | A1 |
| 20110087973 | Martin et al. | Apr 2011 | A1 |
| 20110126093 | Ozzie et al. | May 2011 | A1 |
| 20110173210 | Ahn et al. | Jul 2011 | A1 |
| 20110179378 | Wheeler et al. | Jul 2011 | A1 |
| 20110191276 | Cafarella et al. | Aug 2011 | A1 |
| 20110209064 | Jorgensen et al. | Aug 2011 | A1 |
| 20110209075 | Wan | Aug 2011 | A1 |
| 20110219291 | Lisa | Sep 2011 | A1 |
| 20110225482 | Chan et al. | Sep 2011 | A1 |
| 20110225490 | Meunier | Sep 2011 | A1 |
| 20110252312 | Lemonik et al. | Oct 2011 | A1 |
| 20110276538 | Knapp et al. | Nov 2011 | A1 |
| 20110296291 | Melkinov et al. | Dec 2011 | A1 |
| 20110306028 | Galimore | Dec 2011 | A1 |
| 20120078826 | Ferrucci et al. | Mar 2012 | A1 |
| 20120084644 | Robert et al. | Apr 2012 | A1 |
| 20120095979 | Aftab et al. | Apr 2012 | A1 |
| 20120116812 | Boone et al. | May 2012 | A1 |
| 20120124053 | Ritchford et al. | May 2012 | A1 |
| 20120166924 | Larson et al. | Jun 2012 | A1 |
| 20120185473 | Ponting et al. | Jul 2012 | A1 |
| 20120203734 | Spivack et al. | Aug 2012 | A1 |
| 20120226646 | Donoho et al. | Sep 2012 | A1 |
| 20120254730 | Sunderland et al. | Oct 2012 | A1 |
| 20120284602 | Seed et al. | Nov 2012 | A1 |
| 20120304046 | Neill et al. | Nov 2012 | A1 |
| 20120317046 | Myslinski | Dec 2012 | A1 |
| 20130036344 | Ahmed et al. | Feb 2013 | A1 |
| 20130041685 | Yegnanarayanan | Feb 2013 | A1 |
| 20130132566 | Olsen et al. | May 2013 | A1 |
| 20130165086 | Doulton | Jun 2013 | A1 |
| 20130212062 | Levy et al. | Aug 2013 | A1 |
| 20130246346 | Khosrowshahi et al. | Sep 2013 | A1 |
| 20130268830 | Khosrowshahi et al. | Oct 2013 | A1 |
| 20140006399 | Vasudevan et al. | Jan 2014 | A1 |
| 20140013197 | McAfee et al. | Jan 2014 | A1 |
| 20140032913 | Tenenboym et al. | Jan 2014 | A1 |
| 20140040249 | Ploesser et al. | Feb 2014 | A1 |
| 20140236958 | Vaughn | Aug 2014 | A1 |
| Number | Date | Country |
|---|---|---|
| WO2012057726 | May 2012 | WO |
| WO2014072767 | May 2014 | WO |
| Entry |
|---|
| Ashman. “Electronic Document Addressing: Dealing with Change.” ACM Computing Surveys, vol. 32, No. 3, Sep. 2000, pp. 201-212. |
| Electronic Signatures and Infrastructures ESI; PDF Advanced Electronic Signature Profiles; Part 4: PAdES Long Ter PAdES-LTV Profile, ETSI TS 102 778-4, V1.1.1, Jul. 2009, 19 pages. |
| Fox. “Maps API Blog: Creating Dynamic Client-side Maps Mashups with Google Spreadsheets.” Mar. 2007, [retrieved on Dec. 5, 2011]. Retrieved from the Internet: <URL:http://googlemapsapi.blogspot.com/2007/03/creating-dynamic-client-side-maps.html>. 2 pages. |
| GeekRant.org [online]. “How to Embed a Word Document in Another Word Document,” Sep. 14, 2005, [retrieved on Dec. 5, 2011]. Retrieved from the Internet: <URL:http://www.geekrant.org/2005/09/14/word-embed-document/>. 6 pages. |
| Herrick. “Google this Using Google Apps for Collaboration and Productivity.” Proceedings of the ACM Siguccs Fall Conference on User Services Conference, Siguccs '09, Jan. 2009, p. 55. |
| https://en.wikipedia.org/wiki/Backus%E2%80%93Naur—Form, as of Jul. 14, 2013. |
| https://en.wikipedia.org/wiki/Regular—expression, as of Sep. 2, 2013. |
| ISR and Written Opinion of the International Searching Authority in PCT Application No. PCT/US2011/037862, dated Oct. 31, 2011, 64 pages. |
| Kappe. “Hyper-G: A Distributed Hypermedia System.” Proceedings of the International Networking Conference, 1993, [retrieved on Oct. 20, 2011]. Retrieved from the Internet: <URL:http://ftp.iicm.tugraz.at/pub/papers/inet93.pdf>. 9 pages. |
| Kircher. “Lazy Acquisition.” Proceedings of the 6th European Conference on Pattern Languages of Programs, Jul. 2011, pp. 1-11. |
| Microsoft Support [online]. “How to Embed and Automate Office Documents with Visual Basic,” Mar. 27, 2007, [retrieved on Dec. 5, 2011]. Retrieved from the Internet: <URLhttp://support.microsoft.com/kb/242243>. 6 pages. |
| Microsoft Support [online]. “OLE Concepts and Requirements Overview,” Oct. 27, 1999, [retrieved on Dec. 2, 2011]. Retrieved from the Internet: <URL:http://support.microsoft.com/kb/86008>. 3 pages. |
| Oracle Provider for OLE DB—Developer's Guide. 10g Release 1 (10.1) Dec. 2003, Oracle Corp., 90 pages. |
| Pinkas et al. “CMS Advanced Electrponic Signatures,” Request for Comments 5126, Feb. 2008, 142 pages. |
| WebArchive [online]. “Supplementary Notes for MFC Programming Module 23 and Module 27: Interfaces, com.com + and OLE” in: http://www.tenouk.com/visualcplusmfc/mfcsupp/ole.html, Jan. 6, 2008, [retrieved on Dec. 5, 2011]. Retrieved from the Internet: <URL:http://web.archive.org/web/20091125073542/http://www.tenouk.com/visualcplusmfc/mfcsupp/ole.html>. 4 pages. |
| “Bohman, P. ““Introduction to Web Accessibility””, Oct. 2003, ebAIM, printed Apr. 17, 2004,<http://www.webaim.org/intro/?templatetype=3> (p. 1-6)”. |
| “Caldwell et al., ““Web Content Accessibility Guidelines 2.0, W3C Working Draft Mar. 11, 2004””, Mar. 11, 2004, WorldWide Web Consortium (p. 1-56)”. |
| FraxNCik, E., Computer-& screen-based interfaces: Universal design filter, Human Factors Engineering, Pacific Bell Version 2, Jun. 6, 1996. |
| Griesser, A., “A generic editor Full text,” pp. 50-55, 1997 ACM Press NewYork, NY, USA. |
| Jacobs, Ian, et al., “User Agent Accessibility Guidelines 1.0, W3C Recommendation Dec. 17, 2002”, World Wide Web Consortium, 115 pages. |
| Jourdan, Guy-Vincent, CSI 3140 WWW Structures, Techniques and Standards, Cascading Style Sheets, power point slides, published Feb. 16, 2010. |
| Treviranus, Jutta, et al., “Authoring Tool Accessibility Guidelines 1.0, W3C Recommendation Feb. 3, 2000”, World Wide Web Consortium (p. 1-22). |
| W3C, Cascading Style sheets Level 2 Revision 1 Specification, Apr. 15, 2011, 487 pages. |
| Herb Tyson, Microsoft Word 2010 Bible, John Wiley & Sons, pp. 221, 757, 833, Jun. 21, 2010. |
| David Sawyer McFarland, “CSS the missing manual”, O'Reilly, Aug. 2009, pp. 7-101, 134-138, 428-429. |
| Timestamp from Wikipedia, accessed from https://en.wikipedialcorg/wiki/Timestamp, archived by WaybackMachine on Sep. 15, 2012, pp. 1-2. |
