Abstract: The disclosure relates to a method for effectively and efficiently adding sodium trimetaphosphate to a gypsum slurry. In one exemplary embodiment, the sodium trimetaphosphate is added at the same time as foam is added to the gypsum slurry through the foam waterline. In another exemplary embodiment, the sodium trimetaphosphate is added at the same time as additional water is added to the gypsum slurry through the gauging waterline. The sodium trimetaphosphate can be added to either or both waterlines in its dry form or in a diluted solution.

Abstract: The disclosure relates to a method for effectively and efficiently adding sodium trimetaphosphate to a gypsum slurry. In one exemplary embodiment, the sodium trimetaphosphate is added at the same time as foam is added to the gypsum slurry through the foam waterline. In another exemplary embodiment, the sodium trimetaphosphate is added at the same time as additional water is added to the gypsum slurry through the gauging waterline. The sodium trimetaphosphate can be added to either or both waterlines in its dry form or in a diluted solution.

Abstract: The lock cylinder assembly of the present invention incorporates a number of features designed to defeat attempts to pick or destroy the lock. The lock cylinder assembly employs multiple arrays of pass key pins, making picking of the lock much more difficult. Second, the arrangement of the pass key pins in separate arrays requires that multiple cuts would have to be made into the lock housing mogul or cylinder blank in order to defeat the lock cylinder assembly. Third, the lock cylinder assembly of the present invention may incorporate multiple sets of hardened dowel pins to prevent drilling through the lock housing mogul in the area of the driver pins. Fourth, the lock cylinder assembly of the present invention may incorporate a hardened cylinder shield behind the front face of the cylinder blank to prevent drilling through the cylinder blank.

Abstract: To select routing of communications in a network with a plurality of paths between a first location and a second location, a routing choice is determined from among the plurality of paths based at least in part upon at least one of a communication-success amount of monetary relevance for each of the plurality of paths and a communication-failure amount of monetary relevance for each of the plurality of paths, and further upon at least one of a likelihood of successfully completing communication for each of the plurality of paths and a likelihood of failing to complete communication for each of the plurality of paths. At least one routing device is informed of the determined routing choice, whereby the routing device can select routing information for routing the data between the first location and the second location based on the determined routing choice.

Abstract: To select routing of communications in a network with a plurality of paths between a first location and a second location, a routing choice is determined from among the plurality of paths based at least in part upon at least one of a communication-success amount of monetary relevance for each of the plurality of paths and a communication-failure amount of monetary relevance for each of the plurality of paths, and further upon at least one of a likelihood of successfully completing communication for each of the plurality of paths and a likelihood of failing to complete communication for each of the plurality of paths. At least one routing device is informed of the determined routing choice, whereby the routing device can select routing information for routing the data between the first location and the second location based on the determined routing choice.

Abstract: The lock cylinder assembly of the present invention incorporates a number of features designed to defeat attempts to pick or destroy the lock. The lock cylinder assembly employs multiple arrays of pass key pins, making picking of the lock much more difficult. Second, the arrangement of the pass key pins in separate arrays requires that multiple cuts would have to be made into the lock housing mogul or cylinder blank in order to defeat the lock cylinder assembly. Third, the lock cylinder assembly of the present invention may incorporate multiple sets of hardened dowel pins to prevent drilling through the lock housing mogul in the area of the driver pins. Fourth, the lock cylinder assembly of the present invention may incorporate a hardened cylinder shield behind the front face of the cylinder blank to prevent drilling through the cylinder blank.

Abstract: A lock assembly incorporating a number of features designed to defeat attempts to pick or destroy the lock. The lock cylinder assembly employs multiple arrays of pass key pins, making picking of the lock much more difficult. Second, the arrangement of the pass key pins in separate arrays requires that multiple cuts would have to be made into the lock housing mogul or cylinder blank in order to defeat the lock cylinder assembly. Third, the lock cylinder assembly of the present invention may incorporate multiple sets of hardened dowel pins to prevent drilling through the lock housing mogul in the area of the driver pins. Fourth, the lock cylinder assembly of the present invention may incorporate a hardened cylinder shield behind the front face of the cylinder blank to prevent drilling through the cylinder blank.

Abstract: Data is dynamically routed between first and second locations. An attempt failure ratio is obtained for each of several data paths capable of providing a data link between the first and second locations, where such ratio represents a proportion of failed linkages by the data path to all attempted linkages by the data path between the first and second locations. A revenue value is also obtained for each data path, where such value represents an amount per unit generated by a successful linkage by the data path between the first and second locations. A comparative income value is then computed for each data path, where such value is a product of the attempt failure ratio for the data path and the revenue value for the data path. Routing information is then selected for routing the data between the first and second locations based on the comparative income value for each data path. The routing information may be employed to route the data by way of at least one of the data paths.

Abstract: Data is dynamically routed between first and second locations. An attempt failure ratio is obtained for each of several data paths capable of providing a data link between the first and second locations, where such ratio represents a proportion of failed linkages by the data path to all attempted linkages by the data path between the first and second locations. A revenue value is also obtained for each data path, where such value represents an amount per unit generated by a successful linkage by the data path between the first and second locations. A comparative income value is then computed for each data path, where such value is a product of the attempt failure ratio for the data path and the revenue value for the data path. Routing information is then selected for routing the data between the first and second locations based on the comparative income value for each data path. The routing information may be employed to route the data by way of at least one of the data paths.

Abstract: Data is dynamically routed between first and second locations. An attempt success ratio is obtained for each of several data paths capable of providing a data link between the first and second locations, where such ratio represents a proportion of successful linkages by the data path to all attempted linkages by the data path between the first and second locations. A revenue value is also obtained for each data path, where such value represents an amount per unit generated by a successful linkage by the data path between the first and second locations. A comparative income value is then computed for each data path, where such value is a product of the attempt success ratio for the data path and the revenue value for the data path. Routing information is then selected for routing the data between the first and second locations based on the comparative income value for each data path. The routing information may be employed to route the data by way of at least one of the data paths.