Abstract: The present invention relates generally to a stable liquid formulation of purified hemopexin comprising: (a) a hemopexin content of at least 50 mg/mL; (b) at least 15 mM phosphate buffer; (c) a pH from 5.8 to 8; and (d) at least 50 mM sodium chloride; and uses thereof.

Abstract: The present invention relates generally to a stable liquid formulation of purified hemopexin comprising: (a) a hemopexin content of at least 50 mg/mL; (b) at least 15 mM phosphate buffer; (c) a pH from 5.8 to 8; and (d) at least 50 mM sodium chloride; and uses thereof.

Abstract: Systems configured to dispatch transportation resources and related methods are described. The system including one or more digital devices configured to receive a request for a price for a transportation to a destination; receive destination information; and receive origin information. The system configured to in response to the request for the price, generate a price quote based on a price strategy and a dispatch strategy. The system configured to in response to the generated price quote, generate a response to the request for the price. And, the system configured to transmit the price quote over a network.

Abstract: The present invention relates generally to a stable liquid formulation of purified hemopexin comprising: (a) a hemopexin content of at least 50 mg/mL; (b) at least 15 mM phosphate buffer; (c) a pH from 5.8 to 8; and (d) at least 50 mM sodium chloride; and uses thereof.

Abstract: Techniques are disclosed for optimizing schedules used in implementing plans for performing tasks in data processing systems. For example, an automated method of negotiating for resources in a data processing system, wherein the data processing system comprises multiple sites, comprises a negotiation management component of a computer system at a given one of the sites performing the following steps. One or more tasks from at least one source of one or more plans are obtained. Each plan is annotated with one or more needed resources and one or more potential resource providers at one or more sites in the data processing system. An optimized resource negotiation schedule based on the one or more obtained tasks is computed. The schedule comprises an order in which resources are negotiated.

Abstract: Different solution methodologies for addressing problems or issues when directing security domain patrolling strategies according to attacker-defender Stackelberg security games. One type of solution provides for computing optimal strategy against quantal response in security games, and includes two algorithms, the GOSAQ and PASAQ algorithms. Another type of solution provides for a unified method for handling discrete and continuous uncertainty in Bayesian Stackelberg games, and introduces the HUNTER algorithm. Another solution type addresses multi-objective security games (MOSG), combining security games and multi-objective optimization. MOSGs have a set of Pareto optimal (non-dominated) solutions referred to herein as the Pareto frontier. The Pareto frontier can be generated by solving a sequence of constrained single-objective optimization problems (CSOP), where one objective is selected to be maximized while lower bounds are specified for the other objectives.

Abstract: Techniques are disclosed for optimizing schedules used in implementing plans for performing tasks in data processing systems. For example, an automated method of negotiating for resources in a data processing system, wherein the data processing system comprises multiple sites, comprises a negotiation management component of a computer system at a given one of the sites performing the following steps. One or more tasks from at least one source of one or more plans are obtained. Each plan is annotated with one or more needed resources and one or more potential resource providers at one or more sites in the data processing system. An optimized resource negotiation schedule based on the one or more obtained tasks is computed. The schedule comprises an order in which resources are negotiated.

Abstract: An insert-type barcode reader has a body support with an insertion slot for receiving a card with barcode. A circuit board and a CIS component module electrically connected to the circuit board with each mounted to the body support to scan and process signals. A roller is mounted to the body support for movement relative to the CIS component module to allow the card to be properly guided into the insertion slot and tightly pressed onto the CIS component for accurate scanning of the barcode on the card. Two photoelectric sensors mounted to the body support are electrically connected to the circuit board for sensing the card entering and leaving the insertion slot to control starting, running and stopping of the scanning function of the CIS component module.

Abstract: An insert-type barcode reader has a body support with an insertion slot for receiving a card with barcode. A circuit board and a CIS component module electrically connected to the circuit board with each mounted to the body support to scan and process signals. A roller is mounted to the body support for movement relative to the CIS component module to allow the card to be properly guided into the insertion slot and tightly pressed onto the CIS component for accurate scanning of the barcode on the card. Two photoelectric sensors mounted to the body support are electrically connected to the circuit board for sensing the card entering and leaving the insertion slot to control starting, running and stopping of the scanning function of the CIS component module.