Abstract: A small first level cache and large second level cache support a central processor in accessing necessary data for processing. The second level cache holds tag address words each having two status bits V and R. The V bit indicates validity/invalidity status while the R bit informs the second level cache of the validity/invalidity status of the corresponding address in the first level cache. As a result of the status information between the two caches, the spy-snoop operation and invalidation operation cycles are minimized as to the use required of the processor bus, enabling higher efficiency processor operations. Utilization is made of a smart-fill algorithm which selects the address locations for placement of new data in a second level cache for a Write operation and after a Read-Miss by analyzing the status values (V,R) for each address in order to minimize the overwriting of valid cache data.

Abstract: A system whereby a receiving module, in a mixed network of hardware and software-emulated modules, requires an Interrupt before it can use a Get Message OP to access a message from a message queue and which also provides a Fast Empty of messages in a message queue by eliminating the need for an Interrupt before each succeeding message access.

Abstract: The present invention is a computer software system that allows the developer of a speech-enabled system to create a grammar and corpus for use in the system. A table interface is used, and phrases in the grammar are entered into cells in the table. The table also includes token data which corresponds to each valid utterance. When the grammar is defined, the computer software system automatically traverses the table to enumerate all possible valid utterances in the grammar. This traversal generates a listing (corpus) of valid utterances and their respective tokens. This listing can then be used to interpret spoken utterances for a speech-enabled system. The computer software system also transcribes the grammar rules found in the table to a format compatible with a variety of supported commercially-available speech recognizers.

Abstract: An apparatus is provided for dissipating heat from a stacked circuit board assembly. The apparatus includes circuit boards that are oriented in spaced planes that extend substantially parallel to one another. A heat transfer means connected to the circuit boards transfers heat between the circuit boards. A heat dissipation means connected to at least one of the circuit boards dissipates at least a portion of the transferred heat.

Abstract: A system and method for transforming specialized data files of a first computer system into industry-standard byte-stream files usable for a second system or other systems. First and second programmatic interfaces of the first system can take the specialized format native data files and transform them into standard formatted byte-stream data files for placement in a storage media of a second computer system which can then be initiated to use a CD Writer package to cause the data files to burned on to a CD-ROM. This CD-ROM can then provide the byte-stream data file for use in many different types of platforms.

Abstract: A method for message transfers between digital modules in a network where some modules are hardware implemented and some modules are emulated in software. An Auxiliary Message Arbitrator Unit utilizes Main Memory storage for messages destined for receiving modules. Algorithmic sequencing means maintains chronological transfer operations of messages and uses hard and soft Interrupt signal queues to inform respective hard and soft modules of pending messages for them to retrieve.

Abstract: The disclosed method creates a source object for each source language element parsed by the compiler and associates each such created source object with objects created from source language elements to produce source-mapped objects.

Abstract: A telephony application capable of being updated while on-line is disclosed. The application supports a plurality of active dialogs with callers, and comprises functions, call flows, voice prompts, and on-line updating versions for making on-line modifications of the functions, call flows, and voice prompts. The modifications are coordinated so that selected sets of functions, call flows and voice prompts can be committed to use while one or more active dialogs are occurring without affecting the active dialog(s).

Abstract: A method in a computing system having at least one server and a multiplicity of clients coupled thereto by means of a network. The server executes a Web Server program and at least one of the clients executes a Web browser program. The method operates in the server and at least one of the clients for supporting dynamic access to objects stored in the server repository by the Web browser program. The method begins in the client by parsing Form description language to obtain references to objects stored in the server repository. For each reference to an object stored in the repository, a message is constructed for the Repository Object for transmission to the Web server. Within the Web server the message is used to retrieve the contents of the Repository Object from the server repository. Next, the retrieved contents of the Repository Object is returned to the client for association with its Data Name.

Abstract: Apparatus and methods for revising a field in computer program code. One method includes analyzing program code lines for the presence of the field and, if present, selectively revising the field from the first value range to a second value range. The field has a storage attribute of n bits, where n is at least eight bits; with the first value range being inclusively between zero and 99, and the second value range being inclusively between zero and 2.sup.n -1. The method can further include inserting an extended field representative of a base value into the program code, with the field being encoded as an offset value relative to the extended field. The method also can include creating a program code executable on a computer from the revised computer program code.

Abstract: A novel vector quantization encoding system comprises a conventional vector formatter and a novel gross quantizer. The vector formatter generates vectors to be searched in a full code book of vectors. The gross quantizer generates pointers indicative of subsets of vector indices. The vector indices are indicative of groups of vectors to be searched in the full code book that are substantially less in number than the number of vectors in the full code book. A search controller is employed to search only the subset of vectors in the full code book and produce as an output the index of the one vector in the full code book closest to the formatted vector being searched so that the quality of a full code book searched is made faster without degradation of a full code book search.

Abstract: A system and method is provided for assigning job numbers to fetch requests that are sent to a memory system in order and completed by the memory system out-of-order. A unique set of job numbers represent addresses in a memory fetch list. A valid register maintains status bits associated with the set of job numbers that identify whether a job number is assigned or available. Bits in the valid register are set when an associated job number is assigned and reset when an associated job number is completed. On assignment, a priority encoder selects any lowest available job number based upon the status of the bits in the valid register. In the preferred embodiment, the lowest available job number is selected.

Abstract: A zero clearance connecting system for use in locating and connecting together first and second housings, with each housing having a predefined interior envelope, is provided. The system comprises a locating and connecting pin having first and second ends attached to the first housing. A head is located at the first end of the pin and has a reduced diameter portion. A shank portion is located adjacent to the head and installed in an aperture defined in a surface of the first housing, with the head protruding from the surface by a predetermined distance. A slot having a large portion and a smaller portion is defined in a mating surface of the second housing. The smaller portion of the slot is in a complementary position to the head when the first and second housings are located and connected together. The large portion of the slot is sized for insertion of the head into the slot.

Abstract: A memory controller is described that comprises individual control segments for controlling memory that is divided into individual pairs of memory segments. The programmable memory controller provides improved average access times for memory devices by reducing the number of wait cycles between memory operations. A common data bus is shared between the memory segments. Each control segment provides individual sets of address and control lines to each memory segment so that control sequences can occur simultaneously between multiple control and memory segments. Accordingly, when a control sequence is in process within one segment, another control sequence can occur simultaneously in another segment. By overlapping control sequences in this fashion, the bandwidth of the data bus is increased by remaining idle less frequently. Each control segment provides a plurality of allow mode signals to the other control segment.

Abstract: A memory controller is described that comprises individual control segments for controlling memory that is divided into individual pairs of memory segments. The programmable memory controller provides improved average access times for memory devices by reducing the number of wait cycles between memory operations. A common data bus is shared between the memory segments. However, each control segment provides individual sets of address and control lines to each memory segment so that control sequences can occur simultaneously between multiple control and memory segments. Accordingly, when a control sequence is in process within one segment, another control sequence can occur simultaneously in another segment. By overlapping control sequences in this fashion, the bandwidth of the data bus is increased by remaining idle less frequently. Each control segment comprises a plurality of synchronous countdown register timers.

Abstract: A memory utilization value indicative of memory utilization associated with a data channel is received. A queue depth value indicative of the queue depth of messages located within a message queue maintained by the data channel is also received. A fuzzy logic design is executed with the memory utilization value in the queue depth value used as input parameters. A crisp value is then generated which corresponds to a window size of the data channel.

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: Disclosed are a method and system for transferring data objects from a server to a client in a distributed computing system. The disclosed method comprises the steps of: receiving, at the server, a request from the client for the data object; determining whether a cached copy of the requested object retained by the client is the same as a current version of the requested object retained by the server, wherein the cached copy and the current version are stored in a compressed form; and transmitting the current version of the requested object from the server to the client in the compressed form if the cached copy of the requested object is not the same as the current version of the requested object.

Abstract: Apparatus and method are provided which determine the geometric and logical structure of a document page from its image. The document image is partitioned into regions (both text and non-text) which are then organized into related "article" groups in the correct reading order. The invention uses image-based features, text-based features, and assumptions based on knowledge of expected layout, to find the correct reading order of the text blocks on a document page. It can handle complex layouts which have multiple configurations of columns on a page and inset material (such as figures and inset text blocks). The apparatus comprises two main components, a geometric page segmentor and a logical page organizer. The geometric page segmentor partitions a binary image of a document page into fundamental units of text or non-text, and produces a list of rectangular blocks, their locations on the page in points (1/72 inch), and the locations of horizontal rule lines on the page.

Abstract: A database and warehousing system including a media controller which provides instantaneous access of a snapshot of data for offline analysis by a data analysis host. A transaction host sends the data for storage to the media controller. The media controller stores the data in an original copy with a plurality of mirror images. Upon receiving a request for a snapshot of the data, the data analysis generates a snapshot copy by releasing a mirror image or the original copy. The snapshot copy is provided as a snapshot of data to the data analysis host. After completing processing of the snapshot of data, data analysis host sends a return ready signal to the media controller. In response, the media controller updates the mirror image in the snapshot of data and reconnects the updated mirror image to the transaction host.