Abstract: Technical solutions are described for a seller to bypass a spam filter. An example method includes sending, by a message preempting apparatus, for receipt by a server corresponding to the seller, a transaction identifier in response to a transaction between a user and the seller. The method also includes sending, by the message preempting apparatus, for receipt by a messaging server, the transaction identifier, where the messaging server, in response, bypasses a spam filter for a message that is associated with the transaction identifier.

Abstract: A computer-implemented method includes determining that a database query warrants a first projection operation to project a plurality of input rows to a plurality of projected rows, where each of the plurality of input rows has one or more variable-length columns. A first projection control block is constructed, by a computer processor, to describe the first projection operation. The first projection operation is offloaded to a hardware accelerator. The first projection control block is provided to the hardware accelerator, and the first projection control block enables the hardware accelerator to perform the first projection operation at streaming rate.

Abstract: In an embodiment of the present invention, a first message is determined. The first message is associated with two or more users. The two or more users include a sender of the first message and one or more recipients of the first message. In response to determining that a first user of the two or more users is currently generating a second message, which is a response to the first message, it is determined whether a second user of the two or more users of the first message is currently generating a third message, which is a response to the first message. In response to determining that the second user is currently generating the third message, the first user is notified that the second user is currently generating the third message, and the second user is notified that the first user is currently generating the second message.

Abstract: From a present version of a first artifact which is mutable, an artifact baseline corresponding to the present version of the first artifact can be created. Responsive to creating the artifact baseline, the present version of the first artifact can be made immutable. Present versions of children artifacts of the present version of the first artifact which are mutable also can be made immutable. Responsive to identifying a change to the present version of the first artifact, a new version of the first artifact can be automatically created, wherein the new version of the first artifact is mutable.

Abstract: A method for minimizing head seek movement and improving I/O performance of a hard disk drive is disclosed. In one embodiment, such a method includes logically dividing storage space of a hard disk drive into storage areas of substantially equal size. The method monitors a temperature of each of the storage areas. The temperature indicates how frequently data in a corresponding storage area is accessed. The method swaps data in storage areas of the hard disk drive based on temperature. These swaps involve moving hotter data toward outer tracks of the disk drive and colder data toward inner tracks of the disk drive. A corresponding system and computer program product are also disclosed.

Abstract: A system and method for cognitive risk mitigation are presented. Embodiments comprise journey prediction, parsing of data sources, risk assessment and mitigation, and natural-language user interaction by a cognitive processor. Data is gathered from a plurality of data sources and analyzed in the context of one or more of the user's intention(s). A dialogue with the user, in natural language, aims to provide and select one or more suggestions relating to the one or more user intention(s) such that the risk(s) relating to the one or more user's intention(s) is reduced. During the dialogue, cognitive reasoning may be performed, wherein the cognitive reasoning includes the ability to justify each suggestion and the ability to infer information from the interaction such as, for example, data obtained in a dialogue may inform subsequent inferences. The embodiments may use speech synthesis and speech recognition in an interactive spoken dialogue.

Abstract: Methods, computing systems and computer program products implement embodiments of the present invention that include detecting a loss of communication with a given storage node among multiple storage nodes in a distributed computing system. Upon detecting the loss of communication, a log including updates to the data stored in the given storage node is recorded and, the recorded updates can be applied to the given storage node upon communication with the given storage node being reestablished. In some embodiments, the distributed storage system may be configured as a software defined storage system where the storage nodes can be implemented as either virtual machines or software containers. In additional embodiments, upon detecting the loss of communication, a redistribution of the mirrored data among remaining storage nodes is initiated upon detecting the loss of communication, and the redistribution is rolled back upon reestablishing the communication.

Abstract: A method for utilizing parallel paths of differing performance to improve efficiency is disclosed. In one embodiment, such a method includes transmitting, over a faster path, a first command to perform first actions intended to improve efficiency of second actions associated with a second command. The method transmits, over a slower path in parallel with the faster path, the second command. Alternatively, a method for utilizing parallel paths of differing performance to improve efficiency includes receiving, over a faster path, a first command to perform first actions intended to improve efficiency of second actions associated with a second command. The method executes the first command to perform the first actions. The method receives, over a slower path in parallel with the faster path, the second command and executes the second command to perform the second actions. Corresponding systems and computer program products are also disclosed.

Abstract: Embodiments for managing drones by one or more processors are described. A first aerial drone having a payload coupled thereto is controlled such that the first aerial drone travels from a first location to a second location. A second aerial drone is controlled such that the second aerial drone travels to the second location. While the first aerial drone and the second aerial drone are in flight at the second location, the payload is detached from the first aerial drone and coupled to the second aerial drone. After the payload is detached from the first aerial drone and while the payload is coupled to the second aerial drone, the second aerial drone is controlled such that the second aerial drone travels from the second location to a third location.

Abstract: A communication device associated with a first party monitors a call between the first party and a second party. The communication device identifies a request for sensitive information from the second party during the call. The communication device determines whether the requested sensitive information matches sensitive information stored in an encrypted data store by determining whether a text representation of the requested sensitive information matches a text representation of the sensitive information stored in the encrypted data store. The communication device sends, responsive to determining that the requested for sensitive information matches the stored sensitive information, the requested sensitive information to the second party.

Abstract: Provided are a computer program product, system, and method for locking a cache line for a burst write operations on a bus. A cache line is allocated in a cache for a target address. A lock is set for the cache line, wherein setting the lock prevents the data in the cache line from being cast out. Data is written to the cache line. All the data in the cache line is flushed to the target address over a bus in response to completing writing to the cache line.

Abstract: A method is provided for optimized timer placement. A request to apply a new timer in a computer system is received and an interrupt time for the new timer is extracted from the new timer. A timer list is accessed for each processor in the system responsive to the received request. A range for placement of the new timer is established with respect to each of the accessed timer lists. A timer expiry delay is calculated between proximal processor interrupts and the extracted interrupt time based on the established range placement. Proximity of the extracted interrupt time within the existing processor interrupts is determined and one of the processors is selected based on the calculation and the determined proximity. The new timer is placed on the selected processor.

Abstract: A first layer of a first material is deposited on a first structure and a second structure, a surface of the first structure being disposed substantially parallelly to a surface of the second structure in at least one direction. A selectively removable material is deposited over the first layer and removed up to a height of a first step. The first material is removed from a portion of the first layer that is exposed from removing the selectively removable material up to the height of the first step. A remainder of the selectively removable material is removed to expose a second portion of the first layer, the second portion of the first layer forming the first step. A second layer of a second material is deposited on the first structure, the second structure, and the second portion of the first layer, causing a formation of a stepped structure.

Abstract: A system and computer program product are provided for optimized timer placement. A request to apply a new timer in a computer system is received and an interrupt time for the new timer is extracted from the new timer. A timer list is accessed for each processor in the system responsive to the received request. A range for placement of the new timer is established with respect to each of the accessed timer lists. A timer expiry delay is calculated between proximal processor interrupts and the extracted interrupt time based on the established range placement. Proximity of the extracted interrupt time within the existing processor interrupts is determined and one of the processors is selected based on the calculation and the determined proximity. The new timer is placed on the selected processor.

Abstract: Embodiments include providing content requested by a user via an access point capable of wireless communication. Aspects include receiving the content provided by the management server and storing the content provided by the management server into a volatile memory provided in the wireless communication apparatus. Aspects also include storing difference data into a nonvolatile memory if it is requested to change the content stored in the volatile memory and monitoring a state of communication connection with the access point and whether or not a packet giving an instruction to hold the content has been received. Aspects further include deleting the content stored in the volatile memory if communication with the access point is disconnected or if the packet is unreceived.

Abstract: Embodiments of the invention provide a method, system and computer program product for log file reduction according to problem space topology. A method for log file reduction according to problem space topology can include receiving a fault report for a fault in a solution executing in memory of one or more computers of a computer data processing system. The method further can include extracting references to at least two resources of the computer data processing system from the fault report. The method yet further can include filtering a set of all log files for the computer data processing system to only a subset of log files related to the at least two resources. Finally, the method can include displaying the subset of log files in a log file analyzer.

Abstract: A method of forming a skip-via, including, forming a first dielectric layer on a first metallization layer, forming a second metallization layer on the first dielectric layer and a second dielectric layer on the second metallization layer, removing a section of the second dielectric layer to form a via to the second metallization layer, removing a portion of the second metallization layer to form an aperture, and removing an additional portion of the second metallization layer to form an exclusion zone.

Abstract: Techniques are disclosed for automatically deleting files downloaded and designated as temporary use. In response to a request to download a file and open in a second application, a web browser or other client ascertains whether the file should be deleted after use in the second application. If the file is designated for temporary use, then the client monitors the application accessing the file. When the file is closed, the client deletes the file.

Abstract: A method for verifying data consistency between update-in-place data structures and append-only data structures containing change histories associated with the update-in-place data structures is provided. The method includes loading data from an update-in-place data structure to a first set of hash buckets in a processing platform, loading data from append-only data structures to a second set of hash buckets in the processing platform, performing a bucket-level comparison between the data in the first set of hash buckets and the data in the second set of has buckets, and generating a report based on the bucket-level comparison.

Abstract: A first request may be received to update a first set of values. The first set of values may be stored at a first location within a first data page of a database. The first location may be read-only. In response to the receiving of the first request, a first set of records may be inserted into a second data page. The first set of records may include the update of the first set of values. In response to the inserting, a forward pointer may be stored in the first data page that points to the first set of records on the second data page. One or more committed values may be identified on the second data page. In response to the identifying, the one or more committed values may be merged from the second data page to a third data page.