Abstract: The disclosed data compressor compresses an input stream of data characters using LZW data compression. When the occurrence of a run of input data characters is detected, the run is processed by successively looking ahead into the input to determine the contiguous numerically increasing segments that exist in the run and by utilizing codes from the compressor code counter to correspond to the contiguous numerically increasing run segments. Alternatively, the detected run is processed by determining the length of the run and mathematically determining, from the length of the run, the respective codes from the code counter corresponding to the contiguous numerically increasing segments that exist in the run. Specifically, an iterative mathematical algorithm or a quadratic equation algorithm are utilized to process the run.

Abstract: The disclosed data compressor compresses an input stream of data characters using LZW data compression. When the occurrence of a run of input data characters is detected, the run is processed by successively looking ahead into the input to determine the contiguous numerically increasing segments that exist in the run and by utilizing codes from the compressor code counter to correspond to the contiguous numerically increasing run segments. Alternatively, the detected run is processed by determining the length of the run and mathematically determining, from the length of the run, the respective codes from the code counter corresponding to the contiguous numerically increasing segments that exist in the run. Specifically an iterative mathematical algorithm or a quadratic equation algorithm are utilized to process the run.

Abstract: In an LZW data compressor, the occurrence of a character run in the input character stream is determined and the run count is added to the existing code in the compressor code counter to generate a compressor code output representative of the run count. The LZW data decompressor subtracts the existing code in the decompressor code counter from the received compressed code to recover the run count. In accordance with a further feature, large length runs are processed by reducing the run count to less than the system maximum code by subtracting a selected predetermined constant from the run count. The reduced run count is outputted by the compressor preceded by a reserved code representative of the selected predetermined constant. In response to the received reserved code and the reduced count that follows, the decompressor adds the selected predetermined constant corresponding to the received reserved code to the received reduced count to recover the original run count.

Abstract: The disclosed data compressor receives an input stream of data characters and provides a corresponding stream of output codes. The compressor generates a sequence of numerically increasing output codes corresponding to numerically increasing contiguous segments of a detected run of the same data character. Non-run characters of the input stream are transmitted directly in synchronism with incrementing the codes of the code sequence. In one embodiment, the number of characters in the run segments are stored together with the respective codes representing the segments. In later encounters of a previously processed run, the stored data is accessed and the stored codes corresponding to the run segments are output as appropriate.

Abstract: A feature coordination interface between the Operating System (OS) and a Special Purpose Processor (SPP) in a computer system. Both the OS and SPP maintain a list of bit masks, identified by word numbers, where an associated bit is set in an associated bit mask if the OS or SPP supports a feature identified by the bit. During initialization, the OS transfers each of its bit masks to the SPP whereat features are compared. In response, the SPP sends each of its corresponding bit masks back to the OS together with an error indication if the OS does not support a feature required by the SPP. The OS compares its features with those of the SPP and enters an error shutdown process if the OS has received an error indication from the SPP or if the SPP does not support a feature required by the OS.

Abstract: The disclosed data compressor receives an input stream of data characters and provides a corresponding stream of output codes. The compressor provides a sequence of numerically increasing output codes corresponding to numerically increasing contiguous segments of a detected run of the same character. The number of characters in the detected run is determined and a mathematical algorithm, using the number of characters in the run, mathematically generates the appropriate sequence of codes. One disclosed embodiment utilizes a mathematical algorithm that iteratively diminishes the number of run characters by an iteratively increasing segment index. Another embodiment utilizes a quadratic equation algorithm that computes the codes from the number of characters in the run utilizing equations derived from the expression for the sum of the first n numbers. In a further embodiment, the number of characters in the run segments are stored together with the respective codes representing the segments.

Abstract: A dictionary based data compression and decompression system where, in the compressor, when a partial string W and a character C are matched in the dictionary, a new string is entered into the dictionary with C as an extension character on the string PW where P is the string corresponding to the last output compressed code signal. An update string is entered into the compression dictionary for each input character that is read and matched. The updating is immediate and interleaved with the character-by-character matching of the current string. The update process continues until the longest match is found in the dictionary. The code of the longest matched string is output in a string matching cycle. If a single character or multi-character string "A" exists in the dictionary, the string AAA . . . A is encoded in two compressed code signals regardless of the string length. This encoding results in an unrecognized code signal at the decompressor.

Abstract: A Resource Management System (RMS) including an RMS server having an RMS database containing files storing information on employees, employee skills, employee schedules and projects. The information in the files of the RMS database is obtained from external corporate databases as well as from direct entry. Calendar functionality is included for maintaining the scheduled activities of employees with different types of scheduled activities differently highlighted on a calendar display. Resource search and scheduling functionality is provided that identifies human resources possessing the required skills and availabilities for assignments to projects. Project parameters such as time requirements, skill requirements and proficiency levels are entered as parameters for defining the search. Assignment functionality assigns the identified employees to the projects and updates the system calendar to reflect the project assignments.

Abstract: Using LZW data compression/decompression processing techniques, textual input data is compressed by parsing consecutive words of the text into phrases and storing the phrases in a dictionary with compressed phrase codes associated therewith. The textual input data is searched by determining the longest match with the stored phrases in the dictionary and the compressed phrase code associated with the longest match is output to a compressed text database and stored at a location thereof. A list of references is maintained associated with each stored phrase to the locations in the compressed text database at which the compressed phrase code for the phrase is stored. Lists of word-to-phrase references are also created providing references for each distinct word encountered in the text to the stored phrases containing the word.

Abstract: A dictionary based data compression and decompression system where, in the compressor, when a partial string W and a character C are matched in the dictionary, a new string is entered into the dictionary with C as an extension character on the string PW where P is the string corresponding to the last output compressed code signal. An update string is entered into the compression dictionary for each input character that is read and matched. The updating is immediate and interleaved with the character-by-character matching of the current string. The update process continues until the longest match is found in the dictionary. The code of the longest matched string is output in a string matching cycle. If a single character or multi-character string "A" exists in the dictionary, the string AAA . . . A is encoded in two compressed code signals regardless of the string length. This encoding results in an unrecognized code signal at the decompressor.

Abstract: An associative memory is utilized to perform LZW data compression. The respective locations of the memory contain a prefix code field and a character field. A register containing a code field and a character field is associatively compared to the locations of the memory to determine if a match exists therewith. If a match is found, the address of the match is inserted in the code field of the register and the next input character is inserted in the character field thereof. This process is continued until no match occurs. The code existing in the code field of the register is transmitted as the compressed code of the string and the contents of the register is written into the next empty location of the memory. A next cycle is initiated by nulling the code field of the register and repeating the described steps.

Abstract: A platform for connecting to a CCS7 network for supporting concurrently running CCS related applications. Copies of the SUs flowing through the network are sent to the platform where the FISUs, LSSUs and MSUs are filtered to provide the desired SU type for each of the applications. The MSUs are filtered by MSU category and MSU type within category into groups of MSUs of particular interest to the applications, respectively. Linked lists of filter elements associated with the respective linksets of the CCS7 network perform the filtering by comparing category and type fields to the MSU categories and types to form the groups. Filter change data received at a user interface is utilized to modify the filters.

Abstract: A computer platform with a Call Billing application thereon monitors linksets of the CCS/SS7 network extending between Local Exchange Carrier (LEC) Signaling Transfer Points (STP) and Competitive Access Provider (CAP) switches such as End Offices (EO) and Tandem Offices, where the CAP switches have access to the LEC switching offices in the LEC area for providing service therein. The platform receives SS7 Signal Units (SU) copied from the linksets and filters the SUs to pass ISUP MSUs of message types Initial Address Message (IAM), Exit Message (EXM), Address Complete Message (ACM), Answer Message (ANM), Reset Circuit Message (RSC) and Release Message (REL). The application correlates a received IAM against subsequently received and filtered ISUP messages in accordance with correlation search keys Originating Point Code (OPC), Destination Point Code (DPC) and Circuit Identification Code (CIC) so as to correlate the filtered ISUP MSUs that originate, set up and terminate a call.

Abstract: In a network of computers having different operating systems with different message transport mechanisms, an interprocess communication layer (IPC) is interposed between applications hosted on the computers and the operating systems thereof. IPC presents a consistent interface to the application processes for message transport therebetween while linking to the intracomputer and intercomputer message transport mechanisms of the operating systems and the network. A process desiring to send or receive messages registers through a REGISTER function passing its system name and process identification (PID) assigned by the operating system to the process. To send a message, a process calls a SEND function passing the system name and system address of the recipient process. IPC attaches the recipient process PID to a message to be delivered.

Abstract: An associative memory is utilized to perform LZW data compression. The respective locations of the memory contain a prefix code field and a character field. A register containing a code field and a character field is associatively compared to the locations of the memory to determine if a match exists therewith. If a match is found, the address of the match is inserted in the code field of the register and the next input character is inserted in the character field thereof. This process is continued until no match occurs. The code existing in the code field of the register is transmitted as the compressed code of the string and the contents of the register is written into the next empty location of the memory. A next cycle is initiated by nulling the code field of the register and repeating the described steps.

Abstract: A platform for connecting to a CCS7 network for supporting concurrently running CCS related applications. Copies of the SUs flowing through the network are sent to the platform where the FISUs, LSSUs and MSUs are filtered to provide the desired SU type for each of the applications. The MSUs are filtered by MSU category and MSU type within category into groups of MSUs of particular interest to the applications, respectively. Linked lists of filter elements associated with the respective linksets of the CCS7 network perform the filtering by comparing category and type fields to the MSU categories and types to form the groups. Filter change data received at a user interface is utilized to modify the filters.

Abstract: A voice messaging service system for caller accepted voice store and forward service. The service offering prompt is issued during dial tone in response to caller off-hook, advising that the service can be accepted by the caller if the call to the intended recipient is not completed. Alternatively, the service offering prompt is delayed after caller off-hook for a time interval sufficient for the caller to dial the telephone number of the intended recipient. As a further embodiment, the service is offered for acceptance by the caller without advancing the call to the intended recipient.

Abstract: In combination with the Network Application Platform (NAP), a Speech Interface to NAP (SPIN) creates or modifies a SPIN application for each language in which the prompts of a Network Application deployed on NAP are to be spoken. A prompt is mapped into a sequence of static and dynamic elements. Each SPIN application owns the prompt mappings, elements and element voice for the prompts to be played. The Network Application issues a PEP command to a Prompt Expansion Processor (PEP) to play an identified prompt in a language identified by a SPIN application ID. The command supplies the dynamic data to be played at the positions of the dynamic elements in the prompt definition PEP expands the command into a sequence of NAP Message IDs to play the sequence of NAP voice messages corresponding to the static and dynamic elements of the prompt mapping. The dynamic data is categorized into dynamic element types.

Abstract: A Voice Messaging System (VMS) offers a voice store and forward service to a caller on an incomplete call. The caller records the voice message at a Message Delivery System (MDS) via an Intercept Processing Unit (IPU) during a recording session. Call related parameters are transferred from the IPU to the MDS utilizing a handshake protocol specific to the IPU. The VMS accommodates different types of IPUs having different call parameter transfer protocols. The system displays, on the administration terminal, protocol maintenance screens including a generic list of call parameters with fields for entering the order and field length of selected parameters so as to designate a protocol specification to the system. The fields also include information regarding the delimiters utilized to separate the parameters of a parameter string and to designate the end of a parameter string. The protocol specifications are stored in protocol tables keyed by CALLTYPE designating the type of IPU calling the MDS.

Abstract: A platform for supporting telephone network applications includes Network Interface Units (NIU) for interfacing between the telephone network and the platform. A disk storage system stores voice messages to be sent over the network and voice messages received from the network. Voice messages are conveyed between the NIUs and the disk storage system by Voice Interface Modules (VIM). The platform is installed on a general purpose digital computer and includes an Applications Interface Module (AIM) responsive to an AIM command set including: SEND VOICE MESSAGE, CONNECT CALL, COLLECT DIGITS, INITIATE CALL, TERMINATE CALL, GET MESSAGE NUMBERS and PIVOT CALL. In response to SEND VOICE MESSAGE, a designated message stored on the disk system is sent to the network via the VIM. SEND VOICE MESSAGE has a RECEIVE VOICE MESSAGE option whereby a message is received from the network after the SEND data is transmitted and stored on disk.