Abstract: A cross-platform data migration method and a cross-platform data migration system include generating backup data of a virtual machine in a host system, identifying a first file format associated with backup data, converting the first file format associated with backup data into a platform-neutral file format associated with backup data, and storing the backup data in the platform-neutral file format in a first storage platform.

Abstract: An ad collision machine can be configured to evaluate collision queries for possible ad collisions and is associated with an ad datacenter configured to evaluate and respond to bid requests on behalf of a plurality of advertisers. The ad collision machine can comprise a plurality of nodes and a data cache containing a plurality of user ID—campaign ID keys representing recently submitted bids in response to bid requests. Once a selected node receives a collision query, a user ID—campaign ID key is retrieved from the collision query. If the first key is not found in the data cache, it is written to the data cache by the node and the ad collision machine returns that user ID—campaign ID pair as available to be bid on.

Abstract: Disclosed are a cannabinoid composition and an application of the same in preparing a medicine for treating neurodegenerative diseases, so as to solve the drawbacks of conventional medicines such as serious side effects and degraded therapeutic effect after long-term administration. The cannabinoid composition includes: cannabidiol and cannabigerol, a mass ratio of the cannabidiol to the cannabigerol ranging from 1:1 to 1:10, or from 1:0.3 to 1:0.5, or from 1:0.5 to 1:0.7, or from 1:07 to 1:1.

Abstract: A cross-platform data migration method and a cross-platform data migration system include generating backup data of a virtual machine in a host system, identifying a first file format associated with backup data, converting the first file format associated with backup data into a platform-neutral file format associated with backup data, and storing the backup data in the platform-neutral file format in a first storage platform.

Abstract: An ad collision machine can be configured to evaluate collision queries for possible ad collisions and is associated with an ad datacenter configured to evaluate and respond to bid requests on behalf of a plurality of advertisers. The ad collision machine can comprise a plurality of nodes and a data cache containing a plurality of user ID—campaign ID keys representing recently submitted bids in response to bid requests. Once a selected node receives a collision query, a user ID—campaign ID key is retrieved from the collision query. If the first key is not found in the data cache, it is written to the data cache by the node and the ad collision machine returns that user ID—campaign ID pair as available to be bid on.

Abstract: An ad collision machine can be configured to evaluate collision queries for possible ad collisions and is associated with an ad datacenter configured to evaluate and respond to bid requests on behalf of a plurality of advertisers. The ad collision machine can comprise a plurality of nodes and a data cache containing a plurality of user ID-campaign ID keys representing recently submitted bids in response to bid requests. Once a selected node receives a collision query, a user ID-campaign ID key is retrieved from the collision query. If the first key is not found in the data cache, it is written to the data cache by the node and the ad collision machine returns that user ID-campaign ID pair as available to be bid on.

Abstract: An ad collision machine can be configured to evaluate collision queries for possible ad collisions and is associated with an ad datacenter configured to evaluate and respond to bid requests on behalf of a plurality of advertisers. The ad collision machine can comprise a plurality of nodes and a data cache containing a plurality of user ID-campaign ID keys representing recently submitted bids in response to bid requests. Once a selected node receives a collision query, a user ID-campaign ID key is retrieved from the collision query. If the first key is not found in the data cache, it is written to the data cache by the node and the ad collision machine returns that user ID-campaign ID pair as available to be bid on.

Abstract: An ad collision machine can be configured to evaluate collision queries for possible ad collisions and is associated with an ad datacenter configured to evaluate and respond to bid requests on behalf of a plurality of advertisers. The ad collision machine can comprise a plurality of nodes and a data cache containing a plurality of user ID-campaign ID keys representing recently submitted bids in response to bid requests. Once a selected node receives a collision query, a user ID-campaign ID key is retrieved from the collision query. If the first key is not found in the data cache, it is written to the data cache by the node and the ad collision machine returns that user ID-campaign ID pair as available to be bid on.

Abstract: A system has a repository that stores a plurality of events. Each event requests to utilize one or more functions in a component. An event sequencing module analyzes an event sequencing key of the event if the event requests a function having a component definition that includes an event sequence qualifier. The event sequencing module grants a lock to the event for the function if no other event having the same value for the event sequencing key has the lock for the function. The event sequencing module prevents the event from being processed if another event having the same value for the event sequencing key has the lock for the function. The event sequencing key is composed of one or more object attributes. The system has a worker server that receives the event, if the event obtains the lock, and processes the function requested by the event.

Abstract: A computer program product is disclosed. The computer program product includes a computer useable medium that has a computer readable program. The computer readable program when executive on a computer causes the computer to receive a request from a component to invoke a function. Further, the computer readable program, when executed on a computer, causes the computer to asynchronously perform the function according to the request. In addition, the computer readable program, when executed on a computer, causes the computer to provide, to one or more programs, an indication that the function has completed work according to the request.

Abstract: A system and method for providing Quality-of-Service (QoS) functions to concurrent event-processing applications in a multi-processing database environment are described. The system includes an Event-Listener interface for determining the QoS functions applicable to the events being processed and an Event-Service interface for invoking the determined QoS functions. The Event-Service interface loads, initializes and activates the QoS functions. The QoS functions are based on service definitions. The Event-Service interface further initializes the service providers and sends the events that need QoS support to the respective service providers for processing. The QoS functions include the services commonly needed in a clustered event-processing database system like Event-Sequencing, Event-Isolation, High-Availability, Event-Filtering and Flow-Control. Other QoS functions might be added to the database system using the same interfaces provided by the invention.

Abstract: A system and method for monitoring dynamic scopes in a runtime environment is disclosed. The system and method utilizes an algorithm which may be applied to both synchronous and asynchronous invocations. The method comprises determining an initial scope of a source component, the initial scope being a scope of the source component upon providing a synchronous call to invoke a target component. The scope declaration specified by the target component is determined. A resultant scope present upon invocation of the target component is then determined. The resultant scope is determined based on the initial scope of the source component and the scope declaration specified by the target component. A record is stored in a centralized location identifying the resultant scope, and the target component as a participant in the resultant scope.

Abstract: Disclosed is a technique for flow control. It is detected that a work request is being transferred to an in-memory structure. A maximum limit is compared with a number of work requests stored in the in-memory structure. If the number of work requests stored in the in-memory structure equals the maximum limit, a notification is sent that indicates that additional work requests are not to be sent.

Abstract: A computer implemented method, apparatus, and computer usable program code for updating multiple concurrent versions of shared artifact libraries. Shared artifact libraries are associated with a consuming application for establishing shared artifact libraries upon which the consuming application has a dependency for artifacts. A snapshot of the shared artifact libraries associated with the consuming application in an active session is created in response to starting a session. The shared artifact libraries are updated in response to new versions and updates of the shared artifact libraries becoming available. Artifacts are dispensed from the shared artifact libraries to the consuming application based on the snapshot of the session.

Abstract: A system and method for providing Quality-of-Service (QoS) functions to concurrent event-processing applications in a multi-processing database environment are described. The system includes an Event-Listener interface for determining the QoS functions applicable to the events being processed and an Event-Service interface for invoking the determined QoS functions. The Event-Service interface loads, initializes and activates the QoS functions. The QoS functions are based on service definitions. The Event-Service interface further initializes the service providers and sends the events that need QoS support to the respective service providers for processing. The QoS functions include the services commonly needed in a clustered event-processing database system like Event-Sequencing, Event-Isolation, High-Availability, Event-Filtering and Flow-Control. Other QoS functions might be added to the database system using the same interfaces provided by the invention.

Abstract: A computer implemented method, data processing system, and computer program product for providing a generic sequencing service for ordering processing requests in a scalable business integration environment. When a request is received at a sequencing component, the operation specified in the request is identified. A determination is then made as to whether to sequence the operation according to a sequencing specification. If the operation is to be sequenced, key information of the operation is classified according to the sequencing specification. A lock on the request is then requested using the operation and the key information. Responsive to the lock being granted, a determination is then made as to whether the request is synchronous or asynchronous. If the request is synchronous, the target service component is invoked synchronously. If the request is asynchronous, the target service component is invoked asynchronously.

Abstract: Disclosed is a technique for system recovery. Information identifying one or more work requests is retrieved, along with an order of the work requests, for a business process. If the business process is non-transactional, an in-memory structure is created for the business process, a recovery stub is created for each work request, and the recovery stub for each work request is placed into the in-memory structure based on the order.

Abstract: A system and method for monitoring dynamic scopes in a runtime environment is disclosed. The system and method utilizes an algorithm which may be applied to both synchronous and asynchronous invocations. The method comprises determining an initial scope of a source component, the initial scope being a scope of the source component upon providing a synchronous call to invoke a target component. The scope declaration specified by the target component is determined. A resultant scope present upon invocation of the target component is then determined. The resultant scope is determined based on the initial scope of the source component and the scope declaration specified by the target component. A record is stored in a centralized location identifying the resultant scope, and the target component as a participant in the resultant scope.

Abstract: A business integration (BI) system receives business objects from a source application at an event partitioner. Event partitioner partitions received business objects into independent sets based on interdependent events, and allocates each independent group of business events to a separate event queue based a partitioning modulo reduction transformation of the independent sets to determine the correct event queue for storing a particular received business object. This transformation reduces the number of independent sets to a number of event groups equal to the number of allocated event queues. Events in different groups are delivered to an interchange server through the separate event queues so that they may be processed independently and in parallel, thus improving the overall performance of the interchange server, while guaranteeing that dependent events are processed in the correct serial order.

Abstract: Disclosed is a technique for buffering work requests. It is determined that a work request is about to be placed into an in-memory structure. When the in-memory structure is not capable of storing the work request, a work request ordering identifier for the work request is stored into an overflow structure. When the in-memory structure is capable of storing the work request, a recovery stub is generated for the work request ordering identifier, and the recovery stub is stored into the in-memory structure.