Abstract: An architecture and data processing method for a neural network that can approximate any mapping function between the input and output vectors without the use of hidden layers. The data processing is done at the sibling nodes (second row). It is based on the orthogonal expansion of the functions that map the input vector to the output vector. Because the nodes of the second row are simply data processing stations, they remain passive during training. As a result the system is basically a single-layer linear network with a filter at its entrance. Because of this it is free from the problems of local minima. The invention also includes a method that reduces the sum of the square of errors over all the output nodes to zero (0.000000) in fewer than ten cycles. This is done by initialization of the synaptic links with the coefficients of the orthogonal expansion. This feature makes it possible to design a computer chip which can perform the training process in real time.

Abstract: An architecture and data processing method for a neural network that can approximate any mapping function between the input and output vectors without the use of hidden layers. The data processing is done at the sibling nodes (second row). It is based on the orthogonal expansion of the functions that map the input vector to the output vector. Because the nodes of the second row are simply data processing stations, they remain passive during training. As a result the system is basically a single-layer linear network with a filter at its entrance. Because of this it is free from the problems of local minima. The invention also includes a method that reduces the sum of the square of errors over all the output nodes to zero (0.000000) in fewer than ten cycles. This is done by initialization of the synaptic links with the coefficients of the orthogonal expansion. This feature makes it possible to design a computer chip which can perform the training process in real time.

Abstract: A computer software architecture and operating method for an expert system that performs rule-based reasoning as well as a quantitative analysis, based on information provided by the user during a user session, and provides an expert system recommendation embodying the results of the quantitative analysis are disclosed. In the preferred embodiment of the invention, the expert system includes the important optional feature of modifying its reasoning process upon finding the quantitative analysis results unacceptable in comparison to predetermined acceptance criteria.

Abstract: A bus accessing method and apparatus for the practice thereof in a communication network is disclosed. The network comprises a transmit bus, a receive bus, a plurality of BIUs connected between the transmit and receive buses and a head-end for directing signals leaving the transmit bus onto the receive bus. Each information packet has two control bytes respectively following the start frame delimiter and preceding the end frame delimiter. Each BIU includes means for comparing the bits it receives with the bits as transmitted thereby, a bit mismatch indicating that a downstream BIU has been preempted. During packet transmission, upon detecting a bit mismatch, the transmitting BIU sets one or both control bytes to "1010" so that receiving BIUs in the network are apprised of the preemption. Subsequently, preempted BIUs transmit their packets in accordance with a predetermined protocol, each packet so transmitted having its control bytes set to "1010".

Abstract: The present invention comprises a local area network wherein a network control center is provided to maintain a dynamic logical ring. In accordance with the method of the present invention, the local area network is provided with a transmission medium having first and second channels, wherein prospective entrants to the logical ring are solicited over the first channel and wherein information transfer among BIUs occurs over the second channel. The network control center is provided for continuously soliciting successors and resolving contentions over the first channel. Further, the network control center is adapted to add entering stations to the logical ring by receiving the token and transmitting next neighbor packets over the second channel. Additionally, the network control center may be adapted for monitoring communications over the second channel to determine when a station has received the token and failed and, thereafter, to reestablish the logical ring.

Abstract: A token passing local area network LAN is disclosed wherein each bus interface unit BIU monitors the token rotation time to determine if this time exceeds a predetermined maximum and, if so, creates a second token to be passed through the LAN 180.degree. out of phase with the existing token. Further, each BIU monitors token acquisition time, i.e. the time the BIU has a token to the time that the BIU has another token whether or not they are the same token, to determine whether this token acquisition time is below a predetermined minimum value and, if so, a token is destroyed such that only one token is passed between BIUs.

Abstract: The subject invention comprises method and apparatus for providing protection against an open transmit cable, an open receive cable and/or a failed BIU in a local area network. Each BIU of the network is adapted to monitor tansmissions received from its predecessor to determine whether the primary transmit channel coupling it to its predecessor is open circuited and, if so, to reestablish communications between it and its predecessor over an auxiliary transmit channel. Further, each BIU is adapted to monitor transmissions received over the primary receive channel of the network to determine whether the channel is idle and, if so, to begin receiving message signals over an auxiliary receive channel. Lastly, a network control center is provided to monitor the transmit medium to determine whether a BIU is "babbling", i.e., transmitting signals for longer than is permitted by the network protocol and, if so, to identify the babbling BIU and, thereafter, remove the babbling BIU from the network.

Abstract: Apparatus and method for bus accessing, in a communication system, effective to minimize user to user delay variance is disclosed. The communication system comprises a transmit bus, a receive bus, a plurality of BIUs coupled between the buses, and a head-end coupled between the buses at one end for directing signals from the transmit bus onto the receive bus and further for intermittently alternately transmitting a left sweep or right sweep startup packet onto the receive bus. Upon receipt of the startup packet, each BIU having an information packet to transmit, transmits a beep signal and then subsequently receives its own beep as well as the beeps transmitted by other BIUs. Each BIU determines a transmission ranking for itself according to the number of beeps received before or after receiving its own beep depending on whether the startup packet was respectively a right sweep or left sweep type.

Abstract: Method and apparatus are provided for transmitting message signals in a high speed local area network which method performs as efficiently during intervals when few stations have messages to transmit as it does during intervals when many stations have messages to transmit. A station wishing to transmit a message first monitors the transmission medium to determine whether it is busy and, if not, initiates transmission of its message signal. If there are not predominant stations attempting to initiate transmission, then the subject station will continue its transmission until the completion thereof. If, however, a predominant station should attempt to initiate transmission at the same time as the subject station, i.e., a collision occurs, the predominant station wins and continues its transmission until the conclusion thereof. The subject station, being pre-empted, monitors a control bit contained in the preamble of each message signal to determine whether the control bit is set.

Abstract: Method and apparatus are provided for maintaining a dynamic logical ring in a token passing local area network wherein a plurality of bus interface units (BIUs) exchange information in accordance with a token passing protocol. A network control center is provided for monitoring the transmission medium of the network for transmission of a media demand signal, wherein said media demand signal indicates that a station wishes to be added to the logical ring. The network control center is responsive to the media demand signal for determining a predecessor and successor to the entering station and, thereafter, transmitting media entrance signals to add the entering station to the logical ring. To this end, one media entrance signal is transmitted to the predecessor of the entering station to inform the predecessor to transmit the token to the entering station and another media entrance signal is transmitted to the entering station to inform the entering station to transmit the token to its successor.

Abstract: An improved method for transmitting messages from the buffers of a bus interface unit participating in a local area network is disclosed wherein the bus interface units are permitted to completely empty their buffers upon each possession of the token and thereby decrease the mean bus waiting time of the network. Further, to optimize network bus waiting time while maintaining an upper limit on BIU service time and thereby guaranteeing each bus interface unit of the network one opportunity to transmit during this upper limit time interval, each bus interface unit of the network monitors the BIU service time to determine when this time reaches the upper limit time interval and, thereafter, limits the quantum of information transmitted from its buffer to thereby prevent the BIU service time from increasing beyond the upper limit time interval.

Abstract: Method and apparatus is disclosed for maintaining a dynamic logical ring in a token passing local area network such that each bus interface unit coupled to the network can freely and unilaterally initiate participation therein by monitoring the transmission bus until it is not busy and, thereafter, transmitting a solicit successor packet to initiate entrance to the ring. Further, method is disclosed for re-establishing the ring after a bus interface unit fails or a token is destroyed. Lastly, method and apparatus is disclosed for establishing the logical ring after initialization.

Abstract: A mobile radio system uses a predetermined number of control channels over which a hand-shake routine is performed to determine called station availability, before one of a limited number of talk channels (local and repeater) is assigned for communication between a calling and the called station. After locating an idle talk channel (local channels are searched first), the control channel to which the called station is predeterminedly assigned is attempted to be accessed. Transmission times on the control channel are a function of the called station's identification code, thus creating a logical ring. Provision is made for message based priorities, emergency numbers and high priority for stations having experienced a previous unsuccessful attempt to access a control channel.

Abstract: In a bus communication system, a unidirectional transmit bus is coupled to a unidirectional receive bus such that information packets leaving the transmit bus are placed on the receive bus. A plurality of bus interface units (BIUs) are coupled in series at spaced locations to the transmit and receive buses. The BIUs communicate with one another by transmitting information packets on the transmit bus and receiving transmitted information packets from the receive bus. A BIU transmits an information packet when both buses are silent. In the event of a collision between two information packets, downstream BIUs abort transmission and defer to the most upstream BIU having transmitted. Each BIU having had a transmission aborted attempts to gain access to the bus by placing a beep on the transmit bus which informs other BIUs that a BIU requests access to the bus. Only the most upstream BIU requesting access is permitted to transmit a packet.

Abstract: A plurality of bus interface units (BIUs), capable of placing information packets on a unidirectional transmit bus, are coupled to the transmit bus at locations spaced therealong. Each BIU comprises a transmit bus input port and a transmit bus output port, wherein the transmit bus input port of each BIU is coupled to the transmit bus output port of the next upstream BIU, and a receive bus input port connected to a receive bus. Each BIU includes a memory for storing at least one information packet to be transmitted and a control circuit associated with the memory. In a passive mode, the control circuit operates the BIU like a repeater, wherein packets received on its transmit bus input are reconstituted and retransmitted on its transmit bus output. In an active mode, the control circuit causes the BIU to transmit information packets stored in its memory. Each information packet may have a predetermined priority.

Abstract: A bus accessing system for permitting a plurality of bus information units (BIUs) to sequentially gain access to an information bus utilizes a bidirectional token flow process in which the right to transmit a packet of information on the bus is transmitted from BIU to BIU by the passing of a virtual token. No two BIUs receive a token at the same time, whereby only one BIU will have the right to place its information packet on the bus at any given instant. Each BIU calculates a token time interval, unique to each respective BIU, beginning at receipt of a start-up packet, as a function of its logical position on the bus.

Abstract: A bus communication system has each of a plurality of bus interface units (BIUs) connected to a transmission bus at respective spaced locations along the bus. Each BIU includes a transmission system operable in both a contention mode and a token-passing mode. In the contention mode, the transmission system completes the transmission of information packets only after the BIU senses the bus and determines that no additional information packets are being transmitted on the bus. During the token-passing mode, the transmission system transmits an information packet only after the expiration of a time interval unique to that BIU and determined by the relative location both of that BIU and of the last BIU to transmit either an information or a start-up packet on the bus. A control system causes the transmission means to switch between the contention and token-passing modes of operation as a function of the transmission activity on the bus.

Abstract: A transparent intelligent communication network having nodes and communication links between the nodes and providing improved system input features by including the sampling of customer inputs at different rates according to their output rates of data at the exit node or at faster rates if there is a spare channel capacity available.

Abstract: A transparent intelligent communication network having both terrestrial and satellite links between nodes and providing improved accuracy and speed in transmission by distinguishing between data requiring rapid receipt at the receiving node and other data, and dispatching data accordingly, while transmitting system protocol and error-correcting information (e.g., retransmissions) over terrestrial links.

Abstract: A transparent intelligent communication network having both terrestrial and satellite links between nodes and providing improved channel utilization by including a system of reservations through successive links for the incoming data.