Abstract: Described herein are peptides that bind to mesoporous silica substrates with high affinity. The peptides are useful for immobilizing proteins to such substrates by forming fusion proteins that include the silica binding peptides at the termini of the protein, exemplified herein with fusions to the C-terminus of several test proteins. The peptides may thus be used for making enzymatic reactor columns containing an immobilized enzyme over which a sample containing a substrate may be introduced as an input to the column and the reaction product obtained from the output of the column.

Abstract: Provided in this disclosure are chimeric peptides that include a spacer domain, the spacer domain itself, substrates (e.g., implants) coated with the chimeric peptides, and methods for making and using the coated substrates.

Abstract: For an enterprise system in which physical items are stored in physical container and in which physical container are stored in other physical containers, a data system has data records identifying logical items and logical containers that correspond to the physical items and physical containers, the data records further reflecting the storage of physical items and physical containers with other physical containers. Some of the items are identified as as high-priority items. Containers to hold the high-priority items in transit are identified. Excess capacity in the containers is identified. Low-priority items to be sent are identified. The high-priority items and the low-priority items are aggregated into a list of items-to-be-moved. A list of tasks includes instructions to move the items-to-be-moved from their respective starting logical locations to the containers is made and distributed.

Abstract: Provided in this disclosure are chimeric peptides that include a spacer domain, the spacer domain itself, substrates (e.g., implants) coated with the chimeric peptides, and methods for making and using the coated substrates.

Abstract: For an enterprise system in which physical items are stored in physical container and in which physical container are stored in other physical containers, a data system has data records identifying logical items and logical containers that correspond to the physical items and physical containers, the data records further reflecting the storage of physical items and physical containers with other physical containers. Some of the items are identified as as high-priority items. Containers to hold the high-priority items in transit are identified. Excess capacity in the containers is identified. Low-priority items to be sent are identified. The high-priority items and the low-priority items are aggregated into a list of items-to-be-moved. A list of tasks includes instructions to move the items-to-be-moved from their respective starting logical locations to the containers is made and distributed.

Abstract: Disclosed is a computer-implemented planning process that aids a system administrator in the task of creating a job schedule. The process treats enterprise computing resources as a grid of resources, which provides greater flexibility in assigning resources to jobs. During the planning process, an administrator or other user, or software, builds a job-dependency tree. Jobs are then ranked according to priority, pickiness, and network centricity. Difficult and problematic jobs then are assigned resources and scheduled first, with less difficult jobs assigned resources and scheduled afterwards. The resources assigned to the most problematic jobs then are changed iteratively to determine if the plan improves. This iterative approach not only increases the efficiency of the original job schedule, but also allows the planning process to react and adapt to new, ad-hoc jobs, as well as unexpected interruptions in resource availability.

Abstract: Disclosed is a computer-implemented planning process that aids a system administrator in the task of creating a job schedule. The process treats enterprise computing resources as a grid of resources, which provides greater flexibility in assigning resources to jobs. During the planning process, an administrator or other user, or software, builds a job-dependency tree. Jobs are then ranked according to priority, pickiness, and network centricity Difficult and problematic jobs then are assigned resources and scheduled first, with less difficult jobs assigned resources and scheduled afterwards. The resources assigned to the most problematic jobs then are changed iteratively to determine if the plan improves. This iterative approach not only increases the efficiency of the original job schedule, but also allows the planning process to react and adapt to new, ad-hoc jobs, as well as unexpected interruptions in resource availability.

Abstract: Disclosed is a computer-implemented planning process that aids a system administrator in the task of creating a job schedule. The process treats enterprise computing resources as a grid of resources, which provides greater flexibility in assigning resources to jobs. During the planning process, an administrator or other user, or software, builds a job-dependency tree. Jobs are then ranked according to priority, pickiness, and network centricity. Difficult and problematic jobs then are assigned resources and scheduled first, with less difficult jobs assigned resources and scheduled afterwards. The resources assigned to the most problematic jobs then are changed iteratively to determine if the plan improves. This iterative approach not only increases the efficiency of the original job schedule, but also allows the planning process to react and adapt to new, ad-hoc jobs, as well as unexpected interruptions in resource availability.

Abstract: Aqueous antiseptic solutions and compatible dyes and methods for making and using such solutions are provided. Specifically, in one embodiment, the present invention relates to an antiseptic solution comprising a micellular complex consisting of a cationic excipient and an anionic dye. The antiseptic solution further includes a cationic antiseptic.

Abstract: Aqueous antiseptic solutions and compatible dyes for staining skin and methods for making and using such solutions are provided. More specifically, in one embodiment, the present invention relates to an aqueous antiseptic solution comprising an aqueous solution of chlorhexidine or a salt thereof and a cationic dye in an amount sufficient to stain a patient's skin when the aqueous solution is applied thereon.

Abstract: Aqueous antiseptic solutions and compatible dyes and methods for making and using such solutions are provided. More specifically, in one embodiment, the present invention relates to an aqueous antiseptic solution comprising an aqueous solution of chlorhexidine or a salt thereof, an anionic dye in an amount sufficient to stain a patient's skin when the aqueous solution is applied thereon, and a cationic excipient.

Abstract: Disclosed is a computer-implemented planning process that aids a system administrator in the task of creating a job schedule. The process treats enterprise computing resources as a grid of resources, which provides greater flexibility in assigning resources to jobs. During the planning process, an administrator or other user, or software, builds a job-dependency tree. Jobs are then ranked according to priority, pickiness, and network centricity. Difficult and problematic jobs then are assigned resources and scheduled first, with less difficult jobs assigned resources and scheduled afterwards. The resources assigned to the most problematic jobs then are changed iteratively to determine if the plan improves. This iterative approach not only increases the efficiency of the original job schedule, but also allows the planning process to react and adapt to new, ad-hoc jobs, as well as unexpected interruptions in resource availability.