Abstract: Methods and apparatus provide for a personalization search engine that receives a search query from a first user and identifies multiple portions of indexed content—where each respective portion of indexed content has metadata that matches at least one characteristic of the search query. The personalization search engine determines a relevance of each respective portion of indexed content to the first user who provided the search query. It is understood that, in various embodiments, the relevance of a portion of indexed content has to the first user who provided the search query can be based on user feedback associated with an online version of that portion of indexed content. The personalization search engine ranks the multiple portions of indexed content according to their respective relevance to the first user who provided the search query and creates a search result based on ranking the multiple portions of indexed content.

Abstract: Methods and apparatus provide for a personalization search engine that receives a search query from a first user and identifies multiple portions of indexed content—where each respective portion of indexed content has metadata that matches at least one characteristic of the search query. The personalization search engine determines a relevance of each respective portion of indexed content to the first user who provided the search query. It is understood that, in various embodiments, the relevance of a portion of indexed content has to the first user who provided the search query can be based on user feedback associated with an online version of that portion of indexed content. The personalization search engine ranks the multiple portions of indexed content according to their respective relevance to the first user who provided the search query and creates a search result based on ranking the multiple portions of indexed content.

Abstract: A method and apparatus are provided for capturing and managing user-specific data, where the user-specific data contains information on the user's interaction with the Net. The method generally involves using a proxy to capture or cause to capture the user-specific data and then storing the user-specific data. The user-specific data may be used to customize the contents of electronic information delivered to the particular user.

Abstract: Systems and methods are provided for implementing delta encoding for distribution of content. In one aspect, a canonical reference file that is common to a server and to each client to which the server distributes content, and which represents a portion of particular content, is generated and transmitted to the associated clients. A delta file, which represents the difference between the current state of the content and the canonical reference file, is transmitted to the requesting client so that it can be applied to the canonical reference file to construct the current state of the content. A client can receive the canonical reference file during a period in which the current state of the content differs from the reference file. Furthermore, the canonical reference file can be transmitted during a period in which the current state of the content changes.

Abstract: In a distributed shared memory system, clusters of symmetric multi-processors are connected to each other by a network. Each symmetric multi-processor includes a plurality of processors, a memory having addresses, and an input/output interface to interconnect the processors. A software implemented method enables data sharing between the clusters of symmetric multi-processors using variable sized quantities of data called blocks. A set of the addresses of the memories are designated as virtual shared addresses to store shared data, and a portion of the virtual shared addresses are allocated to store a shared data structure as one or more blocks. The size of a particular allocated block can vary for different shared data structures. Each block includes an integer number of lines, and each line includes a predetermined number of bytes of shared data. Directory information of a particular block is stored in the memory of a processor designed as the home of the block.

Abstract: An automatic organization of images in computer memory is provided as a doubly-linked (or multiply-linked) list data structure which reflects in its interconnections to relationships between various stages in complex image processing tasks. Data structures, implemented in an appropriate high-level computer language such as C, contain pertinent information about the image as well as pointers (memory addresses) to other data structures and their associated images. These pointers allow the construction and maintenance of the linked list relationships between images. Since the relationships between images in the linked lists are equivalent to the relationships between stages of image processing tasks, the complex tasks of image processing are automatically documented in the linked list data structure without the necessity of maintaining an auxiliary written record.