Abstract: The invention relates to a complex comprising a Cell Penetrating Peptide and one or more nucleic acids which can be applied to a plant by spraying and which can trigger a physiological outcome. Hereto, the one or more nucleic acids complex with a Cell Penetrating Peptide can be dissolved in water without the presence of additional components in the solution.

Abstract: Reference frame detection using sensor metadata, including: storing a plurality of first frames each corresponding to first metadata, wherein the first metadata for each first frame of the plurality of first frames is based on first sensor data from one or more sensors; generating a second frame corresponding to second metadata based on the one or more sensors; identifying, based on the first metadata of the plurality of first frames and the second metadata, a reference frame of the plurality of first frames; and encoding the second frame based on the reference frame.

Abstract: There is provided methods and apparatuses for training multiple reinforcement learning agents without requiring inter-agent or agent-server communication in multi-agent reinforcement learning applications where fairness between the agents is desired. According to embodiments, fairness between multiple deep reinforcement learning agents in the same environment can be achieved while not requiring inter-agent communication. The method includes creating episodes where two or more RL agents are deployed in a shared environment, each RL agent behaving independently according to its own policy without inter-agent communication. The method further includes storing the RL agent's experiences in a shared experience replay buffer that exists across multiple training episodes, the shared experience replay buffer being shared between the RL agents.

Abstract: Systems, apparatuses, and methods for reducing latency when consuming an encoded video bitstream in real-time are disclosed. A video encoder encodes a video bitstream and writes chunks of the encoded bitstream to a bitstream buffer. Prior to the encoder completing the encoding of an entire frame, or an entire slice of a frame, a consumer module consumes encoded chunks of the bitstream. In one implementation, to enable pipelining of the consumption with the encoding, the encoder updates a buffer write pointer with an indication of the amount of data that has been written to the bitstream buffer. The consumer module retrieves encoded data from the bitstream buffer up to the location indicated by the buffer write pointer. In this way, the consumer module is able to access and consume encoded video data prior to the encoder finishing encoding an entire frame or an entire slice of the frame.

Abstract: Reference frame detection using sensor metadata, including: storing a plurality of first frames each corresponding to first metadata, wherein the first metadata for each first frame of the plurality of first frames is based on first sensor data from one or more sensors; generating a second frame corresponding to second metadata based on the one or more sensors; identifying, based on the first metadata of the plurality of first frames and the second metadata, a reference frame of the plurality of first frames; and encoding the second frame based on the reference frame.

Abstract: Systems, apparatuses, and methods for reducing latency when consuming an encoded video bitstream in real-time are disclosed. A video encoder encodes a video bitstream and writes chunks of the encoded bitstream to a bitstream buffer. Prior to the encoder completing the encoding of an entire frame, or an entire slice of a frame, a consumer module consumes encoded chunks of the bitstream. In one implementation, to enable pipelining of the consumption with the encoding, the encoder updates a buffer write pointer with an indication of the amount of data that has been written to the bitstream buffer. The consumer module retrieves encoded data from the bitstream buffer up to the location indicated by the buffer write pointer. In this way, the consumer module is able to access and consume encoded video data prior to the encoder finishing encoding an entire frame or an entire slice of the frame.

Abstract: Methods and systems for data communication in a distributed computing environment include: providing a first network node associated with a first data processing location, the first network node providing provide a network interface for a first distributed computing node at the first data processing location; and forwarding task data flow messages from the first distributed computing node to a second distributed computing node at a second data processing location via a second network node associated with the second data processing location.

Abstract: Systems, apparatuses, and methods for reducing latency when consuming an encoded video bitstream in real-time are disclosed. A video encoder encodes a video bitstream and writes chunks of the encoded bitstream to a bitstream buffer. Prior to the encoder completing the encoding of an entire frame, or an entire slice of a frame, a consumer module consumes encoded chunks of the bitstream. In one implementation, to enable pipelining of the consumption with the encoding, the encoder updates a buffer write pointer with an indication of the amount of data that has been written to the bitstream buffer. The consumer module retrieves encoded data from the bitstream buffer up to the location indicated by the buffer write pointer. In this way, the consumer module is able to access and consume encoded video data prior to the encoder finishing encoding an entire frame or an entire slice of the frame.

Abstract: Methods and systems for data communication in a distributed computing environment include: providing a first network node associated with a first data processing location, the first network node providing provide a network interface for a first distributed computing node at the first data processing location; and forwarding task data flow messages from the first distributed computing node to a second distributed computing node at a second data processing location via a second network node associated with the second data processing location.

Abstract: Methods and systems for scheduling jobs in a distributed computing environment include: obtaining a set of task identifiers, each task identifier identifying a corresponding data processing task included in one of a plurality of jobs to be scheduled for execution at one of a plurality of data processing locations; and selecting and scheduling a data processing task of the identified job having a longest optimal completion time to the data processing location corresponding to the optimal completion time of the selected data processing task.

Abstract: Methods and systems for scheduling jobs in a distributed computing environment include: obtaining a set of task identifiers, each task identifier identifying a corresponding data processing task included in one of a plurality of jobs to be scheduled for execution at one of a plurality of data processing locations; and selecting and scheduling a data processing task of the identified job having a longest optimal completion time to the data processing location corresponding to the optimal completion time of the selected data processing task.

Abstract: A method for coding a dependent view picture based on a reference picture includes selecting a reference picture from a base view picture list if a metric of intra macroblocks in an evaluated picture is greater than a first threshold, selecting a reference picture from a dependent view picture list if a metric of skipped macroblocks in the evaluated picture is greater than a second threshold, and coding a dependent view picture using the selected reference picture. An application-controlled weighting mechanism may be used if both of the thresholds are not met.

Abstract: Described is a distributed peer-assisted multicast content delivery system (e.g., a multiparty conferencing application) that uses an adaptive link rate control protocol to discover and adapt to an arbitrary topology quickly and converge to efficient link rate allocations allowed by an underlying network. Link rates are regularly obtained and used to determine trees for sending packets to other nodes. Network coding is used to implement data multicast so that mixtures (i.e., linear combinations) of the packets are transmitted in the network. The redundant packets may be differentiated from non-redundant (“innovative”) packets such that network conditions may be measured by link innovation and/or session innovation.

Abstract: A method for coding a dependent view picture based on a reference picture includes selecting a reference picture from a base view picture list if a metric of intra macroblocks in an evaluated picture is greater than a first threshold, selecting a reference picture from a dependent view picture list if a metric of skipped macroblocks in the evaluated picture is greater than a second threshold, and coding a dependent view picture using the selected reference picture. An application-controlled weighting mechanism may be used if both of the thresholds are not met.

Abstract: Described is a distributed peer-assisted multicast content delivery system (e.g., a multiparty conferencing application) that uses an adaptive link rate control protocol to discover and adapt to an arbitrary topology quickly and converge to efficient link rate allocations allowed by an underlying network. Link rates are regularly obtained and used to determine trees for sending packets to other nodes. Network coding is used to implement data multicast so that mixtures (i.e., linear combinations) of the packets are transmitted in the network. The redundant packets may be differentiated from non-redundant (“innovative”) packets such that network conditions may be measured by link innovation and/or session innovation.