Abstract: A method for enabling a user of a computing device to designate a content item for subsequent review is provided. The computing device is coupled to a memory device and a display. The method is implemented using the computing device. The method includes displaying, by the computing device, a first publication. The method further includes the steps of displaying, by the computing device, a content item at a first time, wherein the content item is displayed in conjunction with the first publication. The method further includes receiving, by the computing device, a first input from the user to designate the content item for subsequent review, generating an indicator that the content item has been designated for subsequent review, causing the memory device to store the indicator, determining a second time to display the content item, and displaying the content item at the second time.

Abstract: A method for enabling a user of a computing device to designate a content item for subsequent review is provided. The computing device is coupled to a memory device and a display. The method is implemented using the computing device. The method includes displaying, by the computing device, a first publication. The method further includes the steps of displaying, by the computing device, a content item at a first time, wherein the content item is displayed in conjunction with the first publication. The method further includes receiving, by the computing device, a first input from the user to designate the content item for subsequent review, generating an indicator that the content item has been designated for subsequent review, causing the memory device to store the indicator, determining a second time to display the content item, and displaying the content item at the second time.

Abstract: A system and associated method for bulk processing of semi-structured results streams from many different resources ingest bytes, parse as many bytes as practical, and return to process additional bytes. The system processes network packets as they arrive from a computing resource, creating intermediate results. The intermediate results are held in a stack until sufficient information is accumulated. The system then merges the intermediate results to form a single document model. As network packets at one connection are consumed by the system, the system can select another connection at which packets are waiting for processing. The processing of a result at a connection can be interrupted while the system processes the results at another connection. In this manner, the system is able to utilize one thread to process many incoming results in parallel.

Abstract: A privacy-preserving index system addresses the problem of providing a privacy-preserving search over distributed access-controlled content. Indexed documents can be readily reconstructed from inverted indexes used in the search. The privacy-preserving index system builds a centralized privacy-preserving index in conjunction with a distributed access-control enforcing search protocol. The privacy-preserving index utilizes a randomized algorithm for constructing a privacy-preserving index. The privacy-preserving index is strongly resilient to privacy breaches. The privacy-preserving index system allows content providers to maintain complete control in defining access groups and ensuring its compliance, and further allows system implementors to retain tunable knobs to balance privacy and efficiency concerns for their particular domains.

Abstract: A privacy-preserving index system addresses the problem of providing a privacy-preserving search over distributed access-controlled content. Indexed documents can be readily reconstructed from inverted indexes used in the search. The privacy-preserving index system builds a centralized privacy-preserving index in conjunction with a distributed access-control enforcing search protocol. The privacy-preserving index utilizes a randomized algorithm for constructing a privacy-preserving index. The privacy-preserving index is strongly resilient to privacy breaches. The privacy-preserving index system allows content providers to maintain complete control in defining access groups and ensuring its compliance, and further allows system implementors to retain tunable knobs to balance privacy and efficiency concerns for their particular domains.

Abstract: A user can easily organize computerized document folders by associating a few sample documents in the document database with each folder. The present invention learns folder profiles based on the sample documents and moves the remaining documents into the folders accordingly. In this way, the user can construct new folders, or rearrange existing folders, or cause the computer to automatically rearrange and maintain the folders. This is particularly useful for managing a database of perhaps thousands of emails.

Abstract: A system, method, and business method for operating a computer as a server for directly providing content and services via a computer network, by assigning a URL to the computer, associating at least one directory in a storage device with the URL, directing access requests from said URL to the directory, and delivering requested content and services, potentially for revenue. The content may be dynamic and contained in a database. The services may include storing data. The directory may be replicated onto additional computers to which access requests may be directed. Access requests may be authenticated as coming from members of a peer group having access rights. The invention features a one-click process for publishing content to an intranet or the internet, and employs known file transfer protocols.

Abstract: A dense data-set mining system and method is provided that directly exploits all user-specified constraints including minimum support, minimum confidence, and a new constraint, known as minimum gap, which prunes any rule having conditions that do not contribute to its predictive accuracy. The method maintains efficiency even at low supports on data that is dense in the sense that many items appear with high frequency (e.g. relational data).

Abstract: A method and apparatus for mining generally long patterns from a database of data records of items. An initial set C of candidates is first generated, each candidate c having disjoint sets of items c.head and c.tail. Frequent candidates from the set C are extracted and put into a set F, where the frequent candidates are those whose set {c.head .orgate. c.tail} is an itemset having a minimum support. Non-frequent candidates in C are used to generate new candidates, which are added to the set C. After any candidates having a superset in the set Fare removed from C and F, the method steps are repeated on the new candidate set C, until C is empty. The candidates remaining in the working set Fare returned as the desired patterns.