Abstract: A computer system for building models of complex business transactions in an information management system. The system includes storage means for storing ordered sets of references to design data, such as entities. The ordered sets, or entity-sets, are assigned a value, and may then be manipulated in a manner similar to a data variable. The references may be ordered in accordance with predetermined criteria, or operator selected criteria.

Abstract: A computer system for dynamically modeling information systems of organizations by employing partnership sets. The system includes one or more editors which enable a user to interact with the system. The system includes a programmed data computer adapted to establish one or more partnership sets within at least one design data, where each partnership set is representative of zero, one or more partnerships. The computer is further adapted to establish one or more partnerships, wherein each partnership is characterized by one partnership set associated with itself or associated with one other partnership set. The computer controls access to one or more design data by reference to a partnership set which is in partnership with partnership sets of one or more design data.

Abstract: A computer system for processing information representative of complex business transactions. The system enables a user to define business logic within a dynamic information management system model. The system may include a plurality of editors which enable a user to dynamically create, analyze and modify design data. The system further includes graphical displays which enable a user to affect the operations to be performed on that design data.

Abstract: A computer system for processing complex information representative of business transactions. Specifically, the system stores transaction data, which is then reversibly transformed in accordance with predetermined processing algorithms, while it is externally inaccessible. In this static state, the transformed transaction data is evaluated against predetermined logical criteria. The evaluation produces either successful or unsuccessful results. If successful, the transformed data is then made externally accessible. If unsuccessful, the original transaction data is made externally accessible.

Abstract: A computer system for dynamically modeling information systems of organizations. The system includes a plurality of editors which enable a user to interact with the system. Included in the system is an information modeler, an information flow modeler, and a logic modeler for creating, analyzing and modifying design data associated with each modeler. Each of the modelers are dynamically interlinked, such that a change to one design data set will affect a corresponding change in other design data sets. The system includes graphic representations associated with each of the modelers to enable a user to interact with the system. The objects of each of the graphic representations may also be dynamically linked, such that a change in one representation affects a substantially immediate change in other representations.

Abstract: A data base management system according to the invention stores, retrieves, and modifies data records within a digital computer data base, permitting access to related data records through partnerships joining record pairs. Partnership sets are employed to relate data records on a one-to-one, one-to-many, and a many-to-many basis. The invention facilitates the modelling of real world structures and events in a data base whose logical representation closely depicts those structures and events.

Abstract: Apparatus for clamping one string of a three or more direction oriented string network of a game racket held in a support fixture, to that support fixture. The apparatus includes a pair of jaws adapted to be selectively biased against the string-to-be-clamped in the string network. The jaws include a portion adapted for extension through the openings between the strings of the network, including a plurality of teeth defined by inter-tooth grooves having angular orientations and spacings matching the angular orientations and spacings of the strings crossing the string-to-be-clamped in the network. In another form, an apparatus for selectively clamping two adjacent parallel strings of a three or more direction oriented string network in a game racket includes two pairs of jaws adapted for clamping the two strings.

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: One of a series of hardware/firmware instructions for converting a general purpose digital computer into a database machine by adding the capability of handling data base records. The invention comprises a hardware/firmware implemented machine instruction apparatus which fetches a record descriptor containing a referenced data base record type from main memory. The record type of the record to be checked, which is pointed to by a base register, is also fetched from main memory, and a comparison of the fetched record descriptor and type is made. A condition code is set to indicate the result of the comparison.

Abstract: An apparatus for utilizing a logical compare instruction is disclosed. The apparatus develops a data field descriptor associated with and describing the attributes of each of the operands of the compare instruction. If the operands have different formats, when matching the contents of a first operand to the contents of a second operand, one operand is converted at execution time of the compare instruction to a format consistent with the other operand. The apparatus determines whether the contents of the first operand is greater than, less than, or equal to the second operand.

Abstract: A data field descriptor extends the flexibility of operand accesses by defining the attributes of a data field with regard to length, location and form of data representation at execution time. This delay of binding the operand accesses until execution time supports both data independence and security by permitting programs to be compiled without any restrictions imposed by the attributes of data fields. At execution time the necessary information is provided through a register so that the data field information may be correctly processed. With this feature a program is permitted to survive the change in formats of its input and output files without repeatedly undergoing the expensive operation of compilation. Also permitted is processing of files containing data field values which are not uniformly formatted throughout the file but which are self-defining through a data field descriptor.

Abstract: One of a series of hardware/firmware primitives is disclosed for converting a general purpose digital computer into a database machine. The invention comprises a hardware/firmware implemented machine instruction which determines the appropriate register where a database pointer is currently stored, retrieves the pointer from that register and then stores the pointer into main memory.

Abstract: Two of a series of hardware/firmware primitives are disclosed for converting a general purpose digital computer into a database machine. The invention comprises two hardware firmware implemented machine instructions which both fetch a set descriptor, which along with a base register BR, allow access to a record. For the Test Set Empty operation, the record accessed is an owner record and a check is made to see whether the set has any member records currently associated with it. For the Test Member Inserted operation, the record accessed is checked to see whether it is currently inserted as a member of a particular set (i.e., a part of that set).

Abstract: One of a series of hardware/firmware primitives is disclosed for converting a general purpose digital computer into a database machine. The invention comprises a hardware/firmware implemented machine instruction called the find owner instruction, which fetches a set descriptor, which along with a base register BR, allows access to the owner pointer of a member record. The address of the owner record is then loaded into a register or registers.

Abstract: One of a series of hardware/firmware primitives is disclosed for converting a general purpose digital computer into a database machine. The invention comprises a hardware/firmware implemented machine instruction which sequentially checks each database record in a database area beginning at the page/line number address (database address) contained in a register, until the next active record is located. The database address of that active record is then loaded into a register.

Abstract: Apparatus for utilizing a logical, record oriented move instruction is disclosed. By utilizing separately maintained data field descriptors which define the attributes of the data, the move instruction is able to transfer a multitude of different data types. From a source operand the logical instruction transfers data field by field to the destination. At the time of transfer, the logical move instruction reformats the data to meet the destination's description. The move instruction is applicable both to removing data from a data file and to restoring data into the data file.