This invention provides a mechanism whereby a group of people operating individual computer devices can view and share and collaboratively edit an electronic document stored in a remote data repository.
Electronic documents, for example text documents, are now often stored in a remote data repository, sometimes referred to as an Entity Content Management system (ECM) or Document Management System. This type of system has one or more servers acting as storage locations for the document. The document is accessed by users operating their own computing devices. In order to facilitate collaborative editing of the remotely stored document, security protocols and data integrity protocols are instituted. This can be established by providing a collaborative environment that interfaces with the data repository. The ECM can be hosted internally in the corporation infrastructure and thereby locked down. In order to encourage electronic collaboration on editing or modifying documents it is useful to permit people to access the ECM from mobile devices but not going through the corporate VPN. Directly connecting mobile or other remote devices to the ECM requires permitting these devices access through the corporate data security wall. This is potentially dangerous from a data security standpoint. Therefore, there is a need for a collaborative environment that is hosted separately from the ECM for documents that are being collaboratively worked to be stored. This environment establishes a trusted connection with the ECM so that documents can be checked in and out of the ECM, but only by the trusted environment and not directly by any remote mobile or other device. The trusted collaboration server permits the ECM to remain behind a network security wall.
The method and system operates on one or more computers, typically using one or more servers and one or more remote user's computing devices. (1601) A customer's device can be a personal computer, mobile phone, mobile handheld device like a Blackberry™ or iPhone™ or a tablet device like the iPad™ or Galaxy™ or any other kind of computing device a user can use to view and edit an electronic document. The user devices are operatively connected to the remote server using a data network. The invention does not require that the data network be in continuous contact with the remote file server. The invention works in combination with document collaborative editing system (CES) and document management systems, sometimes referred to as Entity Content Management (ECM). An example of ECM discussed here, without limiting the invention to that embodiment, is Sharepoint™. The system can be embodied in a client/server architecture, whereby an executable code operates on the user's remote device and interacts with processes operating on the CES. In other embodiments, the same system can be running on the user's remote device by means of scripts or apps that are downloaded and executed within an Internet web-browser.
The user's remote computer is operatively connected to a data communication network, typically the Internet. (1602). This may be directly or indirectly through another network, for example a telephone network or a private data network. The user operates a client software on their computing device that communicates with the CES. (1603). In one embodiment, the client communicates directly with the CES and the CES interacts with the ECM to request documents. (1604). In this embodiment, the client displays on its video output a user interface window to the user, that shows two regions, one listing documents available on the ECM and the other showing documents available on the CES. See
When the client requests the list of documents available on the CES, the request is received and processed on the CES. That data is presented in the user interface in the region associated with the CES. (601) In the default mode, the CES will present a list of documents from a folder associated with that user on the CES platform. (602) In the default mode, the CES will cause the ECM to deliver a list of documents from the root folder configured by the user as the default folder on the ECM. The list of documents can also include as an item a reference to another folder. (101). This folder may be selected in order to view the contents of that folder. (201). The list can also be presented as a chronological list of incoming data messages regarding particular documents. (102). In all of these cases, the CES system is receiving commands from the client operating on the user's computer and brokering the requests out to the ECM. The responses from the ECM are then formatted and transmitted back to the user's computer for display. In one embodiment, each user of the CES has a directory or folder on the CES dedicated to the user and associated with their remote device. Using this architecture, the user that is checking out a document from the ECM has the document stored in their directory on the CES for access only by them from their remote device.
In some case, the CES may be subject to a large amount of document request traffic when a large number of users are requesting documents. In this case, the CES's connection with the ECM may become taxed and the system will slow down. To alleviate this, another embodiment may be used. In this embodiment, the CES maintains a copy of the most recently used documents. In this embodiment, when a user requests a document, the system operates under the assumption that another user will soon request the same document. When that second user does request the same document, the CES transmits it from its local store of documents rather than making two requests to the ECM. In the meantime, the CES can transmit to the ECM a data message that flags the document as having been change, thus establishing that the ECM does not have the latest version of the document. Alternatively, the CES can transmit to the ECM the latest version of the document, but it only has to do that when such a later version is created. In yet another embodiment, the local storage system on the CES can rely on heuristics to pre-fetch documents from the ECM. For example, the CES can use metadata associated with a requested document to determine that it is associated with several other documents. In that case, the CES can proactively request the other documents so that they are on the CES if the user requests them. Security or permission for access can be managed by the CES. For example, if a user requests a document that is not on the CES, then the CES formulates a full request to the ECM, which checks that user's permission to access the document. If the local storage system requests the document, it will do so in the name of the user and thereby populate the local storage system on the CES with documents with a permission value associated with the user. In yet another embodiment, the heuristic may also include checking on a user's document request habits to determine which additional documents may be requested. Another example of a heuristic is to pre-load all of the recently used documents modified or read by the same user. Alternatively, all documents in a project that the user's selected document is a part of A project can have a permission list which lists which usernames may access the documents associated with the project. Alternative lists include a list of recipients of any document associated with the project.
In this embodiment, the system is adapted to:
Receive a request for a document from a first user's computer.
Retrieve the requested document from the ECM.
Store a local copy in a local store on the CES.
Receive a request for the same document from a different user's computer.
Authenticate the different user,
Deliver the local stored copy to the different user's computer.
The system can be enhanced by also having the retrieving the additional relevant documents to be locally stored. The system would then be further adapted to:
Determine the identity of at least one relevant document, based on either the identity of the requesting user, that user's use history, the relationship between the requested document and other documents or some other heuristic.
Retrieve the at least one relevant documents,
Store the at least one relevant documents in the local store.
The collaborative editing functionality can be applied to a document hosted on the ECM by checking out the document into the CES. On the user interface of the remote device, the user can select a document that is represented by an entry on the portion of the user interface devoted to the ECM documents. The user can, by gesture, drag that document to the other region that is devoted to the CES. (601) This causes commands to be transmitted to the CES (1603) in order to cause it to request the document itself from the ECM (1604). In one embodiment, the command is comprised of name of the requested document and the destination region in the user's CES folder hierarchy that has been selected. The CES then receives the document, stores the document in the folder associated with the user, and then updates the content list for the CES. See
Remote devices receive the latest changes of the documents that have been distributed to them, but the CES system holds all historic versions of the document. The CES system periodically polls or otherwise determines that the user's remote device does not have the document and it will then transmit the document to the device. The commands between the remote device and the CES and ECM is not folder to folder or directory to directory. Rather, its process to process, where the processes are moving files and metadata associated with the files and processes are using the metadata to route the files internally. The system executing the process can exist on either the ECM or CES platform, that is the ECM platform can receive commands from the CES and transmit to the remote device directly, or transmit to the CES. If running on the CES platform, then the ECM may need a secure VPN connection to the CES environment. (1605).
When the CES system is operated so as to edit or otherwise change the stored document, a change flag data value associated with the document is changed. This data value is stored on the CES as part of the metadata of the document. As a result, periodically the CES can copy changed documents from their stored location on the CES back up to their original locations in the ECM, including the relevant updated metadata.
In yet another embodiment, the ECM logs into the CES, a time check is used to see if the files resident on the user's remote device, which have been synchronized to the CES, have been superseded by newer versions. If so, these newer versions are transmitted to the ECM. In another embodiment, the versioning check can be done periodically or as a result of a triggered event.
Triggers include:
1. checking the date and time stamp on the CES version of a document and if newer than on the ECM version, loading into the ECM.
2. Any new document.
3. A command from a central authorized party to collect the latest revisions.
The system can also process the documents being loaded into the ECM, for example:
1. a heuristic checks the document content and determines how to label it and checks its metadata in order to enter into the ECM within the ECM document organization. That is, its position in the ECM hierarchy is selected and stored in the ECM hierarchy based on what is in the metadata.
2. Reviewing the authors of the document to determine where to place it in the ECM.
3. Review of the document content to determine where to place it in the ECM, including using phrase matching search of the ECM to find similar or related documents.
The process can create a list of the files to be moved or it can set flags in the metadata of the files and the ECM process will go through the user's files that are flagged and cause the CES system to transmit them to the remote device or to the CES system. (102), (201). The remote device can request from the CES a data item that represents a tree diagram showing lineage of historical changes to or versions of the document. The user interface of the device can present this tree and then permit the user to select a node in the tree, representing a particular version of the document to be viewed or further edited. In another embodiment, a user with appropriate authority can specify that a particular node in the tree become the primary or current version of the document.
In some cases, a document may be checked out from the ECM and CES by two different users. In this case, the system can prevent version conflicts quite easily. One of the two users will be the first to check their version of the document back into the CES system, which will then pass it on to the ECM. In the meantime, the CES, which tracks the identity of the second user, will generate a data message representing an alert that the version of the document that the second user is using is now out of date. In this case, the second user can cause the second version of the document to be transmitted to the CES, which can then combine it with the checked in first version in order to present to the second user a markup showing what changes to the document were made by the first user while the second user had checked out the document.
The heuristic selection of documents to maintain in the local CES storage can be accomplished with one or more approaches, search, metadata, tracking, activity tracking and user behavior. These can be combined. The search technique would firstly identify the most recently accessed documents and then based on the documents that have been identified, it can use the metadata associated with those documents to find related documents or documents with similar metadata. The metadata approach exploits the fact that documents can have custom properties or other types of metadata associated with them which can be used to infer or determine related documents and those related documents can be added to the suggested documents list. In addition, documents can be tracked. For example, a document could have a unique signature embedded in the document or the signature or fingerprint could be created based on the content of the document. The reason for tracking the document would be to uniquely identify the document and associate an activity such as emailing a document or sending the document electronically to another person or interactive workflow. This will allow the system to identify if the document the user is looking for is located in a repository or awaiting another user or systems feedback. That way they can be assured that they are working on the latest or correct version of the document. The activity technique involves using a list of documents which the user most recently viewed, edited or made comments. The comments could be made in an email or any system that allowed the user to provide comments relating to a particular document or contents of that document. Furthermore it can apply weighting to depending on what action was applied to the document to the document. Actions applied to that document would include submitting a document to a workflow or process for review, viewing the document, editing the document or making comments. If there is more activity around the document it would allow the document to bubble up the suggested document list, so that older content can appear at the bottom and eventually disappear off the suggested document list. (102). Use of user behavior involves monitoring how a user works. If a user performs an activity on document A and then following that activity the user performs another activity on documents B and C, that information can be used in future to identify that documents A, B and C are related in some way. As a result of the inferred relationship between the documents they can also be listed in the suggested documents list. Based on the users behavior the system can identify common or related metadata and use that information to refine the list of documents generated.
An important aspect of the system is to maintain security over the ECM. The transport channels between the CES and the remote device are typically using encrypted, secure data channels, for example SSL. In one embodiment, each command submitted by the CES to the ECM is accompanied with authentication information. This can include a unique identifier that is only known to the CES and ECM, for example a login identifier and password. In another embodiment, the ECM is operating internally to a corporation's infrastructure. In that case, a network firewall (1605) between the CES and the ECM can be programmed to establish a secure connection between the CES and ECM. Each data packet traveling between the CES and ECM can be encrypted so that a man-in-the-middle attack, whereby the data is intercepted en-route, cannot compromise the integrity of the data. In this embodiment, the user logs into the CES system from their remote location and establishes a secure connection with the ECM. In yet another embodiment, the CES can transmit a message containing authentication details that includes the commands to transmit the files to particular locations in the CES. In this embodiment, the ECM system will log into the CES system using the authentication data and execute the transfer.
In yet another embodiment, the CES can create a digital data item called a token, which is essentially a string of alphanumerical characters that can be embodied in a small data file and transmitted as part of a data message. Tokens can be revoked or disabled by the CES. Tokens can be revoked or disabled on a regular basis. The CES can transmit the token to a user's mobile device. When a data message is received from the user's mobile device, (1701) for example, a request for a document, the message also carries the token. The CES can check that the received token matches up with the one that was transmitted to the user. (1702). To insure integrity of this approach, the client program operating on the user's mobile device will encrypt the token as it is received in memory so that only an encrypted version of the token is stored. When the decryption of the token occurs, it is only stored in volatile memory such that after it is transmitted in a data message, the memory is flushed so that the decrypted token is destroyed. If the user's request for document data is authenticated (1702), then the CES can formulate the request message that is submitted to the ECM (1703). The CES then receives the document data from the ECM (1704) and then transmits the document data back to the user's device (1705).
In another embodiment, the token is hashed and stored in a database on the CES associated with the username. The token is then destroyed. The authentication process for the token can only be accomplished by executing the hash, because a received token alone will not map to the username.
In yet another embodiment, the token can be generated by the ECM and then passed to the CES, which can verify its authenticity. The token can then be passed on to the user's mobile device. The token has to be the same in both the CES and the ECM to ensure that the chain of trust is not broken.
The process running on the remote device can encrypt the documents that are stored on the device. In another embodiment, the documents are encrypted on the CES prior to transmission to the remote device. These are then decrypted within the secure operating memory space in the remote device, using the input of the user's password. In many devices, the operating system of the device establishes a range of secure memory locations, each range dedicated to an application that is running on the device. In these embodiments, the document is secure because the operating system prevents data from moving between the different secure ranges. In some cases, the operating system encrypts the memory range. When the application is terminated, the decrypted documents present in the associated memory range are immediately deleted and only the encrypted forms of the documents remain on the remote device.
The documents stored on the CES can be encrypted. In one embodiment, each document has its own symmetric key is assigned. When a user wishes to receive a document, a private key is generated that is used to encrypt the document already encrypted using the symmetric key. The private key is stored encrypted using user's data password and the clear version of the key is deleted. When user is present on the CES, the CES system can do something with the document. When user logs off, then the password is lost because it is not stored in the clear. The password only becomes accessible again when the user logs in with their password.
Additional security includes disabling the ability of a remote device to access the CES. This is accomplished by having the device run the application. The application initially contacts the CES with the device identity information. If the CES determines, prior to permitting log-in, that the device has been terminated, the app receives information to that effect and instantly deletes from the remote device all of the documents associated with the CES. This security mechanism can be combined with the geolocation capabilities of the remote device. In this embodiment, the component operating on the remote device transmits within a data message data representing the detected location of the remote device. The system can be adapted so that if the received geographic location is inconsistent with the security policies of the system, the remote device is instructed to flush the documents within it and the connection for that user is blocked regardless that the user's portable device is authenticated. This way, if a remote device is stolen and hacked, its location can be used as an additional authentication mechanism. Another user of the system can also view where the recipients of a document are located by means of receiving data representing the geographic location received from the remote devices of those users. This data can be displayed to the first user. See
The use of remote device level filtering permits the CES to update materials selectively. For example, some remote devices may receive updates of documents based on their user's inclusion on a specific permission list for that update. Or, if an employee has moved departments, their permission level for a particular family of documents may be altered so that their device does not receive the updates.
The CES can also be used to deal with emailed documents. In the case of an incoming email, with an attachment, the email application may filter the email to route it to a client folder. In one embodiment, the filter can specify that any “@workshare” string can filter it to the “workshare” folder. Therefore, an additional menu item can be added to the email client that immediately causes an email to be forwarded to the “workshare” environment. As a result of doing that, the attachment to that email is detached from the email transmission data structure and is then transmitted to the CES to be stored in a directory associated with the “workshare” project. The metadata associated with the document can include the date and time the email was received, the sender of the email, the recipient of the email, and any pertinent data that can be extracted from the body of the email message itself, for example, the subject line of the email.
The system can check whether the sender of the email is identified with a known party and if so, if there are already selectable categories on the ECM for documents related to that party. This data is transmitted to the remote device so that the user interface can display selections from which the user may select as a destination folder for the document.
A heuristic can be used here too for populating metadata regarding document type. The heuristic can be used to map known email addresses associated with particular parties with certain metadata, so that joeblow@yahoo.com is always associated with bigco. In addition, the email message can be parsed to extract the other recipients of the email thread in order to automatically generate permission lists for that document. Email messages in the thread from particular persons may be stored as metadata indicating comments on the document that can be located in the document and presented with the identity of the commenting person.
In another embodiment, the CES can receive a command from a document author to have their document submitted to another reviewer for review. In that case, the system component operating on the reviewer's remote device will receive a notice that such a request is pending and will display and alert on the screen. (701). The alert can be in the form of a dialogue box that when actuated launches the reviewing screen or an alternative to have the request stored and queued. (702). If the reviewer launches the review screen, the reviewer can also actuate the interface to cause a virtual typewriter keyboard to be presented, which causes the remote device to convert touches into text, the letters being selected based on the location of the finger touches. (801). The input text will appear as a markup. (802).
If the document is being presented for approval, then a different screen can be presented.
In yet another embodiment, the remote device can present a display screen that conveniently presents the edits. In this embodiment, the reviewing window is comprised of a region that presents a magnified version (1102) of the text that is the current edit being considered. (1101). As the reviewer actuates buttons to move to the next edit (1103), the main page is changed and also the magnified region presents the next edit in larger typeface. Another embodiment of this invention is where the system is adapted so that the magnified region presents the current edit in context. (1201). In this case, the system determines what region of text surrounds the edit and using a selection algorithm, determines the bounds of the local relevant text. Once that determination is made, the local relevant text is displayed in the magnification window. (1202). The determination can be made on the basis of selecting the entire sentence the edit is in, or, selecting the entire paragraph, or selecting the text between blank lines. Combinations of this can be used. For example, if the sentence is longer than some amount or the edit short, the single sentence may suffice. If the edit is intricate, as in many elements, then the paragraph might be selected. If the paragraph is too long relative to a predetermined amount, then a portion of the paragraph. In cases where the remote device has a large enough display screen, the user can select a review screen that does not use the magnification adaptation.
Operating Environment:
The user's computer may be a laptop or desktop type of personal computer. It can also be a cell phone, smart phone or other handheld device, including a tablet. The precise form factor of the user's computer does not limit the claimed invention. Examples of well known computing systems, environments, and/or configurations that may be suitable for use with the invention include, but are not limited to, personal computers, server computers, hand-held, laptop or mobile computer or communications devices such as cell phones and PDA's, multiprocessor systems, microprocessor-based systems, set top boxes, programmable consumer electronics, network PCs, minicomputers, mainframe computers, distributed computing environments that include any of the above systems or devices, and the like.
The system and method described herein can be executed using a computer system, generally comprised of a central processing unit (CPU) that is operatively connected to a memory device, data input and output circuitry (I/O) and computer data network communication circuitry. A video display device may be operatively connected through the I/O circuitry to the CPU. Components that are operatively connected to the CPU using the I/O circuitry include microphones, for digitally recording sound, and video camera, for digitally recording images or video. Audio and video may be recorded simultaneously as an audio visual recording. The I/O circuitry can also be operatively connected to an audio loudspeaker in order to render digital audio data into audible sound. Audio and video may be rendered through the loudspeaker and display device separately or in combination. Computer code executed by the CPU can take data received by the data communication circuitry and store it in the memory device. In addition, the CPU can take data from the I/O circuitry and store it in the memory device. Further, the CPU can take data from a memory device and output it through the I/O circuitry or the data communication circuitry. The data stored in memory may be further recalled from the memory device, further processed or modified by the CPU in the manner described herein and restored in the same memory device or a different memory device operatively connected to the CPU including by means of the data network circuitry. The memory device can be any kind of data storage circuit or magnetic storage or optical device, including a hard disk, optical disk or solid state memory.
The computer can display on the display screen operatively connected to the I/O circuitry the appearance of a user interface. Various shapes, text and other graphical forms are displayed on the screen as a result of the computer generating data that causes the pixels comprising the display screen to take on various colors and shades. The user interface also displays a graphical object referred to in the art as a cursor. The object's location on the display indicates to the user a selection of another object on the screen. The cursor may be moved by the user by means of another device connected by I/O circuitry to the computer. This device detects certain physical motions of the user, for example, the position of the hand on a flat surface or the position of a finger on a flat surface. Such devices may be referred to in the art as a mouse or a track pad. In some embodiments, the display screen itself can act as a trackpad by sensing the presence and position of one or more fingers on the surface of the display screen. When the cursor is located over a graphical object that appears to be a button or switch, the user can actuate the button or switch by engaging a physical switch on the mouse or trackpad or computer device or tapping the trackpad or touch sensitive display. When the computer detects that the physical switch has been engaged (or that the tapping of the track pad or touch sensitive screen has occurred), it takes the apparent location of the cursor (or in the case of a touch sensitive screen, the detected position of the finger) on the screen and executes the process associated with that location. As an example, not intended to limit the breadth of the disclosed invention, a graphical object that appears to be a 2 dimensional box with the word “enter” within it may be displayed on the screen. If the computer detects that the switch has been engaged while the cursor location (or finger location for a touch sensitive screen) was within the boundaries of a graphical object, for example, the displayed box, the computer will execute the process associated with the “enter” command. In this way, graphical objects on the screen create a user interface that permits the user to control the processes operating on the computer.
The system is typically comprised of a central server that is connected by a data network to a user's computer. The central server may be comprised of one or more computers connected to one or more mass storage devices. The precise architecture of the central server does not limit the claimed invention. In addition, the data network may operate with several levels, such that the user's computer is connected through a fire wall to one server, which routes communications to another server that executes the disclosed methods. The precise details of the data network architecture does not limit the claimed invention.
A server may be a computer comprised of a central processing unit with a mass storage device and a network connection. In addition a server can include multiple of such computers connected together with a data network or other data transfer connection, or, multiple computers on a network with network accessed storage, in a manner that provides such functionality as a group. Practitioners of ordinary skill will recognize that functions that are accomplished on one server may be partitioned and accomplished on multiple servers that are operatively connected by a computer network by means of appropriate inter process communication. In addition, the access of the website can be by means of an Internet browser accessing a secure or public page or by means of a client program running on a local computer that is connected over a computer network to the server. A data message and data upload or download can be delivered over the Internet using typical protocols, including TCP/IP, HTTP, SMTP, RPC, FTP or other kinds of data communication protocols that permit processes running on two remote computers to exchange information by means of digital network communication. As a result a data message can be a data packet transmitted from or received by a computer containing a destination network address, a destination process or application identifier, and data values that can be parsed at the destination computer located at the destination network address by the destination application in order that the relevant data values are extracted and used by the destination application.
The invention may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote computer storage media including memory storage devices. Practitioners of ordinary skill will recognize that the invention may be executed on one or more computer processors that are linked using a data network, including, for example, the Internet. In another embodiment, different steps of the process can be executed by one or more computers and storage devices geographically separated by connected by a data network in a manner so that they operate together to execute the process steps. In one embodiment, a user's computer can run an application that causes the user's computer to transmit a stream of one or more data packets across a data network to a second computer, referred to here as a server. The server, in turn, may be connected to one or more mass data storage devices where the database is stored. The server can execute a program that receives the transmitted packet and interpret the transmitted data packets in order to extract database query information. The server can then execute the remaining steps of the invention by means of accessing the mass storage devices to derive the desired result of the query. Alternatively, the server can transmit the query information to another computer that is connected to the mass storage devices, and that computer can execute the invention to derive the desired result. The result can then be transmitted back to the user's computer by means of another stream of one or more data packets appropriately addressed to the user's computer.
Computer program logic implementing all or part of the functionality previously described herein may be embodied in various forms, including, but in no way limited to, a source code form, a computer executable form, and various intermediate forms (e.g., forms generated by an assembler, compiler, linker, or locator.) Source code may include a series of computer program instructions implemented in any of various programming languages (e.g., an object code, an assembly language, or a high-level language such as FORTRAN, C, C++, JAVA, or HTML or scripting languages that are executed by Internet web-broswers) 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.
This application claims priority as a continuation-in-part to U.S. patent application Ser. No. 13/155,900 filed on Jun. 8, 2011 and as a non-provisional continuation-in-part to U.S. Provisional Patent Application No. 61/559,227 filed on Nov. 14, 2011 both of which are herein incorporated by reference in their entireties.
| 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 |
| 5745879 | Wyman | Apr 1998 | 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 |
| 5874953 | Webster et al. | Feb 1999 | A |
| 5890176 | Kish et al. | Mar 1999 | 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 | May 2000 | A |
| 6088702 | Plantz et al. | Jul 2000 | A |
| 6128635 | Ikeno | Oct 2000 | A |
| 6145084 | Zuili et al. | Nov 2000 | A |
| 6169976 | Colosso | Feb 2001 | B1 |
| 6189019 | Blumer et al. | Feb 2001 | B1 |
| 6189146 | Misra et al. | Feb 2001 | B1 |
| 6212534 | Lo et al. | Apr 2001 | B1 |
| 6219652 | Carter et al. | Apr 2001 | B1 |
| 6219818 | Freivald et al. | Apr 2001 | B1 |
| 6243091 | Berstis | Jun 2001 | B1 |
| 6263350 | Wollrath et al. | Jul 2001 | B1 |
| 6263364 | Najork et al. | Jul 2001 | B1 |
| 6269370 | Kirsch | Jul 2001 | B1 |
| 6285999 | Page | Sep 2001 | B1 |
| 6216112 | Fuller et al. | Oct 2001 | B1 |
| 6301368 | Bolle et al. | Oct 2001 | B1 |
| 6317777 | Skarbo | 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 | Mar 2002 | B1 |
| 6377984 | Najork et al. | Apr 2002 | B1 |
| 6404446 | Bates et al. | Jun 2002 | B1 |
| 6405219 | Saether | Jun 2002 | B2 |
| 6418433 | Chakrabarti et al. | Jul 2002 | B1 |
| 6418453 | Kraft et al. | Jul 2002 | B1 |
| 6424966 | Meyerzon et al. | Jul 2002 | B1 |
| 6449624 | Hammack et al. | Sep 2002 | B1 |
| 6505237 | Beyda et al. | Jan 2003 | B2 |
| 6513050 | Williams et al. | Jan 2003 | B1 |
| 6547829 | Meyerzon et al. | Apr 2003 | B1 |
| 6556982 | McGaffey et al. | Apr 2003 | B1 |
| 6560620 | Ching | May 2003 | B1 |
| 6584466 | Serbinis et al. | Jun 2003 | B1 |
| 6591289 | Britton | Jul 2003 | B1 |
| 6594662 | Sieffert et al. | Jul 2003 | B1 |
| 6596030 | Ball et al. | Jul 2003 | B2 |
| 6614789 | Yazdani et al. | Sep 2003 | B1 |
| 6658626 | Aiken | Dec 2003 | B1 |
| 6662212 | Chandhok et al. | Dec 2003 | B1 |
| 6738762 | Chen et al. | May 2004 | B1 |
| 6745024 | DeJaco et al. | Jun 2004 | B1 |
| 6832202 | Schuyler et al. | Dec 2004 | B1 |
| 6918082 | Gross | Jul 2005 | B1 |
| 7035427 | Rhoads | Apr 2006 | B2 |
| 7085735 | Hall et al. | Aug 2006 | B1 |
| 7107518 | Ramaley et al. | Sep 2006 | B2 |
| 7113615 | Rhoads et al. | Sep 2006 | B2 |
| 7152019 | Tarantola et al. | Dec 2006 | B2 |
| 7181492 | Wen et al. | Feb 2007 | B2 |
| 7194761 | Champagne | Mar 2007 | B1 |
| 7212955 | Kirshenbaum et al. | May 2007 | B2 |
| 7233686 | Hamid | Jun 2007 | B2 |
| 7240207 | Weare | Jul 2007 | B2 |
| 7299504 | Tiller et al. | Nov 2007 | B1 |
| 7321864 | Gendler | Jan 2008 | B1 |
| 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 |
| 7685298 | Day | Mar 2010 | B2 |
| 7694336 | Rinkevich et al. | Apr 2010 | B2 |
| 7707153 | Petite 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 |
| 7903822 | Hair et al. | Mar 2011 | B1 |
| 7904484 | Culpepper | Mar 2011 | B2 |
| 7941844 | Anno | May 2011 | B2 |
| 7958101 | Teugels | Jun 2011 | B1 |
| 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 |
| 8233723 | Sundaresan | Jul 2012 | B2 |
| 8286085 | Denise | Oct 2012 | B1 |
| 8286171 | More et al. | Oct 2012 | B2 |
| 8301994 | Shah | Oct 2012 | B1 |
| 8316237 | Felsher | Nov 2012 | B1 |
| 8406456 | More | Mar 2013 | B2 |
| 8473847 | Glover | Jun 2013 | B2 |
| 8555080 | More | Oct 2013 | B2 |
| 8572388 | Boemker et al. | Oct 2013 | B2 |
| 8620020 | More | Dec 2013 | B2 |
| 8620872 | Killalea | Dec 2013 | B1 |
| 8635295 | Mulder | Jan 2014 | B2 |
| 8670600 | More | Mar 2014 | B2 |
| 8732127 | Rotterdam et al. | May 2014 | B1 |
| 8776190 | Cavage | Jul 2014 | B1 |
| 8797603 | Dougherty et al. | Aug 2014 | B1 |
| 8839100 | Donald | Sep 2014 | B1 |
| 8856143 | Egnor | Oct 2014 | B2 |
| 9092636 | More et al. | Jul 2015 | B2 |
| 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 | 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 | Jan 2003 | A1 |
| 20030009528 | Sharif | 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 | O'Carroll | May 2003 | A1 |
| 20030097454 | Yamakawa | May 2003 | A1 |
| 20030112273 | Hadfield | 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 et al. | Aug 2003 | A1 |
| 20030191799 | Araujo | Oct 2003 | A1 |
| 20030196087 | Stringer | Oct 2003 | A1 |
| 20030204399 | Wolf | 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 | 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 |
| 20050027704 | Hammond et al. | Feb 2005 | A1 |
| 20050038893 | Graham | Feb 2005 | A1 |
| 20050044197 | Lai | Feb 2005 | A1 |
| 20050055306 | Miller et al. | 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 |
| 20060259524 | Horton | Nov 2006 | A1 |
| 20060259949 | Schaefer et al. | Nov 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 | 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 |
| 20070118598 | Bedi et al. | May 2007 | A1 |
| 20070150443 | Bergholz et al. | Jun 2007 | A1 |
| 20070156785 | Hines et al. | Jul 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 et al. | Jan 2008 | A1 |
| 20080033913 | Winburn | Feb 2008 | A1 |
| 20080034282 | Zernik | Feb 2008 | A1 |
| 20080034327 | Cisler et al. | Feb 2008 | A1 |
| 20080040388 | Petri et al. | Feb 2008 | A1 |
| 20080065668 | Spence et al. | Mar 2008 | A1 |
| 20080080515 | Tombroff et al. | Apr 2008 | A1 |
| 20080082529 | Mantena et al. | Apr 2008 | A1 |
| 20080082930 | Omernick et al. | Apr 2008 | A1 |
| 20080091465 | Fuschino et al. | Apr 2008 | A1 |
| 20080091735 | Fukushima et al. | Apr 2008 | A1 |
| 20080094370 | Ording et al. | Apr 2008 | A1 |
| 20080162527 | Pizano et al. | Jul 2008 | A1 |
| 20080177733 | Virdy | Jul 2008 | A1 |
| 20080177782 | Poston et al. | Jul 2008 | A1 |
| 20080209001 | Boyle et al. | Aug 2008 | A1 |
| 20080215667 | Rothbarth et al. | 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 et al. | Dec 2008 | A1 |
| 20080310624 | Celikkan | Dec 2008 | A1 |
| 20080320316 | Waldspurger et al. | Dec 2008 | A1 |
| 20090025087 | Peirson et al. | Jan 2009 | A1 |
| 20090030997 | Malik | Jan 2009 | A1 |
| 20090034804 | Cho et al. | Feb 2009 | A1 |
| 20090049132 | Gutovski | Feb 2009 | A1 |
| 20090052778 | Edgecomb et al. | Feb 2009 | A1 |
| 20090064326 | Goldstein | Mar 2009 | A1 |
| 20090083073 | Mehta et al. | Mar 2009 | A1 |
| 20090083384 | Bhogal et al. | Mar 2009 | A1 |
| 20090129002 | Wu et al. | May 2009 | A1 |
| 20090150462 | McClanahan | Jun 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 | 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 | 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 |
| 20100174826 | Sharma | 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 |
| 20100332682 | Sharp 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 |
| 20120246115 | King et al. | Sep 2012 | A1 |
| 20120260188 | Park et al. | Oct 2012 | A1 |
| 20120265817 | Vidalenc et al. | Oct 2012 | A1 |
| 20120317239 | Mulder | Dec 2012 | A1 |
| 20120317414 | Glover | Dec 2012 | A1 |
| 20120317479 | Safa | Dec 2012 | A1 |
| 20130007070 | Pitschke | Jan 2013 | A1 |
| 20130060799 | Massand | Mar 2013 | A1 |
| 20130074195 | Johnston et al. | Mar 2013 | A1 |
| 20130074198 | More | Mar 2013 | A1 |
| 20130097421 | Lim | Apr 2013 | A1 |
| 20130212707 | Donahue | Aug 2013 | A1 |
| 20130227043 | Murakami | Aug 2013 | A1 |
| 20130227397 | Tvorun et al. | Aug 2013 | A1 |
| 20140032489 | Hebbar | Jan 2014 | A1 |
| 20140115436 | Beaver et al. | Apr 2014 | A1 |
| 20140136497 | Georgiev et al. | May 2014 | A1 |
| 20140181223 | Homsany et al. | Jun 2014 | A1 |
| 20140279843 | Von Weihe | Sep 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 |
| 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 |
| 1020070049518 | May 2007 | KR |
| 102008002960 | Apr 2008 | KR |
| 1020080029602 | Apr 2008 | KR |
| 2000060504 | Oct 2000 | WO |
| WO0060504 | Oct 2000 | WO |
| 2001052473 | Jul 2001 | WO |
| 2001052473 | Jul 2001 | WO |
| 2002101577 | Dec 2002 | WO |
| 2002101577 | Dec 2002 | WO |
| Entry |
|---|
| Monga, “Robust Perceptual Image Hashing Using Feature Points,” http://bluecoat-o2/?cfru=aHR0cDovL3NpZ25hbC51Y2UudXrleGFzLmVkdS9+dmIzaGFsL2hhc2gtcGFydEkucHM=, 2003. |
| PC Magazine “Pure Intranets: Real-Time Internet Collboration”, http://www.zdnet.com/pcmag/featuresgroupware/gpwst.htm, Aug. 30, 2001, 2 pages. |
| Microsoft, “Microsoft XP, Product Guide”, Aug. 24, 2001, pp. 1-26, Microsoft. |
| Written Opinion PCT Application No. PCT/US2009/065019 dated Jun. 4, 2010, 5 pages. |
| Written Opinion of PCT Application No. PCT/2009/064919, dated Jul. 1, 2010, 4 pages. |
| Cox et al; Microsoft Office Word 2007 Step by Step; Jan. 17, 2007; Microsoft Press; pp. 283-293. |
| 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. |
| 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. |
| Dominik Grolmund et al., Cryptree: A Folder Tree Structure for Cryptographic File Systems, Oct. 2-4, 2006, IEEE, pp. 189-198. |
| Final Office Action dated April 16, 2012 in Co-Pending U.S. Appl. No. 12/177,043, filed July 21, 2008. |
| Final Office Action dated April 17, 2007 for U.S. Appl. No. 10/023,010, filed Dec. 17, 2001, Issued U.S. Pat. No. 7,496,841. |
| Advisory Action dated Apr. 12, 2013, in Co-Pending U.S. Appl. No. 12/621,429 by More, S., filed Nov. 18, 2009. |
| Advisory Action dated Apr. 12, 2013, in Co-Pending U.S. Appl. No. 12/621,429 of More, S., filed Nov. 18, 2009. |
| Advisory Action dated Nov. 1, 2013, in Co-Pending U.S. Appl. No. 13/659,793 by More, S., filed Oct. 24, 2012. |
| Co-pending U.S. Appl. No. 10/023,010, filed Dec. 17, 2001. |
| Co-pending U.S. Appl. No. 10/136,733, filed Apr. 30, 2002. |
| Co-pending U.S. Appl. No. 12/177,043, filed Jul. 21, 2008. |
| Co-pending U.S. Appl. No. 12/209,082, filed Sep. 11, 2008. |
| Co-pending U.S. Appl. No. 12/209,096, filed Sep. 11, 2008. |
| Co-pending U.S. Appl. No. 12/275,185, filed Nov. 20, 2008. |
| Co-pending U.S. Appl. No. 12/621,429, filed Nov. 18, 2009. |
| Co-pending U.S. Appl. No. 12/844,818, filed Jul. 27, 2010. |
| Co-pending U.S. Appl. No. 13/306,765, filed Nov. 29, 2011. |
| Co-pending U.S. Appl. No. 13/306,798, filed Nov. 29, 2011. |
| Co-pending U.S. Appl. No. 13/306,819, filed Nov. 29, 2011. |
| Co-pending U.S. Appl. No. 13/620,364, filed Sep. 14, 2012. |
| Co-Pending U.S. Appl. No. 13/659,793, filed Oct. 24, 2012. |
| Co-Pending U.S. Appl. No. 13/659,817, filed Oct. 24, 2012. |
| Dominik Grolimund et al., Cryptree: A Folder Tree Structure for Cryptographic File Systems, Oct. 2-4, 2006, IEEE, pp. 189-198. |
| Final Office Action dated Apr. 16, 2012 in Co-Pending U.S. Appl. No. 12/177,043, filed Jul. 21, 2008. |
| Final Office Action dated Apr. 17, 2007 for U.S. Appl. No. 10/023,010, filed Dec. 17, 2001, Issued U.S. Pat. No. 7,496,841. |
| Final Office Action dated Apr. 17, 2007 for U.S. Appl. No. 10/023,010, filed Dec. 7, 2001, Issued U.S. Pat. No. 7,496,841. |
| Final Office Action dated Apr. 17, 2007 in Co-Pending U.S. Appl. No. 10/023,010, filed Dec. 17, 2001, Issued U.S. Pat. No. 7,496,841. |
| Final Office Action dated Aug. 12, 2011 for U.S. Appl. No. 12/209,096, filed Sep. 11, 2008. |
| Final Office Action dated Aug. 12, 2011 in Co-Pending U.S. Appl. No. 12/209,096, filed Sep. 11, 2008. |
| Final Office Action dated Aug. 16, 2013 in co-pending U.S. Appl. No. 13/306,798 of Glover, R.W., filed Nov. 29, 2011. |
| Final Office Action dated Feb. 1, 2013 in Co-Pending U.S. Appl. No. 12/621,429 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/IB2002/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. |
| 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. |
| Restriction Requirement dated Feb. 14, 2005 for U.S. Appl. No. 10/023,010, filed Dec. 17, 2001, Issued U.S. Pat. No. 7,496,841. |
| Restriction Requirement dated Feb. 14, 2005 in U.S. Appl. No. 10/023,010, filed Dec. 17, 2001, Issued Patent No. 7,496,841. |
| Restriction Requirement dated Feb. 5, 2008 for U.S. Appl. No. 10/023,010, filed Dec. 17, 2001, Issued Patent No. 7,496,841. |
| Restriction Requirement dated Feb. 5,2008 in Co-Pending U.S. Appl. No. 10/023,010, filed Dec. 17, 2001, Issued 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. |
| 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. |
| 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. |
| 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, 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. |
| 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. |
| M. Eric Johnson et al., The Evolution of the Peer-to-Peer File Sharing Industry and the Security Risks for Users, Jan. 1-10, 2008, IEEE, pp. 1-10. |
| Mango, “Robust Perceptual Image Hashing Using Feature Points,” http://bluecoat-02/?cfru=aHR0cDovL3NpZ25hbC51Y2UudXRIeGFzLmVkdS9+dmIzaGFs- L2hhc2gtcGFydEkucHM=, 2003. |
| Mango, “Robust Perceptual Image Hashing Using Feature Points,” http://bluecoat-02/?cfru=aHR0cDovL3NpZ25hbC51Y2UudXRIeGFzLmVkdS9+dmIzaGFs- L2hhagtcGFydEkucHM=, 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, “Microsoft XP, Product Guide”, pp. 1-26, 2001. |
| Microsoft, “Microsoft XP, Product Guide”, pp. 1-26. |
| Monga, “Robust Perceptual Image Hashing Using Feature Points,” http://bluecoat-02/?cfru=aHR0cDovL3NpZ25hbC51Y2UudXRIeGFzLmVkdS9+dmIzaGFs- 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 dated Apr. 27, 2012 in Co-Pending U.S. Appl. No. 12/275,185, filed Nov. 20, 2008. |
| Non-final office action issued for U.S. Appl. No. 13/799,067 dated Oct. 30, 2014. |
| Non-Final Office Action dated Apr. 26, 2013 in Co-Pending U.S. Appl. No. 13/659,817 of More, S., filed Oct. 24, 2012. |
| Non-Final Office Action dated Apr. 27, 2012 in Co-Pending U.S. Appl. No. 12/275,185 of More, S., filed Nov. 20, 2008. |
| Non-Final Office Action dated Aug. 1, 2012 in Co-Pending U.S. Appl. No. 12/621,429 filed Nov. 18, 2009. |
| Non-Final Office Action dated Aug. 1, 2012 in Co-Pending U.S. Appl. No. 12/621,429 of More, S., filed Nov. 18, 2009. |
| Non-Final Office Action dated Aug. 13, 2013 in co-pending U.S. Appl. No. 13/306,819 by Glover, R.W., filed Nov. 29, 2011. |
| Non-Final Office Action dated Dec. 22, 2011 in Co-Pending U.S. Appl. No. 12/209,082. |
| Non-Final Office Action dated Dec. 6, 2012 in co-pending U.S. Appl. No. 13/306,798, filed Nov. 29, 2011. |
| Non-Final Office Action dated Jan. 9, 2012 in Co-Pending U.S. Appl. No. 12/177,043, filed Jul. 21, 2008. |
| Non-Final Office Action dated Jan. 9, 2012 in Co-Pending U.S. Appl. No. 12/171,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, Issued 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, Issued 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, Issued 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. |
| 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, Issued 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. |
| 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. |
| Bettenburg et al., An Empirical Study on the Risks of Using Off-the-Shelf Techniques for Processing Mailing List Data, 2009, IEEE 4 pages. |
| Bindu et al., Spam War: Battling Ham against Spam, 2011 IEEE 6 pages. |
| Bobba et al. Attribute-Based Messaging: Access Control and Confidentiality, 2010, ACM 35 pages. |
| Chen et al., Online Detection and Prevention of Phishing Attacks, 2006, IEEE 7 pages. |
| Kamouskos et al., Active Electronic Mail, 2002, ACM 6 pages. |
| Kaushik et al., Email Feedback: A Policy based Approach to Overcoming False Positives, 2005, 10 pages. |
| Stolfo et al., AMT?MET: Systems for Modeling and Detecting Errant Email. 2003, IEEE 6 pages. |
| Jain, Pravin. The class of JAVA. Aug. 12, 2010. |
| Workshare Ltd. Workshare Protect 4.5 Admin Guide, (c) 2006. |
| Classification Definitions, Data Processing: Presentation Processing of Document, Operator Interface Processing, and Screen Saver Display Processing; Feb. 2011; pp. 1-33. |
| Number | Date | Country | |
|---|---|---|---|
| 20120317239 A1 | Dec 2012 | US |
| Number | Date | Country | |
|---|---|---|---|
| 61559227 | Nov 2011 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 13155900 | Jun 2011 | US |
| Child | 13333605 | US |