Abstract: A computer-implemented method for detecting code regions related to specific processes in an application is provided including obtaining a call-graph of an application, each node of the call-graph representing a program in the application and each edge of the call-graph representing a call between programs, detecting merge points in the call-graph where paths from different entry points are merged, dividing the call-graph into sub-call-graphs at the merge points to create a macro-call-graph, each node of the macro-call-graph representing each of the sub-call-graphs, detecting code regions related to specific processes in each program in the application based on variable names corresponding to the specific processes, setting an initial state to each entry point of the sub-call-graphs, and identifying sub-call-graphs related to each specific process by using dataflow analysis with the initial states and the code regions based on entry states of the sub-call-graphs.

Abstract: A method and related system determine a localness measure that represents accessibility of a node connectiveness within a signed network. The method comprises, with a computer processor, receiving focus node (FN) information related to an FN of a graph representing the signed network, receiving neighbor node (NN) information related to a plurality of NNs in the signed network, and determining the localness measure based on the NN information and the FN information. The method and system also determine a harmony measure that represents importance of a node connectiveness within a signed network. The method comprises, with a computer processor, receiving source node (SN) information related to an SN of a graph representing the signed network, receiving destination node (DN) information related to a DN in the signed network, and determining the harmony measure based on the SN information and the DN information.

Abstract: A structure, apparatus, and method are disclosed. A silicon substrate with a microfluidic system that receives a sample fluid and prepares an analyte solution received by a reservoir containing a sensing surface is electrically connected to a semiconductor device. The structure includes a component for receiving a sample fluid, a component for preparing the sample fluid, a CRISPR system for cleaving a reporter species when the sample fluid contains a target sequence, a sorting component for separating the cleaved reporter species from the sample fluid and the CRISPR products, a cavity for receiving an analyte solution containing the cleaved reporter species, and a sensing surface in the cavity. The sensing surface detects electrical signals induced by reaction events in the analyte solution.

Abstract: An example operation may include one or more of receiving, by a first node, a freshness of goods data from a second node over a blockchain, and executing, by the first node, a smart contract to: calculate an initial order quantity based on a pre-set critical order number and a non-expiring goods order quantity and alter a final order quantity based on the initial order quantity and the freshness of the goods data.

Abstract: An example operation may include one or more of receiving a set of structured query language (SQL) queries from one or more software applications, generating a set of SQL syntax trees that correspond to the set of SQL queries, identifying a unique subset of SQL syntax trees among the generated set of SQL syntax trees based on previously obtained SQL syntax trees, and transmitting the unique subset of SQL syntax trees to a computing system.

Abstract: A transitive closure data structure is constructed for a pair of features represented in a vector space corresponding to an input dataset. The data structure includes a set of entries corresponding to a set of all possible paths between a first feature in the pair and a second feature in the pair in a graph of the vector space. The data structure is reduced by removing a subset of the set of entries such that only a single entry corresponding to a single path remains in the transitive closure data structure. A feature cross is formed from a cluster of features remaining in a reduced ontology graph resulting from the reducing the transitive closure data structure. A layer is configured in a neural network to represent the feature cross, which causes the neural network to produce a prediction that is within a defined accuracy relative to the dataset.

Abstract: An approach is provided in which the approach trains a first machine learning model using a set of features corresponding to a set of build blocks. The set of build blocks include at least one dependency build block and at least one artifact package build block. The approach predicts a set of risk values of the set of build blocks using the trained first machine learning model, and marks at least one of the build blocks as a bottleneck in response to comparing the set of risk values against a risk threshold.

Abstract: Methods, computer program products, and systems are presented. The method computer program products, and systems can include, for instance: obtaining a query statement; parsing the query statement and determining from the parsing that the query statement is a compound predicate query statement that includes a first predicate and a second predicate; responsively to the parsing, rewriting the obtained query statement to provide a transformed query statement, wherein the rewriting includes (a) specifying generating of a temporary table, wherein the specified generating uses data values of the first predicate and (b) specifying a join function that uses the temporary table and a table referenced in the query statement; evaluating a candidate access path associated to the transformed query statement; selecting the candidate access path as an access path for execution; and executing the transformed query statement according to the selected candidate access path for execution.

Abstract: A method for displaying identification information for devices electrically coupled to a plurality of ports includes determining a first device is electrically coupled to a first port out of a plurality of ports. The method further includes establishing communications between a first communication transmitter on a first electrical connector for the first device and a first communication receiver associated with the first port. In response to determining first identification information is available for the first device, the method further includes receiving, from the first communication transmitter, at the first communication receiver the first identification information for the device. The method further includes displaying, in a first display, the first identification information for the first device, wherein the first display is associated with the first port.

Abstract: A method and system of translating addresses is disclosed that includes receiving an effective address for translation, providing a processor and a translation buffer where the translation buffer has a plurality of entries, wherein each entry contains a mapping of an effective address directly to a corresponding real address, and information on a corresponding intermediate virtual address. The method and system further include determining whether the translation buffer has an entry matching the effective address, and in response to the translation buffer having an entry with a matching effective address, providing the real address translation from the entry having the matching effective address.

Abstract: A method, computer program product, and computer system for improving performance of a SQL execution sequence of SQL statements. The SQL execution sequence is recorded in an event log. Original results of executing the SQL statements and an original CPU cost of executing the SQL statements in accordance with the original access path are recorded in a logical log. A new access path is generated from analysis of the event log and the logical log. The SQL statements are executed in accordance with the new access path resulting in new results of executing the SQL statements including a new CPU cost of executing the SQL statements in accordance with the new access path. In response to a determination that the new results replicate the original results and that the new CPU cost is less than the original CPU cost, the original access path is replaced with the new access path.

Abstract: Computation, placement, and accessing of error correcting codes (ECC) in a computer system data cache enabling partial reads and writes to each line of data in the cache. For storing multiple compressed blocks, received at differing time periods, in a single cache line, the ECC for the first compressed block is stored in the ECC field of the cache and the ECC for the second and subsequently received compressed blocks is appended to the compressed data. Additionally, an auxiliary ECC cache may be constructed for temporarily holding a partial ECC for a partial read/write, and a new ECC for the partial read/write is computed using the partial ECC.

Abstract: A system and method for facilitation transactions between an Internet of Things (IoT) system and a blockchain peer without the use of a smart phone are disclosed. The system may have security, a channel manager, a message formatter, parameter enumerator and formatter, a final formatter, a notifier, a monitor and an integrator. The system may accept blockchain queries from the IoT device and may reformat the blockchain queries and alter parameters into a format and parameter framework which is operable by a blockchain peer. The system may also accept responses from the blockchain peer and may reformat the response and alter parameters into a format and parameter framework which is operable by the IoT device. The system may send the reformatted response to the IoT device for display.

Abstract: Embodiments for providing an enhanced codebase in a computing environment by a processor. One or more container specification files may be automatically generated for a codebase based on one or more extracted attribute names and values.

Abstract: Methods and systems for testing a functionality of a code modification operation are described. In an example, a processor can include a processor pipeline comprising one or more execution units. The processor pipeline can execute a first thread. The processor pipeline can further execute a second thread concurrently with the execution of the first thread. The second thread can be executed to modify the first thread using a code modification operation. The processor can further include a test module configured to validate a functionality of the code modification operation based on a result of the modified first thread.

Abstract: In an approach to improve file recall between storage devices by optimizing file recall for multiple users. Embodiments of the present invention obtain one or more similarities among one or more users based on one or more usage points and divide the one or more users into a plurality of clusters based on a content of the one or more usage points. Further, embodiments select a cluster from the plurality of clusters based on cluster importance, and select the content used by more than a predetermined percentage of the weighted users pertaining to the selected cluster as an automated recall subject. Additionally, embodiments recal one or more selected content from a secondary storage device to a primary storage device.

Abstract: A semiconductor structure may include a magnetic tunnel junction layer on top and in electrical contact with a microstud, a hard mask layer on top of the magnetic tunnel junction layer, and a liner positioned along vertical sidewalls of the magnetic tunnel junction layer and vertical sidewalls of the hard mask layer. A top surface of the liner may be below a top surface of the hard mask layer. The semiconductor structure may include a spacer on top of the liner. The liner may separate the spacer from the magnetic tunnel junction layer and the hard mask layer. The semiconductor structure may include a first metal layer below and in electrical contact with the microstud and a second metal layer above the hard mask layer. A bottom portion of the second metal layer may surround a top portion of the hard mask layer.

Abstract: Methods and systems for determining a priority of a threads is described. A processor can execute branch instructions of the thread. The processor can predict branch instruction outcomes of the branch instructions of the thread. The processor can increment a misprediction count of the thread in response to an actual execution of a branch instruction of the thread being different from a corresponding branch instruction prediction outcome of the thread. The processor can determine the priority of the thread based on the misprediction count of the thread.

Abstract: A mechanism is provided in a data processing system for preventing data leakage in automated machine learning. The mechanism receives a data set comprising a label for a target variable for a classifier machine learning model and a set of features. For each given feature in the set of features, the mechanism trains a subprime classifier model using the given feature as a target variable and remaining features as independent input features, tests the subprime classifier model, and records results of the subprime classifier model. The mechanism performs statistical analysis on the recorded results to identify an outlier result corresponding to an outlier subprime classifier model.

Abstract: A processing system server and methods for performing asynchronous data store operations. The server includes a processor which maintains a cache of objects in memory of the server. The processor executes an asynchronous computation to determine the value of an object. In response to receiving a request for the object occurring before the asynchronous computation has determined the value of the object, a value of the object is returned from the cache. In response to receiving a request for the object occurring after the asynchronous computation has determined the value of the object, a value of the object determined by the asynchronous computation is returned. The asynchronous computation may comprise at least one future, such as a ListenableFuture, or a process or thread. The asynchronous computation may determine the value of the object by querying at least one additional server.

Abstract: Embodiments facilitating data exploration in a computing environment by a processor. A multidimensional dataset may be received. The multidimensional dataset may be processed according to booting operation parameters. A visualization and exploration of an interactive representation of one or more probabilistic models using multidimensional dataset.

Abstract: Neural network processing hardware using parallel computational architectures with reconfigurable core-level and vector-level parallelism is provided. In various embodiments, a neural network model memory is adapted to store a neural network model comprising a plurality of layers. Each layer has at least one dimension and comprises a plurality of synaptic weights. A plurality of neural cores is provided. Each neural core includes a computation unit and an activation memory. The computation unit is adapted to apply a plurality of synaptic weights to a plurality of input activations to produce a plurality of output activations. The computation unit has a plurality of vector units. The activation memory is adapted to store the input activations and the output activations. The system is adapted to partition the plurality of cores into a plurality of partitions based on dimensions of the layer and the vector units.

Abstract: Ground rule verification (“GRV”) design layouts may be automatically generated based on one or more design macros. The GRV design layout may be tested based on the one or more design macros by violating one or more ground rules using one or more GRV ranges. The testing may include electrical testing of the one or more GRV design layouts based on the one or more design macros. The one or more ground rules may be automatically selected and approved the based upon a degree of violation acceptability.

Abstract: Embodiments of present invention provide a semiconductor structure. The semiconductor structure includes a plurality of sections from a top to a bottom thereof, wherein the plurality of sections has a same chemical composition and at least two different strains. For example, in one embodiment, the plurality of sections has a same chemical composition of epitaxially grown silicon (Si) and has alternating strains between a tensile strain and a compressive strain. A method of manufacturing the semiconductor structure is also provided.

Abstract: A mechanism is provided to implement a contract analytic binding and provenance system. The mechanism loads contract rules for an agreement between a plurality of contract parties and creates an analytic entry per rule to form a set of analytic entries, Each analytic entry is associated with an executable analytic function. The mechanism assigns each analytic entry a directed acyclic graph vertex. The mechanism confirms alignment between the contract rules and the set of analytic entries and stores the set of analytic entries in peer ledgers associated with the plurality of contract parties. The mechanism activates the set of analytic entries responsive to confirming provenance of the peer ledgers associated with the plurality of contract parties.

Abstract: A generative adversarial network including a generator portion and a discriminator portion is constructed. The network is configured such that the network operates to enhance intensity images, wherein an intensity image is obtained by illuminating an object with an energy pulse and measuring the return strength of the energy pulse, and wherein a pixel of the intensity image corresponds to the return strength. As a part of the configuring, a loss function of the generative adversarial network is minimized, the loss function comprising a mean square error loss measurement of a noisy intensity image relative to a mean square error loss measurement of a corresponding clean intensity image. An enhanced intensity image is generated by applying the minimized loss function of the network to an original intensity image, the applying improving an image quality measurement of the enhanced intensity image relative to the original intensity image.

Abstract: An example operation may include one or more of receiving, from a plurality of providers by a secure enclave, a plurality of training data sets and a plurality of salts paired with the plurality of training data sets, respectively, hashing, via the secure enclave, pairs of training data sets and salts to generate a plurality of salted hashes, and combining the plurality of salted hashes to generate a digest, training, via the secure enclave, a model based on the plurality of training data sets to generate a trained model, and providing the trained model and the digest to a plurality of data providers of the plurality of training data sets and the plurality of salts.

Abstract: Embodiments are provided for providing enhanced routing in a computing system by a processor. All first-order logic formulas may be converted into real-valued logic formulas. A probabilistic inference is executed using the real-valued logic formulas and one or more probability intervals associated with an atomic formulae in a knowledge base to provide an interval conditional probability indicating that a first predicate condition is true based one or more alternative predicates being true.

Abstract: An embodiment includes decomposing a natural language assertion into a natural language question and answer pair that includes an initial question and an initial answer. The embodiment translates the initial question into a structured knowledge graph query and then performs an iterative process comprising iterative querying of a knowledge graph and evaluating of corresponding query responses resulting in respective confidence scores. A first iteration of the iterative process comprises querying of the knowledge graph to retrieve a first predicted answer, then determining whether a degree of similarity between the initial answer and the first predicted answer meets a threshold criterion. If not, the first predicted query is altered and used for querying the knowledge graph in a subsequent iteration of the iterative process. The embodiment also generates an assertion correctness score indicative of a degree of confidence that the assertion is factual using the respective confidence scores.

Abstract: A price for use of a digital asset in a set of digital assets is determined. The set of digital assets stored in a digital asset repository. A time slot during which the digital asset is available for use is determined. The digital asset is leased out at the price and during the time slot, the leasing allowing use of the digital asset during the time slot in return for payment of the price. the leased digital asset is integrated with a set of base characteristics of a virtualized user. The integrated leased digital asset is presented in a virtual environment during the time slot.

Abstract: Programmable memory devices having a cross-point array of polymer junctions with individually-programmed conductances are provided. In one aspect, a method of forming a memory device includes: forming first metal lines on an insulating substrate; forming polymeric resistance elements on the first metal lines; and forming second metal lines over the polymeric resistance elements with a single one of the polymeric resistance elements present at each intersection of the first/second metal lines forming a cross-point array. A memory device and a method of operating a memory device are also provided.

Abstract: A computer-implemented method for scheduling and scaling a cloud system for microservice applications is provided including identifying a plurality of nodes within one or more clusters associated with a plurality of containers, generating a model for predicting resource usage among the plurality of nodes, automatically deciding on a number of replicated containers, node bindings, and weight for each replicated container according to application requests and current usage status of a cluster of the one or more clusters that reduce resource usages and microservice cohesion, and determining at least node redistribution of the plurality of nodes within the plurality of containers and workload partitioning to reconfigure scaling, scheduling, and balance deployment requirements of the microservice applications.

Abstract: Embodiments for ensemble training in a distributed marketplace in a computing environment. One or more ensemble machine learning models may be provided from a plurality of machine learning models competing within the distributed marketplace that achieve a performance on ensemble training data equal to or greater than a selected performance threshold, wherein the distributed marketplace is a blockchain.

Abstract: A 3D printing system comprising, an extendable body, a material delivery system, a first wall adhesion device, and a second wall adhesion device.

Abstract: Securing information within a user interface can include mapping, using a processor, an electronic mail address to an avatar, wherein the mapped electronic mail address and the avatar are stored within a data storage device, and generating, using the processor, a user interface including a message correlated with the electronic mail address. The user interface displays the avatar of the electronic mail address in place of at least one of a name for the electronic mail address or the electronic mail address.

Abstract: A mechanism is provided for implementing an optical character recognition (OCR) error correction mechanism for correcting OCR errors. Responsive to receiving a document in which OCR has been performed, the mechanism assesses the document to identify a set of OCR errors generated by an OCR engine that performed the OCR using a set of visual embeddings. Responsive to identifying the set of OCR errors, the mechanism analyzes each character of a plurality of sentences within the document to generate a high-dimensional embedding for the characters of the plurality of sentences within the document. The mechanism then linguistically corrects each OCR error in the set of OCR error. The mechanism utilizes ground truth information and the set of visual embeddings to verify that character stream is linguistically correct. Responsive to verifying that the character stream is linguistically correct, the mechanism outputs an OCR error corrected document to a user.

Abstract: A method for sharing hidden information in a virtual meeting is disclosed. In one embodiment, such a method includes sharing, by way of a web-conference server, a source window presented on a source system with a target window presented on a target system. The method detects selection of a specific area on the target window and correlates the specific area on the target window with a corresponding area on the source window. The method determines whether the corresponding area on the source window links to hidden information, such as a hyperlink, on the source window. If the corresponding area links to hidden information, the method communicates one or more of the hidden information and a link to the hidden information to the target system. A corresponding system and computer program product are also disclosed.

Abstract: A computer-implemented method to transform and execute queries by merging sparsely populated columns. The method includes receiving, from a host, a first query configured to perform a command on one or more target columns in a database. The method further includes analyzing a set of statistics for the database. The method also includes determining, based on the analyzing, a first column of the one or more target columns is included in a set of sparse columns. The method includes generating a plurality of access plans for the first query, including a first access plan that merges the first column with a second column. The method further includes transforming, based on the first access plan, the first query to merge the first column with the second column. The method also includes executing, in response to the transforming of the first query, the first query.

Abstract: A method and apparatus for automatically repairing structure cracks. The method may include mixing a filler material with ferromagnetic dust to create a filler material mixture. The method may also include storing each filler material mixture in a filler material reservoir. The method may also include creating an array of magnetic coils in the structure, where the array of magnetic coils creates a magnetic path through the structure. The apparatus may include a structure. The structure may include a plurality of filler material reservoirs, wherein each filler material reservoir stores a filler material mixture. The structure may also include an array of magnetic coils inside the structure.

Abstract: A method to dynamically switch between catalog sharing protocols includes monitoring, over a period of time, access to a catalog used to index data sets. Using information gathered during this monitoring period, the method divides the period of time into intervals based on which of a plurality of sharing protocols, used to access the catalog, would provide the best performance during the respective interval. The method schedules the sharing protocols to operate during their respective intervals going forward, and switches between the sharing protocols in accordance with the schedule. In certain embodiments, switching between the sharing protocols includes temporarily operating in a hybrid mode in which multiple sharing protocols operate simultaneously. When using this hybrid mode, the switch may occur when one sharing protocol begins to perform better than the other. A corresponding system and computer program product are also disclosed.

Abstract: A method for facilitating root cause analysis of a software crash by core dump analysis is disclosed. The method comprises receiving a core dump file relating to a software program, identifying unique source code lines in the core dump file for each running thread at the crash time, and determining unique source code lines as conspicuous source code lines depending on an abstraction level value indicating a number of occurrences of the conspicuous source code line in different threads. Furthermore, the method comprises determining an abstraction ratio as a function of a number of conspicuous source code lines and a number of unique source code lines, evaluating whether the predefined abstraction level value has to be adjusted by determining unique source code line as a conspicuous source code line and determining an abstraction ratio, and outputting the conspicuous source code lines and an assessment value for the abstraction ratio.

Abstract: An electrical cable including four copper layers, where at least two of the four copper layers are separated by a polymeric base layer, and where at least two of the four copper layers are separated by an adhesive. The electrical cable further includes a polymeric cover layer adhered to an outermost copper layer.

Abstract: A method, computer system, and a computer program for analyzing a webpage content is provided. The present invention may include receiving a plurality of terms, including a plurality of structural information, derived from one or more responses to a faceted search query. The present invention may also include extracting a plurality of facet values from the plurality of terms. The present invention may then include generating an analysis of each facet value of the plurality of facet values. The present invention may further include determining a type of each facet value of the plurality of facet values based on the analysis. The present invention may also include generating an optimized web site mode interface including the analysis and displaying the optimized web site mode interface to a user.

Abstract: Original idea extraction from written data is provided by capturing expression as written text data, obtaining a knowledge graph representing concepts and relationships between the concepts automatically topic modeling the written text data to ascertain thought units and identify respective concepts of the thought unit, mapping a thought unit to the knowledge graph, determining that the thought unit is an original idea, and based on determining that the thought unit is an original idea, storing a representation of the original idea to an idea repository and invoking processing of at least one computer.

Abstract: A computer-implemented method, a computer program product, and a computer system for keyword extraction. A computer vectorizes word sets by splitting text in a corpus. The computer trains a Gaussian mixture distribution model for the word sets and obtains an inverse document frequency (IDF) value of a word set from the learned Gaussian mixture distribution model. The computer trains a Gaussian mixture distribution model for a cluster and obtains a term frequency (TF) value of the word set in the cluster from the learned Gaussian mixture distribution model. The computer calculates a term frequency-inverse document frequency (TF-IDF) value of the word set in the cluster, based on the TF value and the IDF value. The computer calculates TF-IDF values of the word sets in clusters and rearranges the word sets in a descending order of the TF-IDF values to obtain extracted keywords.

Abstract: Embodiments of process flows and methods are provided for forming a resistive switching random access memory (ReRAM). More specifically, process flows and methods are provided for reducing the forming voltage needed to form a conductive path in the ReRAM cells. A wide variety of plasma doping processes are used to introduce a plurality of different dopants into a metal-oxide dielectric film. By utilizing at least two different dopants, the plasma doping processes described herein reduce the forming voltage of the subsequently formed ReRAM cell compared to conventional processes that use only one dopant. In some embodiments, the forming voltage may be further reduced by applying a bias power during the plasma doping process, wherein the bias power is preselected to increase the number of ions introduced into the metal-oxide dielectric film during the plasma doping process.

Abstract: A method of manufacturing and resultant device are directed to an inverted wide-base double magnetic tunnel junction device having both high-efficiency and high-retention arrays. The method includes a method of manufacturing, on a common stack, a high-efficiency array and a high-retention array for an inverted wide-base double magnetic tunnel junction device. The method comprises, for the high-efficiency array and the high-retention array, forming a first magnetic tunnel junction stack (MTJ2), forming a spin conducting layer on the MTJ2, and forming a second magnetic tunnel junction stack (MTJ1) on the spin conducting layer. The first magnetic tunnel junction stack for the high-retention array has a high-retention critical dimension (CD) (HRCD) that is larger than a high-efficiency CD (HECD) of the first magnetic tunnel junction stack for the high-efficiency array. The second magnetic tunnel junction stack (MTJ1) is shorted for the high-retention array and is not shorted for the high-efficiency array.

Abstract: An example system includes a processor to receive an image containing an object to be detected. The processor is to detect the object in the image via a binary object detector trained via a self-supervised training on raw and unlabeled videos.

Abstract: A semiconductor device includes a first diffusion region having a first conductivity type, a first SiGe fin formed on the first diffusion region, a second diffusion region having a second conductivity type, and a second SiGe fin formed on the second diffusion region and including a central portion including a first amount of Ge, and a surface portion including a second amount of Ge which is greater than the first amount. A total width of the central portion and the surface portion is substantially equal to a width of the second diffusion region.

Abstract: A processing unit, including a first circuit, and a first circuit element connected to the first circuit. The first circuit element is at least charged by the first circuit.