The present invention generally relates to the field of digital document review. More particularly, the present invention relates to methods and systems for displaying detected changes and/or differences between a set of original documents and a set of modified versions of the documents.
Business transactions, for example contracts, share purchases, mergers, acquisitions, etc., typically involve the creation of a group of related documents that between them define the full scope of the transaction being prepared. As the transaction progresses, the documents within the group are changed by the participants, who will often make changes to several documents before distributing the new versions. The changes in the set of documents comprising the transaction may be interrelated as well. Participants in the transaction process need to understand the changes being made to the various related documents in the transaction so that they can make informed decisions efficiently. This can be challenging and time consuming with existing tools—even in the best case where the group of documents are organized into a storage system such as a document management system (that maintains a history of previous versions), a user of a comparison tool such as WORKSHARE COMPARE™ must individually initiate comparisons of each of the documents related to the transaction, selecting the appropriate current and previous versions for comparison in each case. This manual process is time-consuming, prone to error and provides no top level overview of the changes made to the group of documents as a whole.
The invention comprises of a software program or service capable of selecting and comparing multiple documents in a single operation, with the ability to apply changes across multiple documents—for instance all documents in the group of documents related to a business transaction. The comparison procedure comprises the following steps. At least one embodiment of this invention pertains to a document management service that enables a user to initiate a comparison of the last version of all the related documents of a transition to their prior versions or some versions as of a certain date, and then request a display that summarizes all of the detected changes in a set of documents.
The invention is embodied by a computer system, software program or service that operates a software program that is capable of selecting and comparing two versions of multiple documents in a single operation—for instance all documents in the group of documents related to a business transaction. See
The document group comparison system or service may run as a standalone program operating on a user's computing device or, a program operating on a server in communication with one or more users' computing devices. In some instances, may run as a web service on a remote server where the system utilizes a browser operating on users' computers as the user interface providing control to the user and an output to display comparison results. In either scenario, the document management service receives as input a request for particular set of documents that a user wishes to see the revisions to. These and other objects, features and characteristics of the present invention will become more apparent to those skilled in the art from a study of the following detailed description in conjunction with the appended claims and drawings, all of which form a part of this specification. It should be understood that the description and specific examples are intended for purposes of illustration only and not intended to limit the scope of the present disclosure.
The headings provided herein are for convenience only and do not necessarily affect the scope or meaning of the claimed invention. In the drawings, the same reference numbers and any acronyms identify elements or acts with the same or similar structure or functionality for ease of understanding and convenience. To easily identify the discussion of any particular element or act, the most significant digit or digits in a reference number refer to the Figure number in which that element is first introduced (e.g., element 204 is first introduced and discussed with respect to
Various examples of the invention will now be described. The following description provides specific details for a thorough understanding and enabling description of these examples. One skilled in the relevant art will understand, however, that the invention may be practiced without many of these details. Likewise, one skilled in the relevant art will also understand that the invention can include many other features not described in detail herein. Additionally, some well-known structures or functions may not be shown or described in detail below, so as to avoid unnecessarily obscuring the relevant description. The terminology used below is to be interpreted in its broadest reasonable manner, even though it is being used in conjunction with a detailed description of certain specific examples of the invention. Indeed, certain terms may even be emphasized below; however, any terminology intended to be interpreted in any restricted manner will be overtly and specifically defined as such in this Detailed Description section.
The method and system operates on one or more computers, typically using one or more servers and one or more remote user's computing devices. A customer's device can be a personal computer, mobile phone, mobile handheld device like a BLACKBERRY™ or IPHONE™ or a tablet device like the IPAD™ or GALAXY™ or any other kind of computing device a user can use to view and edit an electronic document. The user devices are operatively connected to the remote server using a data network. The invention does not require that the data network be in continuous contact with the remote file server. The invention works in conjunction with a document collaborative editing system (CES) or document management systems, (DMS) or both. For brevity, references to the DMS in the disclosure may disclose processes that may be performed by the CES or the CES in combination with the DMS. The system can be embodied in a client/server architecture, whereby an executable code operates on the user's remote device and interacts with processes operating on a server. In other embodiments, the same system can be running on the user's remote device by means of scripts or apps that are downloaded and executed within an Internet web-browser.
The user's remote computer is operatively connected to a data communication network, typically the Internet. This may be directly or indirectly through another network, for example a telephone network or a private data network. The user operates a client software on their computing device that communicates with the server that operates the process as a service, or the server that delivers documents for editing or review, that is the DMS or CES.
When the client requests to view a document available on the DMS, the request is received and processed on the DMS. In this case, the user's device may select a title for a group of documents from a graphical user interface displayed on the screen of the device. The DMS maintains all of the revisions of the set of documents document in its data storage repository. Each time the CES saves a new version, that is a new computer file. That new file typically has a different filename than the prior version. The system also keeps track of the date and time that the version was stored. The system maintains a separate database that keeps track of each user authorized to access the document on the CES and their access of the document. Once the compared set of documents is presented to the user, the user can make changes to one or more of the set of documents and save those changed documents as yet a newer version In the typical embodiment, a new version of the document is created as a distinct data file.
Document Selection
The group of documents to be compared can be selected in one of a variety of ways. In one embodiment the documents are selected by selecting multiple documents from a Document Management System (DMS). Typically, the set of documents are known to be related as a result of their status in the document management service. If the document management system is appropriately organized, the desired documents will be stored in such a way that they are easily accessible as a group—for instance they may be in the same folder or attached to a particular matter record or other identifier. For example, a plurality of documents may have metadata associated with them that is a reference to a name of a transaction. In one embodiment, a database that comprises the document management system may have a table that assigns an alphanumeric text string to a pointer or other logical reference to each document. The alphanumeric text string may be the name of a commercial transaction, for example “Whiteacre Closing Documents.” The set of documents may then be the legal documents that together comprise the commercial transaction for the sale of “Whiteacre”, in which case the table referring to each document will include the string “Whiteacre” in a column that references the name of the transaction that such document is a part of. Each of the plurality of documents may be represented by a series of files, each file representing a version of its corresponding document. In this case, the logical reference in the table that relates transaction names to documents would be a reference to the document table that contains pointers or other logical references to the data files embodying the versions of the corresponding document. In addition, each document would have a metadata reference to its identity, for example, its title, so that the document management system can distinguish between files that are different versions of the same document from different documents entirely. As an illustrative example, the Whiteacre transaction may be comprised of several versions of a purchase agreement to purchase Whiteacre and several versions of a deed to Whiteacre.
In addition, the system can be configured to use logical criteria to select files automatically. In one embodiment, the system can receive an alphanumeric string that is the name of a transaction. Using that string, the system can search file folder names that contain the string or sufficiently match the string. In other cases, the folder may contain sub-folders that contain relevant documents. Once the folders are identified, the system can check filenames in the folder to determine the set of documents and constituent document versions. In some cases, this requires string matching on the file names.
In another embodiment, a transaction may be associated with an email thread so that the system can select email message attachments from an email program where the system identifies the relevant emails as part of a thread that is determined to be associated with the transaction name. That thread may be identified by input from a user, or, it may be that the email system is configured to assign a transaction name to the thread, in which case a simple string match can be used to determine the relevant email thread. In this embodiment, the system can inspect each email message in the thread to detect attachments.
The invention may implement on a computer a data structure that maps references associated with a plurality of related documents stored in the system to a first group reference. Once the version selection is complete, then this data structure may be updated to include references to two version of the related documents in the group. By use of this data structure, the computer can be configured to receive a command that represents a selection of that group of related documents, and to cause the comparison process to be applied to all of the documents in the group, between the two selected versions associated with each document. The data structure may be represented as a tree, as in
Version Selection
For each document in the group that is to be compared, two versions must be chosen. Where there aren't two versions, the assumption is that no changes will be displayed. In the case where data representing the revision history of the selected documents is available (i.e. data sourced from a DMS or an online storage platform that supports versioning history), selection of which versions are to be compared will be by selection of two points in time—comparing the version of each document at the later point in time against that at the earlier point in time. Sensible defaults can be chosen by the system for the two points in time, which the user can then adjust as required. For instance, a sensible default value for the later point in time would be ‘Now’ and for the earlier point in time would be the time that the user last reviewed the group of documents. This time value can be stored by the system in a file or other local or online storage mechanism, or determined by examining the revision history of all the documents in the group.
In the case that the files are sourced from a storage system that does not have the ability to retrieve version history, selection of the versions may require specific input from the user. While the application may provide assistance in various ways, in general the user will have to choose a previous version corresponding to each document selected. Ways in which the application embodying the invention may provide assistance in selecting appropriate versions may include:
In the case that a document has been selected as an email attachment, the application may search for other, earlier email messages that have an attachment with the same or a similar name and offer the user a list of such message attachments to choose from.
The application may search or maintain a database index of documents stored on the computer or other device upon which it runs, and offer to the user a list of documents to compare against selected from the search results or index based upon the name of the document being the same or similar and the timestamp of the document being earlier.
In the case that the document being compared is a word processing document and contains revision sequence ID information (RSID), the application may use the RSID information to infer version hierarchies between different documents found by searching or indexing and hence present more accurate suggestions to the user.
Comparison
Systems and methods for comparing various types of document (word processing, presentation document, text, etc.) are known in the art. Existing comparison applications such as WORKSHARE COMPARE™ and WORKSHARE COMPARE FOR POWERPOINT™ may be used to perform the actual comparison of each of the selected pairs of the documents in the group.
Displaying the Results
Another advantage of this invention (in addition to simplifying the selection of the appropriate group of files and their relevant versions) is the provision of a consolidated display of the changes made to the group of documents. The summary comparison document may be in one of a number of formats to give a suitable reading experience to the user. Examples of the format for the summary document may be RTF, PDF or HTML.
Such a consolidated display may include
A number of tabs, each tab corresponding to a document comparison that the user can switch between by selecting the tab on the user interface of the user's device displaying the output.
A single document view, containing all comparisons concatenated, where all of the changes of a document are presented together in the same section of the document.
A single document view, as above, but excluding pages that contain no changes in order to allow faster reading of the changes. In this embodiment the summary document would be built by inspecting in turn each page of each comparison. If the page has any changes or portions of a change on it, the page will be added to the summary comparison document, otherwise it will not be added.
The consolidated comparison output summary is more efficient and convenient than multiple single comparisons, but in addition, it can provide information that would not be available if multiple single comparisons were performed. A categorized summary of all changes across all document pairs in addition to any of the display output techniques described above may be used (as disclosed in U.S. patent application Ser. No. 13/306,798 filed on Nov. 29, 2011, which is incorporated herein by reference.) In particular, the categorization display option can provide a summary that can group together identical changes made in different documents (for example corrections to participant names or details) and highlight locations across the multiple documents where such changes have been neglected. Analysis of the changes in any individual document would be incapable of revealing if corrections had been made in 3 out of 4 documents but not the fourth. See
Accepting and Rejecting Changes
A further requirement for users who wish to review changes to multiple documents is that they are likely to want to accept only some of the changes, or equivalently, reject some of the changes. This functionality can be provided by the invention in the following manner:
As part of the viewer application, a review state manager which allows the user to enter a review state for each change—such states might be ‘accepted’, ‘rejected’, ‘needs discussion’, etc. This module will store the review state associated with each change and display highlights in the UI in appropriate locations indicating the review state currently associated with a change.
A change apply module, capable of acting on the review state associated with each change. The apply module might work in either of 2 possible modes of operation
An ‘apply’ mode, where it starts with the original version of each document and applies to it the changes which have been tagged with an ‘accept’ state. In this case, the system will create a new version of the document and update any of the DMS entries so that the new version of the document is appropriately indexed in the system.
An ‘undo’ mode, where it starts with the modified version of each document—in which all changes are already applied—and undoes each change which is tagged with a ‘reject’ state.
A particular implementation of an apply module might implement only one or both of these two modes. The invention supports the ability to apply changes across multiple documents in a single operation. For instance, the user can review a change made in one document and apply the same change across a group of documents where applicable in a single operation, without having to review and accept each instance of the change. The invention can also intelligently suggest changes to the document suite based on changes made to individual documents. For instance, a change made to a term, sentence or paragraph in one document could imply a corresponding change to other related documents that contain the same or similar term, sentence or paragraph.
Automated Cross Referencing:
The consolidated change display can also be used to present to the user cross referenced portions of the documents where the cross reference is in the changed text. Consider as an example, if the changed text in the summarized changes includes the string: “Licensee is permitted to assign its rights to an Affiliate, in accordance with Section 11.” There are two cross references that a reviewing user would have to check before revising the review state on the change. First, the user may have to check the definition of “Affiliate”. Second, the user may have to check what it says in “Section 11” in order to approve the change.
The invention is further comprised of a system and method that parses the changes identified by the comparison step to identify defined terms and section headings. The definition detection module finds common patterns of text used to specify definitions in documents (examples including detecting a section heading named with the string ‘definitions’ section, heading with a two column table, a ‘definitions’ section heading with a list or bullet points and defined terms in bold, or by parsing text in a structured sentence, for example: “ . . . defined as . . . ” or “hereinafter referred as ‘ . . . ’” The point is that parsing rules may be constructed that identify the location within a document comprising the group, that a definition is recited. Similarly, section headings in the documents of the group can be identified by parsing the document data. Locations of section headings may easily identified by detecting formatting data that automatically organizes the heading format convention within the word processing document. In other cases, parsing on typical strings like “section”, “article”, “paragraph” or a number with a CR/LF may be used.
As a result of identifying locations of definitions and section headings in the group of documents, a tooltip or hyperlink function can be inserted into the output display so that it may be activated for words/phrases matching the list of detected definitions or section headings. The tooltip text or hyperlink destination being the identified location of the definition in question. In this embodiment, the definition found in the changes can appear as hyperlinks to the locations in the original document, so the user can select on the highlighted or hyperlinked text in the displayed change, and a window pops up showing the definition in the original document or the section of the original document or the section referred to by the displayed change. In yet another embodiment, is that the system is adapted so that if the hyperlinked location itself has been changed, that system presents the changed version automatically.
The output formulation may further include a definition change categorization module, capable of detecting changes within detected definition portions of the document, allowing such changes to be displayed in a definition change category in the change summary UI.
The output formulation may further include a definition inconsistency detection module, capable of checking definitions found in different source documents. If the definitions detected for a single term differ between different documents (by more than trivialities such as whitespace or punctuation) then the inconsistency is highlighted to the user in an ‘inconsistent definitions’ category in the change summary tree. In this embodiment, the process of locating definitions in the documents produces a table, where there are at least four columns, one for the name of the document, its version, the definition, and the definition location in the document. Once the documents in the group have been parsed to detect definitions, the system can inspect the table to see if there any redundancies, that is, two rows that contain the same defined term (ignoring trivial differences in the text) but with two different corresponding locations. If so, the system can automatically fetch the text surrounding the two different locations and run a comparison to check whether the definitions are the same or not, and to present these on the output display.
In some cases, there are defined terms commonly used in legal documents, for example, where the defined term is confined to the document that it is defined for. For example, two agreements that are part of one transaction may both use the defined term “Effective Date” or “Term”. These cases may require user interaction, in which case a user can input a selection that instructs the system to ignore that definition from a consistency check standpoint. This “ignore” state can be a logical value that is an additional column in the table described above. Those definitions whose row has an “ignore” variable set will not be checked for consistency across different documents, only within the same document.
Implementation of the Invention
The invention could be implemented as
An installable piece of software to be installed and executed on a personal computer or other personal device. In this case, the software operates on a computer dedicated to the user, and the files may be accessed from a storage device in the computer or accessible or storable over a data network. The CPU of the computer executes the processes.
A web site or information portal, such as forming part of an online file collaboration platform. In this case, the software can execute on a server in such a way as to service more than one user. The files may be uploaded to the server and then stored on a local storage device while processed, or may be accessible by the server from a file repository system accessible over a data network. Completed documents that are the output of the process may be transmitted to a user's local computer for display and further editing.
Operating Environment:
Those skilled in the relevant art will appreciate that the invention can be practiced with other communications, data processing, or computer system configurations, including: wireless devices, Internet appliances, hand-held devices (including personal digital assistants (PDAs)), wearable computers, all manner of cellular or mobile phones, multi-processor systems, microprocessor-based or programmable consumer electronics, set-top boxes, network PCs, mini-computers, mainframe computers, and the like. Indeed, the terms “computer,” “server,” and the like are used interchangeably herein, and may refer to any of the above devices and systems. In some instances, especially where the mobile computing device is used to access web content through the network (e.g., when a 3G or an LTE service of the phone is used to connect to the network), the network may be any type of cellular, IP-based or converged telecommunications network, including but not limited to Global System for Mobile Communications (GSM), Time Division Multiple Access (TDMA), Code Division Multiple Access (CDMA), Orthogonal Frequency Division Multiple Access (OFDM), General Packet Radio Service (GPRS), Enhanced Data GSM Environment (EDGE), Advanced Mobile Phone System (AMPS), Worldwide Interoperability for Microwave Access (WiMAX), Universal Mobile Telecommunications System (UMTS), Evolution-Data Optimized (EVDO), Long Term Evolution (LTE), Ultra Mobile Broadband (UMB), Voice over Internet Protocol (VoIP), Unlicensed Mobile Access (UMA), etc.
The user's computer may be a laptop or desktop type of personal computer. It can also be a cell phone, smart phone or other handheld device, including a tablet. The precise form factor of the user's computer does not limit the claimed invention. Examples of well known computing systems, environments, and/or configurations that may be suitable for use with the invention include, but are not limited to, personal computers, server computers, hand-held, laptop or mobile computer or communications devices such as cell phones and PDA's, multiprocessor systems, microprocessor-based systems, set top boxes, programmable consumer electronics, network PCs, minicomputers, mainframe computers, distributed computing environments that include any of the above systems or devices, and the like.
The system and method described herein can be executed using a computer system, generally comprised of a central processing unit (CPU) that is operatively connected to a memory device, data input and output circuitry (I/O) and computer data network communication circuitry. A video display device may be operatively connected through the I/O circuitry to the CPU. Components that are operatively connected to the CPU using the I/O circuitry include microphones, for digitally recording sound, and video camera, for digitally recording images or video. Audio and video may be recorded simultaneously as an audio visual recording. The I/O circuitry can also be operatively connected to an audio loudspeaker in order to render digital audio data into audible sound. Audio and video may be rendered through the loudspeaker and display device separately or in combination. Computer code executed by the CPU can take data received by the data communication circuitry and store it in the memory device. In addition, the CPU can take data from the I/O circuitry and store it in the memory device. Further, the CPU can take data from a memory device and output it through the I/O circuitry or the data communication circuitry. The data stored in memory may be further recalled from the memory device, further processed or modified by the CPU in the manner described herein and restored in the same memory device or a different memory device operatively connected to the CPU including by means of the data network circuitry. The memory device can be any kind of data storage circuit or magnetic storage or optical device, including a hard disk, optical disk or solid state memory.
The computer can display on the display screen operatively connected to the I/O circuitry the appearance of a user interface. Various shapes, text and other graphical forms are displayed on the screen as a result of the computer generating data that causes the pixels comprising the display screen to take on various colors and shades. The user interface also displays a graphical object referred to in the art as a cursor. The object's location on the display indicates to the user a selection of another object on the screen. The cursor may be moved by the user by means of another device connected by I/O circuitry to the computer. This device detects certain physical motions of the user, for example, the position of the hand on a flat surface or the position of a finger on a flat surface. Such devices may be referred to in the art as a mouse or a track pad. In some embodiments, the display screen itself can act as a trackpad by sensing the presence and position of one or more fingers on the surface of the display screen. When the cursor is located over a graphical object that appears to be a button or switch, the user can actuate the button or switch by engaging a physical switch on the mouse or trackpad or computer device or tapping the trackpad or touch sensitive display. When the computer detects that the physical switch has been engaged (or that the tapping of the track pad or touch sensitive screen has occurred), it takes the apparent location of the cursor (or in the case of a touch sensitive screen, the detected position of the finger) on the screen and executes the process associated with that location. As an example, not intended to limit the breadth of the disclosed invention, a graphical object that appears to be a 2 dimensional box with the word “enter” within it may be displayed on the screen. If the computer detects that the switch has been engaged while the cursor location (or finger location for a touch sensitive screen) was within the boundaries of a graphical object, for example, the displayed box, the computer will execute the process associated with the “enter” command. In this way, graphical objects on the screen create a user interface that permits the user to control the processes operating on the computer.
The system is typically comprised of a central server that is connected by a data network to a user's computer. The central server may be comprised of one or more computers connected to one or more mass storage devices. The precise architecture of the central server does not limit the claimed invention. In addition, the data network may operate with several levels, such that the user's computer is connected through a fire wall to one server, which routes communications to another server that executes the disclosed methods. The precise details of the data network architecture does not limit the claimed invention.
A server may be a computer comprised of a central processing unit with a mass storage device and a network connection. In addition a server can include multiple of such computers connected together with a data network or other data transfer connection, or, multiple computers on a network with network accessed storage, in a manner that provides such functionality as a group. Servers may be virtual servers, each an instance of software operating as an independent server but housed in the same computer hardware. Practitioners of ordinary skill will recognize that functions that are accomplished on one server may be partitioned and accomplished on multiple servers that are operatively connected by a computer network by means of appropriate inter process communication. In addition, the access of the website can be by means of an Internet browser accessing a secure or public page or by means of a client program running on a local computer that is connected over a computer network to the server. A data message and data upload or download can be delivered over the Internet using typical protocols, including TCP/IP, HTTP, SMTP, RPC, FTP or other kinds of data communication protocols that permit processes running on two remote computers to exchange information by means of digital network communication. As a result a data message can be a data packet transmitted from or received by a computer containing a destination network address, a destination process or application identifier, and data values that can be parsed at the destination computer located at the destination network address by the destination application in order that the relevant data values are extracted and used by the destination application.
The invention may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote computer storage media including memory storage devices. Practitioners of ordinary skill will recognize that the invention may be executed on one or more computer processors that are linked using a data network, including, for example, the Internet. In another embodiment, different steps of the process can be executed by one or more computers and storage devices geographically separated by connected by a data network in a manner so that they operate together to execute the process steps. In one embodiment, a user's computer can run an application that causes the user's computer to transmit a stream of one or more data packets across a data network to a second computer, referred to here as a server. The server, in turn, may be connected to one or more mass data storage devices where the database is stored. The server can execute a program that receives the transmitted packet and interpret the transmitted data packets in order to extract database query information. The server can then execute the remaining steps of the invention by means of accessing the mass storage devices to derive the desired result of the query. Alternatively, the server can transmit the query information to another computer that is connected to the mass storage devices, and that computer can execute the invention to derive the desired result. The result can then be transmitted back to the user's computer by means of another stream of one or more data packets appropriately addressed to the user's computer.
Computer program logic implementing all or part of the functionality previously described herein may be embodied in various forms, including, but in no way limited to, a source code form, a computer executable form, and various intermediate forms (e.g., forms generated by an assembler, compiler, linker, or locator.) Source code may include a series of computer program instructions implemented in any of various programming languages (e.g., an object code, an assembly language, or a high-level language such as FORTRAN, C, C++, JAVA, or HTML or scripting languages that are executed by Internet web-browsers) for use with various operating systems or operating environments. The source code may define and use various data structures and communication messages. The source code may be in a computer executable form (e.g., via an interpreter), or the source code may be converted (e.g., via a translator, assembler, or compiler) into a computer executable form.
The invention may be described in the general context of computer-executable instructions, such as program modules, being executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, etc., that perform particular tasks or implement particular abstract data types. The computer program and data may be fixed in any form (e.g., source code form, computer executable form, or an intermediate form) either permanently or transitorily in a tangible storage medium, such as a semiconductor memory device (e.g., a RAM, ROM, PROM, EEPROM, or Flash-Programmable RAM), a magnetic memory device (e.g., a diskette or fixed hard disk), an optical memory device (e.g., a CD-ROM or DVD), a PC card (e.g., PCMCIA card), or other memory device. The computer program and data may be fixed in any form in a signal that is transmittable to a computer using any of various communication technologies, including, but in no way limited to, analog technologies, digital technologies, optical technologies, wireless technologies, networking technologies, and internetworking technologies. The computer program and data may be distributed in any form as a removable storage medium with accompanying printed or electronic documentation (e.g., shrink wrapped software or a magnetic tape), preloaded with a computer system (e.g., on system ROM or fixed disk), or distributed from a server or electronic bulletin board over the communication system (e.g., the Internet or World Wide Web.) It is appreciated that any of the software components of the present invention may, if desired, be implemented in ROM (read-only memory) form. The software components may, generally, be implemented in hardware, if desired, using conventional techniques.
The described embodiments of the invention are intended to be exemplary and numerous variations and modifications will be apparent to those skilled in the art. All such variations and modifications are intended to be within the scope of the present invention as defined in the appended claims. Although the present invention has been described and illustrated in detail, it is to be clearly understood that the same is by way of illustration and example only, and is not to be taken by way of limitation. It is appreciated that various features of the invention which are, for clarity, described in the context of separate embodiments may also be provided in combination in a single embodiment. Conversely, various features of the invention which are, for brevity, described in the context of a single embodiment may also be provided separately or in any suitable combination. It is appreciated that the particular embodiment described in the specification is intended only to provide an extremely detailed disclosure of the present invention and is not intended to be limiting.
It should be noted that the flow diagrams are used herein to demonstrate various aspects of the invention, and should not be construed to limit the present invention to any particular logic flow or logic implementation. The described logic may be partitioned into different logic blocks (e.g., programs, modules, functions, or subroutines) without changing the overall results or otherwise departing from the true scope of the invention. Oftentimes, logic elements may be added, modified, omitted, performed in a different order, or implemented using different logic constructs (e.g., logic gates, looping primitives, conditional logic, and other logic constructs) without changing the overall results or otherwise departing from the true scope of the invention.
Also, while processes or blocks are at times shown as being performed in series, these processes or blocks may instead be performed or implemented in parallel, or may be performed at different times.
This application claims priority to U.S. Provisional Patent Application No. 62/129,957 filed on Mar. 8, 2015 and U.S. Provisional Patent Application No. 62/137,358 filed on Mar. 24, 2015 both of which are incorporated by reference. This application claims priority to U.S. patent application Ser. No. 15/236,392 filed on Mar. 14, 2013 which is incorporated herein as a continuation in part. This application claims priority to U.S. patent application Ser. No. 13/306,798 filed on Nov. 29, 2011, which is incorporated herein by reference as a continuation in part.
Number | Name | Date | Kind |
---|---|---|---|
4479195 | Herr et al. | Oct 1984 | A |
4949300 | Christenson et al. | Aug 1990 | A |
5008853 | Bly | Apr 1991 | A |
5072412 | Henderson, Jr. et al. | Dec 1991 | A |
5220657 | Bly et al. | Jun 1993 | A |
5245553 | Tanenbaum | Sep 1993 | A |
5247615 | Mon et al. | Sep 1993 | A |
5293619 | Dean | Mar 1994 | A |
5379374 | Ishizaki et al. | Jan 1995 | A |
5446842 | Schaeffer et al. | Aug 1995 | A |
5608872 | Schwartz et al. | Mar 1997 | A |
5617539 | Ludwig et al. | Apr 1997 | A |
5619649 | Kovnat et al. | Apr 1997 | A |
5634062 | Shimizu et al. | May 1997 | A |
5671428 | Muranaga et al. | Sep 1997 | A |
5699427 | Chow et al. | Dec 1997 | A |
RE35861 | Queen | Jul 1998 | E |
5787175 | Carter | Jul 1998 | A |
5787444 | Gerken et al. | Jul 1998 | A |
5801702 | Dolan et al. | Sep 1998 | A |
5806078 | Hug et al. | Sep 1998 | A |
5819300 | Kohno et al. | Oct 1998 | A |
5832494 | Egger et al. | Nov 1998 | A |
5890177 | Moody et al. | Mar 1999 | A |
5897636 | Kaeser | Apr 1999 | A |
5898836 | Freivald et al. | Apr 1999 | A |
6003060 | Aznar et al. | Dec 1999 | A |
6012087 | Freivald et al. | Jan 2000 | A |
6029175 | Chow et al. | Feb 2000 | A |
6038561 | Snyder et al. | Mar 2000 | A |
6049804 | Burgess et al. | Apr 2000 | A |
6067551 | Brown et al. | May 2000 | A |
6088702 | Plantz et al. | Jul 2000 | A |
6128635 | Ikeno | Oct 2000 | A |
6145084 | Zuili et al. | Nov 2000 | A |
6189019 | Blumer et al. | Feb 2001 | B1 |
6212534 | Lo et al. | Apr 2001 | B1 |
6219818 | Freivald et al. | Apr 2001 | B1 |
6243091 | Berstis | Jun 2001 | B1 |
6263350 | Wollrath et al. | Jul 2001 | B1 |
6263364 | Najork et al. | Jul 2001 | B1 |
6269370 | Kirsch | Jul 2001 | B1 |
6285999 | Page | Sep 2001 | B1 |
6301368 | Bolle et al. | Oct 2001 | B1 |
6317777 | Skarbo et al. | Nov 2001 | B1 |
6321265 | Najork et al. | Nov 2001 | B1 |
6336123 | Inoue et al. | Jan 2002 | B2 |
6351755 | Najork et al. | Feb 2002 | B1 |
6356937 | Montville et al. | Mar 2002 | B1 |
6377984 | Najork et al. | Apr 2002 | B1 |
6404446 | Bates et al. | Jun 2002 | B1 |
6418433 | Chakrabarti et al. | Jul 2002 | B1 |
6418453 | Kraft et al. | Jul 2002 | B1 |
6424966 | Meyerzon et al. | Jul 2002 | B1 |
6449624 | Hammack et al. | Sep 2002 | B1 |
6505237 | Beyda et al. | Jan 2003 | B2 |
6513050 | Williams et al. | Jan 2003 | B1 |
6547829 | Meyerzon et al. | Apr 2003 | B1 |
6556982 | McGaffey et al. | Apr 2003 | B1 |
6560620 | Ching | May 2003 | B1 |
6584466 | Serbinis et al. | Jun 2003 | B1 |
6591289 | Britton | Jul 2003 | B1 |
6594662 | Sieffert et al. | Jul 2003 | B1 |
6596030 | Ball et al. | Jul 2003 | B2 |
6614789 | Yazdani et al. | Sep 2003 | B1 |
6658626 | Aiken | Dec 2003 | B1 |
6662212 | Chandhok et al. | Dec 2003 | B1 |
6738762 | Chen et al. | May 2004 | B1 |
6745024 | DeJaco et al. | Jun 2004 | B1 |
6832202 | Schuyler et al. | Dec 2004 | B1 |
6918082 | Gross | Jul 2005 | B1 |
7035427 | Rhoads | Apr 2006 | B2 |
7085735 | Hall et al. | Aug 2006 | B1 |
7107518 | Ramaley et al. | Sep 2006 | B2 |
7113615 | Rhoads et al. | Sep 2006 | B2 |
7152019 | Tarantola et al. | Dec 2006 | B2 |
7181492 | Wen et al. | Feb 2007 | B2 |
7194761 | Champagne | Mar 2007 | B1 |
7212955 | Kirshenbaum et al. | May 2007 | B2 |
7233686 | Hamid | Jun 2007 | B2 |
7240207 | Weare | Jul 2007 | B2 |
7299504 | Tiller et al. | Nov 2007 | B1 |
7321864 | Gendler | Jan 2008 | B1 |
7356704 | Rinkevich et al. | Apr 2008 | B2 |
7434164 | Salesin et al. | Oct 2008 | B2 |
7454778 | Pearson et al. | Nov 2008 | B2 |
7496841 | Hadfield et al. | Feb 2009 | B2 |
7564997 | Hamid | Jul 2009 | B2 |
7570964 | Maes | Aug 2009 | B2 |
7613770 | Li | Nov 2009 | B2 |
7624447 | Horowitz et al. | Nov 2009 | B1 |
7627613 | Dulitz et al. | Dec 2009 | B1 |
7640308 | Antonoff et al. | Dec 2009 | B2 |
7644111 | Jaffri | Jan 2010 | B2 |
7673324 | Tirosh et al. | Mar 2010 | B2 |
7680785 | Najork | Mar 2010 | B2 |
7685298 | Day | Mar 2010 | B2 |
7694336 | Rinkevich et al. | Apr 2010 | B2 |
7707153 | Petito et al. | Apr 2010 | B1 |
7720256 | Desprez et al. | May 2010 | B2 |
7730175 | Roesch et al. | Jun 2010 | B1 |
7788235 | Yeo | Aug 2010 | B1 |
7796309 | Sadovsky et al. | Sep 2010 | B2 |
7797724 | Calvin | Sep 2010 | B2 |
7818678 | Massand | Oct 2010 | B2 |
7844116 | Monga | Nov 2010 | B2 |
7857201 | Silverbrook et al. | Dec 2010 | B2 |
7877790 | Vishik et al. | Jan 2011 | B2 |
7890752 | Bardsley et al. | Feb 2011 | B2 |
7895166 | Foygel et al. | Feb 2011 | B2 |
7903822 | Hair et al. | Mar 2011 | B1 |
7941844 | Anno | May 2011 | B2 |
7958101 | Teugels et al. | Jun 2011 | B1 |
8005277 | Tulyakov et al. | Aug 2011 | B2 |
8042112 | Zhu et al. | Oct 2011 | B1 |
8117225 | Zilka | Feb 2012 | B1 |
8181036 | Nachenberg | May 2012 | B1 |
8196030 | Wang et al. | Jun 2012 | B1 |
8201254 | Wilhelm et al. | Jun 2012 | B1 |
8209538 | Craigie | Jun 2012 | B2 |
8233723 | Sundaresan | Jul 2012 | B2 |
8286085 | Denise | Oct 2012 | B1 |
8286171 | More et al. | Oct 2012 | B2 |
8301994 | Shah | Oct 2012 | B1 |
8316237 | Felsher et al. | Nov 2012 | B1 |
8406456 | More | Mar 2013 | B2 |
8473847 | Glover | Jun 2013 | B2 |
8478995 | Alculumbre | Jul 2013 | B2 |
8555080 | More | Oct 2013 | B2 |
8572388 | Boemker et al. | Oct 2013 | B2 |
8620872 | Killalea | Dec 2013 | B1 |
8635295 | Mulder | Jan 2014 | B2 |
8645824 | Baer | Feb 2014 | B2 |
8732127 | Rotterdam et al. | May 2014 | B1 |
8776190 | Cavage et al. | Jul 2014 | B1 |
8797603 | Dougherty et al. | Aug 2014 | B1 |
8839100 | Donald | Sep 2014 | B1 |
9092636 | More et al. | Jul 2015 | B2 |
9098500 | Asokan et al. | Aug 2015 | B1 |
9311624 | Diament | Apr 2016 | B2 |
9473512 | More | Oct 2016 | B2 |
9652485 | Bhargava et al. | May 2017 | B1 |
10025759 | Mulder | Jul 2018 | B2 |
10033774 | Kotler | Jul 2018 | B2 |
10210279 | Bhattal | Feb 2019 | B2 |
20010018739 | Anderson et al. | Aug 2001 | A1 |
20010042073 | Saether et al. | Nov 2001 | A1 |
20020010682 | Johnson | Jan 2002 | A1 |
20020016959 | Barton et al. | Feb 2002 | A1 |
20020019827 | Shiman et al. | Feb 2002 | A1 |
20020023158 | Polizzi et al. | Feb 2002 | A1 |
20020052928 | Stern et al. | May 2002 | A1 |
20020063154 | Hoyos et al. | May 2002 | A1 |
20020065827 | Christie et al. | May 2002 | A1 |
20020065848 | Walker et al. | May 2002 | A1 |
20020073188 | Rawson, III | Jun 2002 | A1 |
20020087515 | Swannack et al. | Jul 2002 | A1 |
20020099602 | Moskowitz et al. | Jul 2002 | A1 |
20020120648 | Ball et al. | Aug 2002 | A1 |
20020129062 | Luparello | Sep 2002 | A1 |
20020136222 | Robohm | Sep 2002 | A1 |
20020138744 | Schleicher et al. | Sep 2002 | A1 |
20020159239 | Arnie et al. | Oct 2002 | A1 |
20020164058 | Aggarwal et al. | Nov 2002 | A1 |
20030009518 | Harrow et al. | Jan 2003 | A1 |
20030009528 | Sharif et al. | Jan 2003 | A1 |
20030037010 | Schmelzer | Feb 2003 | A1 |
20030046572 | Newman et al. | Mar 2003 | A1 |
20030051054 | Redlich et al. | Mar 2003 | A1 |
20030061260 | Rajkumar | Mar 2003 | A1 |
20030078880 | Alley et al. | Apr 2003 | A1 |
20030084279 | Campagna | May 2003 | A1 |
20030093755 | Ramakrishnan | May 2003 | A1 |
20030097454 | Yamakawa et al. | May 2003 | A1 |
20030112273 | Hadfield | Jun 2003 | A1 |
20030115273 | Delia et al. | Jun 2003 | A1 |
20030131005 | Berry | Jul 2003 | A1 |
20030147267 | Huttunen | Aug 2003 | A1 |
20030158839 | Faybishenko et al. | Aug 2003 | A1 |
20030191799 | Araujo et al. | Oct 2003 | A1 |
20030196087 | Stringer et al. | Oct 2003 | A1 |
20030223624 | Hamid | Dec 2003 | A1 |
20030233419 | Beringer | Dec 2003 | A1 |
20030237047 | Borson | Dec 2003 | A1 |
20040002049 | Beavers et al. | Jan 2004 | A1 |
20040031052 | Wannamaker et al. | Feb 2004 | A1 |
20040122659 | Hourihane et al. | Jun 2004 | A1 |
20040128321 | Hamer | Jul 2004 | A1 |
20040148567 | Jeon | Jul 2004 | A1 |
20040186851 | Jhingan et al. | Sep 2004 | A1 |
20040187076 | Ki | Sep 2004 | A1 |
20040225645 | Rowney et al. | Nov 2004 | A1 |
20040261016 | Glass et al. | Dec 2004 | A1 |
20050021980 | Kanai | Jan 2005 | A1 |
20050038893 | Graham | Feb 2005 | A1 |
20050055306 | Miller et al. | Mar 2005 | A1 |
20050055337 | Bebo | Mar 2005 | A1 |
20050071755 | Harrington et al. | Mar 2005 | A1 |
20050108293 | Lipman et al. | May 2005 | A1 |
20050138540 | Baltus et al. | Jun 2005 | A1 |
20050204008 | Shinbrood | Sep 2005 | A1 |
20050251738 | Hirano et al. | Nov 2005 | A1 |
20050251748 | Gusmorino et al. | Nov 2005 | A1 |
20050256893 | Perry | Nov 2005 | A1 |
20050268327 | Starikov | Dec 2005 | A1 |
20050278421 | Simpson et al. | Dec 2005 | A1 |
20060005247 | Zhang et al. | Jan 2006 | A1 |
20060013393 | Ferchichi et al. | Jan 2006 | A1 |
20060021031 | Leahy et al. | Jan 2006 | A1 |
20060047765 | Mizoi et al. | Mar 2006 | A1 |
20060050937 | Hamid | Mar 2006 | A1 |
20060059196 | Sato et al. | Mar 2006 | A1 |
20060064717 | Shibata et al. | Mar 2006 | A1 |
20060067578 | Fuse | Mar 2006 | A1 |
20060069740 | Ando | Mar 2006 | A1 |
20060098850 | Hamid | May 2006 | A1 |
20060112120 | Rohall | May 2006 | A1 |
20060129627 | Phillips | Jun 2006 | A1 |
20060158676 | Hamada | Jul 2006 | A1 |
20060171588 | Chellapilla et al. | Aug 2006 | A1 |
20060184505 | Kedem | Aug 2006 | A1 |
20060190493 | Kawai et al. | Aug 2006 | A1 |
20060218004 | Dworkin et al. | Sep 2006 | A1 |
20060218643 | DeYoung | Sep 2006 | A1 |
20060224589 | Rowney | Oct 2006 | A1 |
20060236246 | Bono et al. | Oct 2006 | A1 |
20060261112 | Todd et al. | Nov 2006 | A1 |
20060271947 | Lienhart et al. | Nov 2006 | A1 |
20060272024 | Huang et al. | Nov 2006 | A1 |
20060277229 | Yoshida et al. | Dec 2006 | A1 |
20060294468 | Sareen et al. | Dec 2006 | A1 |
20060294469 | Sareen et al. | Dec 2006 | A1 |
20070005589 | Gollapudi | Jan 2007 | A1 |
20070011211 | Reeves et al. | Jan 2007 | A1 |
20070025265 | Porras et al. | Feb 2007 | A1 |
20070027830 | Simons et al. | Feb 2007 | A1 |
20070038704 | Brown et al. | Feb 2007 | A1 |
20070094510 | Ross et al. | Apr 2007 | A1 |
20070100991 | Daniels et al. | May 2007 | A1 |
20070101154 | Bardsley et al. | May 2007 | A1 |
20070101413 | Vishik et al. | May 2007 | A1 |
20070112930 | Foo et al. | May 2007 | A1 |
20070150443 | Bergholz et al. | Jun 2007 | A1 |
20070179967 | Zhang | Aug 2007 | A1 |
20070192728 | Finley et al. | Aug 2007 | A1 |
20070220061 | Tirosh et al. | Sep 2007 | A1 |
20070220068 | Thompson et al. | Sep 2007 | A1 |
20070253608 | Tulyakov et al. | Nov 2007 | A1 |
20070261099 | Broussard et al. | Nov 2007 | A1 |
20070261112 | Todd et al. | Nov 2007 | A1 |
20070294318 | Arora et al. | Dec 2007 | A1 |
20070294612 | Drucker et al. | Dec 2007 | A1 |
20070299880 | Kawabe et al. | Dec 2007 | A1 |
20080022003 | Alve | Jan 2008 | A1 |
20080033913 | Winburn | Feb 2008 | A1 |
20080034282 | Zernik | Feb 2008 | A1 |
20080034327 | Cisler | Feb 2008 | A1 |
20080065668 | Spence et al. | Mar 2008 | A1 |
20080080515 | Tombroff et al. | Apr 2008 | A1 |
20080082529 | Mantena et al. | Apr 2008 | A1 |
20080091465 | Fuschino et al. | Apr 2008 | A1 |
20080091735 | Fukushima et al. | Apr 2008 | A1 |
20080162527 | Pizano et al. | Jul 2008 | A1 |
20080177782 | Poston et al. | Jul 2008 | A1 |
20080209001 | Boyle et al. | Aug 2008 | A1 |
20080219495 | Hulten et al. | Sep 2008 | A1 |
20080235760 | Broussard et al. | Sep 2008 | A1 |
20080263363 | Jueneman et al. | Oct 2008 | A1 |
20080275694 | Varone | Nov 2008 | A1 |
20080288597 | Christensen et al. | Nov 2008 | A1 |
20080301193 | Massand | Dec 2008 | A1 |
20080306894 | Rajkumar et al. | Dec 2008 | A1 |
20080310624 | Celikkan | Dec 2008 | A1 |
20080320316 | Waldspurger et al. | Dec 2008 | A1 |
20090025087 | Peirson et al. | Jan 2009 | A1 |
20090030997 | Malik | Jan 2009 | A1 |
20090034804 | Cho et al. | Feb 2009 | A1 |
20090049132 | Gutovski | Feb 2009 | A1 |
20090052778 | Edgecomb et al. | Feb 2009 | A1 |
20090064326 | Goldstein | Mar 2009 | A1 |
20090083073 | Mehta et al. | Mar 2009 | A1 |
20090083384 | Bhogal et al. | Mar 2009 | A1 |
20090129002 | Wu et al. | May 2009 | A1 |
20090164427 | Shields et al. | Jun 2009 | A1 |
20090177754 | Brezina et al. | Jul 2009 | A1 |
20090183257 | Prahalad | Jul 2009 | A1 |
20090187567 | Rolle | Jul 2009 | A1 |
20090216843 | Willner et al. | Aug 2009 | A1 |
20090222450 | Zigelman | Sep 2009 | A1 |
20090234863 | Evans | Sep 2009 | A1 |
20090241187 | Troyansky | Sep 2009 | A1 |
20090271620 | Sudhakar | Oct 2009 | A1 |
20090319480 | Saito | Dec 2009 | A1 |
20100011077 | Shkolnikov et al. | Jan 2010 | A1 |
20100011428 | Atwood et al. | Jan 2010 | A1 |
20100017404 | Banerjee et al. | Jan 2010 | A1 |
20100017850 | More et al. | Jan 2010 | A1 |
20100049807 | Thompson | Feb 2010 | A1 |
20100058053 | Wood et al. | Mar 2010 | A1 |
20100064004 | Ravi et al. | Mar 2010 | A1 |
20100064372 | More et al. | Mar 2010 | A1 |
20100070448 | Omoigui | Mar 2010 | A1 |
20100076985 | Egnor | Mar 2010 | A1 |
20100083230 | Ramakrishnan | Apr 2010 | A1 |
20100114985 | Chaudhary et al. | May 2010 | A1 |
20100114991 | Chaudhary et al. | May 2010 | A1 |
20100131604 | Portilla | May 2010 | A1 |
20100146382 | Abe et al. | Jun 2010 | A1 |
20100174678 | Massand | Jul 2010 | A1 |
20100174761 | Longobardi et al. | Jul 2010 | A1 |
20100186062 | Banti et al. | Jul 2010 | A1 |
20100217987 | Shevade | Aug 2010 | A1 |
20100235763 | Massand | Sep 2010 | A1 |
20100241943 | Massand | Sep 2010 | A1 |
20100257352 | Errico | Oct 2010 | A1 |
20100287246 | Klos et al. | Nov 2010 | A1 |
20100299727 | More et al. | Nov 2010 | A1 |
20100318530 | Massand | Dec 2010 | A1 |
20100332428 | McHenry et al. | Dec 2010 | A1 |
20110029625 | Cheng et al. | Feb 2011 | A1 |
20110035655 | Heineken | Feb 2011 | A1 |
20110041165 | Bowen | Feb 2011 | A1 |
20110106892 | Nelson et al. | May 2011 | A1 |
20110107106 | Morii et al. | May 2011 | A1 |
20110125806 | Park | May 2011 | A1 |
20110141521 | Qiao | Jun 2011 | A1 |
20110145229 | Vailaya et al. | Jun 2011 | A1 |
20110173103 | Batra et al. | Jul 2011 | A1 |
20110197121 | Kletter | Aug 2011 | A1 |
20110225646 | Crawford | Sep 2011 | A1 |
20110252098 | Kumar | Oct 2011 | A1 |
20110252310 | Rahaman et al. | Oct 2011 | A1 |
20110264907 | Betz et al. | Oct 2011 | A1 |
20110314384 | Lindgren et al. | Dec 2011 | A1 |
20120011361 | Guerrero et al. | Jan 2012 | A1 |
20120016867 | Clemm et al. | Jan 2012 | A1 |
20120030563 | Lemonik et al. | Feb 2012 | A1 |
20120036157 | Rolle | Feb 2012 | A1 |
20120079267 | Lee | Mar 2012 | A1 |
20120079596 | Thomas et al. | Mar 2012 | A1 |
20120110092 | Keohane et al. | May 2012 | A1 |
20120117096 | Massand | May 2012 | A1 |
20120117644 | Soeder | May 2012 | A1 |
20120131635 | Huapaya | May 2012 | A1 |
20120133989 | Glover | May 2012 | A1 |
20120136862 | Glover | May 2012 | A1 |
20120136951 | Mulder | May 2012 | A1 |
20120151316 | Massand | Jun 2012 | A1 |
20120173881 | Trotter | Jul 2012 | A1 |
20120185511 | Mansfield et al. | Jul 2012 | A1 |
20120246115 | King et al. | Sep 2012 | A1 |
20120260188 | Park et al. | Oct 2012 | A1 |
20120265817 | Vidalenc et al. | Oct 2012 | A1 |
20120317239 | Mulder | Dec 2012 | A1 |
20130007070 | Pitschke | Jan 2013 | A1 |
20130060799 | Massand | Mar 2013 | A1 |
20130074195 | Johnston et al. | Mar 2013 | A1 |
20130097421 | Lim | Apr 2013 | A1 |
20130212707 | Donahue et al. | Aug 2013 | A1 |
20130227043 | Murakami | Aug 2013 | A1 |
20130227397 | Tvorun | Aug 2013 | A1 |
20140032489 | Hebbar et al. | Jan 2014 | A1 |
20140115436 | Beaver et al. | Apr 2014 | A1 |
20140136497 | Georgiev | May 2014 | A1 |
20140181223 | Homsany et al. | Jun 2014 | A1 |
20140280336 | Glover | Sep 2014 | A1 |
20140281872 | Glover | Sep 2014 | A1 |
20150026464 | Hanner et al. | Jan 2015 | A1 |
20150172058 | Follis | Jun 2015 | A1 |
20160055196 | Collins | Feb 2016 | A1 |
20160350270 | Nakazawa | Dec 2016 | A1 |
Number | Date | Country |
---|---|---|
10177650 | Jun 1998 | JP |
2004265267 | Sep 2004 | JP |
2007299364 | Nov 2007 | JP |
1020010078840 | Aug 2001 | KR |
20040047413 | Jun 2004 | KR |
1020040047413 | Jun 2004 | KR |
1020060048686 | May 2006 | KR |
0049518 | May 2007 | KR |
200070049518 | May 2007 | KR |
102008002960 | Apr 2008 | KR |
1020080029602 | Apr 2008 | KR |
WO0060504 | Oct 2000 | WO |
2001052473 | Jul 2001 | WO |
2002101577 | Dec 2002 | WO |
Entry |
---|
Data Processing: Presentation Processing of Document, Operator Interface Processing, and Screen Saver Display Processing; Feb. 2011; pp. 1-33. |
Bettenburg et al., An Empirical Study on the Risks of Using Off-the-Shelf Techniques for Processing Mailing List Data, 2009, IEEE 4 pages. |
Bindu et al., Spam War: Battling Ham against Spam, 2011 IEEE 6 pages. |
Bobba et al. Attribute-Based Messaging: Access Control and Confidentiality, 2010, ACM 35 pages. |
Chen et al., Online Detection and Prevention of Phishing Attacks, 2006, IEEE 7 pages. |
Kamouskos et al., Active Electronic Mail, 2002, ACM 6 pages. |
Kaushik et al., Email Feedback: A Policy based Approach to Overcoming False Positives, 2005, 10 pages. |
Stolfo et al., AMT?MET: Systems for Modeling and Detecting Errant Email. 2003, IEEE 6 pages. |
International Search Report of PCT Application No. PCT/US2009/064919 dated Jul. 1, 2010, pp. 1-3. |
International Search Report of PCT Application No. PCT/US2010/043345, dated Apr. 28, 2011, 3 pages. |
Non-Final Office Action dated Apr. 27, 2012 in Co-Pending U.S. Appl. No. 12/275,185, filed Nov. 20, 2008. |
Non-final office action issued for U.S. Appl. No. 13/799,067 dated Oct. 30, 2014. |
Non-Final Office Action dated Apr. 26, 2013 in Co-Pending U.S. Appl. No. 13/659,817 of More, S., filed Oct. 24, 2012. |
Non-Final Office Action dated Apr. 27, 2012 in Co-Pending U.S. Appl. No. 12/275,185 of More, S., filed Nov. 20, 2008. |
Non-Final Office Action dated Aug. 1, 2012 in Co-Pending U.S. Appl. No. 12/621,429, filed Nov. 18, 2009. |
Non-Final Office Action dated Aug. 1, 2012 in Co-Pending U.S. Appl. No. 12/621,429 of More, S., filed Nov. 18, 2009. |
Non-Final Office Action dated Aug. 13, 2013 in co-pending U.S. Appl. No. 13/306,819 by Glover, R.W., filed Nov. 29, 2011. |
Non-Final Office Action dated Dec. 22, 2011 in Co-Pending U.S. Appl. No. 12/209,082. |
Non-Final Office Action dated Dec. 6, 2012 in co-pending U.S. Appl. No. 13/306,798, filed Nov. 29, 2011. |
Non-Final Office Action dated Jan. 9, 2012 in Co-Pending U.S. Appl. No. 12/177,043, filed Jul. 21, 2008. |
Non-Final Office Action dated Mar. 11, 2011 in Co-Pending U.S. Appl. No. 12/209,096, filed Sep. 11, 2008. |
Non-Final Office Action dated Mar. 18, 2013 in Co-Pending U.S. Appl. No. 13/659,793 by More, S., filed Oct. 24, 2012. |
Non-Final Office Action dated Mar. 20, 2006 in Co-pending U.S. Appl. No. 10/136,733, filed Apr. 30, 2002. |
Non-Final Office Action dated May 17, 2013 in Co-pending U.S. Appl. No. 13/306,765 by Mulder, S. P. M, filed Nov. 29, 2011. |
Non-Final Office Action dated Sep. 19, 2011 for U.S. Appl. No. 12/177,043, filed Jul. 21, 2008. |
Non-Final Office Action dated Sep. 19, 2012 in Co-Pending U.S. Appl. No. 12/844,818 by Glover, R., filed Jul. 27, 2010. |
Notice of Allowance dated Aug. 19, 2012 in Co-Pending U.S. Appl. No. 12/177,043, filed Jul. 21, 2006. |
Notice of Allowance dated Jul. 8, 2013 in Co-Pending U.S. Appl. No. 12/209,082 by S. More et al. filed Sep. 11, 2008. |
Notice of Allowance dated Jun. 26, 2012 in Co-Pending U.S. Appl. No. 12/275,185 of More, S., filed Nov. 20, 2008. |
Notice of Allowance dated Mar. 13, 2013 in Co-Pending U.S. Appl. No. 12/844,818 by Glover, R., filed Jul. 27, 2010. |
Notice of Allowance dated Oct. 24, 2008 in Co-pending U.S. Appl. No. 10/023,010, filed Dec. 17, 2001. |
Notice of Allowance dated Oct. 24, 2008 in Co-pending U.S. Appl. No. 11/023,010, filed Dec. 17, 2001. |
Notice of Allowance dated Sep. 25, 2013, Co-Pending U.S. Appl. No. 13/659,817 by More, S., filed Oct. 24, 2012. |
PC Magazine “Pure Intranets: Real-Time Internet Collaboration”, http://www.zdnet.com/pcmag/featuresgroupware/gpwst.htm, Aug. 30, 2001, 2 pages. |
Restriction Requirement Jun. 30, 2006 for U.S. Appl. No. 10/136,733, filed Apr. 30, 2002. |
Restriction Requirement dated Feb. 14, 2005 for U.S. Appl. No. 10/023,010, filed Dec. 17, 2001, Issued U.S. Pat. No. 7,496,841. |
Restriction Requirement dated Jun. 30, 2006 for U.S. Appl. No. 10/136,733, filed Apr. 30, 2002. |
Roussev, et al., “Integrating XML and Object-based Programming for Distributed Collaboration”, IEEE, 2000, pp. 254-259. |
Stephen Voida et al., Share and Share Alike: Exploring the User Interface Affordances of File Sharing, Apr. 22-27, 2006, ACM, pp. 1-10. |
Tsai, et al., “A document Workspace for Collaboration and Annotation based on XML Technology”, Department of Electrical Engineering, 2001, pp. 165-172. |
Tuklakov, et al., “Symmetric Hash Functions for Fingerprint Minutiae,” International Workshop on Pattern Recognition for Crime Prevention, Security and Surveillance, Bath U.K., Oct. 2, 2005, pp. 30-38. |
U.S. Appl. No. 13/789,104, filed Mar. 7, 2013, Gofman. |
V Monga, B.L. Evans Perceptual image hashing via feature points: performance evaluation and tradeoffs IEEE Transactions on Image Processing, 15 (11) (2006), pp. 3453-3466. |
Weiss et al., Lightweight document matching for help-desk applications, In: Intelligent Systems and their Applications, IEEE, Vo. 15, Issue:2, pp. 57-61, ISSN 1094-7167, 2000. |
Wells et al., “Groupware & Collaboration Support,”, www.objs.com/survey/groupwar.htm, Aug. 30, 2001, 10 pages. |
Written Oninion of PCT Application No. PCT/US2009/051313, dated Mar. 3, 2010, 4 pages. |
Written Opinion PCT Application No. PCT/2009/064919, dated Jul. 1, 2010, 4 pages. |
Written Opinion PCT Application No. PCT/US2009/056651, dated Apr. 21, 2010, pp. 1-5. |
Written Opinion PCT Application No. PCT/US2009/056668 dated Apr. 16, 2010, pp. 1-4. |
Written Opinion PCT Application No. PCT/US2009/064919 dated Jul. 1, 2010, pp. 1-4. |
Written Opinion PCT Application No. PCT/US2009/065019 dated Jun. 4, 2010, p. 1-5. |
Written Oninion PCT Application No. PCT/US2010/043345 dated Apr. 28, 2011, 4 pages. |
Written Opinion PCT/US2009/056651 dated Apr. 21, 2010, pp. 1-5. |
Advisory Action dated Apr. 12, 2013, in Co-Pending U.S. Appl. No. 12/621,429 by More, S., filed Nov. 18, 2009. |
Advisory Action dated Apr. 12, 2013, in Co-Pending U.S. Appl. No. 12/621,429 of More, S., filed Nov. 18, 2009. |
Advisory Action dated Nov. 1, 2013, in Co-Pending U.S. Appl. No. 13/659,793 by More, S., filed Oct 24, 2012. |
Co-pending U.S. Appl. No. 10/023,010, filed Dec. 17, 2001. |
Co-pending U.S. Appl. No. 10/136,733, filed Apr. 30, 2002. |
Co-pending U.S. Appl. No. 12/177,043, filed Jul. 21, 2008. |
Co-pending U.S. Appl. No. 12/209,082, filed Sep. 11, 2008. |
Co-pending U.S. Appl. No. 12/209,096, filed Sep. 11, 2008. |
Co-pending U.S. Appl. No. 12/275,185, filed Nov. 20, 2008. |
Co-pending U.S. Appl. No. 12/621,429, filed Nov. 18, 2009. |
Co-pending U.S. Appl. No. 12/844,818, filed Jul. 27, 2010. |
Co-pending U.S. Appl. No. 13/306,765, filed Nov. 29, 2011. |
Co-pending U.S. Appl. No. 13/306,798, filed Nov. 29, 2011. |
Co-pending U.S. Appl. No. 13/306,819, filed Nov. 29, 2011. |
Co-pending U.S. Appl. No. 13/620,364, filed Sep. 14, 2012. |
Co-Pending U.S. Appl. No. 13/659,793, filed Oct. 24, 2012. |
Co-Pending U.S. Appl. No. 13/659,817, filed Oct. 24, 2012. |
Final Office Action dated Apr. 16, 2012 in Co-Pending U.S. Appl. No. 12/177,043, filed Jul. 21, 2008. |
Final Office Action dated Apr. 17, 2007 for U.S. Appl. No. 10/023,010, filed Dec. 17, 2001, Issued U.S. Pat. No. 7,496,841. |
Final Office Action dated Apr. 17, 2007 for U.S. Appl. No. 10/023,010, filed Dec. 7, 2001, Issued U.S. Pat. No. 7,496,841. |
Final Office Action dated Apr. 17, 2007 in Co-Pending U.S. Appl. No. 10/023,010, filed Dec. 17, 2001, Issued U.S. Pat No. 7,496,841. |
Final Office Action dated Aug. 12, 2011 for U.S. Appl. No. 12/209,096, filed Sep. 11, 2008. |
Final Office Action dated Aug. 12, 2011 in Co-Pending U.S. Appl. No. 12/209,096, filed Sep. 11, 2008. |
Final Office Action dated Aug. 16, 2013 in co-pending U.S. Appl. No. 13/306,798 of Glover, R.W., filed Nov. 29, 2011. |
Final Office Action dated Feb. 1, 2013 in Co-Pending U.S. Appl. No. 12/621,429 by More, S., filed Nov. 18, 2009. |
Final Office Action dated Feb. 1, 2013 in Co-Pending U.S. Appl. No. 12/621,429 of More, S., filed Nov. 18, 2009. |
Final Office Action dated Jan. 18, 2013 in Co-Pending U.S. Appl. No. 12/844,818 by Glover, R., filed Jul. 27, 2010. |
Final Office Action dated Jan. 18, 2013 in Co-Pending U.S. Appl. No. 12/844,818 of Glover, R., filed Jul. 27, 2010. |
Final Office Action dated May 10, 2012 in Co-Pending U.S. Appl. No. 12/209,082, filed Sep. 11, 2008. |
Final Office Action dated May 10, 2012 in Co-Pending U.S. Appl. No. 12/209,082. |
Final Office Action dated Oct. 21, 2013, in Co-Pending U.S. Appl. No. 13/659,793 by More, S., filed Oct. 24, 2012. |
International Search Report of PCT Application No. PCT/1B2002/005821, dated Jan. 30, 2004, 6 pages. |
International Search Report of PCT Application No. PCT/2009/064919, dated Jul. 1, 2010, 3 pages. |
Workshare Compare Service Administration Guide, © 2007. p. 1-25. |
Workshare Compare Service Developers Guide, © 2007. p. 1-30. |
Workshare Compare Service Technical Quick Start Guide, © 2007 p. 1-10. |
Workshare DeltaServer Configuration Guide, © 2003 p. 1-24. |
User Permissions and Permission Levels (SharePoint Foundation 2010)(technet.microsoft.com) (Jan. 4, 2011), https://technet.microsoft.com/en-us/library/cc288074(v=office.14).aspx (last visited Feb. 27, 2017), p. 1-6. |
Cawood, Stephen. How to Do Everything™ Microsoft® SharePoint® 2010. McGraw-Hill, 2010, ISBN 978-0-07-174367-9 (pbk). Copyright © 2010. p. 8, 44, 45, 46, 61, 69, 82, 215. |
Microsoft SharePoint 2010 White Paper , Microsoft.com, www.microsoft.com/downloads/en/details.aspx?FAMILYID=5C562F71-3AA9-46FD-ABAC-7D381813F2B8 (Sep. 2010), www.microsoft.com/downloads/en/details.aspx?FamilyID=5c562f71-3aa9-46fd-abac-7d381813f2b8 (last visited Feb. 27, 2017), p. 1-38. |
Number | Date | Country | |
---|---|---|---|
20160188584 A1 | Jun 2016 | US |
Number | Date | Country | |
---|---|---|---|
62129957 | Mar 2015 | US | |
62137358 | Mar 2015 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 13306798 | Nov 2011 | US |
Child | 15063247 | US | |
Parent | 13830023 | Mar 2013 | US |
Child | 13306798 | US |