Method and system for shared document approval

Information

  • Patent Grant
  • 11386394
  • Patent Number
    11,386,394
  • Date Filed
    Tuesday, February 21, 2017
    7 years ago
  • Date Issued
    Tuesday, July 12, 2022
    2 years ago
  • Inventors
  • Original Assignees
  • Examiners
    • Bashore; William L
    • Distefano; Gregory A
    Agents
    • Nixon Peabody LLP
Abstract
This invention discloses a novel system and method for displaying electronic documents that are subject to approval by multiple parties. The invention presents approval by person as a separate indication on the original document. The system automatically reviews the document to determine its type and then using the type, looks up the recipient list that is associated with that type of document. The document is then transmitted to those recipients for approval.
Description
FIELD OF INVENTION

This invention provides a mechanism whereby a group of people operating individual computer devices can view and approve an electronic document.


BACKGROUND

Electronic documents, for example text documents, are often subject to approval by more than one authorized viewer. There is a need for a method and system of group approval of an electronic document whereby the user interface of the computer program permits better control of the group approval process by its participants.





DESCRIPTION OF THE FIGURES




  • 1. Approval Dialogue Box.


  • 2. Flow Chart for Document Distribution


  • 3. Flow Chart for Recipient List Generation


  • 4. Flow Chart for Display of Approval Dialogue Box


  • 5. Flow Chart for Document Approval Completion






DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

The method and system operates on one or more computers, typically using a server 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 with document management and editing systems. An example of a document editing system is presented by U.S. patent application Ser. No. 13/155,900 filed on Jun. 8, 2011, which is hereby incorporated by reference.


In one embodiment of the invention, an originator creates an electronic document that requires approval. For example, the originator who is a worker in an organization may create on their computer a vacation request that has to be approved by several people in management. The electronic document can be created on the originator's device. The invention then opens a dialogue box that is displayed on the originator's computer screen where the originator inputs the identity of the personnel that are to approve the document (referred to as the “recipient list”). The identity of the originator. In another embodiment, the invention operating on either the originator's device or the server checks the document to see if the metadata contained in the document shows that it is a document subject to approval. Examples would include (without limiting the breadth of the invention) an expense report, a vacation request or similar internal corporate document detailing an action that requires approval. That metadata can also indicate the type of document, for example, distinguishing between a vacation request and an expense approval. If the document is subject to an approval, the invention then distributes the document to the list of recipients included in the metadata.


In yet another embodiment, the invention will use the type of document that is specified by the metadata to query a database to find a list of recipients that are specified as personnel that are to approve (or not approve) the document. For example, there may be a database comprised of one list of recipients for vacation requests made by that originator and another for approving expense reimbursement.


In another embodiment of the invention, the originator of the document can receive a list of pre-determined recipients that were not cited by the originator when the document was created. In this embodiment, the originator can select which of these missing recipients should be added to the recipient list. This information is then stored as metadata in the document. The document is then transmitted up to the server. On the server, the metadata is checked and action is taken in response to the metadata.


In yet another embodiment, the invention can delete from the recipient list destination addresses that are not part of the pre-determined recipient list that the invention has fetched from storage as the list associated with that type of document. In yet another embodiment, the invention can scan a database of documents to seek out similar documents. Then the invention can compile a list of recipients from the set of recipients that received one or more of those similar documents. The system can apply further logic, for example, deleting from that set those persons who are not currently listed as employees of the company. The resulting recipient list may be used or presented to the originator to selectively supplement the originator's list of recipients.


Once the recipient list has been finally determined, the system then transmits the document to the list of recipients or a message that such a document is pending the recipient's approval. The document stored on the remote server is downloaded into each recipient's device. When the downloaded document is displayed on the recipient's device, the device utilizes the system. The system causes the identity of the recipient list to be displayed at the bottom of the screen in a dialogue box. If other recipients have inserted comments into the document, the dialogue box can indicate the presence of comments. If the other recipients have approved or rejected the document, the approval or rejection of each recipient can be shown by means of a visual indication in the dialogue box.


In yet another embodiment, the system will analyze the text of the document directly to determine whether or not an approval was required and which recipient list would apply. For example, the heading of a document might include the title “Vacation Request”. Text matching logic can determine that the document is a vacation request form. By means of automated content analysis of the document, the type of document can be determined to some pre determined adequate level of accuracy.


The document subject to approval is transmitted to the recipients on the recipient list. The recipient list may be a list of email addresses or other network locations. In another embodiment, the recipient list is a list of identifiers that the system can associate with corresponding network destinations. The recipient's computer receives the document and determines by examining the metadata that the document is subject to approval. The application running on the recipient's computer opens a dialogue box that displays the identity of the other recipients that are to give approval. (See FIG. 1). The application can transmit a request to a server to obtain the approval status of the document for those other recipients. The application then updates the display to show the approval status of the document. The application then detects whether the recipient has actuated any of the buttons displayed on the user interface. In one embodiment, there are three buttons: approve, reject and cancel. When approve or reject are selected, the document metadata is updated with the approve or reject, respectively. The document is then transmitted back to the server in order to update the document database.


In another embodiment, the application running on the recipient's computer transmits a data message to the server indicating the identity of the document, the identity of the recipient and whether the recipient has approved or rejected the document. The server component of the system can then update the document directly, as well as transmit this status information to the other recipients' computers and the originator's computer.


In yet another embodiment, the invention can cause a message to be sent to the originator each time a member of the recipient list inputs an “Approve” or “Reject” command into the dialogue box displayed on their computer. In this way, the originator can track the progress of the document through the approval process. The originator can also fetch the document to see comments that have been inserted into the document.


The system contains data storage that is comprised of data including network addresses associated with the originator or recipients, for example, an email address, a telephone number, Twitter™ handle or any other designation of an electronic message destination. This data may be stored on the server or on the user devices. When a recipient list is determined, the actual network addresses are looked up and used to transmit the message. When the “approve” or “reject” button is actuated, the system composes an electronic message that is then transmitted to the destination associated with the originator. In another embodiment, the message is transmitted to the destinations associated with all of the members of the recipient list and the originator, respectively. The message is a data object that is transmitted to the destination or destinations. The program logic causes the system to fetch from storage the destination data associated with the originator of the document. Then the program assembles the data object using content and the destination data. The content of the message can be comprised of a reference to the document and the identity of the recipient in the form of text data. In yet another embodiment, the system can cause a dialogue box to open permitting the recipient to type in a question or comment that is included with the message data object as text data. In yet another embodiment, the device can open a dialogue box that permits the recipient to record their voice input or voice together with video input as a recording of the recipient reciting a question or a comment. This audio or audio visual data is then transmitted as part of the content of the message data object, thus alleviating the need for the reviewer to type text data into the message.


When the document has all members of the recipient list set to “Approve”, the invention then transmits the document back to the originator. In another embodiment, an electronic message indicating completed approval is transmitted to the originator. In yet another embodiment, the document itself contains metadata that indicates where the document should go when approval is completed. The destination may be determined by using the type of document. For example, an expense reimbursement report may contain metadata indicating an email address of the accounts payable department. When the system determines that the expense report document has been approved by all the recipients, it automatically routes it to the appropriate recipient at the accounts payable department. Because personnel can change and therefore email addresses, another embodiment of the invention involves having a final recipient associated with a type of document. In this case, the document does not carry the identity of the final recipient, rather, the invention determines that destination address by looking up in a database the destination address. The database would contain a mapping of document types to final recipient addresses. This may be carried to another level in the database, so that an “expense report” is mapped to “accounts payable”, and then “accounts payable” mapped to a particular individual. That way, if the individual changes, the mapping of the expense report does not need to be changed, only the mapping of “accounts payable” to the individual's network address.


Operating Environment

The user's computer may be a laptop, 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 comp 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. 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) 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.


Modifications of the above disclosed apparatus and methods which fall within the scope of the invention will be readily apparent to those of ordinary skill in the art. Accordingly, while the present invention has been disclosed in connection with exemplary embodiments thereof it should be understood that other embodiments may fall within the spirit and scope of the invention, as defined by the following claims.

Claims
  • 1. A computer system for automatically executing an approval of an electronic document by one or more personnel comprising: a video display;a module configured by logic to receive the electronic document and one or more recipients for the document from an originator of the document;a module configured by logic to determine that the received document is a type of document that is one of a plurality of document types that require an approval, and to receive from a data storage device data representing a recipient list corresponding to the received document type by using the determined document type, said recipient list comprised of a predetermined combination of members assigned based on the document type;a module configured by logic to provide the originator of the document with one or more additional recipients, based on the recipient list, who are not included in the one or more recipients for the document from the originator;a module configured by logic to modify the recipient list based on current statuses of the members, to add to the recipient list selected recipients from the one or more additional recipients, and to block the one or more recipients for the document who are not on the recipient list;a module configured by logic to transmit said document to devices associated with the members of the recipient list; anda module configured by logic to receive from at least one of said member devices a data message representing an approval, said message comprised of data representing the identity of the approving member and the identity of the transmitted document.
  • 2. The system of claim 1, further comprising: a module configured by logic to determine that the document is of a document type that requires an approval by reading metadata associated with the document itself.
  • 3. The system of claim 1, wherein the module configured by logic to determine is further configured to read metadata associated with the document to retrieve the identities of the recipient list.
  • 4. The system of claim 1, further comprising a module configured by logic to receive from a device associated with a recipient member a data message representing a comment and an identity of the transmitted document; wherein the module is further configured to determine an originator of the document and transmit the comment to the originator.
  • 5. The system of claim 1, further comprising: a module configured by logic to transmit to the computer associated with an originator of the received document the retrieved recipient list; and further configured by logic to receive from said associated computer an approval of at least one of the members of the retrieved recipient list to be added to the recipient list that the document is to be transmitted to.
  • 6. The system of claim 1, further comprising: a module configured by logic to determine whether all members of the recipient list have transmitted an approval of the document; to determine the destination for the approved document; and to transmit the approved document to the determined destination.
  • 7. The system of claim 1, further comprising: a module configured by logic to determine whether all members of the recipient list have transmitted an approval of the document; to determine the destination for the approved document; and transmit a message to the determined destination that indicates that the document has been approved.
  • 8. The system of claim 1, further comprising: a module configured by logic to scan a database of documents to determine similar documents as the received document; and compile the recipient list from a set of recipients that received one or more of the similar documents.
  • 9. The system of claim 1, further comprising: a module configured by logic to receive a message each time a member of the recipient list acts on the document.
  • 10. The system of claim 9, wherein the member of the recipient list acting on the document is the member indicating one of approval or rejection of the document.
  • 11. The system of claim 1, wherein the module configured by logic to determine that the received document is the type of document analyzes text of the document to determine the document type.
  • 12. The system of claim 11, wherein the text of the document contains one or more keywords or phrases that indicate the document type.
  • 13. The system of claim 11, wherein the document type maps to a recipient type, and the recipient type maps to the recipient list.
  • 14. The system of claim 1, wherein the recipient list is a list of e-mail addresses.
  • 15. The system of claim 1, wherein the recipient list is a list of network destinations.
  • 16. The system of claim 1, further comprising: a module configured by logic to modify the recipient list based on removing one or more members on the recipient list that are also listed on a second list.
  • 17. The system of claim 16, wherein the second list is members that are no longer employed at a company associated with the recipient list.
  • 18. The system of claim 1, wherein the statuses of the members comprise whether the members are currently employed at a company associated with the recipient list.
  • 19. The system of claim 1, further comprising: a module configured by logic to provide a dialogue box that permits a member of the document for approval to add a voice input, a video input, or a combination thereof to the data message.
  • 20. A computer system comprised of a processor, memory and a database for automatically approving an electronic document comprising: a module adapted by logic to receive from an originator's computer the electronic document and one or more recipient computers for the document from an originator of the document;a module configured by logic to determine that the received document is a type of document that is one of a plurality of document types that require an approval, and to receive from a data storage device, a data representing a recipient list corresponding to the received document type by using the determined document type, the recipient list comprised of a predetermined combination of recipient computers assigned based on the document type;a module configured by logic to provide the originator of the document with one or more additional recipient computers, based on the recipient list, that are not included in the one or more recipients for the document from the originator;a module configured by logic to modify the recipient list based on current statuses of recipients associated with the recipient computers and to add to the recipient list selected recipient computers from the one or more additional recipient computers;a module adapted by logic to transmit the received electronic document to at least one network addresses associated with at least one corresponding recipient computers on the corresponding recipient list;a module adapted by logic to receive a data message from a recipient computer where, the message is comprised of data encoding either an Approve or a Reject logic value, said data message further comprised of data indicating the identity of the determined document, the identity of the recipient and the selection of Approve or Reject;a module adapted by logic to update a data record in the database associated with the determined document with information representing that the recipient has accepted or rejected the document; anda module adapted by logic to determine that all members of the recipient list have approved the document and to transmit a data message to a destination address indicating that the document has been approved.
Parent Case Info

This application claims priority as a continuation of U.S. patent application Ser. No. 13/160,772, filed on Jun. 15, 2011, which is a non-provisional continuation of U.S. Patent Application No. 61/496,904 filed on Jun. 14, 2011, both of which are hereby incorporated by reference in their entireties. This application incorporates U.S. patent application Ser. No. 13/155,900 filed on Jun. 8, 2011, for all that it teaches.

US Referenced Citations (376)
Number Name Date Kind
4479195 Herr et al. Oct 1984 A
4949300 Christenson et al. Aug 1990 A
5008853 Bly et al. Apr 1991 A
5072412 Henderson, Jr. et al. Dec 1991 A
5220657 Bly et al. Jun 1993 A
5245553 Tanenbaum Sep 1993 A
5247615 Mori 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
5838313 Hou 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
6212552 Biliris 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
6327611 Everingham Dec 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 Dec 2004 B1
6871318 Wynblatt Mar 2005 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
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 Feb 2011 B2
7903822 Hair et al. Mar 2011 B1
7941844 Anno May 2011 B2
7958101 Teugels et al. Jun 2011 B1
7996456 Gross Aug 2011 B2
8005277 Tulyakov et al. Aug 2011 B2
8042112 Zhu et al. Oct 2011 B1
8117225 Zilka Feb 2012 B1
8145724 Hawks et al. Mar 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 et al. Oct 2013 B2
8572388 Boemker et al. Oct 2013 B2
8620872 Killalea Dec 2013 B1
8635295 Mulder Jan 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
9098500 Asokan et al. Aug 2015 B1
9311624 Diament et al. Apr 2016 B2
9652485 Bhargava et al. May 2017 B1
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 Amie 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
20030061350 Masuoka et al. 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 et al. 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 Mar 2005 A1
20050055337 Bebo et al. Mar 2005 A1
20050071755 Harrington et al. Mar 2005 A1
20050108293 Lipman et al. May 2005 A1
20050138350 Hariharan Jun 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
20080028017 Garbow Jan 2008 A1
20080033913 Winburn Feb 2008 A1
20080034282 Zernik Feb 2008 A1
20080034327 Cisler et al. Feb 2008 A1
20080065668 Spence et al. Mar 2008 A1
20080071873 Gross 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
20080215667 Rothbarth et al. Sep 2008 A1
20080219416 Roujinsky Sep 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 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
20090059922 Appelman Mar 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
20100274765 Murphy et al. 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
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
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
20140067942 Carrigan Mar 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
20160350270 Nakazawa Dec 2016 A1
Foreign Referenced Citations (14)
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
Non-Patent Literature Citations (177)
Entry
Non-Final Office Action dated Sep. 19, 2012 in Co-Pending U.S. Appl. No. 12/844,818 of 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, 2008.
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 Jun. 26, 2012 in Co-Pending U.S. Appl. No. 12/275,185, 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 Mar. 13, 2013 in Co-Pending U.S. Appl. No. 12/844,818 of Glover, R., filed Jul. 27, 2010.
Notice of Allowance dated Oct. 2, 2012, in Co-Pending U.S. Appl. No. 12/275,185 by More, S., filed Nov. 20, 2008.
Notice of Allowance dated Oct. 2, 2012, in Co-Pending U.S. Appl. No. 12/275,185 of More, S., filed Nov. 20, 2008.
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. 10/023,010, filed Dec. 17, 2001, now U.S. Pat. No. 7,496,841.
Notice of Allowance dated Sep. 25, 2013, in Co-Pending U.S. Appl. No. 13/659,817 by More, S., filed Oct. 24, 2012.
Office Web Apps Overview (Installed on SharePoint 2010 Products), Technet.Microsoft.com (Jun. 11, 2010), https://technet.microsoft.com/en-us/library/ff431685(v=office.14).aspx, (last visited Feb. 27, 2017).
Pattison,Ted et al. Inside Microsoft® SharePoint® 2010. Critical Path Training, LLC © 2011.
PC Magazine “Pure Intranets: Real-Time Internet Collaboration”, Aug. 30, 2001.
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, now U.S. Pat. No. 7,496,841.
Restriction Requirement dated Feb. 14, 2005 in U.S. Appl. No. 10/023,010, filed Dec. 17, 2001, now U.S. Pat. No. 7,496,841.
Restriction Requirement dated Feb. 5, 2008 for U.S. Appl. No. 10/023,010, filed Dec. 17, 2001, now U.S. Pat. No. 7,496,841.
Restriction Requirement dated Feb. 5, 2008 in Co-Pending U.S. Appl. No. 10/023,010, filed Dec. 17, 2001, now 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.
Restriction Requirement dated Jun. 30, 2006 in 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.
Sahil Malik. Microsoft SharePoint 2010: Building Solutions for SharePoint 2010 . Apress; 1st ed. edition (Jun. 7, 2010).
Silver, Michael A.; MacDonald, Neil. Plan to Deal with Metadata Issues with Windows Vista. Gartner, Inc.. Dec. 21, 2005.ID No. G00136321.
Simple Mail Transfer Protocol, Internet Engineering Task Force(IETF), RFC 821 (Aug. 1982).
Stephen Voida et al., Share and Share Alike: Exploring the User Interface Affordances of File Sharing, Apr. 22-27, 2006, ACM, pp. 1-10.
Sujoy Roy, et al., “Robust Hash for Detecting and Localizing Image Tampering,” Image Processing, 2007, ICIP 2007, IEEE International Conference on, vol. 6, No., pp. V1-117-V1-120, Sep. 16, 2007-Oct. 19, 2007.
Sujoy Roy; Qibin Sun; , “Robust Hash for Detecting and Localizing Image Tampering,” Image Processing, 2007. ICIP 2007. IEEE International Conference on , vol. 6, No., pp. VI-117-VI-120, Sep. 16, 2007-Oct. 19, 2007.
Tsai, et al., “A document Workspace for Collaboration and Annotation based on XML Technology”, Department of Electrical Engineering, 2001, pp. 165-172.
Tsai, et al., “A Document Workspace for Collaboration and Annotation based on XML Technology”, IEEE, 2000, 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.
Tulyakov et al, Symmetric Hash Functions for Fingerprint Minutiae, ICAPR 2005, LNCS 3687, pp. 30-38, 2005.
Tulyakov et al. “Symmetric Hash Functions for Fingerprint Minutiae.” International Workshop on Patter Recognition for Crime Prevention, Security and Surveillance, Bath U.K., Oct. 2, 2005, pp. 30-38.
Tulyakov, 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.
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).
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 Opinion of PCT Application No. PCT/US2009/051313, dated Mar. 3, 2010, 3 pages.
Written Opinion 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/056668, dated Apr. 16, 2010, 4 pages.
Written Opinion PCT Application No. PCT/US2009/064919 dated Jul. 1, 2010, pp. 1-4 pages.
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 Opinion PCT Application No. PCT/US2009/065019 dated Jun. 4, 2010, pp. 1-5.
Written Opinion PCT Application No. PCT/US2009/065019, dated Jun. 4, 2010, 5 pages.
Written Opinion PCT Application No. PCT/US2010/043345 dated Apr. 28, 2011, 4 pages.
Written Opinion PCT/US2009/056651 dated Apr. 21, 2010, pp. 1-5.
XP-002257904, “Workshare Debuts Synergy”, 2003, 3 pages.
Xuefeng Liang; et al., “Fingerprint Matching Using Minutia Polygons,” Pattern Recognition, 2006, ICPR 2006, 18th International Conference on, vol. 1, No., pp. 1046-1049.
Xuefeng Liang; et al., “Fingerprint Matching Using Minutia Polygons,” Pattern Recognition, 2006, ICPR 2006, 18th International Confernce on, vol. 1, No., pp. 1046-1049.
Xuefeng Liang; Tetsuo Asano; , “Fingerprint Matching Using Minutia Polygons,” Pattern Recognition, 2006. ICPR 2006. 18th International Conference on , vol. 1, No., pp. 1046-1049.
Yung et al, Generating Robust Digital Signature for Image/Video Authentication, Multimedia and Security Workshop at ACM Multimedia '98, Bristol, U.K., Sep. 1998.
Jain, Pravin. The class of JAVA. Aug. 12, 2010.
“3BClean”.
“ezClean—Metadata removal utility for Microsoft Office”.
“MIMEsweeper Solutions”.
“CS MAILsweeper™ 4.3 for SMTP” by Clearswift Ltd (© 2002).
“ezClean—New Features—version 3.3”.
“ezClean 3.2—New Features”.
“ezClean FAQ”.
“How do I make sure that there is no embarrassing Metadata in any documents that I attach to e-mails? ezClean makes it easy!”.
“Lotus Announces cc:Mail for the World Wide Web; Provides EasyAccess to E-Mail via the Web”.
“Middleboxes: Taxonomy and Issues,” Internet Engineering TaskForce (IETF), RFC 3234 (Feb. 2002).
“MIME (Multipurpose Internet Mail Extensions): Mechanisms forSpecifying and Describing the Format of Internet Message Bodies,” Internet Engineering Task Force (IETF), RFC 1341 (Jun. 1992).
“Think Your Deletions are Gone Forever? Think Again! ezClean Makes Metadata Removal Easy!”
3B Clean: What is the Problem? 3B is the solution.
3B Transform from 2005.
3BOpen Doc Making StarOffice and OpenOffice.org a viable option.
3BOpenDoc—Convert documents to and from OSF.
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.
Bitform Extract SDK 2005.1.
Cawood, Stephen. How to Do Everything™ Microsoft® SharePoint®2010. McGraw-Hill, 2010. ISBN 978-0-07-174367-9 (pbk). Copyright © 2010.
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.
Dominik Grolimund et al., Cryptree: A Folder Tree Structure for Cryptographic File Systems, Oct. 2-4, 2006, IEEE, pp. 189-198.
EZclean version 3.3 Installation Guide and Admin Manual.
EzClean version 3.3 Integration Guide for use with CS MailSweeper for SMTP.
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, now 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, now 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, now 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.
International Search Report of PCT Application No. PCT/IB2002/005821, dated Jan. 3, 2004, 6 pages.
International Search Report of PCT Application No. PCT/IB2002/005821, dated Jan. 30, 2004, 6 pages.
International Search Report of PCT Application No. PCT/US2009/051313, dated Mar. 3, 2010, 3 pages.
International Search Report of PCT Application No. PCT/US2009/056651, dated Apr. 21, 2010, pp. 1-3.
International Search Report of PCT Application No. PCT/US2009/056668 dated Apr. 16, 2010, pp. 1-9.
International Search Report of PCT Application No. PCT/US2009/056668, dated Apr. 16, 2010, 9 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/US2009/065019 dated Jun. 4, 2010, pp. 1-6.
International Search Report of PCT Application No. PCT/US2009/065019, dated Jun. 4, 2010, 6 pages.
International Search Report of PCT Application No. PCT/US2010/043345, dated Apr. 28, 2011, 3 pages.
International Search Report PCT/US2010/043345 dated Apr. 28, 2011, 3 pages.
Jamison, Scott. Essential SharePoint 2010: Overview, Governance, and Planning. Addison-Wesley Professional; 1 edition (Aug. 22, 2010).
Lightfoot, Johnathan and Beckett, Chris. Plain & Simple Microsoft® SharePoint® 2010. O'Reilly Media, Inc. Copyright © 2010.
Londer, Olga and Coventry, Penelope. Step by Step Microsoft® SharePoint® Foundation 2010. Microsoft Press. ISBN: 978-0-7356-2726-0. Copyright © 2011.
M. Eric Johnson et al., The Evolution of the Peer-to-Peer File Sharing Industry and the Security Risks for Users, Jan. 7-10, 2008, IEEE, pp. 1-10.
Mango, “Robust Perceptual Image Hashing Using Feature Points,” http://bluecoat-02/?cfru=aHR0cDovL3NpZ25hbC51Y2UudXRIeGFzLmVkdS9+dmlzaGFs- L2hhc2gtcGFydEkucHM=, 2003.
Mango, et al., “Perceptual Image Hashing via Feature Points: Performance Evaluation and Tradeoffs,” IEEE Transactions on Image Processing, vol. 15, No. 11, Nov. 2006.
Mango, Robust Perceptual Image Hashing Using Feature Points, http://bluecoat-02/?cfru=aHR0cDovL3NpZ25hbC5IY2UudXRIeGFzLmVkdS9+dmizaGFs- L2hhc2gtcGFydEkucHM=, 2003.
Microsoft SharePoint 2010 SDK: Building Block: Files and Documents, msn.microsoft.com (Nov. 1, 2010), https://msdn.microsoft.com/en-us/library/office/ee538269(v=office.14).aspx, (last visited Feb. 27, 2017).
Microsoft SharePoint 2010 SDK: How to: Upload a File to a SharePoint Site from a Local Folders, msn.microsoft.com (Jul. 7, 2010), https://msdn.microsoft.com/en-us/library/office/ms454491(v=office.14).aspx, (last visited Feb. 27, 2017).
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).
Microsoft, “Microsoft XP, Product Guide”, pp. 1-26, 2001.
Microsoft, “Microsoft XP, Product Guide”, pp. 1-26.
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.
Karnouskos 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.
Monga, “Robust Perceptual Image Hashing Using Feature Points,” http://bluecoat-02/?cfru=aHR0cDovL3NpZ25hbC51Y2UudXRIeGFzLmVkdS9+dmlzaGFs- L2hhc2gtcGFydEkucHM=, 2003.
Monga, “Robust Perceptual Image Hashing Using Feature Points,” http://bluecoat-02/?cfru=aHROcDovL3NpZ25hbC51Y2UudXRIeGFzLmVkdS9+dmlzaGFs- L2hhc2gtcGFydEkucHM=, 2003.
Monga, et al., “Perceptual Image Hashing via Feature Points: Performance Evaluation and Tradeoffs,” IEEE Tranactions on Image Processing, vol. 15, No. 11, Nov. 2006.
Monga, et al., “Perceptual Image Hashing via Feature Points: Performance Evaluation and Tradeoffs,” IEEE Transactions on Image Processing, vol. 15, No. 11, Nov. 2006.
Monga, V. et al., Perceptual image hashing via feature points: performance evaluation and tradeoffs IEEE Transactions on Image Processing, 15 (11) (2006), pp. 3453-3466.
Nathaniel S. Good et al., Usability and privacy: a study of KaZaA P2P file-sharing, Apr. 5-10, 2003, ACM, vol. No. 5, Issue No. 1, pp. 137-144.
Non-Final Office Action 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 by More, S., filed Oct. 24, 2012.
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 Apr. 27, 2012 in Co-Pending U.S. Appl. No. 12/275,185, 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. 16, 2006 for U.S. Appl. No. 10/023,010, filed Dec. 17, 2001, now U.S. Pat. No. 7,496,841.
Non-Final Office Action dated Mar. 16, 2006 in Co-Pending U.S. Appl. No. 10/023,010, filed Dec. 17, 2001, now U.S. Pat. No. 7,496,841.
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. 18, 2013 in Co-Pending U.S. Appl. No. 13/659,793 of 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 Mar. 20, 2006 in 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 May 7, 2008 in Co-pending U.S. Appl. No. 10/023,010, filed Dec. 17, 2001.
Non-Final Office Action dated May 7, 2008 in Co-Pending U.S. Appl. No. 10/023,010, filed Dec. 17, 2001, now U.S. Pat. No. 7,496,841.
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, 2011 in Co-Pending 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.
Workshare Ltd. Workshare Protect 4.5 Admin Guide, (c) 2006.
Classification Definitions Class 715, Data Processing: Presentation Processing of Document, Operator Interface Processing, and Screen Saver Display Processing; Feb. 2011; pp. 1-33.
Related Publications (1)
Number Date Country
20170200123 A1 Jul 2017 US
Provisional Applications (1)
Number Date Country
61496904 Jun 2011 US
Continuations (1)
Number Date Country
Parent 13160772 Jun 2011 US
Child 15437531 US