Abstract: A method and apparatus related to developing electromagnetic emission and power models for a target device using photonic emissions thereof are provided. Data of photonic emissions of a target device during a first period of time with the target device in one or more modes is recorded. Data of electromagnetic emissions of the target device during the first period of time with the target device in the one or more modes is also recorded. The recorded data of the photonic emissions and the recorded data of the electromagnetic emissions are correlated to establish one or more electromagnetic emission models for the target device. The one or more electromagnetic emission models enable predictive analysis of emissions by the target device.

Abstract: Low spike count ring buffer mechanisms on neuromorphic hardware are provided. A ring buffer comprises a plurality of memory cells. The plurality of memory cells comprises one or more neurosynaptic core. A demultiplexer is operatively coupled to the ring buffer. The demultiplexer is adapted to receive input comprising a plurality of spikes, and write sequentially to each of the plurality of memory cells. A plurality of output connectors is operatively coupled to the ring buffer. Each of the plurality of output connectors is adapted to provide an output based on contents of a subset of the plurality of memory cells.

Abstract: A memory cell formed in a pillar structure between a first electrode and a second electrode includes laminated encapsulation structure. In one example, the pillar includes a body of ovonic threshold switch material, carbon-based intermediate layers, metal layers and a body of phase change memory material in electrical series between the first and second electrodes. The laminated encapsulation structure surrounds the pillar. The laminated dielectric encapsulation structure comprises at least three conformal layers, including a first layer of material, a second conformal layer of a second layer material different from the first layer material; and a third conformal layer of a third layer material different from the second layer material.

Abstract: Pointer alignment in a computer programming to obtain information enabling a compiler to optimize program code. Equivalence classes of pointers are collected in a program using a flow-insensitive yet field-sensitive pointer analysis operation iterating through an entire program code of the program. The equivalence classes of pointers, once collected, are mapped to and recorded in an equivalence class mapping table (ECTable). A portion of the collected equivalence classes of pointers are identified, from the ECTable, as pointer candidates for a pointer alignment computation according to a code pattern analysis of each pointer candidate. The code pattern analysis is based on available alignment information, and whether the alignment information would enable a compiler to optimize pointer references of the candidate pointer. The pointer alignment computation is then performed for each identified pointer candidate to obtain the alignment information used to optimize execution of the program.

Abstract: A computer-implemented method is provided that includes accessing candidate text and a candidate pair including first and second phrases, substituting the first and second phrases into cause-effect patterns to generate variant sentences. An artificial intelligence model is leveraged to determine respective probabilities that the variant sentences are inferred from the candidate text, calculate a statistical measure of the respective probabilities, and assess the calculated statistical measure to ascertain whether the first and second phrases possess a causal relationship or non-causal relationship to one another. A knowledge base including one or more pairs of cause-effect phrase pairs is populated with the first and second phrases possessing the causal relationship. A computer system and a computer program product are also provided.

Abstract: Embodiments relate to a system, program product, and method for protecting cache access in a multi-tenant environment, and, more specifically, for allowing access to specified data, encrypted or unencrypted, in a shared cache to authorized tenants, while denying access to the data for unauthorized tenants. The system includes a server including one or more shared cache and a plurality of tenant devices coupled to the server. The server is configured to run one or more applications thereon, where each tenant has access to one or more authorized instances of the applications. The system also includes a cache proxy coupled to the tenant devices and the shared cache. The cache proxy facilitates enforcing one or more schemes to provide for separation of data for authorized tenants and their users using the shared cache from unauthorized tenants and users.

Abstract: A method provides a security action based on identity profile scores. One or more processors represent an identity profile as a knowledge graph. The processor(s) associate a set of changes of the identity profile across a plurality of identity networks with a fraud score. The processor(s) then implement a security action based on the fraud score.

Abstract: At least one secure object of a security module is bound to a secure guest. A trusted component determines whether metadata of the secure guest includes a confidential binding attribute for the security module. Based on determining that the metadata includes the confidential binding attribute, the trusted component configures the security module for the secure guest in a select mode. The select mode prevents certain operations from being intercepted by a hypervisor associated with the secure guest. The trusted component intercepts a security module communication and performs a cryptographic operation on one or more secure objects of the security module communication using the confidential binding attribute to provide a cryptographic result. An outcome of the security module communication, which includes the cryptographic result, is provided to a receiver.

Abstract: An instruction to perform an operation selected from a plurality of operations configured for the instruction is executed. The executing includes determining a value of a selected operand of the instruction. The determining the value is based on a control of the instruction and includes reading the selected operand of the instruction from a selected operand location to obtain the value of the selected operand, based on the control having a first value, and using a predetermined value as the value of the selected operand, based on the control having a second value. The value and another selected operand of the instruction are multiplied to obtain a product. An arithmetic operation is performed using the product and a chosen operand of the instruction to obtain an intermediate result. A result from the intermediate result is obtained and placed in a selected location.

Abstract: A clinical information extraction and training mechanism is provided for automatically extracting and identifying information in plain text narratives in a set of electronic medical records. The mechanism segments each clinical note in a plurality of clinical notes into one or more identified sections, labels each identified section with an associated tag, and generate a tag data structure utilizing explicitly tagged sequences of sentences and associated tags. The mechanism performs statistical analysis of the identified sections that contain tags identified in the tag data structure to identify one or more valid stop/start conditions; extracts a first set of positive examples of sentences for a selected type of information, and then trains a cognitive system to identify sentences in the plurality of clinical notes that fail to have a tag associated with the selected type using the positive examples of sentences for different types of information.

Abstract: Systems and methods for modelling time-series data includes testing a testing model with a plurality of hyper-forgetting rates to select a best performing hyper-forgetting rate. A model optimization is tested using the best performing hyper-forgetting rate with the testing model to test combinations of hyper-parameters to select a best performing combination of hyper-parameters. An error of the model is determined using the model optimization. Model parameters are recursively updated according to the least squares regression by determining a pseudo-inverse of a Hessian of the least squares regression at a current time stamp according to a projection of the time-series data at the current time stamp and the pseudo-inverse of the Hessian at a previous time-stamp to determine an optimum model parameter. A next step behavior of the time-series data is predicted using the optimum model parameter. The next step behavior is stored in a database for access by a user.

Abstract: Coordinated smart contract-based satellite management and operation is provided by obtaining terms of smart contracts that govern utilization of a constellation of Earth-orbiting satellites, which form a space-based data center, in transmitting data between the constellation of satellites and ground stations for receiving data transmissions. Different service providers operate different satellites of the constellation and different ground stations of the collection, and the smart contracts further govern servicing of requests made between the different service providers. A service provider operates satellite(s) of the constellation pursuant to the smart contracts and ground station(s) of the collection of ground stations.

Abstract: In an approach for automatically extracting product baseline information from a request for proposal document, a processor receives the document. A processor detects a table in the document. A processor identifies a table header on the table. The table header is associated with a name and an associated volume of the product. A processor extracts context based on the table header from the table. The context includes the name and the associated volume of the product. A processor maps the extracted context with the name of the product in the table to an associated name of the product based on a pre-defined product ontology.

Abstract: An embodiment of the invention may include a method, computer program product, and computer system for reconfiguration of a computing environment from an as-is input/output (I/O) configuration to a to-be I/O configuration. An embodiment may include normalizing respective hierarchical models of the as-is and the to-be I/O configurations. The hierarchical models each comprise a hierarchical structure of leaf and non-leaf nodes. Normalizing comprises the application of syntactical transformation rules to the hierarchical models such that their respective I/O configurations are defined in a syntactically consistent manner. An embodiment may include creating respective hash tree representations of the first hierarchical model and the second hierarchical model. Nodes of the hash tree representations are checksum values. Nodes of the hash tree representations reflect the hierarchical structure of their respective hierarchical models.

Abstract: The present disclosure relates to a method comprising receiving an electronic message of an electronic communication system. An image based noisy content may be generated. The image based noisy content is different from a content of the received electronic message and relates to the message intents of the received message. The electronic communication system may be configured to provide the image based noisy to the recipient instead of the received electronic message or provide the received electronic message to the recipient in addition to the image based noisy.

Abstract: Embodiments of the present invention provide for a method for duplicate determination in a graph. The graph comprises nodes representing entities and edges representing relationships between the entities. Embodiments of the present invention identify two target nodes in the graph. A neighborhood subgraph may be determined for each of the two nodes. The neighborhood subgraph includes the respective node. Embodiments of the present invention can then determine whether the two nodes are duplicates with respect to each other, based on a result of a comparison between the two subgraphs and based on a comparison of the two target nodes of the subgraphs.

Abstract: A computer-implemented method according to one embodiment includes identifying a request to migrate data associated with a volume from a source storage pool having a first rank extent size to a destination storage pool having a second rank extent size smaller than the first rank extent size, creating a correspondence between logical volume extents of the volume and physical offset locations within rank extents of the source storage pool, and migrating data from one or more ranks of the source storage pool to one or more ranks of the destination storage pool, utilizing the correspondence between the logical volume extents of the volume and the physical offset locations within the rank extents of the source storage pool.

Abstract: A throttling engine throttles access to a high latency hybrid memory. A request is received for partition mapping of a virtual address for an R/W memory page. An entry is added to a partition page table that maps a virtual address to a physical address and comprises access information that is R/W. A throttled flag is set in an entry of a partition page extension table. The throttle entry corresponds to the entry. The access information is saved in an original access part of the partition page extension table, and the access information is replaced with an R value. Upon application fault receipt, a throttling test is performed on an address of the application fault. If the throttling test is false, the fault is passed through to an operating system fault handler and the throttling fault stage is ended, otherwise, a delay is implemented for slowing access to the memory.

Abstract: A computer-implemented method, a computer system and a computer program product evaluate multimedia quality. The method includes displaying a current frame of a video. The method also includes generating dataframes for the current frame and for a reference frame of the video. The method further includes comparing the dataframes for the reference and current frames. In addition, the method includes determining a quality metric of the current frame based on the comparison of the dataframes for the reference and current frames. Finally, the method includes modifying the current frame so that the quality metric is at or above the threshold in response to determining that the quality metric of the current frame is below a threshold.

Abstract: A security application may provide a secure digital currency for a blockchain while maintaining anonymity and security from unauthorized third parties. One example may include one of accessing a retailer site from a device, selecting one or more items for purchase, transmitting a payment option to the retailer site for the selected one or more items, receiving a payment request message from the retailer site comprising a unique identifier linked to one or more incentives, creating a payment confirmation message comprising the unique identifier and the one or more incentives, and transmitting the payment confirmation.