Abstract: A method and associated computer system. A first machine executes machine code in a debugging session on the first machine. The machine code had been previously received by the first machine from a second machine. The machine code includes machine executable instructions. The machine code was generated from compilation of source code developed and compiled on the second machine. In response to a change in the machine code having detected by the first machine in the debugging session on the first machine, the first machine determines a portion of the source code associated with the change in the machine code based on a profile. The profile indicates a mapping between the source code and the machine code. The first machine, while communicating with the second machine, causes the portion of the source code to be updated on the second machine based on the change in the machine code.

Abstract: Approaches presented herein enable creating a dynamic geofence based on an availability of a product to optimize a flow of customers to a venue. Specifically, a geofence at a venue (e.g., retail outlet, restaurant, ticket office, etc.) is established based on a reference point and an area having a range. A campaign related to a product (e.g., a sales promotion, etc.) is associated with the established geofence. An aspect of the established geofence is dynamically modified based on an availability of the product in order to optimize the flow of customers to the venue.

Abstract: Provided are techniques for efficient subquery predicate generation to reduce processing in a multi-table join. It is determined that a query is to be rewritten, wherein the query includes a predicate for a first column of a first table and a second column of a second table. The query is rewritten with generated subquery predicates for the first table that are to be applied to the second table and with generated subquery predicates for the second table that are to be applied to the first table. Minimum and maximum ranges for columns of the generated subquery predicates at a cursor open are determined. The minimum and maximum ranges are merged to determine inclusive ranges that exist in the first table and the second table. The generated subquery predicates are rewritten as derived local subquery predicates with the inclusive ranges. The query with the derived local subquery predicates is executed.

Abstract: Methods, computer program products, and systems are presented. The methods include, for instance: collecting data corresponding to factors that affect a resalable return rate of the item. By predicting the resalable return rate based on the factors and respective contribution of the factors, number of total units of the item is adjusted.

Abstract: A method prevents a cascading failure in a complex stream computer system. The method includes receiving binary data that identifies multiple subcomponents in a complex stream computer system. These identified multiple subcomponents include upstream subcomponents that generate multiple outputs and a downstream subcomponent that executes a downstream computational process that uses the multiple outputs. The method dynamically adjusts which of multiple inputs are used by the downstream subcomponent in an attempt to generate an output from the downstream subcomponent that meets a predefined trustworthiness level for making a first type of prediction. If no variations of execution of one or more functions used by the downstream subcomponent ever produce an output that meets the predefined trustworthiness level for making a first type of prediction, then computer hardware executes a new downstream computational process that produces a different second type of prediction.

Abstract: Embodiments include systems, methods, and computer program products for using a multi-tier hang buster for detecting and breaking out of hang conditions in a processor. One method includes determining a plurality of actions available at each of a plurality of tiers used for breaking out of the hang condition in the processor. The method also includes, after detecting the hang condition on a first thread of the processor, performing one or more actions available at a first tier of the plurality of tiers to break out of the hang condition. The method further includes, after performing the one or more actions at the first tier and determining that the hang condition is still present, performing one or more actions available at one or more second tiers of the plurality of tiers to break out of the hang condition.

Abstract: Techniques for analyzing data based on the vulnerability of the corresponding device are provided. A plurality of devices are classified into a plurality of groups based on respective measures of vulnerability associated with each device, and a respective weighting factor is determined for each respective group of the plurality of groups based at least in part on a number of devices included in the respective group. An evidentiary value of data received from a first device of the plurality of devices is modified, based on the respective weighting factor associated with the first device. Further, a probable state of a physical environment is determined, based in part on the data received from the first device.

Abstract: An integrated circuit includes a first communication interface for communicatively coupling the integrated circuit with a coherent data processing system, a second communication interface for communicatively coupling the integrated circuit with an accelerator unit including an effective address-based accelerator cache for buffering copies of data from a system memory, and a real address-based directory inclusive of contents of the accelerator cache. The real address-based directory assigns entries based on real addresses utilized to identify storage locations in the system memory. The integrated circuit further includes request logic that communicates memory access requests and request responses with the accelerator unit.

Abstract: Communicating a message via a leakage-deterring encryption scheme. A sender computer stores a public key pko of a recipient key-pair (pko, sko) of a message recipient, a commitment c, bound to the public key pko, to a secret s of the message recipient, and a public key pkt of a decryptor key-pair (pkt, skt). A receiver computer stores a secret key sko of the recipient key-pair (pko, sko), the commitment c and an opening o to the commitment. A decryptor computer stores a secret key skt of the decryptor key-pair (pkt, skt). The sender computer is adapted to encrypt a message m for the message recipient by generating ciphertexts. The sender computer sends the ciphertexts to the receiver computer. The receiver computer is adapted to send a ciphertext to the decryptor computer and provide a proof. The decryptor computer is adapted to verify the proof.

Abstract: A method, system and computer program product for providing privacy protection to data streams in a distributed computing environment. The method includes concurrently processing, by a plurality of computer machines, data streams of attributes containing data values received by each of the plurality of local computer machines; indexing the data values for each attribute of the plurality of data streams received by each of the plurality of local computer machines; providing the indexed data values to a main computer machine; integrating, by the main computer machine, the local computer machine indexed data values into a global index data structure for the plurality of data streams; and identifying privacy vulnerabilities of the attributes that are direct identifiers and quasi-identifiers based on the global index.

Abstract: Embodiments of the present disclosure relate to text resources in an application. According to a method, an updated application is run, wherein information displayed on at least one text resource in the updated application is editable and the information displayed on at least one text resource in an original application of the updated application is not editable. Then, in response to a first piece of information displayed on a text resource of the at least one text resource being changed to a second piece of information, ID of the text resource of the at least one text resource in the updated application is obtained; and the second piece of information is mapped to the ID of the text resource in a file corresponding to the at least one text resource in the updated application.

Abstract: Embodiments of the present invention provides methods, computer program products, and a system for determining and displaying an image selected from a plurality of images based on a physical displacement of a device. Embodiments of the present invention can be used to generate a composite model based on a collected plurality of images. Embodiments of the present invention can be used to determine an image for display selected from the generated composite model based on a physical displacement of a device.

Abstract: A method for execution by a request scheduler includes receiving a set of requests for execution from at least one request issuer. Resource requirements are determined for each of the set of requests, and current resource availability data is determined for resources indicated in the resource requirements. Scheduling data is generated for the set of requests based on the resource requirements and the current resource availability data. A first subset of the set of requests are added to a queue in response to the scheduling data indicating the first subset of the set of requests be queued for execution. Execution of the set of requests is facilitated in accordance with the scheduling data by facilitating immediate, simultaneous execution of a second subset of the set of requests and by facilitating serial execution of the first subset of the set of requests.

Abstract: Methods, systems and computer program products for providing notifications to drivers based on observed local driver patterns are provided. Aspects include storing a number of times that each driver travels across a road segment and classifying the drivers as local drivers for the road segment if the number of times the driver traversed the road segment is greater than a threshold number. Aspects also include determining an expected driving pattern for the road segment. Based on a determination that a local driver deviated from the expected driving pattern, aspects include storing an indication of how the local driver deviated from the expected driving pattern and a condition at that time. Based on a determination that greater than a threshold percentage of local drivers deviated from the expected driving pattern, aspects include notifying a driver traversing the road segment of a variant driving pattern for the road segment.

Abstract: Provided are techniques for handling cache and Non-Volatile Storage (NVS) out of sync writes. At an end of a write for a cache track of a cache node, a cache node uses cache write statistics for the cache track of the cache node and Non-Volatile Storage (NVS) write statistics for a corresponding NVS track of an NVS node to determine that writes to the cache track and to the corresponding NVS track are out of sync. The cache node sets an out of sync indicator in a cache data control block for the cache track. The cache node sends a message to the NVS node to set an out of sync indicator in an NVS data control block for the corresponding NVS track. The cache node sets the cache track as pinned non-retryable due to the write being out of sync and reports possible data loss to error logs.

Abstract: Systems, computer-implemented methods and/or computer program products that facilitate answering questions that involve mathematical computations are provided. In one embodiment, a computer-implemented method comprises: transforming, by a system operatively coupled to a processor, a natural language query into a first logical representation and extrinsic knowledge into a second logical representation relevant to the natural language query; merging, by the system, the first logical representation and the second logical representation into a third logical representation; and generating, by the system, answers for the natural language query based on processing of the third logical representation.

Abstract: A request is received to perform a point in time copy operation from a source volume to a space efficient target volume. A controller copies data stored in a group of data storage units, from the source volume to a non-volatile storage, to preserve the point in time copy operation. A background process asynchronously copies the data from the non-volatile storage to the space efficient target volume to commit a physical point in time copy of the data from the source volume to the target volume.

Abstract: A recommendation method, system, and computer program product include monitoring a patient using a plurality of sensors, receiving patient information including a comfort level corresponding to a sensor of the plurality of sensors, determining a relevance of each sensor of the plurality of sensors to at least one health conditions of the patient, and determining at least one sensor of the plurality of sensors to disconnect based on the comfort level and the relevance of each sensor.

Abstract: Various embodiments disclose a method for fabricating a semiconductor structure. In one embodiment, the method includes forming a masking layer over at least a first portion of a source contact layer formed on a substrate. At least a second portion of the source contact layer is recessed below the first portion of the source contact layer. The mask layer is removed and a first spacer layer, a replacement gate on the first spacer layer, a second spacer layer on the replacement gate, and an insulating layer on the second spacer layer are formed. First and second trenches are then formed. A first channel layer is epitaxially grown within the first trench. A second channel layer is epitaxially grown within the second trench. A length of the second channel layer is greater than a length of the first channel layer.

Abstract: Methods and systems for generating and evaluating fused query lists. A query on a corpus of documents is evaluated using a plurality of retrieval methods and a ranked list for each of the plurality of retrieval methods is obtained. A plurality of fused ranked lists is sampled, each fusing said ranked lists for said plurality of retrieval methods, and the sampled fused ranked lists are sorted. In an unsupervised manner, an objective comprising a likelihood that a fused ranked list, fusing said ranked lists for each of said plurality of retrieval methods, is relevant to a query and a relevance event, is optimized to optimize the sampling, until convergence is achieved. Documents of the fused ranked list are determined based on the optimization.