Abstract: A scheduling system and method for moving plural objects through a multipath system described as a freight railway scheduling system. The scheduling system utilizes a cost reactive resource scheduler to minimize resource exception while at the same time minimizing the global costs associated with the solution. The achievable movement plan can be used to assist in the control of, or to automatically control, the movement of trains through the system.

Abstract: A scheduling system and method for moving plural objects through a multipath system described as a freight railway scheduling system. The scheduling system utilizes a cost reactive resource scheduler to minimize resource exception while at the same time minimizing the global costs associated with the solution. The achievable movement plan can be used to assist in the control of, or to automatically control, the movement of trains through the system.

Abstract: A scheduling system and method for moving plural objects through a multipath system described as a freight railway scheduling system. The scheduling system utilizes a cost reactive resource scheduler to minimize resource exception while at the same time minimizing the global costs associated with the solution. The achievable movement plan can be used to assist in the control of, or to automatically control, the movement of trains through the system.

Abstract: A scheduling system and method for moving plural objects through a multipath system described as a freight railway scheduling system. The scheduling system utilizes a cost reactive resource scheduler to minimize resource exception while at the same time minimizing the global costs associated with the solution. The achievable movement plan can be used to assist in the control of, or to automatically control, the movement of trains through the system.

Abstract: A scheduling system and method for moving plural objects through a multipath system described as a freight railway scheduling system. The scheduling system utilizes a cost reactive resource scheduler to minimize resource exception while at the same time minimizing the global costs associated with the solution. The achievable movement plan can be used to assist in the control of, or to automatically control, the movement of trains through the system.

Abstract: A scheduling system and method for moving plural objects through a multipath system described as a freight railway scheduling system. The scheduling system utilizes a cost reactive resource scheduler to minimize resource exception while at the same time minimizing the global costs associated with the solution. The achievable movement plan can be used to assist in the control of, or to automatically control, the movement of trains through the system.

Abstract: A scheduling system and method for moving plural objects through a multipath system described as a freight railway scheduling system. The scheduling system utilizes a cost reactive resource scheduler to minimize resource exception while at the same time minimizing the global costs associated with the solution. The achievable movement plan can be used to assist in the control of, or to automatically control, the movement of trains through the system.

Abstract: A scheduling system and method for moving plural objects through a multipath system described as a freight railway scheduling system. The scheduling system utilizes a cost reactive resource scheduler to minimize resource exception while at the same time minimizing the global costs associated with the solution. The achievable movement plan can be used to assist in the control of, or to automatically control, the movement of trains through the system.

Abstract: A scheduling system and method for moving plural objects through a multipath system described as a freight railway scheduling system. The scheduling system utilizes a cost reactive resource scheduler to minimize resource exception while at the same time minimizing the global costs associated with the solution. The achievable movement plan can be used to assist in the control of, or to automatically control, the movement of trains through the system.

Abstract: The present invention relates to a predictive train scheduler that continually adjusts train routes and controls in real time so that train throughput on the railway system is optimized. The schedule repairer makes intelligent decisions through the collection of real time data as well as the use of predictive algorithms which are able to estimate potential conflicts, resolve the conflicts and leave the rest of the movement plan undisturbed in a very short amount of time.

Abstract: A scheduling system and method for moving plural objects through a multipath system described as a freight railway scheduling system. The achievable movement plan can be used to assist in the control of, or to automatically control, the movement of trains through the system.

Abstract: A scheduling system and method for moving plural objects through a multipath system described as a freight railway scheduling system. The achievable movement plan can be used to assist in the control of, or to automatically control, the movement of trains through the system.

Abstract: A routing algorithm for broadcast packets in packet switching networks, utilizing a "flood-and-forward" technique. In such networks, data are often transmitted in grat quantities from a sensor node to all other nodes in the network, or in a subnetwork, over point-to-point links. Existing broadcast routing algorithms, including multidestination addressing, constrained flooding, minimum spanning tree forwarding, and reverse path forwarding, suffer from an excessive use of bandwidth, a poor choice of routes, or a costly need for memory or computing power. In flood-and-forward routing, periodically a data packet is designated as a Scout packet and is transmitted in a constrained flood broadcast transmission. The Scout packet is identified by a Source Id and a Scout Label. Each receiving node sends a Ack Scout packet to the node from which it first receives a particular Scout packet, acknowledging receipt of that packet.

Abstract: Imagery data is compressed by subdividing the data into a plurality of blocks. Each block is encoded into a bit map and a pair of threshold values. The bit map provides an array of binary encoded imagery data-representative vector combinations. A vector combination is subdivided into a set of adjacent sub-blocks, each which is examined to determine whether or not it is associated with a prescribed attribute of the image. If the vector is associated with a prescribed attribute, a code representative of that attribute is generated. If the vector is not associated with a prescribed attribute of the image, prescribed portions of the vector are inverted to derive modified vectors that are associated with prescribed image attributes. For each such modified vector a corresponding code is generated. Using each of these corresponding codes, image data is effectively reconstructed and then compared with the original image data.

Abstract: A mechanism for implementing the Chinese remainder theorem includes a signal processing architecture that is effectively configured principally of binary adders and lookup tables having small address space. Through a set of lookup tables referencing a prescribed divisor, a respective set of summands are expressed in terms of quotients and remainders. Those signal lines over which the quotient representative data is produced are summed in a modulo-power-of two adder, while the remainder data is summed in a simple binary adder. The resulting sums are then recombined into a common data format, using a reduced capacity lookup table and binary adders.