Abstract: An electronic calendaring method for use in a data processing system has a plurality of workstations, each of which is assigned to a different individual who maintains an electronic calendar on the system. The method establishes a plurality of data structures for storing data that is entered into the system interactively by the calendar owner during the process of calendaring an event which involves a number of other calendar owners e.g. a meeting. A Trigger data structured is included to store data at the time an event is being calandered that provides a reminder to the meeting originator or calendar owner. The type of reminder may be selected by the meeting originator provided the system hardware supports the underlying technology. The reminder may be just a visual message on the display, an audio tone, an audio message or any combination. The official ID of the event that is to be triggered is included in the Trigger data structure.

Abstract: An electronic calendaring method for use in a data processing system that has a plurality of interactive type work stations (terminals or personal computers) connected directly or indirectly to a host processor. The method assists a calendar owner who receives a notice at his work station requesting his involvement in a future event that is being calendared by another calendar owner on the system, to manually or automatically designate in the reply a temporary alternate to attend the meeting being calendared or a permenant alternate to attend all future meetings without affecting his status in the system as a receipient of the meeting notice.

Abstract: A method for running an expert system on a data processing system in which the Rulebase is segmented into contextual units so that the system memory can accommodate each unit. Portions of the Rulebase containing data or knowledge that is not needed in a particular application may then be eliminated. The segmenting of the Rulebase also allows the contextual units of the application to be paged into and out of the system as needed. The various intersegment relationships are managed by the system as units are paged into and out of memory. A second Rulebase unit may be called by the first unit and executed at any time during the processing of the first Rulebase. Provision is made in the form of a Global attribute to selectively identify and store the data that is relevant to the application and that has been accumulated up to the point where another unit is called so that at some time later in the process, when the system returns to the first unit, it can proceed from the last RULE node that was processed.

Abstract: An electronic calendaring method for use in a data processing system that has a plurality of interactive type work stations (terminals or personal computers) connected directly or indirectly to a host processor. The method assists a calendar owner who receives a notice at his work station requesting his involvement in a future event that is being calendared by another calendar owner on the system, to develop different responses to the requests automatically based on criteria that are pre-established by the invitee/owner and data that is included in the invitation. The criteria may include such items as the name of the event originator, a specific ID of the event, a subject for the meeting, the place of the meeting, the time of the meeting or various combinations of the above. Responses which are automatically returned may include a confirmation, a rejection, or some qualified form of either, such as a tentative confirmation.

Abstract: An electronic calendaring method for use in a data processing system having a plurality of interactive type workstations connected to a host processing unit in which the event calendaring process permits the availability of requested event resources to be confirmed automatically during the calendaring of certain events such as meetings which involve participation of a plurality of other calendar owners that are designated in a "Names List" unique to that meeting.

Abstract: A method to manage the operation of a coprocessor in a virtual memory type data processing system in which an Input/Output channel and an Input/output channel controller interconnect the coprocessor to the main processor and system memory. A Virtual Resource Manager (VRM) comprising a group of interrelated software programs function in the system to establish virtual machines that execute application programs concurrently. A Coprocessor Manager component of the VRM establishes a Virtual Machine in which the compressor executes application programs that cannot be executed on the main processor. The coprocessor is mounted on an integrated circuit card which is inserted into a `mother board` socket which contains the main processor and related components.

Abstract: A method for use in an expert system which selectively allows the system to avoid asking the user a question by providing the answer to that question based on related information that may have been previously attained in the system. The method involves providing an action attribute that can be attached to any node in the rule tree. The attribute is assigned to a node in the tree which provides an answer to a class question based on processing various other dependent nodes. When the answer is obtained, the action attribute then causes all other nodes in the rule base referencing the same class question to be set to the same answer. The user is therefore only requested to supply information as a last resort.

Abstract: A memory management system method increases the size of a segment in blocks of 64K virtual pages in response to the system detecting that the requested page has been protected. The conventional UNIX type System Calls create and open files in virtual memory. All pages are protected "read only" until a SHMAT type System Call is made to operate on a page at a specific address. At that point in the process, a protection exception is recognized by the system and the UNIX kernel takes control to remove the protection and update the appropriate data structures to reflect the new status of the page and the addresses in real memory where the page may be found. Segments containing mapped files are also extended by the method.

Abstract: A method and system for controlling the display of data in a data processing system that includes a main processor, a memory subsystem, and an Input/Output subsystem which includes an I/O Channel Controller for managing traffic on an I/O bus having an attached co-processor and a plurality of I/O devices including display devices with different reserved I/O address space. The main processor can establish different display modes for displays having different reserved I/O address space, which generally indicates different display types. In one mode, a display is assigned exclusively to the main processor and attempted data transfers by the co-processor to that display are suppressed. The display control means is based on logic circuitry associated with the co-processor for trapping instructions having addresses within the range of those reserved for the display devices.

Abstract: A method for solving problems using an expert system in which the Rulebase includes a section having specific definitions of processes or procedures which are available to the expert system as a data source. The method allows data to be collected dynamically in response to and in accordance with parameters supplied by the expert system and at a time determined by the expert system. The ability of the expert system to provide meaningful conclusions is considerably enhanced when such type of data is made available since any process or procedure that can be executed on the host for the expert system can become a source of current data for analysis by the expert system. Computer hardware diagnostic applications can include running self-diagnostic procedures even on the host system.

Abstract: A method for accessing information in a page segmented virtual memory data processing system in which virtual machines running UNIX type operating systems are concurrently established, and in which a memory manager controls the transfer of information between primary and secondary storage devices in response to the occurrence of page faults.The method establishes a plurality of data structures in a dynamic manner in response to a Supervisor call to "map" a file. The mapping process assigns a new segment of virtual memory to the mapped file and correlates, in one data structure, the virtual address of each page of data in the new segment to a disk file address where that page is actually stored.A UNIX system call by an application program for a specific virtual page is handled by the page fault hanger, and not the UNIX kernel, since the application can supply the real address of the page on the disk file from the data structure that was created by the mapped page range Supervisor call.

Abstract: A method for facilitating the interchange of data in a UNIX* file between two UNIX processes being run concurrently on two virtual machines in a page segmented virtual memory virtual machine type data processing system. A Shared Copy-On-Write (SCOW) command is created for the UNIX type operating system which when executed in response to a system call from one processes causes the specified UNIX file to be mapped to a unique segment of the virtual memory. A map node data structure is established for storing the ID of the unique segment and for maintaining a count value of the number of user sharing the unique segment. A system call to the SCOW command by the second process involving the same UNIX file checks the map node data structure to see if the file is currently mapped for the SCOW mode. Subsequent instructions in the application programs which are run concurrently on the virtual machines operate on the copy of the file in the unique segment so that any data that is changed, i.e.

Abstract: A method for use in a virtual memory data processing system employing a pageable External Page Table data structure for recording current status and disk address information for each virtual page in said system, provides improved system performance when a large number of virtual pages are to be operated on in the same manner. In accordance with the method, each page of External Page Table entries can record a predetermined number of entries (512), depending on the byte capacity of each virtual page (2,048) and the size of each entry (4 bytes). One page of 512 entries correspond to 1 megabyte of virtual storage (512.times.2,048) and also appears as one entry in a pinned External Page Table. The pinned External Page Table is referred to as the "XPT of the XPT," and has the same format as the pageable XPT. A 256 megabyte segment of virtual memory is representable in the XPT of the XPT by 256, 4 byte entries, or one-half of a page.

Abstract: A straight boomerang which may be massed produced and which provides consistent and reproducible flight characteristics, is constructed based on an analysis of the aerodynamic forces which are operable on the boomerang during its flight and the use of a material which eliminates or minimizes density gradients along both the longitudinal axis and the width axis. In addition, the weight verses lift area ratio is chosen to facilitate the transition of the longitudinal axis of the boomerang immediately after release from a vertical position to a horizontal position which is key to a successful flight pattern.

Abstract: A method to logically serialize a plurality of independent system events in a virtual memory data processing system. Each event causes interrupt servicing routines to be executed and requires data structures that record the status of virtual pages to be updated. The system events include the interrupt that is generated as a result of a page fault, the interrupt that is generated as a result of a paging I/O completion operation that resolves a page fault, and lastly interrupts generated in response to a supervisory call to a paging service.

Abstract: A data processing system having a main processing unit, a memory subsystem, and a co-processor selectively connectable to said memory subsystem through an Input/Output Channel Controller which includes a control means for arbitrating access to the I/O Bus among the co-processor and the other I/O devices connected to the Bus. Since the co-processor runs programs stored in the memory subsystem, there is a tendency for the co-processor to monopolize the bus with instruction fetch cycles, thereby excluding other I/O devices from access to the bus. The control means for arbitrating responds to requests on the basis of a linear priority scheme in which the co-processor has the lowest priority. Each device, except the co-processor, is permitted to keep control of the bus until it voluntarily relinquishes it. The co-processor, on the other hand, relinquishes control of the bus in response to a request for access by any higher operator.

Abstract: A method for editing graphic objects in an interactive draw graphic system, in which the operator is allowed to select one of two editing modes which results in a graphic object being either redefined or remaining as is when a graphical editing action is applied only to a portion (sub-object) of the object. In the REDEFINE mode, the graphic editing action e.g., stretch, shrink, scale down, rotate, etc., applied to a sub-object results in the line segments of the object that are attched to the ends of the sub-object to be redrawn or "rubber-banded" as the sub-object is edited (moved). In the AS-IS mode only the sub-object is affected by the graphic editing action and the rest of the object is not altered.

Abstract: A method is described for editing graphic objects in an interactive draw graphic system which selectively displays a menu of available editing actions in response to operation of one mouse button by the operator and allows the operator to cursor select the specific edit action from the menu to be made active by operating a second mouse key. The operator may also cursor select the object to be edited by operation of the second mouse key. Once the editing action is selected and made active, the menu is hidden (not displayed) and the editing action remains active in the system until positive steps are taken by the operator to either terminate the edit function or change the active editing action. The operator, therefore, does not have to return to the selection process after each specific editing operation. The previous editing operation is implied for the next edit operation.

Abstract: A method for editing sub-objects in an interactive draw graphic application which allows the operator to apply the edit action to the sub-object without affecting the rest of the object. Vertices of the object that are defined by the adjacent common end points of the sub-object are assigned attributes that either permit or prevent the end points from being separated during the sub-object editing process. If the end points are permitted to separate, actual separation is determined by the operator during the sub-object selection action and is based upon whether the point of selection is in the center third of the sub-object or the end third of the sub-object adjacent the vertex to be separated.

Abstract: A method is described for editing a graphic object being displayed by an interactive draw graphic system. The method is directed to a rotate edit action on a graphic object that can be selected from a group of individual objects that are being concurrently displayed in an overlaid fashion on the same screen. The method permits the operator to move the cursor that is involved in the object selection task away from the object after the object selection task is completed so that the cursor can be positioned in an uncluttered area of the screen. The direction of movement of the cursor is along the line extending from the center of the object through a point or line segment of the object that was adjacent the cursor the time the object was selected. When cursor motion is under the control of an input device, such as a mouse, the operator's efficiency and accuracy is increased since the desired amount of rotation becomes easier to obtain as the distance between the object and the cursor increases.