Abstract: A method of operating a computer system is disclosed that facilitates the creation and testing of application system software by utilizing an autonomous environment to emulate the application system environment. The emulation environment allows the user to call into view sequences of standard input-output (I/O) screen format pairs normally used to submit information to and receive information from the application system. In the emulation mode, these screens are prepared off-line and stored until the user desires to exercise the application system. Each input format is filled with information that will serve as actual input to the application system when it is exercised. Each output format is filled with information that comprises expected results when the application system is actually exercised. The expected results are compared to actual results after execution of each I/O pair and further application system processing is controlled by the comparison results.

Abstract: A human-computer interface for executing computer operations on data objects under control of a multifunctional cursor which represents multiple computer operations visually in the cursor, which facilitates execution of repeated operations through a "cycle" capability, and which decouples pointer and image functionalities in time and space.The interface may be configured with a screen display and a movable region to display a cursor shape, which shape contains multiple icons representative of computer operations. Each computer operation may be executed under the control of a distinct input pattern. Multiple operations may be loaded in one or more sequences, which may themselves by cycled under control of a distinct input pattern.The interface may also be configured with a screen display, a movable region to display a cursor pointer, and an image region to display computer operation icons.

Abstract: A process is disclosed for adaptively routing service requests through a network comprising nodes interconnected with links. The network is also arranged so that each node may communicate with each of the other nodes. At preselected time intervals, sets of routes through the network are generated in response to the network configuration and traffic information. Over predetermined periods, traffic data is measured to determine carried load and blocking for each link. Also, at predetermined time intervals, occupancy factors are computed as determined by the network configuration and in response to traffic information including measured traffic data. Each of the occupany factors is derived from a nominal routing scheme in which a call blocked on a single route is treated as a lost call as in separable routing. Upon a request for service, the occupany factors corresponding to the busy-idle status of the links are used to compute an occupany value associated with each of the routes.

Abstract: Methodology, and associated circuitry, for encoding and decoding signals utilize combined time-signal path diversity techniques that trade-off bandwidth for autonomy of communications and simplified signal processing, thereby improving reliability.Transmitter (800) processes an incoming data stream by partitioning the stream into contiguous blocks. Each block is encoded into a data frame for transmission over one or more paths comprising the medium interconnecting the transmitter and receiver. Frame encoding is effected by generating an array of pulses distributed in time as well as distributed across the paths.Receiver (100) is generally arranged as a correlation detector in that the receiver only responds to the particular time-signal path pattern for which it is configured. Sensors in energy transfer relation to the one or more paths are positioned at detection points on the paths in correspondence to the time-space pattern of the receiver.

Abstract: A process for transitioning a hierarchical input database to create a hierarchical output database. The processing occurs generally in two stages. During the first stage, information contained in user-specified driver tables is utilized to extract only pertinent data from the input database and thereby produce intermediate data in a form accessible by the second stage. During the second stage, information from the driver tables is applied to the intermediate data to map this data to the required output form representative of the hierarchical output database. With this processing approach, the driver tables are derived and then maintained independently of underlying software that executes under control of the driver tables. A database conversion is efficiently effected by preparing the driver tables and then invoking execution of the common software embodying the extracting and mapping subprocesses.

Abstract: A methodology is disclosed for effecting contention-free communication over a plurality of Collision-type lines interconnecting numerous synchronized stations. In broad terms, each station having a message to transmit executes a prescribed encoding/algorithm. Each station also monitors the states of the lines and depending upon the dynamic states of the lines, the lines are associated with prescribed ones of the lines during each bit interval. At any stage of the detection process, if it is determined that a line broadcasts of unique message, then this line is assigned to the station generating the unique message for the remainder of the frame. The remaining lines are then available for reassignment in subsequent bit intervals. The pattern of bits detected at the end of the frame by each of the lines determines successfully transmitted messages.

Abstract: A method of operating a computer system to effect user-customization, primarily foreign language translation, of standard system-supplied screen displays without the need to modify underlying system source code. A transltion environment includes an autonomous processor (250) interposed between a host system (100) and access devices (201,202). Information transmitted between the host and access device is diverted to the processor for intermediate processing. One phase of this processing generates a translation file (500) which stores a mapping relationship between a first language screen and its second language counterpart. This translation file is invoked during the secod processing phase to effect a translation from the first-to-second language upon a host response and from the second-to-first language upon a host request.

Abstract: A methodology is disclosed for effecting contention-free communication over a plurality of OR-type lines interconnecting numerous synchronized stations. In broad terms, each station having a message to transmit executes a prescribed encoding/decoding algorithm. Each station also monitors the states of all the lines, collectively rather than individually, and prepares a station response each bit interval in correspondence to the collective states. During each bit interval, message candidates corresponding to the set of messages are identified and then assigned to selected ones of the lines. Based on the assignment, logic signals are propagated from each station over one of the assigned lines. By monitoring, each station senses the composite line signal on each of the lines and then generates new message candidates for the next bit interval.

Abstract: A methodology for retrieving textual data objects is disclosed. The information is treated in the statistical domain by presuming that there is an underlying, latent semantic structure in the usage of words in the data objects. Estimates to this latent structure are utilized to represent and retrieve objects. A user query is recouched in the new statistical domain and then processed in the computer system to extract the underlying meaning to respond to the query.

Abstract: A method is disclosed for the operation of a computer process to generate and store a file representative of physical assemblies by utilizing an enhanced decision tree defining in detail the interrelationsips of subassemblies. The computer process further derives assembly operations from inputed component and subassembly operations.

Abstract: A survivable ring network is disclosed that can withstand a cut link or failed node, without the need for a central controller or protection switching among links. The disclosed invention comprises two rings carrying identical multiplexed node-to-node communications in opposite directions. When a system error is detected in a downstream node, error signals are inserted in all subrate channels. Each subrate channel receiver receives identical communications from each ring. If one subrate channel has an error signal, the receiver selects the alternate channel.

Abstract: Circuitry, and associated methodology, in a parallel processing environment for aligning the various processing states of the autonomous processors communicating over a common bus assures that the order of execution and alignment of processing states is preserved across processors. This is effected by augmenting each processor with a state alignment network for inhibiting, within one interval of the global reference generator, generation of global reference signals. The reference generator is restarted only after all processing is completed in the order required by the allocation of tasks among the processors. To provide maximal efficiency, the state alignment network incorporated an arrangement to detect periods of delay between scheduled tasks and to automatically advance to the next immediate state requiring processing.

Abstract: A structure and methodology is disclosed for adaptively concentrating Integrated Services Digital Network (ISDN) B and D channel basic access on carrier systems. Central station 93 receives B and D channel requests on the D channel, combines this information with the status of queue storage device 11 transmitted from remote terminal 92, determines the allocation for B and D channel access, and transmits this information to the remote terminal, where the allocation is made at multiplexer 5.

Abstract: A circuit board edge connector that utilizes alternating conductive (5) and non-conductive (6) segments of elastomeric strips (4) to provide discrete electrical conductivity between pairs of boards (illustratively 40 and 60). The disclosed structure maintains surface contact between boards (1) and associated elastomeric strips (4), and between associated elastomeric strips (4).

Abstract: Filter arrangements (400,500,600) are disclosed for tunable channel selection in optical wavelength division multiplexed systems. Each filter arrangement has an etalon device (e.g. 401-403) as a simple, compact, in-line component which is rotatably adapted for interposing between the ends of fiber optic cables for interconnecting the cables. An optical beam emanating from a free end of each cable end is focused and directed to the etalon device by a collimated lensed connector (e.g. 411). Identical etalon devices may be stacked and ganged for rotation in unison to increase the number of system channels that may be propagated. Non-identical etalon devices may be stacked and made independently rotatable to increase the free spectral range of the system.

Abstract: An encoder method for processing an input data signal to produce binary coded data frames and to provide for synchronized, high-speed operation partitions the incoming data into contiguous frames composed of a plurality of bit positions. For each frame, a synchronizing signal comprising a pulse in the first bit position and no pulse in the midpoint bit position is propagated over the channel. Any station gaining access to the channel propagates its data samples in the remaining positions in each frame. Thus, the channel signal includes a component which is a subharmonic of the bit rate and this subharmonic is used to derive a synchronizing signal in a decoder.The decoder method for detecting the samples in the contiguous frames includes the steps of processing the synchronizing signal to produce signals at both the frame and bit rates and extracting a sampling signal in correspondence to the locations of the data samples in the frames.

Abstract: A telephone system allows a user to provide new services to terminations in a telephone network. A server having program sequences for controlling its operation connects the terminations and the telephone network. Using certain of its program sequences, the server monitors the occurrence of a request event at one of the terminations. A processor, distinct from the server, controls the server by accessing a directly accessible database to extract a state transition rule to provide control information corresponding to the response event. Information is returned to the terminations in response to the control information. The database storing the state transition rules is directly accessible by the user for changing the state transition rules to modify the services without changing the program sequences of the server. State transition rules within the database may be inserted, deleted or modified using conventional database management techniques.

Abstract: Methodology, and associated circuitry, for encoding and decoding signals utilize optimizing orthogonal code techniques that effect autonomy of communications and simplified signal processing, thereby improving reliability.Encoder (121) processes an incoming data stream by associating an optimizing orthogonal code with each binary one in the input stream and then by transmitting a series of rate-increased pulses over a path during intervals determined by the code for each of the binary ones.Decoder (131) is generally arranged as a correlation detector in that the decoder only responds to the particular optimizing orthogonal code for which it is configured. Sensors in energy transfer relation to the path are positioned at detection points on the path in correspondence to an assigned code. The outputs of the sensors are processed to produce a rate-decreased detected signal at the rate of the input stream whenever a rate-increased stream corresponding to the decoder configuration is propagating along the path.

Abstract: Methodology, and associated circuitry, for encoding and decoding signals utilize bistate orthogonal code techniques that effect autonomy of communications and simplified signal processing, thereby improving reliability.Encoder (121) processes an incoming data stream by associating a bistate orthogonal code with each binary one in the input stream and then by transmitting a series of rate-increased pulses over a path during intervals determined by the code for each of the binary ones.Decoder (131), in synchronism with encoder (121), is generally arranged as a correlation detector in that the decoder only responds to the particular bistate orthogonal code for which it is configured. Sensors in energy transfer relation to the path are positioned at detection points on the path in correspondence to an assigned code.

Abstract: Methodology and associated circuitry (131,141-143, 151,152,161,162,171-174,181) are disclosed for achieving contention-free broadcasting over one or more buses interconnecting a plurality of synchronized stations. In broad terms for the multiple bus case, each station that intends to utilize the buses prepares candidate message frames equalling the number of buses. The first candidate message of each station (301), after a first perturbation, is propagated over the first bus (311); also, the second candidate message of each station (302), after a second perturbation, is propagated over the second bus (312); this process occurs for all buses. Then, any station detecting a mismatch between its most recently propagated bit on a particular bus and the state of that bus deactivates further propagation of the candidate message on that bus. To arrive at the correct candidate message revealed by each bus, the inverse of the original perturbation must be applied to the revealed message.