Abstract: Online outreach based reward model generation is described. A set of features that are indicative of an online outreach for a user are determined, the online outreach originating from a particular online network. Based on this set of features, an online outreach for the user originating from the particular online network is determined. A reward model is derived from the online outreach for the user. The reward model indicates locations within the particular online network that are to be searched for user information.

Abstract: The present invention relates to a novel block copolymer of structure 1, wherein, A- is a block polymer chain, B is a block polymer chain, wherein, A- and B- are chemically different, covalently connected polymer chains, which are phase separable and the moiety X(Y(Z)b)a is a junction group, which comprises a surface active pendant moiety Y(Z)b wherein: a is an integer from 1 to 4 denoting the number of surface active pendant moieties Y(Z)b on X, b is an integer from 1 to 5 denoting the number of Z moieties on the linking moiety Y, X is a linking group between the A polymer block, the B polymer block and the moiety Y, Y is a linking group or a direct valence bond between X and Z; and Z is a moiety independently selected from, a fluorine containing moiety, a Si1-Si8 siloxane containing moiety or a hydrocarbon moiety with at least 18 carbons, and further wherein the junction group X(Y(Z)b)a has a surface energy less than that that of the block A and less than that of the block B.

Abstract: A method for managing memory operations includes reading a first memory page from a storage device responsive to a request for the first memory page. The first memory page is stored to a system memory. Based on a pre-established set of association rules, one or more associated memory pages are identified that are related to the first memory page. The associated memory pages are read from the storage device and compressed to generate corresponding compressed associated memory pages. The compressed associated memory pages are also stored to the system memory to enable faster access to the associated memory pages during processing of the first memory page. The compressed associated memory pages are individually decompressed in response to the particular page being required for use during processing.

Abstract: A method provides cross enterprise communication in which intermediary communication components carry out cross enterprise communication. The method at a first sending enterprise comprises: receiving a signed encrypted message from a sender within a first enterprise; validating the sender; decrypting the message; encrypting the message for receipt by a second enterprise; signing the encrypted message by the first enterprise; and sending the re-signed re-encrypted message to a second enterprise. The method at the second receiving enterprise comprises: receiving a signed encrypted message from a first enterprise; validating that the first enterprise is the sender; decrypting the message; encrypting the message for receipt by one or more recipients at the second enterprise; signing the encrypted message by the second enterprise indicating that the message is from the first enterprise; and sending the re-signed re-encrypted message to the one or more recipients of the second enterprise.

Abstract: A method for controlling memory refresh operations in dynamic random access memories. The method includes determining a count of deferred memory refresh operations for a first memory rank. Responsive to the count approaching a high priority threshold, issuing an early high priority refresh notification for the first memory rank, which indicates the pre-determined time for performing a high priority memory refresh operation at the first memory rank. Responsive to the early high priority refresh notification, the behavior of a read reorder queue is dynamically modified to give priority scheduling to at least one read command targeting the first memory rank, and one or more of the at least one read command is executed on the first memory rank according to the priority scheduling. Priority scheduling removes these commands from the re-order queue before the refresh operation is initiated at the first memory rank.

Abstract: A fused multiply-adder is disclosed. The fused multiply-adder includes a Booth encoder, a fraction multiplier, a carry corrector, and an adder. The Booth encoder initially encodes a first operand. The fraction multiplier multiplies the Booth-encoded first operand by a second operand to produce partial products, and then reduces the partial products into a set of redundant sum and carry vectors. The carry corrector then generates a carry correction factor for correcting the carry vectors. The adder adds the redundant sum and carry vectors and the carry correction factor to a third operand to yield a final result.

Abstract: An improved method of making interconnect structures with self-aligned vias in semiconductor devices utilizes sidewall image transfer to define the trench pattern. The sidewall height acts as a sacrificial mask during etching of the via and subsequent etching of the trench, so that the underlying metal hard mask is protected. Thinner hard masks and/or a wider range of etch chemistries may thereby be utilized.

Abstract: A computer-implemented method simplifies a netlist, verifies the simplified netlist using induction, and remaps resulting inductive counterexamples via inductive trace lifting within a multi-algorithm verification framework. The method includes: a processor deriving a first unreachable state information that can be utilized to simplify the netlist; performing a simplification of the netlist utilizing the first unreachable state information; determining whether the first unreachable state information can be inductively proved on an original version of the netlist; and in response to the first unreachable state information not being inductively provable on the original netlist: projecting the first unreachable state information to a minimal subset; and adding the projected unreachable state information as an invariant to further constrain a child induction process.

Abstract: In a Virtual Input/Output (I/O) Server (VIOS) partition within a data processing system that comprises cluster-aware VIOSes, a method includes: performing, via a backup/restore utility of a cluster aware (CA) operating system (OS) executing on a processor resource of the first VIOS partition, a backup operation on the first VIOS partition, which creates a first configuration backup file having configuration information about the hardware, logical and virtual devices of the VIOS partition; storing the configuration backup file within local storage; and responsive to receipt of a VIOS restore command: retrieving the configuration backup file from the local storage; and restoring the configuration of the hardware, logical and virtual devices of the first VIOS to a state that existed at a time at which the backup operation creating the configuration backup file was performed.

Abstract: A memory system and data processing system for controlling memory refresh operations in dynamic random access memories. The memory controller comprises logic that: tracks a time remaining before a scheduled time for performing a high priority, high latency operation a first memory rank of the memory system; responsive to the time remaining reaching a pre-established early notification time before the schedule time for performing the high priority, high latency operation, biases the re-order queue containing memory access operations targeting the plurality of ranks to prioritize scheduling of any first memory access operations that target the first memory rank. The logic further: schedules the first memory access operations to the first memory rank for early completion relative to other memory access operations in the re-order queue that target other memory ranks; and performs the high priority, high latency operation at the first memory rank at the scheduled time.

Abstract: A system and a computer program product for selecting a primary-secondary host pair for mirroring virtual machines. The system includes a processor collecting data related to each of a plurality of potential primary-secondary host pairs in a computer network. The processor analyzes each of the plurality of potential primary-secondary host pairs in the computer network utilizing performance metrics. An ideal primary-secondary host pair in the computer network is determined by the processor based on the analysis of the performance metrics of each of the plurality of potential primary-secondary host pairs. In response to determining the ideal primary-secondary host pair, a primary host virtual machine is mirrored onto the secondary host of the primary-secondary host pair.

Abstract: A method allocates energy entitlement to a logical partition (LPAR) executing on a data processing system. An energy entitlement allocation (EEA) utility enables an administrator to specify a minimum and/or maximum energy entitlement and an LPAR priority. When the relevant LPARs utilize the respective minimum energy entitlement based on a respective energy consumption, the EEA utility determines whether the LPAR(s) has satisfied a respective maximum energy entitlement. When the LPAR has not satisfied its maximum energy entitlement, the EEA utility allocates unused energy entitlement from the data processing system to the LPAR, according to an allocation policy. Additionally, the EEA utility dynamically adjusts a priority level for the LPAR to efficiently control resource allocation, according to the LPAR's energy consumption relative to its energy entitlement.

Abstract: A system and computer program product allocates energy entitlement to a logical partition (LPAR) executing on a data processing system. An energy entitlement allocation (EEA) utility enables an administrator to specify a minimum and/or maximum energy entitlement and An LPAR priority. When the relevant LPARs utilize the respective minimum energy entitlement based on respective energy consumption, the EEA utility determines whether the LPAR (and other LPARs) has satisfied a respective maximum energy entitlement. When the LPAR has not satisfied its maximum energy entitlement, the EEA utility allocates unused energy entitlement from the data processing system to the LPAR, according to an allocation policy. Additionally, the EEA utility dynamically adjusts a priority level for the LPAR to efficiently control resource allocation, according to the LPAR's energy consumption relative to its energy entitlement.

Abstract: A method utilizes cluster-awareness to effectively support a live partition mobility (LPM) event and provide recovery from node failure within a Virtual Input/Output (I/O) Server (VIOS) cluster. An LPM utility creates a monitoring thread on a first VIOS on initiation of a corresponding LPM event. The monitoring thread tracks a status of an LPM and records status information in the mobility table of a database. The LPM utility creates other monitoring threads on other VIOSes running on the (same) source server. If the first VIOS VIOS sustains one of multiple failures, the LPM utility provides notification to other functioning nodes/VIOSes. The LPM utility enables a functioning monitoring thread to update the LPM status. In particular, a last monitoring thread may perform cleanup/update operations within the database based on an indication that there are nodes on the first server that are in failed state.

Abstract: A method is provided for using a temporary object handle. The method performed at a resource manager includes: receiving an open temporary handle request from an application for a resource object, wherein a temporary handle can by asynchronously invalidated by the resource manager at any time; and creating a handle control block at the resource manager for the object, including an indication that the handle is a temporary handle. The method then includes: responsive to receiving a request from an application to use a handle, which has been invalidated by the resource manager, sending a response to the application that the handle is invalidated.

Abstract: A method enables cluster-level backup and restore functionality of all Virtual Input/Output Server (VIOS) configuration data within a VIOS cluster and the data of a shared VIOS cluster database. The method comprises: performing, via a backup/restore utility of a VIOS partition, a cluster level backup, which creates a first VIOS cluster configuration backup file having configuration information about hardware, logical and virtual devices of each VIOS partition within a VIOS cluster and all cluster data from the shared VIOS database of the VIOS cluster; storing the VIOS cluster configuration backup file within a storage location; and responsive to receipt of a VIOS restore command at a VIOS partition: retrieving the configuration backup file from the storage location; restoring a configuration of the hardware, logical and virtual devices of each VIOS within the VIOS cluster to prior state; and restoring the shared VIOS database with the backed-up cluster data.

Abstract: A method, system and computer program product manages a batch processing job by: partitioning the batch processing job for execution in a plurality of batch execution servers from a cluster of computers; designating one computer from the cluster as a primary command server that oversees and coordinates execution of the batch processing job; selecting a second computer from the cluster to serve as a failover command server; storing an object data grid structure in the primary command server; replicating the object grid structure to create and store a replicated object grid structure in the failover command server; in response to the primary command server failing, restarting, by the failover command server, execution of batch processes from the batch processing job in the plurality of batch execution servers utilizing objects within the replicated object grid structure, and executing the batch processes with processing states at the time of the failover.

Abstract: An information handling system includes a processor with an instruction issue queue (IQ) that may perform age tracking operations. The issue queue IQ maintains or stores instructions that may issue out-of-order in an internal data store (IDS). The IDS organizes instructions in a queue position (QPOS) addressing arrangement. An age matrix of the IQ maintains a record of relative instruction aging for those instructions within the IDS. The age matrix updates latches or other memory cell data to reflect the changes in IDS instruction ages during a dispatch operation into the IQ. During dispatch of one or more instructions, the age matrix may update only those latches that require data change to reflect changing IDS instruction ages. The age matrix employs row and column data and clock controls to individually update those latches requiring update.

Abstract: A method, system, and computer program product provides effective management and deployment of image files within a Virtual Input/Output (I/O) Server (VIOS) cluster. An Image Management (IM) utility utilizes a discovery process to establish connections with objects in order to manage these objects. Following discovery of an ICP client, the IM utility enables creation of a virtual server partition and initiates the importing of a captured image to a VIOS cluster Storage Pool (SP). The IM utility creates logical units (LUs) within the Image Management Fileset (IMF) for each file within the captured image. The IM utility maps the LUs to the VIOS Cluster SP using unique image file handles. The IM utility configures the new storage that comprises the created LUs. The IM utility copies image files to the appropriate storage device/LU. When import/copy of the image is completed, the IM utility activates the virtual server partition.

Abstract: Disclosed is a method for identifying inactive objects in an entity. The inactive objects may be purged from an entity to reduce the size of the entity.