Abstract: Embodiments of the invention include a semiconductor structure with a first magneto-resistive random access memory (MRAM) pillar with a bottom electrode layer, a reference layer connected above the bottom electrode layer, a free layer, and a tunnel barrier between the reference layer and the free layer. The MRAM pillar includes a pillar diameter. The semiconductor structure also includes a coaxial top electrode with a top diameter that is less than the pillar diameter.

Abstract: Techniques and a system for quantum computing device modeling and design are provided. In one example, a system includes a modeling component and a simulation component. The modeling component models a quantum device element of a quantum computing device as an electromagnetic circuit element to generate electromagnetic circuit data for the quantum computing device. The simulation component simulates the quantum computing device using the electromagnetic circuit data to generate response function data indicative of a response function for the quantum computing device. Additionally or alternatively, a Hamiltonian is constructed based on the response function.

Abstract: According to one embodiment, a method, computer system, and computer program product for navigating an autonomous vehicle is provided. The present invention may include measuring, in real time, movement patterns of air in the surroundings of the autonomous vehicle; analyzing the movement patterns to identify wind flow patterns, terrain, and passage in the surroundings; and navigating the autonomous vehicle based on the identified wind flow patterns, terrain, and passage.

Abstract: Semiconductor integrated circuit devices are provided which have standard cells with ultra-short standard cell heights. For example, a device comprises an integrated circuit comprising a standard cell which comprises a first cell boundary and a second cell boundary. The standard cell comprises an n-track cell height defined by a distance between the first cell boundary and the second cell boundary, wherein n is four or less.

Abstract: A semiconductor structure includes a substrate, a first device disposed on the substrate and a second device disposed on the substrate. The first device includes a first plurality of nanosheets comprising a p-type material. The second device includes a second plurality of nanosheets comprising an n-type material. A dielectric isolation pillar is disposed between the first device and the second device.

Abstract: A tool for managing heat generation in smart contact lenses. The tool determines one or more activities to be performed by one or more smart contact lenses. The tool determines a heat generation pattern associated with performance of the one or more activities. The tool assigns the one or more activities to the one or more smart contact lenses based on the heat generation pattern. Responsive to a determination that a pre-determined thermal threshold of the one or more smart contact lenses is exceeded, the tool generates one or more recommendations to perform one or more cooling functions of the one or more smart contact lenses.

Abstract: Methods, systems, and computer program products for mining multi-party collaboration platforms to create triaging trees and playbooks are provided herein. A computer-implemented method includes obtaining, from a multi-user platform, conversations related to at least one technical issue; generating a plurality of triaging trees by analyzing the conversations, wherein each of the triaging trees stores information corresponding to temporal sequences of steps related to diagnosing and resolving said at least one technical issue; and deriving a playbook for resolving said at least one technical issue at least in part by combining two or more of the plurality of triaging trees.

Abstract: A data processing system includes a plurality of processing nodes communicatively coupled to a system fabric. Each of the processing nodes includes a respective plurality of processor cores. Logical partition (LPAR) information for each of a plurality of LPARs is maintained in a register set in each of the processor cores, where the LPAR information indicates, for each of the LPARs, which of the processing nodes may hold an address translation entry for each LPAR. Based on the LPAR information, a first processor core selects a broadcast scope for a multicast request on the system fabric that includes fewer than all of the plurality of processing nodes and issues the multicast request with the selected broadcast scope. The first processor core updates the LPAR information in the register set of a second processor core in another of the plurality of processing nodes via an inter-processor interrupt.

Abstract: A computer-implemented method according to one embodiment includes obtaining a first latch for a first node within a tree data structure; copying a first version number of the first node; unlatching the first node; copying the first node; latching the first node a second time after completing the copying; copying a second version number of the first node; and performing one or more actions in response to a comparison of the first version number and the second version number.

Abstract: A transient input/output in progress state is established during processing of a testcase by a test infrastructure in a computing environment. The method includes obtaining the testcase for an object having one or more pages, and processing the testcase by the test infrastructure. Processing the testcase by the test infrastructure includes, for a page of the object, generating a delay in the processing of the testcase for the page of the object. The delay opens a transient input/output in progress state during which one or more test operations reference the page of the object.

Abstract: Containerized software discover and identification can include discovering a plurality of container remnants by electronically scanning portions of computer memory of at least one computer system of one or more of computing nodes, the portions of computer memory being allocated to persistent storage of computer data, and each container remnant containing computer data providing a record of system-generated execution attributes generated in response to execution of one or more containerized applications. One or more inactive container remnants unutilized by a currently running containerized application can be identified among the plurality of container remnants. Each inactive container remnant can be categorized, the categorizing being based on system-generated execution attributes contained in each inactive container remnant.

Abstract: Described are techniques for a tape unmounting protocol. The techniques include selecting a tape for unmounting from a plurality of tape drives, where the tape for unmounting includes a remaining capacity below a first threshold and a number of migrated files below a second threshold. The techniques further include unmounting the tape for unmounting from a tape drive.

Abstract: Disclosed are techniques for two-way synchronization of infrastructure-as-code templates and instances, including a method comprising detecting changes to a run-time state of a system and, in response to detecting a change, triggering an update of a current run-time state model. The method may further comprise, in response to updating the run-time state model, comparing the updated model to a current model using a template in a local repository instantiated as the current model. The method may further comprise, in response to the comparison determining a structural difference between the updated model and the current model, merging the updated model and the current model into a new model; and updating a local clone of a repository of the template with the new model. The method may further comprise, in response to the comparison determining no structural difference between the updated model and the current model, pushing changes to a remote repository.

Abstract: Providing an automatic mechanism of invalidating false-positive indications of certain identified portions of source code to reduce the number of errors in a security report. Certain embodiments of the present invention utilize static security scanning as a mechanism for automatically determining which portions of the identified source code contain potential vulnerabilities, and whether these identified portions of the source code are correctly or incorrectly identified with a false-positive indication.

Abstract: Performing a mutual exclusion data class analysis is provided. A data class group of a plurality of data class groups that a matching data class is a member of is identified. The matching data class matches data in a plurality of rows of a column in a data asset. Data classes included in the data class group that the matching data class is a member of are identified. A mutual exclusion data class is filtered from the data class group to form a filtered data class group for the column. The filtered data class group is run against the column of the data asset decreasing processing time and resource utilization of a computer.

Abstract: A method, system and apparatus of processing queries, including inputting a query as query data, generating paraphrases from the query data, and normalizing the generated paraphrases according to predefined annotations of a schema.

Abstract: Computer-implemented techniques for unsupervised event extraction are provided. In one instance, a computer implemented method can include parsing, by a system operatively coupled to a processor, unstructured text comprising event information to identify candidate event components. The computer implemented method can further include employing, by the system, one or more unsupervised machine learning techniques to generate structured event information defining events represented in the unstructured text based on the candidate event components.

Abstract: A method, system, and computer program product for identifying reference data values in a source data set. The method may include inputting a block of attribute values to a predefined machine learning model. The method may also include receiving an indication of a presentation layout of the block of the attribute values and an associated reference data extraction method. The method may also include determining a reading direction of the block of values. The method may also include identifying one or more inspection areas in the reading direction of the block of values. The method may also include determining sets of the one or more inspection areas that share a common presentation feature. The method may also include identifying tokens in an inspection area. The method may also include determining if the inspection area includes reference data values. The method may also include outputting the reference data values.

Abstract: Methods, systems, and computer program products for zero-shot entity linking based on symbolic information are provided herein. A computer-implemented method includes obtaining a knowledge graph comprising a set of entities and a training dataset comprising text samples for at least a subset of the entities in the knowledge graph; training a machine learning model to map an entity mention substring of a given sample of text to one corresponding entity in the set of entities, wherein the machine learning model is trained using a multi-task machine learning framework using symbolic information extracted from the knowledge graph; and mapping an entity mention substring of a new sample of text to one of the entities in the set using the trained machine learning model.

Abstract: A first copy of a heterogeneous program payload is provided to a first computing device. The heterogeneous program payload contains an unencrypted component and a set of one or more encrypted components. The set of encrypted components corresponding to a set of one or more programs. The unencrypted component of the heterogeneous program payload includes loader program code configured to receive a first license key. The loader program code is configured to, in response to receiving the first license key, perform a decryption action against the set of encrypted components of the heterogeneous program payload.