Abstract: A method for detecting a network anomaly in a network includes collecting management information base (MIB) data from the network at an interval and constructing a time series of the collected data. The method also includes decomposing the time series of the collected data in the wavelet domain, constructing an energy plot based on the time series decomposed in the wavelet domain and analyzing the energy plot to determine a sign of a network anomaly event.

Abstract: Network traffic may be estimated using samples of network activities to identify traffic parameters. A model of the network may be generated using the traffic parameters, and the model can be used to simulate the network using a modified set of parameters. Network traffic may be managed using the results of the simulation. Network traffic can also be managed by intercepting and modifying a control message on a peer-to-peer network.

Abstract: A network includes multiple nodes interconnected to form a ring topology. These nodes support data transmissions over the network using tokens. To send and receive data over the network, nodes may process control messages. A node can receive a token authorizing transmission on one of multiple data channels, determine a transmission allocation, which represents an amount of time that the authorized data channel may be utilized to transmit data, and determine a destination allocation, which represents a proportion of the transmission allocation that may be utilized to transmit the data to a particular destination. The node can also transmit the data on the authorized data channel in accordance with the transmission allocation and the destination allocation.

Abstract: A network includes multiple nodes interconnected to form a ring topology. These nodes support data transmissions over the network using tokens. To send and receive data over the network, nodes may process control messages. A node can receive a first token authorizing transmission on one of multiple data channels, generate a transmission control message identifying a destination node and the authorized data channel, and communicate the transmission control message to a next node. The node can also communicate a second token to the next node authorizing secondary transmissions on the authorized data channel, transmit data on the authorized data channel after communicating the transmission control message, and communicate the first token to the next node after communicating the second token to the next node.

Abstract: A network includes multiple nodes interconnected to form a ring topology. These nodes support data transmissions over the network using tokens. To send and receive data over the network, nodes may process control messages. A node can receive a token authorizing transmission on one of multiple data channels, generate a transmission control message identifying a destination node and the authorized data channel, and communicate the transmission control message for receipt by the destination node. The node can also transmit data on the authorized data channel after communicating the transmission control message and communicate the token to a next node.

Abstract: A network provides fault tolerant network routing by identifying root nodes that provide cover against a particular type of fault. Nodes then route copies of packets through these root nodes such that an occurrence of the particular type of fault will not disrupt delivery of the packets.

Abstract: A vehicle control system comprising a vehicle speed sensor for detecting the speed of a vehicle; a road situation storage device for storing road structures and conditions; a recommended gear stage determining device for determining a recommended gear stage of an automatic transmission on the basis of the vehicle speed and the road structures and conditions; a present position detecting device for detecting the present position of the vehicle; a present position recognizing device for recognizing the present position of the vehicle, as detected by the present position detecting device; a control content selecting device for evaluating at least one of the present position detecting device and the present position recognizing device to select the control content on the basis of the evaluation result; and a speed change processing device for changing the speed in accordance with the control content selected by the control content selecting device.

Abstract: A dynamic database structuring method includes the steps of (a) clustering transition probabilities among transactions by on-line, (b) forming a hyper graph representing the transition probabilities of the transactions clustered in the step (a) using weighting, (c) partitioning the hyper graph to obtain clustering information related to objects or records to be stored in a storage, and (d) reorganizing a database by rearranging data in the storage by on-line using the clustering information obtained in the step (c), thereby restructuring the database dynamically.

Abstract: A method of controlling a telecommunication network management is disclosed. By the method, a managing subject of a telecommunication network carries out a management sequence for management information of the telecommunication network in an agent subject. The method comprises the steps of (a) locating a cache storing the management information in the managing subject; and (b) partitioning attributes of the management information into attribute classes corresponding to demands for cache coherency. In the method, the managing subject carries out the management sequence with a higher speed by accessing the cache, and manages the cache for each attribute class efficiently.

Abstract: The upper and lower bounds of the probability distributions of the number of arrivals at given arrival rates and the upper and lower bounds of the distributions of the arrival rates of each call class are prestored in memory, and by referencing such prestored values, the distributions of the arrival rate and the number of arrivals are obtained (step 104), then, the upper and lower bounds of the resulting cell length distribution are calculated to obtain safe-side evaluation values of QOS parameters (step 106). Based on the obtained QOS parameters, admission or rejection of a call is determined (step 108). Using this method, a function defining the upper bound of the probability distribution of the cell flow rate at the outgoing line side can also be obtained, from which a threshold value is calculated, and abnormality in the cell flow rate is judged on the basis of the threshold value.

Abstract: The method of the invention is concerned with the manufacture of a molded copper-chromium family metal based alloy article which involves the steps of injection-molding a mixture of copper powder, a chromium family metal powder, an iron family metal powder and a thermoplastic organic binder made up of a polymer binder and low molecular binder in a ratio by volume of 5:1 to 1:1, dewaxing a molded body formed by the injection-molding by heating in a reducing atmosphere, and then sintering the dewaxed molded body at 1,100.degree. to 1,450.degree. C. in a reducing atmosphere. According to this method, molded articles having a high dimensional accuracy and high density can be provided.

Abstract: A cell loss ratio calculating method is a method of calculating a cell loss ratio of a buffer for storing call cells from a plurality of traffic sources and comprises a distribution expressing step, a number-of-average-arrivals expressing step, an average path calculating step and a cell loss ratio calculating step. In the distribution expressing step, a distribution of the number of cells accumulated within a time for which the cell passes the buffer is expressed by use of a Poisson distribution on an assured side. In the number-of-average-arrivals expressing step, the number-of-cells distribution is expressed with parameters representing a number of average arrivals of the Poisson distribution. In average path calculating step, an average path is calculated with respect to time-variations of a cell arrival ratio and a distribution of the cell arrival ratio.

Abstract: A probability transition matrix S.sub.t is formulated that expresses a multiplexing process which includes nested threshold priority control and classified priority control. A state equation using the matrix S.sub.t is solved by substituting therein upper and lower bounds of a probability distribution of a cell arrival count a.sub.t in an average time series, to calculate a probability distribution of a cell length in a buffer. From the thus calculated cell length probability distribution, the QOS is evaluated on a priority class basis. Based on the QOS evaluation, optimization of call admission control and priority control is accomplished.