Abstract: Provided is a vaccine composition for preventing respiratory syncytial virus (RSV) infection, which is in the form of a liposome formulation including a RSV antigen, monophosphoryl lipid A (MLA), and/or a cobalt-porphyrin-phospholipid (CoPoP) conjugate. The vaccine composition exhibits excellent vaccine efficacy from a RSV antigen with enhanced immunogenicity and a combination of immune adjuvants for enhancing immune activity and antigen presentation.

Abstract: A radio frequency (RF) generator system includes first and second RF power sources, each RF power source applying a respective RF signal and second RF signal to a load. The first RF signal is applied in accordance with the application of the second RF signal. The application of the first RF signal is synchronized to application of the second RF signal. The first RF signal may be amplitude modulated in synchronization with the second RF signal, and the amplitude modulation can include blanking of the first RF signal. A frequency offset may be applied to the first RF signal in synchronization with the second RF signal. A variable actuator associated with the first RF power source may be controlled in accordance with the second RF signal.

Abstract: Methods, systems, and computer-readable media are disclosed for dynamic partitioning in distributed computing environments. One method includes: receiving a first data set and a second data set; mapping the first data set into a first set of key-value pairs; mapping the second data set into a second set of key-value pairs; estimating, using a sketch, a frequency count for each key based on the first set of key-value pairs and the second set of key-value pairs; determining whether the estimated frequency count for each key is greater than or equal to a predetermined threshold; and partitioning the key when the estimated frequency count for the key is greater than or equal to the predetermined threshold.

Abstract: Methods, systems, and computer-readable media are disclosed for dynamic partitioning in distributed computing environments. One method includes: receiving a first data set and a second data set; mapping the first data set into a first set of key-value pairs; mapping the second data set into a second set of key-value pairs; estimating, using a sketch, a frequency count for each key based on the first set of key-value pairs and the second set of key-value pairs; determining whether the estimated frequency count for each key is greater than or equal to a predetermined threshold; and partitioning the key when the estimated frequency count for the key is greater than or equal to the predetermined threshold.

Abstract: Methods, systems, and computer-readable media are disclosed for dynamic partitioning in distributed computing environments. One method includes: receiving a first data set and a second data set; mapping the first data set into a first set of key-value pairs; mapping the second data set into a second set of key-value pairs; estimating, using a sketch, a frequency count for each key based on the first set of key-value pairs and the second set of key-value pairs; determining whether the estimated frequency count for each key is greater than or equal to a predetermined threshold; and partitioning the key when the estimated frequency count for the key is greater than or equal to the predetermined threshold.

Abstract: Methods, systems, and computer-readable media are disclosed for dynamic partitioning in distributed computing environments. One method includes: receiving a first data set and a second data set; mapping the first data set into a first set of key-value pairs; mapping the second data set into a second set of key-value pairs; estimating, using a sketch, a frequency count for each key based on the first set of key-value pairs and the second set of key-value pairs; determining whether the estimated frequency count for each key is greater than or equal to a predetermined threshold; and partitioning the key when the estimated frequency count for the key is greater than or equal to the predetermined threshold.

Abstract: Methods, systems, and computer-readable media are disclosed for dynamic partitioning in distributed computing environments. One method includes: receiving a first data set and a second data set; mapping the first data set into a first set of key-value pairs; mapping the second data set into a second set of key-value pairs; estimating, using a sketch, a frequency count for each key based on the first set of key-value pairs and the second set of key-value pairs; determining whether the estimated frequency count for each key is greater than or equal to a predetermined threshold; and partitioning the key when the estimated frequency count for the key is greater than or equal to the predetermined threshold.

Abstract: A system includes one or more memory devices storing instructions, and one or more processors configured to execute the instructions to perform steps of a method for automatic communication failure recovery. The system may receive customer data associated with a customer and generate a message based on the customer data. The system may transmit the message to the customer and upon determining that the customer has failed to engage the message within a predetermined amount of time, the system may monitor an application service to detect when the customer logs in and then generate a communication link between a CSR terminal and the customer's device and cause a communication interface within the application to launch on the customer's device.

Abstract: Methods, systems, and computer-readable media are disclosed for dynamic partitioning in distributed computing environments. One method includes: receiving a first data set and a second data set; mapping the first data set into a first set of key-value pairs; mapping the second data set into a second set of key-value pairs; estimating, using a sketch, a frequency count for each key based on the first set of key-value pairs and the second set of key-value pairs; determining whether the estimated frequency count for each key is greater than or equal to a predetermined threshold; and partitioning the key when the estimated frequency count for the key is greater than or equal to the predetermined threshold.

Abstract: A system includes one or more memory devices storing instructions, and one or more processors configured to execute the instructions to perform steps of a method for automatic communication failure recovery. The system may receive customer data associated with a customer and generate a message based on the customer data. The system may transmit the message to the customer and upon determining that the customer has failed to engage the message within a predetermined amount of time, the system may monitor an application service to detect when the customer logs in and then generate a communication link between a CSR terminal and the customer's device and cause a communication interface within the application to launch on the customer's device.

Abstract: A system includes one or more memory devices storing instructions, and one or more processors configured to execute the instructions to perform steps of a method for automatic communication failure recovery. The system may receive customer data associated with a customer and generate a message based on the customer data. The system may transmit the message to the customer and upon determining that the customer has failed to engage the message within a predetermined amount of time, the system may monitor an application service to detect when the customer logs in and then generate a communication link between a CSR terminal and the customer's device and cause a communication interface within the application to launch on the customer's device.

Abstract: Methods, systems, and computer-readable media are disclosed for dynamic partitioning in distributed computing environments. One method includes: receiving a first data set and a second data set; mapping the first data set into a first set of key-value pairs; mapping the second data set into a second set of key-value pairs; estimating, using a sketch, a frequency count for each key based on the first set of key-value pairs and the second set of key-value pairs; determining whether the estimated frequency count for each key is greater than or equal to a predetermined threshold; and partitioning the key when the estimated frequency count for the key is greater than or equal to the predetermined threshold.

Abstract: Methods, systems, and computer-readable media are disclosed for dynamic partitioning in distributed computing environments. One method includes: receiving a first data set and a second data set; mapping the first data set into a first set of key-value pairs; mapping the second data set into a second set of key-value pairs; estimating, using a sketch, a frequency count for each key based on the first set of key-value pairs and the second set of key-value pairs; determining whether the estimated frequency count for each key is greater than or equal to a predetermined threshold; and partitioning the key when the estimated frequency count for the key is greater than or equal to the predetermined threshold.