Abstract: Methods and apparatus of the invention enable users to request access to one or more electronic images of pages in a physical text. When the user is identified and user ownership of the physical text is confirmed, the user is given access to the requested electronic images in accordance with the one or more access rules. Electronic images of pages may be automatically added to a user-personalized library of electronic content for later access. A flag associated with the user and the pages images may be set to indicate confirmed user ownership of the physical text. A user may purchase a physical text itself or purchase an item that the physical text normally accompanies. Electronic page images may be acquired by scanning printed pages of the text or from a user upload. Access to the electronic images of a physical text is based on user ownership of the physical text.

Abstract: A web site system includes an event history server system that persistently stores event data reflective of events that occur during browsing sessions of web site users, and makes such data available to other applications and services in real time. The server system may, for example, be used to record information about every mouse click of every recognized user, and may also be used to record other types of events such as impressions and mouse-over events. The event data of a particular user may be retrieved from the server system based on event type, event time of occurrence, and various other criteria. In one embodiment, the server system includes a cache layer that caches event data by session ID, and includes a persistent storage layer the persistently stores the event data by user ID. Also disclosed are various application features that may be implemented using the stored event data.

Abstract: The invention relates to processing of electronic text communication distributed in bulk. In one embodiment, a process for blocking electronic text communication distributed in bulk is disclosed. In the process, a first electronic and a second electronic submission are received. A first portion is extracted from the first electronic submission and a second portion is extracted from the second electronic submission. A first code is determined for the first portion and a second code is determined for the second portion. The first code is indicative of the first portion and the second code is indicative of the second portion. After the first code is compared to the second code, the second electronic submission is filtered in response to that comparison.

Abstract: Systems and methods for connecting two or more individuals to an Internet conversation based on their mutual interests, the current content they may be viewing and what they want to talk about at that time. The techniques of the present invention allow an individual who starts a conversation to maintain full control over who is able to join that conversation as well as how many are able to join at any one time. A user who desires to start or join a conversation about a particular topic or story selects an indicator, such as an icon, associated with the specific topic or story. The user is presented with an option to start or join a conversation. If the user opts to start a conversation, the user is presented with a comment page, and the user enters a comment, or comments, that preferably is intended to spark an interest in other users. The comment is then presented to other users.

Abstract: A search system provides search results to searchers in response to search queries and the search results are ranked. The ranking is determined by an automated ranking process in combination with human editorial input. A search system might comprise a query server for receiving a current query, a corpus of documents to which the current query is applied, ranking data storage for storing information from an editorial session involving a human editor and a reviewed query at least similar to the current query, and a rank adjuster for generating a ranking of documents returned from the corpus responsive to the current query taking into account at least the information from the editorial session.

Abstract: Systems and methods for connecting two or more individuals to an Internet conversation based on their mutual interests, the current content they may be viewing and what they want to talk about at that time. The techniques of the present invention allow an individual who starts a conversation to maintain full control over who is able to join that conversation as well as how many are able to join at any one time. A user who desires to start or join a conversation about a particular topic or story selects an indicator, such as an icon, associated with the specific topic or story. The user is presented with an option to start or join a conversation. If the user opts to start a conversation, the user is presented with a comment page, and the user enters a comment, or comments, that preferably is intended to spark an interest in other users. The comment is then presented to other users.

Abstract: An “active” calendar automatically analyzes a user's calendar entries and sends machine-readable messages to destinations appropriate to content of the calendar entry. A group of event categories is established, each category specifying one class of anticipated calendar entry. An action rule database pre-associates each event category with one or more message formats each having a content and a destination. The action rule database also contains data identifying sources containing the content and destination for each message format. These sources include records of the action rule database itself, subparts of calendar entries of the pre-associated event category, one or more other databases, or a combination of the foregoing. After the calendar receives a user-submitted computer calendar entry describing a planned event, it identifies one of the event categories of the established group that classifies the planned event.

Abstract: A search engine that forms a compact representation of a plurality of user queries to efficiently find desired information in an information network. The search engine comprises a profile processor having logic to receive the queries from the users and a search module. The search module is coupled to the profile processor and has logic to receive the information content, to combine the user queries into a master query, and to match the master query with the information content to determine matching content. The search engine also includes logic to analyze the matching content to determine if any of the queries has been satisfied.

Abstract: A technique for detecting similarities in large sets of binary code files, e.g., bytecode files, without requiring access or knowledge of the actual source code itself. In accordance with the technique, bytecode files are disassembled and preprocessed using positional encoding to prepare the disassembled bytecode files for use in conjunction with similarity detection tools.

Abstract: A first-come first-serve arbitration protocol arbitrates between processing agents seeking access to a common bus. The system is an extension of a parallel contention arbiter in which each agent has an identity value made up of two portions, one a fixed portion and one a variable portion. The variable portion of each agent's identity is incremented depending on how long the agent has been waiting for access to the bus and the variable portion is the most significant portion of each agent's identity. Thus in each arbitration in which the highest identity value is awarded control of the bus, the agent which has waited the longest will gain access to the bus prior to those which have not waited as long.

Abstract: A protocol is disclosed for the round-robin distributed arbitration of access to a common resource, such as a bus, in a multiprocessor system or machine. The protocol assigns identity values to each agent, or processor, which are compared during each arbitration to determine which agent is awarded control of the bus. To enhance fairness agents having an identity value lower than the winner of the last arbitration are favored over agents having a higher identity value in the next subsequent arbitration.