Abstract: A method for extracting a preferred set of textual records from a database includes the following features. Priority values are assigned to each of a plurality of predefined category structures. Textual records are assigned a relevance value with respect to each category structure. If a record's relevance value exceeds a predetermined threshold value, that record is associated with the category structure. Each category has a list of associated textual records which are retrieved. Textual records are selected from the set of retrieved textual records and assembled into a set. Information on how the subscriber uses the set is gathered, and new rankings for the category structure are computed.

Abstract: A generalized event management architecture based upon an analysis of the traditional interprocess communication and synchronization mechanisms is disclosed. An extended semaphore architecture is proposed which combines the properties of Dijkstra's semaphore with that of a trap facility. This model is further developed into a more general architecture capable of handling complex events, structured event condition variables and generalized assignments. The architecture is defined in terms of entity classes, relationship classes and functional primitives. Finally a typical hardware computer system utilizing these concepts is shown and described.

Abstract: A method and apparatus for detecting a deadlock condition where two or more processes are waiting for events which cannot happen. Firmware is provided to examine the request of a first process of a group of processes for assignment of a first resource of a group of resources, and to determine whether said first resource is or is not currently assigned to a second process of said group of processes which said second process is already waiting directly or indirectly for a second resource of said group of resources which said second resource is currently assigned to the said first process.

Abstract: An arrangement for sharing file information among plural processes in a multiprogrammed computing system. Source program file declarations are compiled into file control structures which are placed in skeletal segments, the segments forming units of potential sharing between active processes. Those segments which contain file control structures are placed in either the address space of (1) all processes, (2) related processes, or (3) a single process, depending upon the declared sharing level of the file. Job control language (JCL) commmands are expanded into JCL file control structures and merged with the source language structures to form a file request control structure. This request may be compared against a catalog of existing external files, a check being made to insure that the account on whose behalf a computing job is requesting file assignment is authorized to obtain the requested access to the file.