Abstract: A context switching logic cell with public and context private data sharing for use in a context switching system. A context switching logic cell includes a programmable logic unit using configuration bits for implementing programmable logic functions for each context, a context memory for storing and providing results of context dependent logic operations, and carry logic. The context memory includes private registers, public registers and an active register. Each private register corresponds to a context and is addressable only within the corresponding context while public registers are addressable within all contexts and the active register stores results of logic operations for the current context. A context switching logic cell may include a data memory that is accessible within all contexts. The context switching logic cells may be arranged into a context switching logic array for use in a context switching system by level 1 buses and carry bit lines.

Abstract: The emulation of a first system disk drive on a second processing system including a second system user level process including first system user and executive tasks issuing disk input/output requests. An emulator level is interposed between the second system user level process and a kernel level and includes a pseudo device driver corresponding to the first system disk drive and the kernel level includes a kernel process corresponding to the pseudo device driver and emulating the disk drive. The pseudo device driver and the kernel process execute in a second system process to emulate the operations of the disk drive and the kernel process emulating the disk drive is a file input/output process. The pseudo device driver includes a pseudo device queue, a return queue and a queue manager responsive to first system disk input/output instructions and to completed disk operations.

Abstract: A handwritten character recognizer having an input cluster buffer and a point buffer with dynamic and static stroke feature extraction and segment analysis by conical boundaries for identification of stroke segments dynamic stroke feature extractor static stroke feature extractor. A stroke recognizer compares single copies of idealized stroke representations with hierarchically approximated multiple scaled topological representations of a current stroke, followed by stroke proportion discrimination comparing a selected topological representation of the current stroke with boundaries defined by linear combinations of features of direct and reversed ideal stroke prototypes to provide a stroke identification. A cluster recognizer maintains a time ordered current stroke buffer and previous stroke buffer and constructs a per stroke area of influence list. The time ordered buffers are scanned to generate a spatially ordered window buffer.

Abstract: An emulator executes on a second data processing system as a second system user level process including a first system user level program, a first system executive program, and first system user and executive tasks. An emulator level is interposed between the second system user level process and a kernel level and contains pseudo device drivers. Each pseudo device driver corresponds to a first system input/output device. The kernel level includes kernel processes, each kernel process corresponding to a pseudo device driver. The second system hardware platform includes a plurality of second system input/output devices, wherein each second system input output device corresponds to a kernel process. Each combination of a pseudo device driver, a corresponding kernel process and a corresponding second system input/output device executes in a second system process and emulates the operations of a corresponding first system input/output task and the corresponding first system input/output device.

Abstract: An first apparatus for searching a collection of words based upon an input word, the first apparatus including means for generating a first set of words containing members that are lexically related to the input word, the first set of words including words that are other than regular inflectional nouns; and a search engine for searching the collection of words to detect the occurrence of any of the words from a group of search words, the group of search words comprising the input word and the first set of words.

Abstract: A multi-layer abstraction bucket mechanism connected between applications programs and at least one data source and providing to the users transformations of data and the results of processes performed on the data. The multi-layer abstraction bucket mechanism includes hierarchically connected abstraction layers, each including a methods object for storing methods for performing operations on data received from a data bucket of a hierarchically next lower abstraction layer, a data operation object for selecting a method to be executed by the method object, a data bucket for storing the results of an executed method, and a map for storing information for constructing the data bucket and for relating requests to methods residing in the methods object. The mechanism includes a data extraction layer and an abstraction layer. At least one abstraction layer is a data transformation layer while others include a data processing layer and a rules transformation layer for performing the rule based decision operations.

Abstract: A device access controller residing in a first computer system for transferring virtual inputs and outputs representing operations of the first system between the first system and a second system. The device access controller includes a video controller for performing video display operations, a video memory for storing video data representing operations of the first system, a network controller for transferring information between the first system and the second system, a controller processor, and a device access controller bus interconnecting the video controller, the network controller and the processor.

Abstract: An electronic mail facility for dynamically adding a direct electronic mail capability to applications programs in a computer system having an integrated operating environment and connected to a plurality of electronic mail systems and including mail modules providing a drivers and interfaces to the mail systems, an administrative module, a user interface and a data interface. The administrative module includes a mail system manger including a mail system detector for detecting each of the mail systems and a mail system table for selecting and enabling a current one of the electronic mail modules and an application program manager for detecting the invocation of an application program to be supported by the electronic mail facility. The user interface includes user interface modifiers, each including a user interface representation of an electronic mail operation and an electronic mail procedure, including resources, scripts and macros, and drag and drop icons.

Abstract: A link manager for a computer system including data objects and application programs for performing operations on the data objects wherein container objects contain references to linked data residing in server objects and including a link mechanism for invoking a server application program for providing linked data to a presentation window. The link manager includes a reference selector selecting a single reference to linked data in a container object and a moniker generator to generate a moniker identifying a server object containing the linked data. The link mechanism responds to the moniker pointer by invoking a server application program to open the server object and provide the linked data to the presentation window. Each reference includes a file name and a path name and a search mechanism determines the server object directory path, which is used in generating the moniker.

Abstract: A method enables a dithered representation of an image to be converted to a continuous tone representation of the image. This undithering method compares the regions of dithered representation with sections of dither patterns to determine an appropriate continuous tone representation from which the dithered image could have resulted. When the continuous tone representation is found the region is converted into a continuous tone representation. This procedure may be spatially iterated on a pixel by pixel basis until all of the initial representation of the image is converted into a continuous tone representation. The procedure may also be modified to account for line art. Furthermore, the procedure may be applied to produce adjustments in the size of the picture including miniaturizations and enlargements of the original image. In accordance with this application, dithered portions of the original image are redithered in a manner to produce a alternative size output image.

Abstract: An apparatus for generating an index for a collection of words, the apparatus including means for selecting an input word from the collection of words; means for generating words that are lexically related to the input word, wherein the input word and the lexically related words form a group of words; and an indexing engine for representing the occurrence in the collection of words of any of the members of the group by a single member of the group.

Abstract: A method and apparatus for providing access to database data by applications programs executing on a computer system wherein a database bucket mechanism is interposed between one or more application programs and one or more databases. The bucket mechanism is comprised of an applications interface communicating with each of the applications programs in their native modes and a bucket engine generating "buckets" containing "bucket objects". Each bucket represents a group or class of database data members and contains one or more bucket data objects containing members of the databases, a database object mapping the bucket data object to the databases and an access object containing methods for accessing the databases in their native modes. Buckets and bucket data objects are constructed by the bucket engine according to information stored in an object map and a table map.

Abstract: A layered communications bridge mechanism connected between an upper communications layer of a first communications layer mechanism executing in a user level process and a layered communication kernel process of a second system corresponding to the next lower layers of the first communications layer mechanism. The bridge includes an upper bridge mechanism operating to appear to the lowest layer or the layers of the first communications layer mechanism to be the next lower layer of the first layered communications mechanism and a lower bridge mechanism operating to appear to the upper communications layer of the second system kernel process to be the next higher layer of the communications layers of the second system and the upper and lower bridge mechanisms operate to map between the operations of the lower layer of the first communications layer mechanism and the upper layer of the layered communications layers of the second system.

Abstract: A memory translation mechanism and method executing in a second system to perform first system memory operations for first system executive and user tasks executing on the second system which includes a second system memory organized as a plurality of memory segments, wherein first memory segments are designated to correspond to system memory areas and second memory segments are designated to correspond to user memory areas, and wherein each memory segment corresponds to a combination of a type of first system task and a type of a first system memory area. An interpreter maps by reading an identification of the type of the task corresponding to the first system virtual address from the task type memory and the area type value from the first system virtual address and determining a memory segment corresponding to the type of the first system task and the type of first system area referenced by the first system virtual address.

Abstract: A commuications control system for distributing execution of communication connecting among the service access points of a local multiprocessor computer system and remote computer systems interconnected by a communications network. A load balancing module includes a local user list for storing the number of communications connections being executed by each local access point and a remote user list for storing the number of communication connections between each local service access point in the local computer system and each remote service access point.

Abstract: The subject invention is directed to a database system for organizing large amounts of data to be accessed by a digital computer. More particularly, a free form type database, in the form of a summarized, multikey tree, is built from files stored on the computer. After a building operation, the user obtains specified information by using the summarized database. Information in the files is divided into three categories; that is, a dimension field which comprises data to be organized, a summary field which comprises a numeric quantity on which calculations can be performed, and a non-summary field which comprises other information associated with an input record. The internal nodes of the tree summarize and organize sets of input records. Methods are provided for reducing the amount of storage space used by cutting off the tree when the size of sets go below a given threshold, and sharing parts of the tree so that each record does not appear n! times in the database.

Abstract: A communications control system in a multi-processor system includes a connection distribution data structure, including, for each central processing unit, a connection count means for storing a number representing the number of communication connections currently being executed by the corresponding central processing unit, and a gate driver interface service module. The gate driver interface service module is a single task resident in the computer system memory with an active invocation in a single central processing unit of the processing system. The gate driver interface service module responds to each request by selecting the central processing unit presently executing the least number of communication connections, and assigning the communication connection to the central processing unit for execution by constructing a corresponding control block containing the identification of the central processing unit assigned to execute the communication operation.

Abstract: The subject invention is directed to a database system for organizing large amounts of data to be accessed by a digital computer. More particularly, a free form type database, in the form of a summarized, multikey tree, is built from files stored on the computer. After a building operation, the user obtains specified information by using the summarized database. Information in the files is divided into three categories; that is, a dimension field which comprises data to be organized, a summary field which comprises a numeric quantity on which calculations can be performed, and a non-summary field which comprises other information associated with an input record. The internal nodes of the tree summarize and organize sets of input records. Methods are provided for reducing the amount of storage space used by cutting off the tree when the size of sets go below a given threshold, and sharing parts of the tree so that each record does not appear n! times in the database.

Abstract: The subject invention is directed to a database system for organizing large amounts of data to be accessed by a digital computer. More particularly, a free form type database, in the form of a summarized, multikey tree, is built from files stored on the computer. After a building operation, the user obtains specified information by using the summarized database. Information in the files is divided into three categories; that is, a dimension field which comprises data to be organized, a summary field which comprises a numeric quantity on which calculations can be performed, and a non-summary field which comprises other information associated with an input record. The internal nodes of the tree summarize and organize sets of input records. Methods are provided for reducing the amount of storage space used by cutting off the tree when the size of sets go below a given threshold, and sharing parts of the tree so that each record does not appear n! times in the database.

Abstract: A method of searching the directory of a database, held in the store of an information processing system, to identify an entry in the directory which most closely matches a search entry, each of said directory entries containing first, second and third fields, said search entry containing at least a first field, and each of said fields having the capability of including multiple parts: wherein the set of all directory entries which have the first part of the first field thereof the same as the first part of the first field of the search entry are retrieved from the directory; wherein all parts of the first field of each entry of said set are compared with a similar number of parts of the search entry and according to the degree of match of such comparison, a respective value is calculated for such degree of match; wherein similar comparisons are made between the second and third fields, if any, of each entry of the set and the search entry; and wherein the highest of such calculated values indicates the direc