Abstract: Generally discussed herein are systems, apparatuses, and methods for creating message traffic. In one or more embodiments, a method can include receiving message characteristics of a plurality of messages to transmit to a device and transmitting, using processing circuitry, the plurality of messages to the device, wherein the plurality of messages are configured to replicate message traffic that includes the received message characteristics. The message characteristics can include a message pattern, a message density (e.g., high burstiness, low burstiness, or consistent traffic density), a message size, a message type, a message inter-arrival time, or other message characteristic.

Abstract: Generally discussed herein are systems, apparatuses, and methods for creating message traffic. In one or more embodiments, a method can include receiving message characteristics of a plurality of messages to transmit to a device and transmitting, using processing circuitry, the plurality of messages to the device, wherein the plurality of messages are configured to replicate message traffic that includes the received message characteristics. The message characteristics can include a message pattern, a message density (e.g., high burstiness, low burstiness, or consistent traffic density), a message size, a message type, a message inter-arrival time, or other message characteristic.

Abstract: A method for allocating system resources includes receiving, by a processor, an assignment list that includes a first assignment and a second assignment, each assignment is assigned a priority and includes tasks associated with each assignment, assigning each assignment to a system resource according to the assigned priority of each assignment, populating a tree for the system resource, the tree including each assignment assigned to the system resource ordered by the relative priority of the assignments, generating task roots associated with each task associated with each assignment in the tree, associating each task root with a task score, defining a first system resource root that includes the task roots having the lowest task scores, calculating a first system resource root score as a function of the task scores of the first system resource root, and saving the first system resource root as the current best estimate system resource root.

Abstract: A method for allocating system resources includes receiving, by a processor, an assignment list that includes a first assignment and a second assignment, each assignment is assigned a priority and includes tasks associated with each assignment, assigning each assignment to a system resource according to the assigned priority of each assignment, populating a tree for the system resource, the tree including each assignment assigned to the system resource ordered by the relative priority of the assignments, generating task roots associated with each task associated with each assignment in the tree, associating each task root with a task score, defining a first system resource root that includes the task roots having the lowest task scores, calculating a first system resource root score as a function of the task scores of the first system resource root, and saving the first system resource root as the current best estimate system resource root.

Abstract: In one or more embodiments, a method and system for scheduling resources is provided. The method includes receiving, in a processor, a plurality of concurrent processing requests. Each concurrent processing request is associated with at least one device configured to perform one or more different tasks at a given time. The at least one device has a predefined processing capacity. If one or more of the plurality of concurrent processing requests exceeds the predefined capacity of the at least one device at the given time, the processor determines a priority score for each concurrent processing request based, at least in part, on a time value associated with each concurrent processing request and whether any one of the concurrent processing requests is currently being processed at the given time. Responsive to the determined priority score at the given time, a highest priority processing request is executed for the at least one device.

Abstract: A device and method for wide area surveillance of a geographic region includes identifying a search space associated with a geographic region having a plurality of sub-regions. The search space is divided into a plurality of search cells and observation data is collected for each of the plurality of search cells based on a scan of the geographic region. An event generation rate is calculated for each of the search cells based on the collected observation data. One or more of the sub-regions are identified as a region(s) of interest based on the calculated event generation rates. A coverage pattern is estimated for each of the sub-regions and a desired revisit rate is calculated for the region of interest based on the estimated coverage pattern. The desired revisit rate is then output for scanning the region of interest.

Abstract: A device and method for wide area surveillance of a geographic region includes identifying a search space associated with a geographic region having a plurality of sub-regions. The search space is divided into a plurality of search cells and observation data is collected for each of the plurality of search cells based on a scan of the geographic region. An event generation rate is calculated for each of the search cells based on the collected observation data. One or more of the sub-regions are identified as a region(s) of interest based on the calculated event generation rates. A coverage pattern is estimated for each of the sub-regions and a desired revisit rate is calculated for the region of interest based on the estimated coverage pattern. The desired revisit rate is then output for scanning the region of interest.

Abstract: In one or more embodiments, a method and system for scheduling resources is provided. The method includes receiving, in a processor, a plurality of concurrent processing requests. Each concurrent processing request is associated with at least one device configured to perform one or more different tasks at a given time. The at least one device has a predefined processing capacity. If one or more of the plurality of concurrent processing requests exceeds the predefined capacity of the at least one device at the given time, the processor determines a priority score for each concurrent processing request based, at least in part, on a time value associated with each concurrent processing request and whether any one of the concurrent processing requests is currently being processed at the given time. Responsive to the determined priority score at the given time, a highest priority processing request is executed for the at least one device.