Abstract: A computer-implemented method according to one embodiment includes establishing, for each hop in pathways of a network, a relation between a desired reliability and channel error. Based on the established relations, a maximum number of copies of packets to send from a source in the network to a target in the network is determined. An overhead associated with sending packets from the source to the target in the network is determined for each of the hops, and a first sum of such overheads is also determined. An overhead associated with sending an acknowledgement packet to the source is determined for each of the hops. A second sum is a sum of the overheads associated with sending the acknowledgement packet to the source. In response to a determination that a sum of the first sum and the second sum is less than a predetermined threshold value, the pathways are used.

Abstract: A computer-implemented method according to one embodiment includes defining a network resilience construct of an internet-based network. The network resilience construct includes rankings for nodes of the internet-based network. The nodes of the internet-based network are manipulated to determine an Activated Core Affluence (ACA) of the internet-based network, and the ACA defines a likelihood, for each node, of retaining the ranking for the node upon a first group of the nodes losing connection with the internet-based network. The method further includes determining, based on the ACA, a resilient portion of the network that includes an activated core of the nodes. The nodes of the activated core retain connection with one or more other nodes of the internet-based network upon the first group of the nodes losing connection.

Abstract: A computer-implemented method according to one embodiment includes defining a micro-operative of a first network. The first network has non-obligatory nodes, and the micro-operative includes rankings assigned to each of the nodes of the first network. Activated core covalences (ACCs) are established for the nodes. Each ACC defines a minimum number of neighboring nodes of the node associated with the ACC that, upon the minimum number of neighboring nodes being disconnected from the first network, cause the ranking of the associated node to decrease. An aggregated activated core covalence (A-ACC) is established, and the A-ACC corresponds to a sum of at least some of the ACCs of the nodes. The method further includes determining, based on the A-ACC, whether to perform a communication operation using a path that includes the nodes in the first network.

Abstract: There is a need for more effective and efficient predictive data analysis. This need can be addressed by, for example, solutions for performing/executing cross-geographical predictive data analysis that enhance network transmission efficiency. In one example, a method includes determining forecasted superior domain event data for a hierarchically superior geographic domain at a forecasting period; determining forecasted inferior domain event data for each hierarchically inferior geographic domain associated with the hierarchically superior geographic domain at the forecasting period; determining confirmed inferior domain event data based at least in part on each hierarchically inferior geographic domain; and performing prediction-based actions based at least in part on each confirmed inferior domain event data.

Abstract: A core set of nodes of a graph representing a network of devices is identified, a node of the graph representing a device in the network of devices, an edge of the graph representing an ability to transmit data between two devices represented by corresponding nodes of the graph. A device represented by a node more than one hop from any node in the core set of nodes of the graph is removed from the network of devices, the removing resulting in a validated network of devices. Using a number of devices in the validated network of devices, a number of security keys in use in the validated network is validated. A device in the validated network is caused to perform a task.

Abstract: There is a need for more effective and efficient predictive data analysis. This need can be addressed by, for example, solutions for performing/executing cross-geographical predictive data analysis that enhance network transmission efficiency. In one example, a method includes determining forecasted superior domain event data for a hierarchically superior geographic domain at a forecasting period; determining forecasted inferior domain event data for each hierarchically inferior geographic domain associated with the hierarchically superior geographic domain at the forecasting period; determining confirmed inferior domain event data based at least in part on each hierarchically inferior geographic domain; and performing prediction-based actions based at least in part on each confirmed inferior domain event data.

Abstract: There is a need for more effective and efficient predictive data analysis. This need can be addressed by, for example, solutions for performing/executing cross-geographical predictive data analysis that enhance network transmission efficiency. In one example, a method includes determining forecasted superior domain event data for a hierarchically superior geographic domain at a forecasting period; determining forecasted inferior domain event data for each hierarchically inferior geographic domain associated with the hierarchically superior geographic domain at the forecasting period; determining confirmed inferior domain event data based at least in part on each hierarchically inferior geographic domain; and performing prediction-based actions based at least in part on each confirmed inferior domain event data.

Abstract: Systems and methods for firing an insulator is described. A kiln includes at least three zones on a wall of the kiln, a processing unit, and at least three PID controllers. The at least three zones have at least three burners arranged vertically. The processing unit determines firing ratio information for the at least three zones. Each of the PID controllers corresponds to a zone of the at least three zones. The at least three PID controllers control supply of gas and air to the at least three burners of the at least three zones based on the firing ratio information.

Abstract: A method and system for publishing video ads on Web pages, comprising providing a publisher interface for interactively specifying a video ad by a publisher wherein a video ad comprises one or more media clips and, optionally, one or more interactive controls, generating by the publisher interface a playlist that specifies the video ad wherein said playlist includes references to said one or more media clips and said optional interactive controls, storing by the publisher interface the playlist in a storage system, downloading the playlist from the storage system to a smart media player capable of processing said playlist, in response to a user request, and playing the video ad by the smart media player.

Abstract: A method and apparatus are provided for routing a packet within a plurality of n nodes arranged in a line or tree (or a combination of the foregoing), given a maximum stack depth, s. A fixed stack process for routing packets on a line given a stack depth, s, initially divides a line of n nodes into segments, such as n1/s approximately equal segments. A unique label is assigned to each segment and, within each segment, one of up to n1/s labels is assigned to each node. A fixed stack process for routing packets on a tree, given a target stack depth, s, initially identifies a subset, S, of at nodes from the tree, such as at most 3 n1/s nodes, such that after the subset, S, is removed, each remaining subtree has at most n(s-1)/s nodes. A unique label is assigned to each of the nodes in the subset S and, within each remaining subtree, one of up to n(s-1)/s labels is assigned to each node.

Abstract: Described are methods and apparatus, including computer program products, for indicating a pending content change within a benefits content system. A request to change a portion of content within the benefits content system is received. A work item is initiating in a work flow process in response to the request. The work item is associated with the portion of content. Based on the association between the work item and the portion of content, an indicator is displayed indicating a pending change when the portion of content is displayed. Details about the pending change to the portion of content based on information included in the work item are displayed in response to an event. The indicator is automatically removed when the work item is closed.

Abstract: Described are methods and apparatus, including computer program products, for content filtering within a benefits content management the system. Benefits programs identifiers are defined within the benefits content system. A mapping rule is defined mapping one or more mapping elements into an access key. Values are retrieved for the one or more mapping elements based on a request to display one or more of the benefits programs. The access key is generated using one or more of the retrieved values. A listing is displayed of those benefits programs having an identifier that matches the generated access key.

Abstract: A method and apparatus are provided for routing a packet within a plurality of n nodes arranged in a line or tree (or a combination of the foregoing), given a maximum stack depth, s. A fixed stack process for routing packets on a line given a stack depth, s, initially divides a line of n nodes into segments, such as n1/s approximately equal segments. A unique label is assigned to each segment and, within each segment, one of up to n1/s labels is assigned to each node. A fixed stack process for routing packets on a tree, given a target stack depth, s, initially identifies a subset, S, of at nodes from the tree, such as at most 3n1/s nodes, such that after the subset, S, is removed, each remaining subtree has at most n(s-1)/s nodes. A unique label is assigned to each of the nodes in the subset S and, within each remaining subtree, one of up to n(s-1)/s labels is assigned to each node.