Abstract: Methods and systems for event prediction. The system includes at least one connector configured to gather at least partially incomplete data from at least one data source. The gathered data may be communicated to a model definition module that converts at least a subset of the gathered data into a prediction model in accordance with a received definition. A prediction module may receive a prediction query and, in response, supply an event prediction based on the prediction model.

Abstract: A system includes at least one connector configured to gather at least partially incomplete data from at least one data source. The gathered data is communicated to a model definition module that converts at least a subset of the gathered data into a prediction model in accordance with a received definition. A prediction module receives a prediction query and, in response, supplies an event prediction based on the prediction model.

Abstract: Methods and apparatus for predicting unknown values given a data set of known values. A prediction engine ingests a variety of data sets. Once the dataset has been ingested, requests for predictions may be presented to the prediction engine. The engine responds with a prediction as well as a confidence score based on the ingested information using a variety of techniques. Some of these techniques identify witness values in the ingested data that are similar to the requested prediction, other techniques compute witness values from ingested data, etc. These witness values are aggregated to yield an answer and a confidence level in a way that permits the user to review the underlying witness values.

Abstract: Systems and methods for tracking at least one entity. Systems according to various embodiments may include an interface for at least receiving training data representing movements of a plurality of training entities and a query regarding a test entity's movement, a memory, and at least one processor executing instructions stored on the memory to create a plurality of tracks, generate an index of the plurality of tracks, execute the received query, and output a feature value with respect to the test entity.

Abstract: Systems and methods for tracking at least one entity. Systems according to various embodiments may include an interface for at least receiving training data representing movements of a plurality of training entities and a query regarding a test entity's movement, a memory, and at least one processor executing instructions stored on the memory to create a plurality of tracks, generate an index of the plurality of tracks, execute the received query, and output a feature value with respect to the test entity.

Abstract: Methods and systems for event prediction. The system includes at least one connector configured to gather at least partially incomplete data from at least one data source. The gathered data may be communicated to a model definition module that converts at least a subset of the gathered data into a prediction model in accordance with a received definition. A prediction module may receive a prediction query and, in response, supply an event prediction based on the prediction model.

Abstract: Methods and apparatus for predicting unknown values given a data set of known values. A prediction engine ingests a variety of data sets. Once the dataset has been ingested, requests for predictions may be presented to the prediction engine. The engine responds with a prediction as well as a confidence score based on the ingested information using a variety of techniques. Some of these techniques identify witness values in the ingested data that are similar to the requested prediction, other techniques compute witness values from ingested data, etc. These witness values are aggregated to yield an answer and a confidence level in a way that permits the user to review the underlying witness values.

Abstract: An encoder generates a compressed data sequence from an original data sequence using many-to-one mapping independently of a source model associated with the original data sequence and without extracting the source model. A decoder uses both the source model associated with the original data sequence and the mapping applied during compression that is devoid of, in substance, the source model, to regenerate, at least in part, the original uncompressed data sequence from the compressed data sequence that does not include a significant portion of the source model.

Abstract: An encoder generates a compressed data sequence from an original data sequence using many-to-one mapping independently of a source model associated with the original data sequence and without extracting the source model. A decoder uses both the source model associated with the original data sequence and the mapping applied during compression that is devoid of, in substance, the source model, to regenerate, at least in part, the original uncompressed data sequence from the compressed data sequence that does not include a significant portion of the source model.

Abstract: Transmission delays are minimized when packets are transmitted from a source computer over a network to a destination computer. The source computer measures the network's available bandwidth, forms a sequence of output packets from a sequence of data packets, and transmits the output packets over the network to the destination computer, where the transmission rate is ramped up to the measured bandwidth. In conjunction with the transmission, the source computer monitors a transmission delay indicator which it computes using acknowledgement packets it receives from the destination computer. Whenever the indicator specifies that the transmission delay is increasing, the source computer reduces the transmission rate until the indicator specifies that the delay is unchanged. The source computer dynamically decides whether each output packet will be a forward error correction packet or a single data packet, where the decision is based on minimizing the expected transmission delays.

Abstract: Transmission delays are minimized when packets are transmitted from a source computer over a network to a destination computer. The source computer measures the network's available bandwidth, forms a sequence of output packets from a sequence of data packets, and transmits the output packets over the network to the destination computer, where the transmission rate is ramped up to the measured bandwidth. In conjunction with the transmission, the source computer monitors a transmission delay indicator which it computes using acknowledgement packets it receives from the destination computer. Whenever the indicator specifies that the transmission delay is increasing, the source computer reduces the transmission rate until the indicator specifies that the delay is unchanged. The source computer dynamically decides whether each output packet will be a forward error correction packet or a single data packet, where the decision is based on minimizing the expected transmission delays.

Abstract: A method converts an input image of noisy wrapped phases to an output image of absolute unwrapped phases. The noisy wrapped phases in the input image are represented as a set of re-wrapped phases and a set of phase shifts. The set of re-wrapped phases are partitioned into a first group and a second group. Integer differences between the phase shifts are optimized while holding the re-wrapped phases fixed. Then, the first group of re-wrapped phases are optimized, while holding the integer differences between the phase shifts, and the second group of re-wrapped phases fixed. The integer differences between the phase shifts are optimized again, while holding the re-wrapped phases fixed. Then, the second group of re-wrapped phases are optimized, while holding the integer differences between the phase shifts, and the first group of re-wrapped phases fixed. The optimizing steps are repeated until the re-wrapped phase converge.

Abstract: Data packet processing is described. A set of first data packets comprising hierarchically encoded data is accessed. A number of the first data packets are identified as candidate data packets to be potentially transmitted over a network to a receiver based at least in part on the hierarchically encoded data. The number of candidate data packets is then reduced based at least in part on the hierarchically encoded data so that a number of second data packets comprising error correction information for one or more of the first data packets can be increased.

Abstract: A method converts an input image of noisy wrapped phases to an output image of absolute unwrapped phases. The noisy wrapped phases in the input image are represented as a set of re-wrapped phases and a set of phase shifts. The set of re-wrapped phases are partitioned into a first group and a second group. Integer differences between the phase shifts are optimized while holding the re-wrapped phases fixed. Then, the first group of re-wrapped phases are optimized, while holding the integer differences between the phase shifts, and the second group of re-wrapped phases fixed. The integer differences between the phase shifts are optimized again, while holding the re-wrapped phases fixed. Then, the second group of re-wrapped phases are optimized, while holding the integer differences between the phase shifts, and the first group of re-wrapped phases fixed. The optimizing steps are repeated until the re-wrapped phase converge.