Abstract: A new LZW compressor implementation architecture utilizes a plurality of prefix tables corresponding to respective prefix codes. A string is stored by storing the code associated with the string in a prefix table corresponding to the code of the string prefix at a prefix table location corresponding to the extension character of the string. A search for the longest matching string is performed by determining if the prefix table location is empty corresponding to the currently fetched character in the prefix table associated with the code of the currently matched string. If the location is not empty, it is storing the code of the string comprising the currently matched string extended by the currently fetched character. This string code is used as the next match with which to continue the search with the next fetched character. When the location is empty, the longest match has been determined to be the currently matched string.

Abstract: The data compressor utilizes a plurality of character tables arranged in levels for storing strings of data characters, the character tables corresponding to respective characters of the alphabet. A string is stored by storing the string code associated with the string in a character table corresponding to the extension character of the string in a location of the character table corresponding to the code of the string prefix. The character tables at the first level store 2-character strings and the character tables at a subsequent level store strings that are one character longer than the strings stored in the character tables at the level prior thereto.

Abstract: A method and system for preventing hung calls on a channel of a network interface device of a voice messaging system is described. A channel of the network interface device receives a new incoming call from the telephone network. If no other call is in progress on the same channel as the one on which the new call was received, the new incoming call is accepted. On the other hand, if another call is already in progress on this channel, the other call is terminated and the new incoming call is rejected. At this point, the network interface device is ready to accept any subsequent calls received on that channel.

Abstract: A data compressor includes a matrix of AND-gates corresponding to a respective plurality of strings. An AND-gate has inputs responsive, respectively, to a representation of a prefix code and a representation of a fetched character for energizing the AND-gate output. The AND-gate outputs are coupled, respectively, to the inputs of a matrix switch and the matrix switch outputs have respective string codes assigned thereto. The matrix switch is controllable for coupling any one of the matrix switch inputs to a selected one of the matrix switch outputs. Energization of an AND-gate output coupled to a matrix switch output provides a representation of the code assigned thereto. A prefix decoder responsive to the provided representations of codes assigned to the matrix switch outputs provides decoder outputs to the prefix code inputs of the AND-gates. A character decoder responsive to fetched characters provides decoder outputs to the character inputs of the AND-gates.

Abstract: A low-cost, self-contained close-off for a cabinet is formed as a generally planar body which is provided with integrated hardware for facilitating the attachment of the close-off to the cabinet, and subsequent detachment of the close-off from the cabinet. The planar body preferably incorporates an embossed region for providing the close-off with structural integrity, and is preferably fitted with integrated latches for securing the close-off to the cabinet. Support features are also preferably mated with the planar body including guide pins and embossed locators for positively locating the close-off relative to the cabinet at a proper height and in a correct orientation.

Abstract: A messaging system comprises a storage unit for storing e-mail messages, a text-to-speech converter for converting the different text segments of e-mail messages into speech signals for playback to a user via a telephone handset, and a cache for storing the speech signals of selected ones of previously converted text segments. Upon a subsequent request by a user to convert the text segments of a new e-mail message to speech signals for playback via a telephone handset, the speech signals of previously converted text segments that are identical to any text segments of the new e-mail message are played back from the cache thus avoiding the need for the text-to-speech converter to convert those text segments of the new e-mail message to speech. The load on the text-to-speech converter is thereby reduced.

Abstract: Poisoning of specific memory locations as a process when a part of a multiprocessor computer system becomes faulty leads to ability to isolate specific data owned by individual failing units even in a shared memory area. Also continuous processing by non-failing units is allowable. A support processor handles non-immediate problems and allows resetting of memory locations formerly owned by failed units.

Abstract: An emulation system functions to translate instructions comprising a target application of a target system into corresponding instructions native to a host system and executes the instructions on the host system. During execution, the emulation system encounters target disk read/write operations. As the memory architectures of the host and target computer systems differ, the data in host memory is conformed to a target memory format when data in keyboard memory buffer is processed. Also, the host and target disk controllers cause storage of data on diskettes in differing byte orders. However, the emulation system performs disk/read write operations without byte-reversal prior to disk-write or subsequent to disk read operations. Thus, the host does not produce storage media having data conforming to that of target storage media.

Abstract: An LZW compressor implementation architecture utilizes a plurality of limited length character tables corresponding to the respective characters of the alphabet. A string is stored by storing the code associated with the string in the character table corresponding to the extension character of the string at a character table location corresponding to the code of the string prefix. A character table is created when the character corresponding thereto is first encountered in the input. The input data character stream is searched by comparing the input stream to the stored strings to determine longest matches therewith. The codes associated with the longest matched strings are outputted so as to provide an output stream of compressed codes. The respective lengths of the character tables are limited in accordance with the frequency of occurrence of the characters of the alphabet.

Abstract: A system, method, and adapter card for providing, via a network, emulation of a console of a host computer system on another, remotely located computer system on the network, includes the ability to remotely control a peripheral device connected to a peripheral device interface controller on the adapter card. The adapter card further comprises a processor, a network interface controller providing a connection to the network, a communications client program executing on the processor, and at least one computer-readable medium having stored therein a modified BIOS extension for said peripheral device interface controller. The modified BIOS extension comprises first program code and second program code, the second program code being embedded within the first program code and defining a separate server program.

Abstract: A system for indicating to a message subscriber when a message has been left for that subscriber accommodates multiple time zones by providing information to the subscriber related to the subscriber's time zone indicating that the message was left. When the caller leaves his message, the caller's time zone is determined based the caller's phone number's time zone determined from a database corresponding these data. Then the subscriber's local time zone is determined. The difference in time zones is determined and the time indicated to the subscriber is related to the subscriber's time zone, not the caller's, by adding or subtracting the appropriate amount of time indicated by the difference in time between the time zones to give the subscriber the time of the call in the subscriber's local zone.

Abstract: Audit Trail recovery is enhanced by including addresses of immediately prior periodic saves of all active or open Steps or transactions in each new period save area. Reduced cost in main memory usage and on-the-fly processing to accomplish audit trail format that enhances recovery time results from ability to immediately address next prior period save data once a last periodic save is found in reading back the audit trail. Reading back the audit trail to find the last periodic save can be avoided too by directly addressing the last periodic save in preferred embodiments since the computer system will in all events temporarily maintain a record of the address of the last periodic save to record the next time a periodic save is to be made, so this temporarily maintained record can be accessed and used to jump directly to the last periodic save address on the audit trail.

Abstract: A method and apparatus for ensuring the coherence of multiple copies of the same data at multiple geographic locations is presented. The system operating system, the system operator or some combination of both may determine the physical disks having the file or comprising the disk families containing data which requires protection. Using the MIRROR CREATE commands in a Unisys MCP operating system environment, a mirrored disk pack set is made for each relevant physical disk identified. The disk pack set is distributed amongst at least two geographic locations. For each member of each disk pack set, the STORESAFE+command associates a site identifier with the member corresponding to the member's geographic location. During application processing, disk writes for one member of a mirrored set are performed for each member of the set. The MCP operating system checks the results of each disk write to each of the members of the mirrored disk set.

Abstract: A distributed messaging system comprises a first node including a first messaging platform and a first voice file, wherein the first messaging platform is provided with read/write access to the first voice file. In addition, the system includes a second node having a second messaging platform and a second voice file, and having read/write access to the second voice file. The first messaging system is further provided with read only access to the second voice file, and the second messaging system is further provided with read only access to the first voice file.

Abstract: A modular, expandable, multi-port main memory system that includes multiple point-to-point switch interconnections and a highly-parallel data path structure that allows multiple memory operations to occur simultaneously. The main memory system includes an expandable number of modular Memory Storage Units, each of which are mapped to a portion of the total address space of the main memory system, and may be accessed simultaneously. Each of the Memory Storage Units includes a predetermined number of memory ports, and an expandable number of memory banks, wherein each of the memory banks may be accessed simultaneously. Each of the memory banks is also modular, and includes an expandable number of memory devices each having a selectable memory capacity. All of the memory devices in the system may be performing different memory read or write operations substantially simultaneously and in parallel.

Abstract: Methods and apparatus that enable a first network protocol provider, executing on a first computer system, and a second network protocol provider, executing on a second computer system which is directly interconnected to the first computer system, to communicate at high speed, with low latency, over the interconnection therebetween such that both systems may use their native mechanisms to communicate with each other without change in those mechanisms, rather than over conventional network communication paths such as Ethernet. An interconnection couples the input/output (I/O) subsystem of the first computer system to the I/O subsystem of the second computer system such data can be transmitted between the systems, and a virtual LAN (“VLAN”) device driver executing on the second computer system provides an interface between the interconnection and the native communications mechanisms of the second computer system.

Abstract: A magnetic read head assembly and method for recognizing magnetic ink characters involves the scaling of peak information based on a second waveform. The read head assembly includes a first read head for generating a first waveform in response to a magnetic field of a magnetic ink character printed on a document. A second read head generates a second waveform in response to the magnetic field of the magnetic ink character. The read heads have a known head spacing, where the known head spacing defines an actual distance between the first read head and the second read head. In operation, peak information is determined for the character based on the first waveform. The peak information is scaled based on the first waveform and the second waveform. The scaled peak information is then compared to peak profiles, where the profiles correspond to known magnetic ink characters. Scaling the peak information based on the second waveform eliminates the need for precise knowledge or control of the document velocity.

Abstract: A decompressor recovers and outputs a stream of data characters corresponding to an input stream of compressed codes. The decompressor includes a dictionary that stores strings of data characters having respective codes associated therewith. A currently received compressed code accesses the dictionary to recover a string and the decompressor outputs the characters of the recovered string so as to provide the output stream of data characters. An extended string is inserted into the dictionary that comprises the string corresponding to the previously received code extended by the first character of the recovered string. A code is assigned to the stored extended string. The decompressor maintains counts of inserted extended strings that have the same extension character for respective characters of the alphabet.

Abstract: A door for a computer cabinet and method of constructing the same, with the door comprising a panel that is manufactured from a planar material, that has a corrugated cross-sectional profile, and that defines a plurality of perforations. The panel is adapted for attachment to the computer cabinet.

Abstract: A computer-implemented system and method for allowing users to interactively develop search queries is provided. The system performs query development utilizing a hierarchical concept tree stored in memory, wherein the nodes of the concept tree are concepts that describe various search topics. Parent/child relationships are created between the concepts, with children concepts describing sub-categories of a parent concept, and so on. Any concept at any level in the tree structure may be related to one or more character strings descriptive of the related concept. Query development is performed by traversing the various relationships in the hierarchical tree structure to selectively add related character strings to a potential query. According to one embodiment, the user is allowed to control the manner and extent of the traversal, and is further allowed to de-select any located concepts and character strings for further use in query development.