Abstract: A computer-based method implements a customized instance of a dynamic interactive voice system for a customer. The method includes configuring a call flow that incorporates multiple call flow nodes within a framework of a predetermined interactive voice response (IVR) application. The call flow nodes include different node types that are interchangeable with respect to call flow incorporation. The different node types include at least one standard node and at least one preprogrammed designer tool kit (DTK) module. The DTK modules include an application separate from the predetermined IVR application. The call flow is stored in association with an identification of the customer and activated in response to a call received at an IVR port associated with the customized instance. Configuring the call flow includes displaying at least one data field relating to a parameter of each call flow node at a display terminal and receiving data defining the parameter.

Abstract: A computer-based method implements a customized instance of a dynamic interactive voice system for a customer. The method includes configuring a call flow that incorporates multiple call flow nodes within a framework of a predetermined interactive voice response (IVR) application. The call flow nodes include different node types that are interchangeable with respect to call flow incorporation. The different node types include at least one standard node and at least one preprogrammed designer tool kit (DTK) module. The DTK modules include an application separate from the predetermined IVR application. The call flow is stored in association with an identification of the customer and activated in response to a call received at an IVR port associated with the customized instance. Configuring the call flow includes displaying at least one data field relating to a parameter of each call flow node at a display terminal and receiving data defining the parameter.

Abstract: A computer-based method implements a customized instance of a dynamic interactive voice system for a customer. The method includes configuring a call flow that incorporates multiple call flow nodes within a framework of a predetermined interactive voice response (IVR) application. The call flow nodes include different node types that are interchangeable with respect to call flow incorporation. The different node types include at least one standard node and at least one preprogrammed designer tool kit (DTK) module. The DTK modules include an application separate from the predetermined IVR application. The call flow is stored in association with an identification of the customer and activated in response to a call received at an IVR port associated with the customized instance. Configuring the call flow includes displaying at least one data field relating to a parameter of each call flow node at a display terminal and receiving data defining the parameter.

Abstract: The present invention relates to a customer call routing menu employing an interactive voice response system (IVR) to process a call in a customer service center. The menu messages are provided in terms of customer tasks to be performed, rather than in terms of corporate units. Further, the menu messages are arranged and played to the caller in the order of the most frequently requested tasks and include terminology commonly used by customers.

Abstract: According to a system for switched cutover with paced transition, subscribers are transitioned to a new communication system while the capacity needed by the cutover facility is minimized. A cutover facility between a pre-cut switch and a post-cut switch for transitioning a first and a second set of subscribers from a first communication system to a second communication system is established. The migration of the first and the second set of subscribers from the pre-cut switch to the post-cut switch is begun. A transition midpoint is identified. The transition midpoint occurs when the number of subscribers migrated to the post-cut switch is equal to the number of subscribers remaining on the pre-cut switch. End office traffic routed to the pre-cut switch is then shifted to the post-cut switch in response to the transition midpoint being identified. Finally, the remaining subscribers are shifted to the post-cut switch. This transition may be performed using a slice-cut dial-with-dial transfer.

Abstract: Documentation is automatically generated having a specified format for a computer program having a source code consisting of a stream of characters. The ordering of the stream of characters follows a set of syntax rules. The set of syntax rules includes a set of reserved words. The specified format of the documentation and the set of syntax rules define a set of selection rules for selecting a set of selected character strings. The set of selected character strings includes at least one selected reserved word and at least one word affiliated with the selected reserved word. The stream of characters is read and the selected character strings are searched. Each time one of the selected character strings is found, at least one related character string affiliated with the found selected character string is stored in memory. After all the characters in the source code are read, the related character strings are retrieved.

Abstract: A method of sharing dataspaces among a plurality of applications on IBM mainframe computers. A DataServ Routing Table (DSRT) is anchored in an extended command storage area (ECSA) by a pointer stored in a SubSystem Communications vector Table (SSCVT) which also resides in the ECSA. The DSRT identifies all DataServ tasks using pointers to DataServ Vector Tables (DSVT), which are created by each DataServ task in the ECSA. Each DSVT contains a pointer to a DataServ task, as well as a pointers to associated Dataspace Information Element (DSIE) and DataServ Application Descriptor (DSAD) pools. The DSIEs contain a description of each dataspace created by the DataServ task. The DSADs contain a description of each application currently accessing a dataspace created by the DataServ task. Each DataServ task is responsible for creating one or more dataspace, mapping a linear dataset to the dataspace, and then making the dataspace available to authorized applications by creating its associated DSVT, DSIEs, and DSADs.

Abstract: A system and method for testing equipment in a telephone network is disclosed for remote maintenance and verification of subscriber loops. The system and method accommodates known AC and DC fault testing techniques while improving reliability by providing duplex verification of the subscriber loop identification.

Abstract: Playslip booklets are printed with bar code and numeric identification plus individual ticket identification numbers on each playslip. At purchase, the booklet is authorized for play through the telephone lottery computer, which provides a PIN for the booklet. To play, the bettor calls the telephone lottery computer and provides the booklet identification number and the PIN. The computer uses interactive voice capabilities to guide the player through play entry. For each lottery play, the bettor provides a playslip number. The selected lottery game wager numbers/symbols are verified by the player and may be recorded on the playslip. The telephone lottery computer returns a transaction number to be written on each ticket played to serve as a hard copy identification/verification of the transaction. The tickets then serve as the claim tickets required to collect a prize.

Abstract: Improved database structure is described in which the fields of each database record are divided into two classes, navigational and informational data. The data in the navigational fields is stored in a topological map which may be viewed as a tree structure or the merger of two or more such tree structures. The informational data is preferably stored in a conventional relational database. Each leaf node in the topological map specifies a unique record in the relational database.

Abstract: A telephone enclosure which provides wheelchair access while maintaining efficient usage of floor space is disclosed. The enclosure includes two telephone instruments. The enclosure may be constructed from mass-produced components while providing an appearance that can be customized for a particular business establishment.

Abstract: A packet routing network for outputting information packets from a plurality of network input ports to a plurality of network output ports, each packet having a destination address specifying one of the output ports to which the packet is to be sent. The packet routing network includes an arbiter for transmitting only packets having distinct destination addresses, an assignor for assigning each packet a packet bit sequence comprised of an input port label and a destination address, a plurality of parallel Banyan routers, and a distributor/selector for selecting one of the Banyan routers and one of a limited set of active router input lines of the selected Banyan router such that the distributed packets will not collide with any other packets while being routed through the Banyan router. The present invention utilizes preprocessing instead of sorting to achieve nonblocking in Banyan routers.

Abstract: A packet routing network for outputting information packets from a plurality of network input ports to a plurality of network output ports, each packet having a destination address specifying one of the output ports to which the packet is to be sent. The packet routing network includes an arbiter for transmitting only packets having distinct destination addresses, a plurality of parallel Banyan routers, and distribution and selection means for distributing packets having distinct destination addresses to the Banyan routers and selecting one of the Banyan routers and one of a limited set of active router input lines of the selected Banyan router such that the distributed packets will not collide with any other packets while being routed through the Banyan router. The present invention utilizes a preprocessing instead of sorting to achieve nonblocking in Banyan routers.

Abstract: An improved computer network which utilizes the communication lines of a telephone system to provide connections between computing equipment in geographically mode area is described. The network utilizes a plurality of network units which are coupled by communication links within a telephone system. Each of the network units transmits user data and commands directed to other network units. Each of the network units monitors transmission errors within the telephone system. The data transmission rate within the network can be automatically varied in response to the observed error rate in a manner which reduces transmission errors within the network. When the transmission errors subside, the transmission rate is automatically increased to provide greater data throughput. The network includes features that allow it to be topologically altered without the need to send telephone technicians to the various locations serviced thereby.

Abstract: A piezoelectric relay requiring less piezoelectric material than conventional piezoelectric relays is disclosed. The relay differs from conventional relays in that the contacts are touching with essentially no force applied between the contacts when no power is applied to the relay.

Abstract: An improved packet routing network is disclosed in which inbound packets do not have to arrive synchronously. The network includes collision avoidance circuitry and an m stage switching network where the number of input lines to the network is 2.sup.m. Each stage in the first (m-1) stages further comprises one or more line reducing circuits. Each line reducing circuit transfers each data packet input on an input line thereof to one of a plurality of output lines thereof. The number of line reducing input lines is greater than the number of line reducing output lines. The transfer is accomplished in a manner guaranteeing that no two data packets are output on the same line reducing output line.

Abstract: An apparatus for coupling data processing equipment to subscriber loops in a telephone system based computer network is disclosed. The multipoint communication network includes a plurality of network units with at least two of the network units comprising the apparatus in question. The network units are coupled to telephone system communication links. The network units transmit and receive digital data in a frame mode in which the data is organized into frames on the communication links. The network units also communicate with each other in a manner which allows the configuration and speed of the network to varied in response to the time of day and error rates observed on the telephone system communcation links.

Abstract: An apparatus for transferring digital data between time-domain multiplexed communication links of a telephone system which forms part of a computer network. A time-domain multiplexed communication link interface unit for transferring digital data between a first channel on a first time-domain multiplexed communication link and a second channel on a second time-domain multiplexed communication link of a multipoint communication network is disclosed. The multipoint communication network includes a plurality of network units with at least two of the network units comprising said time-domain multiplexed communication link interface units. The network units are coupled to telephone system communication links. The network units transmit and receive digital data in a frame mode in which the data is organized into frames on the communication links.

Abstract: A circuit for eliminating illegal data sequences from a data stream is disclosed. The circuit examines a portion of an input data stream. The previously received data sequence is then examined. If the previously received data matches an illegal sequence, the stored data is altered. The stored data is then outputted to form an output data sequence.

Abstract: A fiber optic telephone system is described in which a plurality of subscribers with different bandwidth subscriptions are each connected to the system by an optical fiber subscriber connection. Use of the subscriber connection beyond the subscription bandwidth is prevented by the installation of a bandwidth limiting device having a maximum transmitted bandwidth capacity above that of the subscription bandwidth but below that of the total bandwidth capacity of the subscriber connection.