Abstract: A message limit value to be used in enqueuing one or more messages on a queue of a device of the computing environment is obtained. The message limit value indicates whether an extended maximum message length is supported by the device. The extended maximum message length is different from a default maximum message length supported by the device. Based on determining that the extended maximum message length is supported and that the obtained message limit value has a defined relationship with a select value, at least one message of an extended length is enqueued on the queue of the device.

Abstract: A message limit value to be used in enqueuing one or more messages on a queue of a device of the computing environment is obtained. The message limit value indicates whether an extended maximum message length is supported by the device. The extended maximum message length is different from a default maximum message length supported by the device. Based on determining that the extended maximum message length is supported and that the obtained message limit value has a defined relationship with a select value, at least one message of an extended length is enqueued on the queue of the device.

Abstract: Aspects include detecting, at a first point in time, that a first person at a first location is within a vicinity of one or more other people and predicting, for each of the one or more people, a future location of the other person at a future point. The future point in time is subsequent to the first point in time and a confidence level is assigned to the prediction. A travel route from the first location to a destination location is generated based at least in part on the one or more predicted future locations and their assigned confidence levels. The generated travel route includes travel route locations that are more than a specified distance from at least one of the predicted future locations having an assigned confidence level greater than a confidence level threshold. Travel route guidance along the generated travel route is provided to the first person.

Abstract: A cryptographic hardware security module (HSM) includes a memory storage device and an immutable hardware unit in signal communication with the memory storage device. The memory storage device is configured to store firmware. The immutable hardware unit is configured to perform a hash operation on targeted firmware stored in the memory storage device to determine an authenticity of the targeted firmware based at least in part on results of the hash operation.

Abstract: A cryptographic hardware security module (HSM) includes a memory storage device and an immutable hardware unit in signal communication with the memory storage device. The memory storage device is configured to store firmware. The immutable hardware unit is configured to perform a hash operation on targeted firmware stored in the memory storage device to determine an authenticity of the targeted firmware based at least in part on results of the hash operation.

Abstract: A computing system may be protected from revoked system updates. A computing system receives an object and scans it for revocation updates to a security structure of the computing system. The security structure is a monotonically nondecreasing collection of segments containing data on whether a system update is revoked, and a system update's status as revoked signifies the revoked system update can no longer be used by the computing system. Based upon scanning the object, the computing system identifies and validates a revocation update. The computing system resolves the revocation update by applying the revocation update to the security structure, by adding or changing one or more segments of the security structure identified by the revocation update, in response to determining that the revocation update is valid, or by denying application of the revocation update to the security structure in response to determining that the revocation update is invalid.

Abstract: A computing system may be protected from revoked system updates. A computing system receives an object and scans it for revocation updates to a security structure of the computing system. The security structure is a monotonically nondecreasing collection of segments containing data on whether a system update is revoked, and a system update's status as revoked signifies the revoked system update can no longer be used by the computing system. Based upon scanning the object, the computing system identifies and validates a revocation update. The computing system resolves the revocation update by applying the revocation update to the security structure, by adding or changing one or more segments of the security structure identified by the revocation update, in response to determining that the revocation update is valid, or by denying application of the revocation update to the security structure in response to determining that the revocation update is invalid.

Abstract: A computing system may be protected from revoked system updates. A computing system receives an object and scans it for revocation updates to a security structure of the computing system. The security structure is a monotonically nondecreasing collection of segments containing data on whether a system update is revoked and a system update's status as revoked signifies the revoked system update can no longer be used by the computing system. Based upon scanning the object, the computing system identifies and validates a revocation update. The computing system resolves the revocation update by applying the revocation update to the security structure, by adding or changing one or more segments of the security structure identified by the revocation update, in response to determining that the revocation update is valid, or by denying application of the revocation update to the security structure in response to determining that the revocation update is invalid.

Abstract: A computing system may be protected from revoked system updates. A computing system receives an object and scans it for revocation updates to a security structure of the computing system. The security structure is a monotonically nondecreasing collection of segments containing data on whether a system update is revoked, and a system update's status as revoked signifies the revoked system update can no longer be used by the computing system. Based upon scanning the object, the computing system identifies and validates a revocation update. The computing system resolves the revocation update by applying the revocation update to the security structure, by adding or changing one or more segments of the security structure identified by the revocation update, in response to determining that the revocation update is valid, or by denying application of the revocation update to the security structure in response to determining that the revocation update is invalid.

Abstract: A computing system may be protected from revoked system updates. A computing system receives an object and scans it for revocation updates to a security structure of the computing system. The security structure is a monotonically nondecreasing collection of segments containing data on whether a system update is revoked, and a system update's status as revoked signifies the revoked system update can no longer be used by the computing system. Based upon scanning the object, the computing system identifies and validates a revocation update. The computing system resolves the revocation update by applying the revocation update to the security structure, by adding or changing one or more segments of the security structure identified by the revocation update, in response to determining that the revocation update is valid, or by denying application of the revocation update to the security structure in response to determining that the revocation update is invalid.

Abstract: A computing system may be protected from revoked system updates. A computing system receives an object and scans it for revocation updates to a security structure of the computing system. The security structure is a monotonically nondecreasing collection of segments containing data on whether a system update is revoked and a system update's status as revoked signifies the revoked system update can no longer be used by the computing system. Based upon scanning the object, the computing system identifies and validates a revocation update. The computing system resolves the revocation update by applying the revocation update to the security structure, by adding or changing one or more segments of the security structure identified by the revocation update, in response to determining that the revocation update is valid, or by denying application of the revocation update to the security structure in response to determining that the revocation update is invalid.

Abstract: A computing system may be protected from revoked system updates. A computing system receives an object and scans it for revocation updates to a security structure of the computing system. The security structure is a monotonically nondecreasing collection of segments containing data on whether a system update is revoked and a system update's status as revoked signifies the revoked system update can no longer be used by the computing system. Based upon scanning the object, the computing system identifies and validates a revocation update. The computing system resolves the revocation update by applying the revocation update to the security structure, by adding or changing one or more segments of the security structure identified by the revocation update, in response to determining that the revocation update is valid, or by denying application of the revocation update to the security structure in response to determining that the revocation update is invalid.

Abstract: Provided herein are heterocyclic compounds for treatment of CSF1R, FLT3, KIT, and/or PDGFR? kinase mediated diseases. Also provided are pharmaceutical compositions comprising the compounds and methods of using the compounds and compositions.

Abstract: A method, system, and computer program product for performing robust, parallel data transfer by a processor device. Data is segmented into k-bit segments, where k?1. The k-bit segments are convolution encoded, using m?1 stages of delay. The n output streams are transmitted in parallel for increased effective data rate, where n>k. The n output streams are received. An XOR (Exclusive OR) logic is applied to the n output streams with pathing allowed by the convolution encoding, in a trellis-decoding diagram.

Abstract: Provided herein are heterocyclic compounds for treatment of CSF1R, FLT3, KIT, and/or PDGFR? kinase mediated diseases. Also provided are pharmaceutical compositions comprising the compounds and methods of using the compounds and compositions.

Abstract: Provided herein are heterocyclic compounds for treatment of CSF1R, FLT3, KIT, and/or PDGFR? kinase mediated diseases. Also provided are pharmaceutical compositions comprising the compounds and methods of using the compounds and compositions.

Abstract: A software version management system comprising a host driver and at least one software module. The host driver comprises migration means to start, stop and replace the software modules on a computer system in response to replacement actions.

Abstract: A method, system, and computer program product for performing robust, parallel data transfer by a processor device. Data is segmented into k-bit segments, where k?1. The k-bit segments are convolution encoded, using m?1 stages of delay. The n output streams are transmitted in parallel for increased effective data rate, where n>k. The n output streams are received. An XOR (Exclusive OR) logic is applied to the n output streams with pathing allowed by the convolution encoding, in a trellis-decoding diagram.

Abstract: A method, system, and computer program product for performing robust, parallel data transfer by a processor device. Data is segmented into k-bit segments, where k?1. The k-bit segments are convolution encoded, using m?1 stages of delay. The n output streams are transmitted in parallel for increased effective data rate, where n>k. The n output streams are received. The n output streams are exclusive-or'ed with pathing allowed by the convolution encoding, in a trellis-decoding diagram. Error-corrected data is identified as an overall path in the trellis-decoding diagram with zero Hamming radius.

Abstract: A method, system, and computer program product for performing robust, parallel data transfer by a processor device. Data is segmented into k-bit segments, where k?1. The k-bit segments are convolution encoded, using m?1 stages of delay. The n output streams are transmitted in parallel for increased effective data rate, where n>k. The n output streams are received. The n output streams are exclusive-or'ed with pathing allowed by the convolution encoding, in a trellis-decoding diagram. Error-corrected data is identified as an overall path in the trellis-decoding diagram with zero Hamming radius.