This invention provides a mechanism whereby a group of people operating individual computer devices can view and approve an electronic document.
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.
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
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 document then contains metadata that indicates the type of document that it is as well as 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) a 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
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 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. 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 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 fail 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.
This application claims priority as a non-provisional continuation of U.S. Patent Application No. 61/496,904 filed on Jun. 14, 2011.
Number | Name | Date | Kind |
---|---|---|---|
4479195 | Herr et al. | Oct 1984 | A |
4853961 | Pastor | Aug 1989 | 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 |
5315504 | Lemble | May 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 |
5673316 | Auerbach et al. | Sep 1997 | A |
5699427 | Chow et al. | Dec 1997 | A |
5745879 | Wyman | Apr 1998 | A |
5751814 | Kafri | May 1998 | A |
RE35861 | Queen | Jul 1998 | E |
5787175 | Carter | 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 |
5850219 | Kumomura | Dec 1998 | A |
5874953 | Webster et al. | Feb 1999 | A |
5890176 | Kish et al. | Mar 1999 | A |
5890177 | Moody et al. | Mar 1999 | A |
5898836 | Frievald et al. | Apr 1999 | A |
6003060 | Aznar et al. | Dec 1999 | A |
6009173 | Sumner | Dec 1999 | A |
6012087 | Frievald et al. | Jan 2000 | A |
6049804 | Burgess et al. | Apr 2000 | A |
6067551 | Brown et al. | May 2000 | A |
6088702 | Plantz et al. | Jul 2000 | A |
6145084 | Zuili et al. | Nov 2000 | A |
6169976 | Colosso | Jan 2001 | B1 |
6189019 | Blumer et al. | Feb 2001 | B1 |
6189146 | Misra et al. | Feb 2001 | B1 |
6212534 | Lo et al. | Apr 2001 | B1 |
6216112 | Fuller et al. | Apr 2001 | B1 |
6219652 | Carter et al. | Apr 2001 | B1 |
6219818 | Frievald 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 |
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 |
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 |
6918082 | Gross | Jul 2005 | B1 |
7035427 | Rhoads | Apr 2006 | B2 |
7107518 | Ramaley et al. | Sep 2006 | B2 |
7113615 | Rhoads et al. | Sep 2006 | B2 |
7152019 | Tarantola et al. | Dec 2006 | B2 |
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 |
7353455 | Malik | Apr 2008 | B2 |
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 |
7613770 | Li | Nov 2009 | B2 |
7624447 | Horowitz et al. | Nov 2009 | B1 |
7627613 | Dulitz et al. | Dec 2009 | B1 |
7673324 | Tirosh et al. | Mar 2010 | B2 |
7680785 | Najork | Mar 2010 | B2 |
7694336 | Rinkevich et al. | Apr 2010 | B2 |
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 |
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 |
7895276 | Massand | 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 |
8060575 | Massand | Nov 2011 | B2 |
8117225 | Zilka | Feb 2012 | B1 |
8140513 | Ghods | Mar 2012 | B2 |
8181036 | Nachenberg | May 2012 | B1 |
8196030 | Wang et al. | Jun 2012 | B1 |
8201254 | Wilhelm et al. | Jun 2012 | B1 |
8233723 | Sundaresan | Jul 2012 | B2 |
8286085 | Denise | Oct 2012 | B1 |
8286171 | More et al. | Oct 2012 | B2 |
8316237 | Felsher et al. | Nov 2012 | B1 |
8326814 | Ghods | Dec 2012 | B2 |
8381104 | Massand | Feb 2013 | B2 |
8406456 | More | Mar 2013 | B2 |
8471781 | Massand | Jun 2013 | B2 |
8473847 | Glover | Jun 2013 | B2 |
8478995 | Alculumbre | Jul 2013 | B2 |
8555080 | More et al. | Oct 2013 | B2 |
8620020 | More | Dec 2013 | B2 |
8635295 | Mulder | Jan 2014 | B2 |
8670600 | More | Mar 2014 | B2 |
8839100 | Orofino, II | Sep 2014 | B1 |
8977697 | Massand | Mar 2015 | B2 |
20010042073 | Saether et al. | Nov 2001 | A1 |
20020010682 | Johnson | Jan 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 | 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 |
20030037010 | Schmelzer | Feb 2003 | A1 |
20030046572 | Newman et al. | Mar 2003 | A1 |
20030046639 | Fai et al. | Mar 2003 | A1 |
20030061260 | Rajkumar | Mar 2003 | A1 |
20030090513 | Ramakrishnan | May 2003 | A1 |
20030097454 | Yamakawa et al. | May 2003 | A1 |
20030112273 | Hadfield et al. | Jun 2003 | A1 |
20030115273 | Delia et al. | Jun 2003 | A1 |
20030121008 | Tischer | Jun 2003 | A1 |
20030131005 | Berry | Jul 2003 | A1 |
20030147267 | Huttunen | Aug 2003 | A1 |
20030158839 | Faybishenko | 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 |
20040186851 | Jhingan et al. | Sep 2004 | A1 |
20040187076 | Ki | Sep 2004 | A1 |
20040261016 | Glass et al. | Dec 2004 | A1 |
20050021637 | Cox | Jan 2005 | A1 |
20050027704 | Hammond et al. | Feb 2005 | A1 |
20050055306 | Miller | Mar 2005 | A1 |
20050071755 | Harrington et al. | Mar 2005 | A1 |
20050086525 | Cirulli et al. | Apr 2005 | A1 |
20050138540 | Baltus et al. | Jun 2005 | A1 |
20050251748 | Gusmorino et al. | Nov 2005 | A1 |
20060005247 | Zhang et al. | Jan 2006 | A1 |
20060013393 | Ferchichi et al. | Jan 2006 | A1 |
20060020520 | Lange et al. | Jan 2006 | A1 |
20060021031 | Leahy et al. | Jan 2006 | A1 |
20060059196 | Sato et al. | Mar 2006 | A1 |
20060064717 | Shibata et al. | Mar 2006 | A1 |
20060067578 | Fuse | Mar 2006 | A1 |
20060069605 | Hatoun | Mar 2006 | A1 |
20060069740 | Ando | Mar 2006 | A1 |
20060112120 | Rohall | May 2006 | A1 |
20060129592 | Poozhiyil et al. | Jun 2006 | A1 |
20060129627 | Phillips | Jun 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 |
20060259524 | Horton | Nov 2006 | A1 |
20060259949 | Schaefer et al. | Nov 2006 | A1 |
20060261112 | Gates et al. | Nov 2006 | A1 |
20060271947 | Lienhart et al. | Nov 2006 | A1 |
20060272024 | Huang et al. | Nov 2006 | A1 |
20060294468 | Sareen et al. | Dec 2006 | A1 |
20060294469 | Sareen et al. | Dec 2006 | A1 |
20070005589 | Gollapudi | Jan 2007 | A1 |
20070011211 | Reeves | Jan 2007 | A1 |
20070025265 | Porras et al. | Feb 2007 | A1 |
20070027830 | Simons et al. | Feb 2007 | A1 |
20070100991 | Daniels et al. | May 2007 | A1 |
20070112854 | Franca | May 2007 | A1 |
20070112930 | Foo et al. | May 2007 | A1 |
20070118598 | Bedi et al. | May 2007 | A1 |
20070141641 | Fang | Jun 2007 | A1 |
20070156785 | Hines et al. | Jul 2007 | A1 |
20070179967 | Zhang | Aug 2007 | A1 |
20070192728 | Finley et al. | Aug 2007 | A1 |
20070220068 | Thompson et al. | Sep 2007 | A1 |
20070261112 | Todd et al. | Nov 2007 | A1 |
20070294318 | Arora et al. | Dec 2007 | A1 |
20070294612 | Drucker et al. | Dec 2007 | A1 |
20080028017 | Garbow et al. | Jan 2008 | A1 |
20080033913 | Winburn | Feb 2008 | A1 |
20080040388 | Petri et al. | Feb 2008 | A1 |
20080046518 | Tonnison et al. | Feb 2008 | A1 |
20080080515 | Tombroff | Apr 2008 | A1 |
20080082529 | Mantena et al. | Apr 2008 | A1 |
20080082930 | Omernick et al. | Apr 2008 | A1 |
20080094370 | Ording et al. | Apr 2008 | A1 |
20080177782 | Poston et al. | Jul 2008 | A1 |
20080178076 | Kritt et al. | Jul 2008 | A1 |
20080209001 | Boyle | Aug 2008 | A1 |
20080219495 | Hulten et al. | Sep 2008 | A1 |
20080235760 | Broussard et al. | Sep 2008 | A1 |
20080263363 | Jueneman et al. | Oct 2008 | A1 |
20080306894 | Rajkumar | Dec 2008 | A1 |
20080310624 | Celikkan | Dec 2008 | A1 |
20080320316 | Waldspurger | Dec 2008 | A1 |
20090019051 | Winburn | Jan 2009 | A1 |
20090030997 | Malik | Jan 2009 | A1 |
20090034804 | Cho et al. | Feb 2009 | A1 |
20090037520 | Loffredo | Feb 2009 | A1 |
20090052778 | Edgecomb et al. | Feb 2009 | A1 |
20090064326 | Goldstein | Mar 2009 | A1 |
20090070128 | McCauley et al. | Mar 2009 | A1 |
20090083384 | Bhogal et al. | Mar 2009 | A1 |
20090094530 | Champlain et al. | Apr 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 |
20090216843 | Willner et al. | Aug 2009 | A1 |
20090222450 | Zigelman | Sep 2009 | A1 |
20090234863 | Evans | Sep 2009 | A1 |
20090235706 | Broussard et al. | Sep 2009 | A1 |
20090241187 | Troyansky | Sep 2009 | A1 |
20090271620 | Sudhakar | Oct 2009 | A1 |
20100011077 | Shkolnikov et al. | Jan 2010 | A1 |
20100011428 | Atwood et al. | Jan 2010 | A1 |
20100017404 | Banerjee et al. | Jan 2010 | A1 |
20100017478 | Mejia et al. | Jan 2010 | A1 |
20100049807 | Thompson | Feb 2010 | A1 |
20100064004 | Ravi et al. | Mar 2010 | A1 |
20100064372 | More | Mar 2010 | A1 |
20100070448 | Omoigui | Mar 2010 | A1 |
20100076985 | Egnor | Mar 2010 | A1 |
20100114985 | Chaudhary et al. | May 2010 | A1 |
20100114991 | Chaudhary et al. | May 2010 | A1 |
20100124354 | More | May 2010 | A1 |
20100146382 | Abe et al. | Jun 2010 | A1 |
20100174761 | Longobardi et al. | Jul 2010 | A1 |
20100217987 | Shevade | Aug 2010 | A1 |
20100251104 | Massand | Sep 2010 | A1 |
20100257352 | Errico | Oct 2010 | A1 |
20100287246 | Klos et al. | Nov 2010 | A1 |
20100299727 | More et al. | Nov 2010 | A1 |
20100332428 | McHenry et al. | Dec 2010 | A1 |
20100332682 | Sharp et al. | Dec 2010 | A1 |
20110029625 | Cheng et al. | Feb 2011 | A1 |
20110107106 | Morii et al. | May 2011 | A1 |
20110141521 | Qiao | Jun 2011 | A1 |
20110145229 | Vailaya et al. | Jun 2011 | A1 |
20110154180 | Evanitsky et al. | Jun 2011 | A1 |
20110276658 | Massand | Nov 2011 | A1 |
20110283177 | Gates et al. | Nov 2011 | A1 |
20120011361 | Guerrero et al. | Jan 2012 | A1 |
20120016867 | Clemm et al. | Jan 2012 | A1 |
20120079267 | Lee | Mar 2012 | A1 |
20120110092 | Keohane et al. | May 2012 | A1 |
20120131635 | Huapaya | May 2012 | A1 |
20120133989 | Glover | May 2012 | A1 |
20120136951 | Mulder | May 2012 | A1 |
20120136952 | Mulder | May 2012 | A1 |
20120173881 | Trotter | Jul 2012 | A1 |
20120260188 | Park | Oct 2012 | A1 |
20120265817 | Vidalenc et al. | Oct 2012 | A1 |
20120317414 | Glover | Dec 2012 | A1 |
20120317479 | Safa | Dec 2012 | A1 |
20130074195 | Johnston et al. | Mar 2013 | A1 |
20130074198 | More | Mar 2013 | A1 |
20130097421 | Lim | Apr 2013 | A1 |
20130246901 | Massand | Sep 2013 | A1 |
20130254536 | Glover | Sep 2013 | A1 |
20130290867 | Massand | Oct 2013 | A1 |
20140115066 | Massand | Apr 2014 | A1 |
20140115436 | Beaver et al. | Apr 2014 | A1 |
20140279843 | Von Weihe | Sep 2014 | A1 |
20140281872 | Glover | Sep 2014 | A1 |
20150033283 | Mulder | Jan 2015 | A1 |
Number | Date | Country |
---|---|---|
10177650 | Jun 1998 | JP |
2004265267 | Sep 2004 | JP |
2007299364 | Nov 2007 | JP |
1020010078840 | Aug 2001 | KR |
1020040047413 | Jun 2004 | KR |
1020060048686 | May 2006 | KR |
1020070049518 | May 2007 | KR |
1020080029602 | Apr 2008 | KR |
0060504 | Oct 2000 | WO |
0152473 | Jul 2001 | WO |
02101577 | Dec 2002 | WO |
Entry |
---|
Prinz, Wolfgang, and Sabine Kolvenbach. “Support for workflows in a ministerial environment.” Computer Supported Cooperative Work: Proceedings of the 1996 ACM conference on Computer supported cooperative work. vol. 16. No. 20. 1996; pp. 2-4, 8. |
Howard, Pamela O. Prototype Message Dissemination System and Document Routing System for an Army Organization. Arizona Univ Tucson, 1990; pp. 7-9. |
Cox et al; Microsoft Office Word 2007 Step by Step; Jan. 17, 2007; Microsoft Press; pp. 283-293. |
Non-Final Office Action mailed Dec. 6, 2012 in co-pending U.S. Appl. No. 13/306,798, filed Nov. 29, 2011. |
Restriction Requirement Jun. 30, 2006 for U.S. Appl. No. 10/136,733, filed Apr. 30, 2002. |
Stephen Voida et al., Share and Share Alike: Exploring the User Interface Affordances of File Sharing, Apr. 22-27, 2006, ACM, pp. 1-10. |
Dominik Grolmund et al., Cryptree: A Folder Tree Structure for Cryptographic File Systems, Oct. 2-4, 2006, IEEE, pp. 189-198. |
Nathanial 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. |
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. |
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. |
PC Magazine “Pure Intranets: Real-Time Internet Collboration”, http://www.zdnet.com/pcmag/featuresgroupware/gpwst.htm, Aug. 30, 2001, 2 pages. |
Wells et al., “Groupware & Collaboration Support”, www.objs.com/survey/groupwar.htm, Aug. 30, 2001, 10 pages. |
Tsai, et al., “A Document Workspace for Collaboration and Annotation based on XML Technology”, IEEE, 2000, pp. 165-172. |
Roussev, et al., “Integrating XML and Object-based Programming for Distributed Collaboration”, IEEE, 2000, pp. 254-259. |
XP-002257904, “Workshare Debuts Synergy”, 2003, 3 pages. |
Microsoft, “Microsoft XP, Product Guide”, Aug. 24, 2001, pp. 1-26, Microsoft. |
Monga, et al., “Perceptual Image Hashing via Feature Points: Performance Evaluation and Tradeoffs,” IEEE Transactions on Image Processing, vol. 15, No. 11, Nov. 2006, pp. 3453-3466. |
Monga, “Robust Perceptual Image Hashing Using Feature Points,” http://bluecoat-o2/?cfru=aHR0cDovL3NpZ25hbC51Y2UudXrleGFzLmVkdS9+dmIzaGFsL2hhc2gtcGFydEkucHM=, 2003. |
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. |
Xuefeng Liang; et al., “Fingerprint Matching Using Minutia Polygons,” Pattern Recognition, 2006, ICPR 2006, 18th International Conference on, vol. 1, No., pp. 1046-1049. |
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. |
Yung, et al., “Generating Robust Digital Signature for Image/Video Authentication,” Multimedia and Security Workshop at ACM Multimedia '98, Bristol, U.K., Sep. 1998. |
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/065019 dated Jun. 4, 2010, pp. 1-6. |
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/051313, Mar. 3, 2010, 3 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, Apr. 28, 2011, 3 pages. |
International Search Report of PCT Application No. PCT/IB2002/005821, Jan. 3, 2004, 6 pages. |
Written Opinion PCT Application No. PCT/US2009/056651, Dated Apr. 21, 2010, pp. 1-5. |
Written Opinion PCT Application No. PCT/US2009/065019 dated Jun. 4, 2010, pp. 1-5. |
Written Opinion PCT Application No. PCT/US2009/056668 dated Apr. 16, 2010, pp. 1-4. |
Written Opinion of PCT Application No. PCT/US2009/051313, Mar. 3, 2010, 4 pages. |
Written Opinion PCT Application No. PCT/US2009/064919 dated Jul. 1, 2010, pp. 1-4. |
Written Opinion PCT Application No. PCT/US2010/043345 dated Apr. 28, 2011, 4 pages. |
Advisory Action mailed Apr. 12, 2013, in Co-Pending U.S. Appl. No. 12/621,429 by More, S., filed Nov. 18, 2009. |
Advisory Action Mailed Nov. 1, 2013, in Co-Pending U.S. Appl. No. 13/659,793 by More, S., filed Oct. 24, 2012. |
Restriction Requirement Mailed Feb. 14, 2005 for U.S. Appl. No. 10/023,010, filed Dec. 17, 2001, Issued U.S. Pat. No. 7,496,841. |
Non-Final Office Action Mailed Jan. 9, 2012 in Co-Pending U.S. Appl. No. 12/177,043, filed Jul. 21, 2008. |
Non-Final Office Action Mailed Mar. 11, 2011, in Co-pending U.S. Appl. No. 12/209,096, filed Sep. 11, 2008. |
Restriction Requirement Mailed Feb. 5, 2008 for U.S. Appl. No. 10/023,010, filed Dec. 17, 2001, Issued U.S. Pat. No. 7,496,841. |
Notice of Allowance Mailed 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 Mailed Oct. 24, 2008 in Co-pending U.S. Appl. No. 10/023,010, filed Dec. 17, 2001. |
Notice of Allowance Mailed Oct. 2, 2012 in Co-Pending U.S. Appl. No. 12/275,185 by More, S., filed Nov. 20, 2008. |
Notice of Allowance Mailed Mar. 13, 2013 in Co-Pending U.S. Appl. No. 12/844,818 by Glover, R., filed Jul. 27, 2010. |
Notice of Allowance Mailed Aug. 19, 2012 in Co-Pending U.S. Appl. No. 12/177,043, filed Jul. 21, 2008. |
Notice of Allowance Mailed Jun. 26, 2012 in Co-Pending U.S. Appl. No. 12/275,185, filed Nov. 20, 2008. |
Notice of Allowance Mailed Sep. 25, 2013 in Co-Pending U.S. Appl. No. 13/659,817 by More, S., filed Oct. 24, 2012. |
Non-Final Office Action mailed 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 Mailed Sep. 19, 2011 for U.S. Appl. No. 12/177,043, filed Jul. 21, 2008. |
Final Office Action mailed Aug. 16, 2013 in co-pending U.S. Appl. No. 13/306,798 of Glover, R.W., filed Nov. 29, 2011. |
Non-Final Office Action mailed May 17, 2013 in co-pending U.S. Appl. 13/306,765 by Mulder, S.P.M., filed Nov. 29, 2011. |
Final Office Action Mailed Feb. 1, 2013 in Co-Pending U.S. Appl. No. 12/621,429 by More, S., filed Nov. 18, 2009. |
Final Office Action Mailed May 10, 2012 in Co-Pending U.S. Appl. No. 12/209,082, filed Sep. 11, 2008. |
Final Office Action Mailed Apr. 16, 2012 in Co-Pending U.S. Appl. No. 12/177,043, filed Jul. 21, 2008. |
Final Office Action mailed Aug. 12, 2011 for U.S. Appl. No. 12/209,096, filed Sep. 11, 2008. |
Final Office Action Mailed Apr. 17, 2007 for U.S. Appl. No. 10/023,010, filed Dec. 17, 2001, Issued U.S. Pat. No. 7,496,841. |
Non-Final Office Action Mailed May 7, 2008 in Co-Pending U.S. Appl. No. 10/023,010, filed Dec. 17, 2001, Issued Patent No. 7,496,841. |
Non-Final Office Action Mailed Apr. 26, 2013 in Co-Pending U.S. Appl. No. 13/659,817 by More, S., filed Oct. 24, 2012. |
Non-Final Office Action Mailed Sep. 19, 2012 in Co-Pending U.S. Appl. No. 12/844,818 by Glover, R., filed Jul. 27, 2010. |
Non-Final Office Action Mailed Apr. 27, 2012 in Co-Pending U.S. Appl. No. 12/275,185, filed Nov. 20, 2008. |
Non-Final Office Action Mailed Mar. 18, 2013 in Co-Pending U.S. Appl. No. 13/659,793 by More, S., filed Oct. 24, 2012. |
Non-Final Office Action Mailed Mar. 20, 2006 in Co-pending U.S. Appl. No. 10/136,733, filed Apr. 30, 2002. |
Non-Final Office Action Mailed Mar. 16, 2006 for U.S. Appl. No. 10/023,010, filed Dec. 17, 2001, Issued U.S. Pat. No. 7,496,841. |
Final Office Action Mailed Oct. 21, 2013, in Co-Pending U.S. Appl. No. 13/659,793 by More, S., filed Oct. 24, 2012. |
Final Office Action Mailed Jan. 18, 2013 in Co-Pending U.S. Appl. No. 12/844,818 by Glover, R., filed Jul. 27, 2010. |
Non-final office action issued for U.S. Appl. No. 13/799,067 on Oct. 30, 2014. |
Non-Final Office Action Mailed Aug. 1, 2012 in Co-Pending U.S. Appl. No. 12/621,429, filed Nov. 18, 2009. |
Non-Final Office Action Mailed Dec. 22, 2011 in Co-Pending U.S. Appl. No. 12/209,082, filed Sep. 11, 2008. |
Number | Date | Country | |
---|---|---|---|
20120324369 A1 | Dec 2012 | US |
Number | Date | Country | |
---|---|---|---|
61496904 | Jun 2011 | US |