Abstract: The invention relates to a method of inducing osteogenesis in a subject comprising administrating a chitosan material to the a subject in need of osteogenesis, wherein the chitosan material having a chitosan with a degree of deacetylation at the range of 70%˜90%, and the chitosan is 0.15% by weight of the chitosan material. The method of the present invention can induce bone-forming and promote osseointegration around an implant.

Abstract: A computer-implemented method, according to one embodiment, includes: splitting a video stream into a plurality of sub-streams, encoding each of the sub-streams in parallel, and transmitting a packet to a receiver, wherein the packet includes a number of the encoded sub-streams. Each of the sub-streams individually provide a unique version of the video stream having a lower video quality, while merging more than one of the sub-streams provides a merged version of the video stream having a relatively higher video quality. Moreover, the number of the encoded sub-streams included in the packet transmitted to the receiver corresponds to a quality of service associated with the receiver. Other systems, methods, and computer program products are described in additional embodiments.

Abstract: A method to determine a hierarchical fair share of resources among one or more scheduling peers. The method determines a greatest fairness difference between the usage percentage difference of a most-served competing peer and that of a least-served competing peer. The method determines a greatest accumulated fairness difference between the accumulated usage percentage difference of the most-served competing peer and that of the least-served competing peer. The method adjusts a resource allocation such that resources from the most-served competing peer are allocated to the least-served competing peer if an adjustment condition is met, wherein the adjustment condition is based on one or both of i) the greatest fairness difference, and ii) whether the greatest accumulated fairness difference exceeds at least one threshold.

Abstract: A method to determine a hierarchical fair share of resources among one or more scheduling peers. The method determines a greatest fairness difference between the usage percentage difference of a most-served competing peer and that of a least-served competing peer. The method determines a greatest accumulated fairness difference between the accumulated usage percentage difference of the most-served competing peer and that of the least-served competing peer. The method adjusts a resource allocation such that resources from the most-served competing peer are allocated to the least-served competing peer if an adjustment condition is met, wherein the adjustment condition is based on one or both of i) the greatest fairness difference, and ii) whether the greatest accumulated fairness difference exceeds at least one threshold.

Abstract: A technique for operating a grid includes receiving, by a resource manager executing on a data processing system of the grid, an allocation request from a first application for one or more resources. The resource manager determines whether a service that is in standby mode is available for utilization by the first application. In response to the service that is standby mode being available for utilization by the first application, the resource manager assigns one or more resources associated with the service and the service to the first application.

Abstract: Embodiments of the present invention provide systems and methods for allocating multiple resources. In one embodiment, a configured resource plan is used to construct a hierarchical tree. The system then identifies a set of unowned resources from the configured resource plan and sends the set of unowned resource to a share pool. The share pool is either a global or local pool and can be accessed by one or more consumers. In response to changes in workload demands, a set of unused resources are lent to a global or local pool.

Abstract: Embodiments of the present invention provide systems and methods for allocating multiple resources. In one embodiment, a configured resource plan is used to construct a hierarchical tree. The system then identifies a set of unowned resources from the configured resource plan and sends the set of unowned resource to a share pool. The share pool is either a global or local pool and can be accessed by one or more consumers. In response to changes in workload demands, a set of unused resources are lent to a global or local pool.

Abstract: A single workload scheduler schedules sessions and tasks having a tree structure to resources, wherein the single workload scheduler has scheduling control of the resources and the tasks of the parent-child workload sessions and tasks. The single workload scheduler receives a request to schedule a child session created by a scheduled parent task that when executed results in a child task; the scheduled parent task is dependent on a result of the child task. The single workload scheduler receives a message from the scheduled parent task yielding a resource based on the resource not being used by the scheduled parent task, schedules tasks to backfill the resource, and returns the resource yielded by the scheduled parent task to the scheduled parent task based on receiving a resume request from the scheduled parent task or determining dependencies of the scheduled parent task have been met.

Abstract: A computer processor allocates a service instance to a first resource of a resource pool, in which the service instance corresponds to performing a first task and for the service instance to continue to occupy the first resource subsequent to task completion, and determines the first resource to be idle. The first resource is returned to a resource pool, with the service instance occupying the first resource as a global standby service instance of a first service. In response to a request of a resource to perform a task from a second application, in which the request for the resource includes a global name associated with the first service of the global standby service instance, occupying the first resource returned to the resource pool, allocating from the resource pool, the first resource occupied by the global standby service instance, based on the global name associated with the first service.

Abstract: A single workload scheduler schedules sessions and tasks having a tree structure to resources, wherein the single workload scheduler has scheduling control of the resources and the tasks of the parent-child workload sessions and tasks. The single workload scheduler receives a request to schedule a child session created by a scheduled parent task that when executed results in a child task; the scheduled parent task is dependent on a result of the child task. The single workload scheduler receives a message from the scheduled parent task yielding a resource based on the resource not being used by the scheduled parent task, schedules tasks to backfill the resource, and returns the resource yielded by the scheduled parent task to the scheduled parent task based on receiving a resume request from the scheduled parent task or determining dependencies of the scheduled parent task have been met.

Abstract: A method to determine a hierarchical fair share of resources among one or more scheduling peers. The method determines a greatest fairness difference between the usage percentage difference of a most-served competing peer and that of a least-served competing peer. The method determines a greatest accumulated fairness difference between the accumulated usage percentage difference of the most-served competing peer and that of the least-served competing peer. The method adjusts a resource allocation such that resources from the most-served competing peer are allocated to the least-served competing peer if an adjustment condition is met, wherein the adjustment condition is based on one or both of i) the greatest fairness difference, and ii) whether the greatest accumulated fairness difference exceeds at least one threshold.

Abstract: A system for treatment of contaminated sediments and soils using free radical chemical reaction and phase separation processes comprises a sediment or soil inlet system, a slurry tank, wherein the inlet system feeds the slurry tank, a water make-up tank, an optional acid storage tank, wherein the water make-up tank and the acid storage tank are connected to the slurry tank, a reaction vessel, wherein the slurry tank is connected to the reaction vessel, an oxidant agent storage tank, an optional catalyst storage tank, wherein the oxidant agent storage tank and the catalyst storage tank are connected to the reaction vessel, a first particle separator, wherein the reaction vessel is connected to the first particle separator, and an oil/water separator, wherein the first particle separator is connected to the oil/water separator is disclosed. A method for treatment of contaminated sediments and soils is also disclosed.

Abstract: A method to determine a hierarchical fair share of resources among one or more scheduling peers. The method determines a greatest fairness difference between the usage percentage difference of a most-served competing peer and that of a least-served competing peer. The method determines a greatest accumulated fairness difference between the accumulated usage percentage difference of the most-served competing peer and that of the least-served competing peer. The method adjusts a resource allocation such that resources from the most-served competing peer are allocated to the least-served competing peer if an adjustment condition is met, wherein the adjustment condition is based on one or both of i) the greatest fairness difference, and ii) whether the greatest accumulated fairness difference exceeds at least one threshold.

Abstract: A method, computer program product, and system for optimizing service pools supporting resource sharing and enforcing SLAs, to minimize service restart. A computer processor determines a first resource to be idle, wherein a service instance continues to occupy the first resource that is idle. The processor adds the first resource to a resource pool, wherein the service instance continues to occupy the first resource as a global standby service instance on the first resource. The processor receives a request for a resource, wherein the request for the resource includes a global name associated with a service that corresponds to the global standby service instance, and the processor allocates, from the resource pool, the first resource having the global standby service instance, based on the request for the resource that includes the global name associated with the service corresponding to the global standby service instance.

Abstract: A method, computer program product, and system for optimizing service pools supporting resource sharing and enforcing SLAs, to minimize service restart. A computer processor determines a first resource to be idle, wherein a service instance continues to occupy the first resource that is idle. The processor adds the first resource to a resource pool, wherein the service instance continues to occupy the first resource as a global standby service instance on the first resource. The processor receives a request for a resource, wherein the request for the resource includes a global name associated with a service that corresponds to the global standby service instance, and the processor allocates, from the resource pool, the first resource having the global standby service instance, based on the request for the resource that includes the global name associated with the service corresponding to the global standby service instance.

Abstract: Embodiments of the present invention provide systems and methods for allocating multiple resources. In one embodiment, a configured resource plan is used to construct a hierarchical tree. The system then identifies a set of unowned resources from the configured resource plan and sends the set of unowned resource to a share pool. The share pool is either a global or local pool and can be accessed by one or more consumers. In response to changes in workload demands, a set of unused resources are lent to a global or local pool.

Abstract: Embodiments of the present invention provide systems and methods for allocating multiple resources. In one embodiment, a configured resource plan is used to construct a hierarchical tree. The system then identifies a set of unowned resources from the configured resource plan and sends the set of unowned resource to a share pool. The share pool is either a global or local pool and can be accessed by one or more consumers. In response to changes in workload demands, a set of unused resources are lent to a global or local pool.

Abstract: A single workload scheduler schedules sessions and tasks having a tree structure to resources, wherein the single workload scheduler has scheduling control of the resources and the tasks of the parent-child workload sessions and tasks. The single workload scheduler receives a request to schedule a child session created by a scheduled parent task that when executed results in a child task; the scheduled parent task is dependent on a result of the child task. The single workload scheduler receives a message from the scheduled parent task yielding a resource based on the resource not being used by the scheduled parent task, schedules tasks to backfill the resource, and returns the resource yielded by the scheduled parent task to the scheduled parent task based on receiving a resume request from the scheduled parent task or determining dependencies of the scheduled parent task have been met.

Abstract: A consumer accesses a secure area of a transaction account website and provides their login information for retail websites. The transaction account issuer or a third party creates a script that logs in to the retail websites on behalf of the consumer and transmits transaction account information associated with the transaction account. The script sets the transaction account as the default payment method for the retail website. The transaction account information may be evergreen, such that whenever the transaction account information changes, the script updates the retail websites.

Abstract: A consumer accesses a secure area of a transaction account website and provides their login information for retail websites. The transaction account issuer or a third party creates a script that logs in to the retail websites on behalf of the consumer and transmits transaction account information associated with the transaction account. The script sets the transaction account as the default payment method for the retail website. The transaction account information may be evergreen, such that whenever the transaction account information changes, the script updates the retail websites.