Abstract: A method of analyzing source code includes receiving, by a processor, an updated version of a computer program, the updated version including a source code. The method also includes preprocessing, by a compiler, the source code for a target computing platform. Preprocessing the source code by the compiler includes identifying a macro condition associated with one or more computer instructions enclosed by a macro, determining object code corresponding to the one or more computer instructions based on a current value of the macro condition, and generating object code and macro information for output to a debugger, the macro information including one or more breakpoint conditions in the macro.

Abstract: A microtiter plate comprising a first array of M×N wells and a microfluidic probe insert is provided. The microfluidic probe insert includes a second array of M×N microfluidic probe conduits, forming N columns of M conduits. The M conduits include respective orifices in a bounding plane and extend, each, perpendicularly to the bounding plane on one side. The microfluidic probe insert also includes N vacuum circuits, each comprising at least one vacuum port and M openings in the bounding plane, where 2?M, 2?N. The microfluidic probe insert is positioned on the microtiter plate and the microfluidic probe conduits are inserted in respective wells. A processing liquid is ejected from M conduits via the M orifices of the M conduits by applying a negative pressure to a corresponding set of N vacuum circuits via the respective one or more vacuum ports.

Abstract: As part of a container initialization procedure, a maximum number of hardware threads per processor core in a set of cores of a computer system are enabled, the container initialization procedure configuring an operating system executing on the computer system for container execution and configuring a first container for execution on the operating system. From a set of available cores in the set of cores, an execution core is selected. In the selected execution core, a number of threads per core to be used during execution of the first container is configured, the number of threads per core specified for the container initialization procedure by a first simultaneous multithreading (SMT) parameter. Using the configured execution core, the first container is executed, the executing virtualizing the operating system.

Abstract: A method includes: obtaining, by a computing device, a first work item from a first index, wherein the first work item represents a namespace of a bucket of a vault in a dispersed storage network; dividing, by the computing device, the namespace into plural ranges of names; creating, by the computing device, plural second work items, each respective one of the plural second work items including a respective one of the plural ranges of names; and adding, by the computing device, each of the plural second work items to a second index.

Abstract: Concepts for creating a metatype tree for metatype introspection are presented. One example comprises decoding a parent metatype from a synthetic dataset by decoding one or more child metatypes of the parent metatype. The method then comprises creating a metatype tree comprising a parent node and one or more child nodes of the parent node. The parent node comprises the decoded parent metatype and the one or more child nodes of the parent node comprise the one or more decoded child metatypes.

Abstract: A processor retrieves a webpage for rendering in a web browser. A processor identifies at least one zone of the webpage. A processor determines a resource consumption rate for the at least one zone. A processor determines a display area for the at least one zone. A processor determines a consumption ratio based on the resource consumption rate and the display area of the at least one zone. In response to the consumption ratio exceeding a threshold value, a processor disables a rendering of the at least one zone when rendering the webpage in the web browser.

Abstract: One or more line ends of a putative integrated circuit design are modelled using a constraint graph. A longest path algorithm is applied on subgraphs of the constraint graph. An extent minimization algorithm is carried out on the subgraphs of the constraint graph and routing on the putative integrated circuit design is carried out based on results of the longest path algorithm and the extent minimization algorithm.

Abstract: A gas capture system is configured to purify gas streams. The gas capture system includes a first capture system including a plurality of first chambers interconnected by a first path. Each first chamber includes a first adsorbent. The gas capture system further includes a second capture system including a plurality of second chambers interconnected by a second path. Each second chamber includes a second adsorbent. The gas capture system further includes a third path connecting each first chamber to the second path such that a first output of the first capture system is input into the second capture system. The gas capture system further includes a fourth path connecting each second chamber to the first path such that a second output of the second capture system is input into the first capture system.

Abstract: An embodiment searches source for callable units, and scans the contents of the callable units, and generates a set of unit groups that each include one or more of the callable units. The embodiment preprocesses the callable units and then generates hashes of each of the callable units. The embodiment generates a data structure comprising unit identifiers associated with the hashes and their corresponding callable units. The embodiment generates statistical data using a callable-unit metric and updates the data structure by prioritizing the callable units based on the statistical data. The embodiment compares hashes of the callable units and identifies first and second callable units as redundant callable units. The embodiment updates the data structure by identifying the second callable unit as being redundant to the first callable unit. The embodiment generates a report of redundant callable units based on the data structure.

Abstract: An example operation may include one or more of generating, by a training participant client, a plurality of transaction proposals, each of the plurality of transaction proposals corresponding to a training iteration for machine learning model training related to stochastic gradient descent, the machine learning model training comprising a plurality of training iterations, the transaction proposals comprising a gradient calculation performed by the training participant client, transferring the plurality of transaction proposals to one or more endorser nodes or peers each comprising a verify gradient smart contract, executing, by each of the endorser nodes or peers, the verify gradient smart contract; and providing endorsements corresponding to the plurality of transaction proposals to the training participation client.

Abstract: Embodiments are provided for compilation of a quantum program. In some embodiments, a system can include a processor that executes computer-executable components stored in memory. The computer-executable components can include an identification component that selects a subgraph that is common among a first commutation directed acyclic graph (DAG) and a second commutation DAG. The subgraph has an upper-bound size that is greater than a threshold size. The first commutation DAG represents a first quantum circuit of a set of quantum circuits and the second commutation DAG represents a second quantum circuit of the set of quantum circuits. The computer-executable components also include a compilation component that compiles a quantum subcircuit corresponding to the subgraph. The computer-executable components further include a configuration component that replaces the quantum subcircuit in the first quantum circuit with the compiled quantum subcircuit.

Abstract: A method for updating a current master key (MK) with a new MK, protected by an HSM, while a software component using a key is active, is disclosed. The method comprises signaling that a new master key has been loaded to the HSMs, re-encrypting the key encrypted with the current MK, storing the re-encrypted key as respective newKey component of a key object, wherein a current key is stored in a curKey component of the key object, and setting the new MK in a first HSM, and signaling to the active software component that the new MK is set in at least one of the HSMs. Upon determining that the new MK is set in the HSM, restricting usage of the HSMs to the selected HSM, and upon determining that the new MK is set in all HSMs, moving the value of the newKey to the curKey component.

Abstract: Promotional offers are presented to users by tagging users of the services with the user preferences. Promotional offers are received from vendors. The vendors are classified as being in a home area or roaming areas for the services. The users are tracked through movement of a device for the user that is receiving the services to determine whether the user is in the home area or the roaming areas. Promotional offers from the vendors are matched to the user preferences according to the tagging of the users, wherein the promotional offers are from the home area of the home network or the roaming area of the roaming network.

Abstract: Embodiments of the present invention provide methods, computer program products, and systems. Embodiments of the present invention receive a request for a machine learning model and information associated with decisions made by the machine learning model. Embodiments of the present invention can determine one or more machine learning modules that satisfy the received request and create a dedicated traffic channel to send the determined one or more machine learning modules and information associated with the decisions made by the machine learning model. Embodiments of the present invention can transmit the determined one or more machine learning modules and information associated with decisions made by the machine learning model to a computing system using the created, dedicated traffic channel.

Abstract: A method, a computer system, and a computer program product for marketplace creation and model training in a blockchain network is provided. Embodiments of the present invention may include uploading images to a marketplace. Embodiments of the present invention may include recording references to the images on a blockchain ledger. Embodiments of the present invention may include measuring local and global annotations. Embodiments of the present invention may include determining an image quality threshold has been met. Embodiments of the present invention may include providing an annotation quality metric to the marketplace. Embodiments of the present invention may include pre-processing and standardizing the images. Embodiments of the present invention may include training a model. Embodiments of the present invention may include recording the model in the blockchain ledger. Embodiments of the present invention may include providing the model to the marketplace.

Abstract: A computer-implemented method according to one embodiment includes identifying a job creation request within a system; determining a current amount of available resources within the system; and conditionally deploying a reusable group of containers for the job, based on the current amount of available resources for the system.

Abstract: Provided are a computer program product, system, and method for replicating data to a plurality of replication devices through a tape device. A replication request is transmitted to a primary tape device to replicate data to a replication number of at least one replication device to store the data to replicate. The primary tape device stores the data to replicate in tape storage media at the primary tape device and transmits the data to replicate over a network to the replication number of at least one replication device to store. Acknowledgment is received from the primary tape device indicating that the data has been replicated to the primary tape device and the replication number of the at least one replication device.

Abstract: A computer-implemented method for automatically recommending an online meeting reconnection time for one or more online meeting participants that are disconnected. The method collects disconnection information for one or more online meeting participants over time as historical data. The method constructs a predictive model for the one or more online meeting participants based on the historical data and predicts a reconnection time for the one or more online meeting participants based on the predictive model. The method notifies the one or more online meeting participants when a disconnected participant is expected to return online and updates the online meeting agenda if the disconnected participant's reconnection time exceeds a predefined threshold.

Abstract: A semiconductor device including a hybrid contact scheme for stacked FET is disclosed with integration of a BSPDN. A double-sided (both frontside and backside of the wafer) contact scheme with buried power rail (BPR) and backside power distribution network (BSPDN) provides optimum contact and interconnect. The stacked FET could include, for example, FINFET over FINFET, FINFET over nanosheet, or nanosheet over nanosheet.

Abstract: A method for automatically detecting and processing a computer input event comprising one or more intents is provided. The method may include, in response to receiving the computer input event, automatically generating a parse tree comprising nodes including a possible interpretation of the received computer input event and at least one determined intent. The method may further include performing a confidence evaluation for the nodes and receiving one or more first scores from one or more computer agents for a respective node to indicate an ability of a respective computer agent to process the respective node. The method may further include, determining a second score for the respective node by aggregating the one or more first scores from the one or more computer agents for the respective node. The method may further include, based on the determined second score, selecting a node for processing the received computer input event.