Abstract: A method for route calculation using real time traffic conditions is disclosed. A transmission that includes weightings indicative of traffic conditions on roads is received. Then, a solution route is calculated by forming a list of road segments. The list is formed by expanding a search tree comprised of gates. Each gate represents a physical location on a road segment and an accessible direction relative thereto. Each gate to which a weighting applies is incremented by an amount indicated in the transmission. The solution route is determined by expanding the search tree, which includes determining and evaluating successor gates.

Abstract: A process and apparatus to deliver both process chemical and solvent for cleaning the process chemical in a solvent purge refill system along with an integral solvent sorption module, in a single “assembly” that permits ease of shipping, minimal end-user interaction, sufficient solvent for the solvent purge operation, without residual solvent, requiring disposal. This eliminates customer handling of the solvent, and eliminates the customer's need to find a solvent waste facility, as residual solvent can be returned in the same package in one piece/one step.

Abstract: A process and apparatus to deliver both process chemical and solvent for cleaning the process chemical in a solvent purge refill system along with an integral solvent sorption module, in a single “assembly” that permits ease of shipping, minimal end-user interaction, sufficient solvent for the solvent purge operation, without residual solvent, requiring disposal. This eliminates customer handling of the solvent, and eliminates the customer's need to find a solvent waste facility, as residual solvent can be returned in the same package in one piece/one step.

Abstract: A process and apparatus to deliver both process chemical and solvent for cleaning the process chemical in a solvent purge refill system along with an integral solvent sorption module, in a single “assembly” that permits ease of shipping, minimal end-user interaction, sufficient solvent for the solvent purge operation, without residual solvent, requiring disposal. This eliminates customer handling of the solvent, and eliminates the customer's need to find a solvent waste facility, as residual solvent can be returned in the same package in one piece/one step.

Abstract: A program and method for route calculation for use with a navigation system and used with a map database that represents a road network in a geographic region. A route calculation program is adapted to find at least one solution route between a first location on a road network and a second location on the road network. The route calculation program includes a first search tree associated with the first location and a second search tree associated with the second location. Each search tree is adapted to hold gates. Each of the gates represents a physical position on the road network and a direction from the position to another location along a path on the road network. The route calculation program also includes at least one priority queue associated with one of the search trees. The priority queue assigns a priority to one of the gates in the associated search tree based upon an evaluation using a search algorithm.

Abstract: A process and apparatus to deliver both process chemical and solvent for cleaning the process chemical in a solvent purge refill system along with an integral solvent sorption module, in a single “assembly” that permits ease of shipping, minimal end-user interaction, sufficient solvent for the solvent purge operation, without residual solvent, requiring disposal. This eliminates customer handling of the solvent, and eliminates the customer's need to find a solvent waste facility, as residual solvent can be returned in the same package in one piece/one step.

Abstract: A program and method for route calculation for use with a navigation system and used with a map database that represents a road network in a geographic region. A route calculation program is adapted to find at least one solution route between a first location on a road network and a second location on the road network. The route calculation program includes a first search tree associated with the first location and a second search tree associated with the second location. Each search tree is adapted to hold gates. Each of the gates represents a physical position on the road network and a direction from the position to another location along a path on the road network. The route calculation program also includes at least one priority queue associated with one of the search trees. The priority queue assigns a priority to one of the gates in the associated search tree based upon an evaluation using a search algorithm.

Abstract: A program and method for route calculation for use with a navigation system and used with a map database that represents a road network in a geographic region A route calculation program is adapted to find at least one solution route between a first location on a road network and a second location on the road network. The route calculation program includes a first search tree associated with the first location and a second search tree associated with the second location. Each search tree is adapted to hold gates. Each of the gates represents a physical position on the road network and a direction from the position to another location along a path on the road network. The route calculation program also includes at least one priority queue associated with one of the search trees.

Abstract: A program and method for route calculation for use with a navigation system and used with a map database that represents a road network in a geographic region. A route calculation program is adapted to find at least one solution route between a first location on a road network and a second location on the road network. The route calculation program includes a first search tree associated with the first location and a second search tree associated with the second location. Each search tree is adapted to hold gates. Each of the gates represents a physical position on the road network and a direction from the position to another location along a path on the road network. The route calculation program also includes at least one priority queue associated with one of the search trees. The priority queue assigns a priority to one of the gates in the associated search tree based upon an evaluation using a search algorithm.

Abstract: A program and method for route calculation for use with a navigation system and used with a map database that represents a road network in a geographic region. A route calculation program is adapted to find at least one solution route between a first location on a road network and a second location on the road network. The route calculation program includes a first search tree associated with the first location and a second search tree associated with the second location. Each search tree is adapted to hold gates. Each of the gates represents a physical position on the road network and a direction from the position to another location along a path on the road network. The route calculation program also includes at least one priority queue associated with one of the search trees. The priority queue assigns a priority to one of the gates in the associated search tree based upon an evaluation using a search algorithm.

Abstract: A program and method for route calculation for use with a navigation system and used with a map database that represents a road network in a geographic region. A route calculation program is adapted to find at least one solution route between a first location on a road network and a second location on the road network. The route calculation program includes a first search tree associated with the first location and a second search tree associated with the second location. Each search tree is adapted to hold gates. Each of the gates represents a physical position on the road network and a direction from the position to another location along a path on the road network. The route calculation program also includes at least one priority queue associated with one of the search trees. The priority queue assigns a priority to one of the gates in the associated search tree based upon an evaluation using a search algorithm.

Abstract: A program and method for route calculation for use with a navigation system and used with a map database that represents a road network in a geographic region. A route calculation program is adapted to find at least one solution route between a first location on a road network and a second location on the road network. The route calculation program includes a first search tree associated with the first location and a second search tree associated with the second location. Each search tree is adapted to hold gates. Each of the gates represents a physical position on the road network and a direction from the position to another location along a path on the road network. The route calculation program also includes at least one priority queue associated with one of the search trees. The priority queue assigns a priority to one of the gates in the associated search tree based upon an evaluation using a search algorithm.

Abstract: Process for solvent purging a process line of process chemical in a process chemical delivery system typically used to dispense toxic chemicals from replaceable process chemical containers in the electronic fabrication industry.

Abstract: Apparatus and process for solvent purging a process line of process chemical in a process chemical delivery system typically used to dispense toxic chemicals from replaceable process chemical containers in the electronic fabrication industry.

Abstract: A peptide having at least 15 consecutive amino acids of the amino acid sequence shown in SEQ ID NO:1 or conservative amino acid substitutions thereof. The peptide is capable of promoting pairing of a single-stranded DNA molecule and a double-stranded DNA molecule. The single-stranded DNA molecule is homologous to at least a portion of the double-stranded DNA molecule. The single-stranded DNA molecule and the double-stranded DNA molecule form a three-stranded DNA molecule.