Abstract: Soft handoff is provided in a mobile-to-mobile call in a cellular communication system, wherein a first mobile is moving from a first cell to a second cell, and the second mobile is in a third cell. The first mobile requests a handoff from the first cell to the second cell. In response, information regarding the call handoff is sent to the second and third cells. During handoff, the first and second cells receive radio transmission from the first mobile, and they both translate the transmissions into electronic data, packetize the data, and send the packetized data to the third cell. The third cell sends packetized data from the second mobile to both the first and second cells. Further, the second mobile may also move from the third cell to a fourth cell. The second mobile requests a handoff from the third cell to the fourth cell. Call data is sent to the fourth cell identifying the first and second cells. Call data is sent to the first and second cells identifying the fourth cell.

Abstract: A system for testing one or more communication network components comprising a network entity simulator for emulating message communication among network entities and the one or more network components under test, and a message processor for intercepting predefined messages between the network entity simulator and the network components to examine, change, or delete intercepted messages. A scheduler arbitrates usage of processing among the components, and a language processor provides an interface for a tester to control the simulator and message processor.

Abstract: In object-oriented systems, non-memory resources are both managed by objects and represented as objects. If an object managing or representing non-memory resources becomes unreferenced, the non-memory resources managed by that object are lost from the system. This invention provides, as a part of a garbage collection process that automatic recovers memory resources of unreferenced objects, a last-will method that is invoked for unreachable objects that have provided a method named "finalize." All unreachable objects that have a last will method are put on a list. A separate process is scheduled to run each last-will method on its object in the list. Objects that have become reachable as a consequence of the last-will method are preserved. The memory resources associated with objects that have remained unreachable after the execution of the last-will method are recovered. In this way both memory and non-memory resources are preserved for re-use.

Abstract: A system and method are described for enforcing the validity of circulating pointers stored in a pointer FIFO (first-in-first-out) memory. One or more target pointers are generated and compared to circulating pointers. If a pointer does not circulate through the system within a pre-specified time, then a pointer has been lost and an error is reported. If a circulating pointer matches a target pointer, it is suppressed by being removed from the set of circulating pointers. Another timer is then set to determine whether further circulating pointers match a target pointer. If so, then multiple pointers to the same location are present and all duplicate pointers are suppressed. After expiration of the second time, the target pointers are added to the set of circulation pointers. This process repeats with new target pointers, so that the validity of the set of circulating pointers is verified.

Abstract: A system and method for delivering called party identification to a called telephone wireless station set during paging of the called wireless telephone, or, advantageously, after call set up but before ringing starts. A control unit then may cause the called line to be displayed, may cause a distinctive ring to be made, or take other action depending upon its program.

Abstract: A system for delivering packetized data in a network comprising a plurality of packet switch communities, wherein each of the packet switch communities has a plurality of endpoints connected to a common packet switch and having a unique address, and wherein each of the endpoints has addresses unique to their respective packet switch community. The endpoints in this system add a two-part destination address to the packetized data to be sent, wherein the first field represents a packet switch community and the second represents a destination endpoint. Each packet switch community is responsive to the first field being different from its own address for delivering the packetized data to a switch. The switch is responsive to the first field for delivering the packetized data to a packet switch community identified by the first field. Finally, each endpoint in the destination packet switch community is responsive to the first and second address fields for accepting packetized data.

Abstract: A system and method for establishing licensor changeable limits on shared software usage without the licensor having access to the system on which the shared software is running. An encrypted numerical limit value is embedded in the licensed software (program); when the program is executed ("accessed"), as a first step, the program decrypts the limit value and compares it to the number of users currently accessing the shared program. If the number of users is less than the limit, then access is allowed. If the number of users is equal to (or greater than) the limit, then access is denied.

Abstract: A network monitor and associated control system is provided to monitor a toll network for customer signaling. A multi-tone signal processor and associated control is provided such that when signaling is detected, such signaling is validated against a provisioned list. A valid signal is reported to a central control of the network switch, which takes action in response to the signal.

Abstract: An exemplary CELP coder where gain adaptation is performed using previous gain values in conjunction with an entry in a table comprising the logarithms of the root-mean-squared values of the codebook vectors, to predict the next gain value. Not only is this method less complex because the table entries are determined off-line, but in addition the use of a table at both the encoder and the decoder allows fixed-point/floating-point interoperability requirements to be met.

Abstract: A method and apparatus for detecting dual-tone, multi-frequency (DTMF) digits and call progress tones by determining the amplitudes of preselected frequencies in a signal over a predetermined time period, and determining a candidate tone by selecting two of the preselected frequencies with the highest amplitudes and comparing the two selected frequencies to known DTMF and call progress tone frequencies. The amplitudes of the two selected frequencies are then tested against predefined thresholds corresponding to a candidate tone having the two selected frequencies. The candidate tone in the current time period is tested against candidate tones in previous time periods for consistency. If the candidate tone is a DTMF digit and passed all of the tests, then the DTMF digit is returned. If the candidate tone is a call progress tone, the pattern of the candidate tone over a plurality of predetermined time periods is recorded and tested against known patterns of the candidate tone.

Abstract: A line-based 911 system and method that completes an emergency call from a telephone to a PSAP comprising a multiplicity of operator stations connected by individual lines to a telephone switching system. An emergency call is routed to the termination ports of the switching system associated with a PSAP. Each of the termination ports is connected to one of the multiplicity of operator stations via its associated line, thereby establishing a path from the telephone to the operator station, the CPN of the calling telephone is delivered to the selected operator station and the operator station obtains location information of the telephone in accordance with the CPN, which is then displayed.

Abstract: An automatic call distribution system wherein, when no agent is immediately available, and the calculated delay before an agent is likely to become available is above a predetermined threshold, a record is made of the calling number (either received as part of call set up or inputs from the caller), and the record is queued. When an agent becomes available, or after a predetermined time, the ACD removes the top entry from the queue, places a call to the received calling number, and presents the call to an available agent.

Abstract: An interface to an integrated service, digital network (ISDN) line for up to two analog dual tone, multifrequency telephones and up to four personal computers or data terminals. A stored program-controlled processor controls access to the ISDN line for the analog and digital interface circuits. The processor also provides access to switch-controlled ISDN features for the analog telephones (e.g., call waiting, call hold, etc.).

Abstract: A fast packet switch comprising one buffer directly connected between a plurality of input ports and a plurality of output ports to effect rapid throughput of data packets. A pointer to a location in the buffer is allocated by a buffer manager upon receipt of notification of an incoming packet at the receiving input port and the input port delivers the packet as it is received to the location designated by the pointer. After the data packet is received, the input port delivers the pointer and a destination address for the packet to a router, which selects one of the plurality of output ports based on the destination address. The router queues the pointer in a queue for the selected output port. The output port then retrieves the data packet from the buffer using the pointer to determine the location, and transmits the data packet. After the transmission is complete, the output port returns the pointer to the buffer manager.

Abstract: An arrangement providing an internetwork identification in response to a broadcast message from a LAN client wherein the broadcast message comprises the LAN client's LAN address. The exemplary apparatus comprises a receiver for receiving a message from the LAN and a translator coupled to the receiver for providing a translation of the LAN address to an internetwork identification responsive to determining that the received message is a broadcast message request for internetwork identification. The translator comprises a first device for determining that the received message comprises a broadcast message request for an internetwork identification and a second device coupled to the first device and responsive thereto for receiving the LAN address and providing the internetwork identification. The second device may comprise a disk system or other writable, nonvolatile electronic device.

Abstract: A computer data backup method where copying of data blocks from one medium to another is deferred until a data structure, e.g. a bit map, is generated defining those data blocks that in fact contain data. The data structure is then read to copy to the backup medium the data-containing blocks as defined by the data structure. Since the data structure is generated before the copying is effected, a range of contiguous data-containing blocks is determinable such that all the blocks of that contiguous range may be copied as a single continuous operation. The magnitude of required backup storage is reduced by eliminating the copying of empty blocks in general unless the number of empty blocks between two ranges of contiguous data-containing blocks is less than a predefined number.

Abstract: A system for alerting a plurality of telephones in response to an incoming call to a destination directory number. A handling switch sends a query to a centralized database requesting routing instructions, and the database returns the directory numbers of the plurality of telephones to be alerted for incoming calls to the destination directory number. The busy/idle status of all of the plurality of telephones is checked, and an alerting signal is sent to all idle telephones. The handling switch is notified as to which alerted telephone has an off-hook appearance first, and the incoming call is routed to that telephone.

Abstract: A reaction barrier is formed at an interface region between adjacent layers of a multilayer composite integrated circuit by implanting one or more active ionic species at energies effective to place the ionic species at or near the interface. A further step may include annealing the structure formed above to promote efficacy of the reaction barrier.

Abstract: In a multi-layered integrated memory circuit, a method for using sacrificial layers and insulating "sticks" is disclosed to provide a contact between two layers, where the contact does not short to an intervening layer. This invention provides this with minimal extra processing by using sacrificial layers with appropriate etch and etch stop properties. As these layers are etched, additional layers which alternate in the same conducting/insulating pattern are exposed. Each etch stops on either a conductive or insulative layer. A contact layer may then be deposited which connects the uppermost capacitor plate to the pass transistor of the memory cell.