Abstract: Transport Layer Security (TLS) connection establishment between a client and a server for a new session is enabled using an ephemeral (temporary) key pair. In response to a request, the server generates a temporary certificate by signing an ephemeral public key using the server's private key. A certificate chain comprising at least the temporary certificate that includes the ephemeral public key, together with a server certificate, is output to the client by the server, which acts as a subordinate Certificate Authority. The client validates the certificates, generates a session key and outputs the session key wrapped by the ephemeral public key. To complete the connection establishment, the server applies the ephemeral private key to recover the session key derived at the client for the new session. The client and server thereafter use the session key to encrypt and decrypt data over the link. The ephemeral key pair is not reused.

Abstract: A floor system in a server room includes a main panel and a sub-panel. The main panel includes main panel inlaid cables and main panel connectors where the main panel inlaid cables connect a first set of the main panel connectors to a second set of the main panel connectors. The sub-panel includes sub-panel inlaid cables and sub-panel connectors where the sub-panel inlaid cables connect the sub-panel connectors to one another. The floor system provides an operating floor via the main panel and the sub-panel where the operating floor is raised relative to a sub-floor and the main panel is a removable floor panel to access a space between the operating floor and the sub-floor. The main panel inlaid cables and the sub-panel inlaid cables establish a current pathway from a power source.

Abstract: A method of detecting deceptive web activity is implemented in an intermediary located between a requesting client device, and a server that hosts a web application. Following a bootstrap phase used to generate a database of information identifying characteristics of clients, the method begins by receiving a page directed to the client from the server. The server injects an invisible DOM element having a set of style properties associated therewith, with one of the set of style properties assigned a random value, to generate a modified page, which is returned to the client. As the client interacts with the modified page, the intermediary tracks the device's styles and uses them to identify the client from information in the database. Once the device is identified, the intermediary then detects whether a spoofing attack has occurred. By leveraging the tracked styles, a spoofing attack on the DOM element's styles may also be detected.

Abstract: Embodiments of the present invention provide computer-implemented methods, computer program products and computer systems. Embodiments of the present invention can monitor user activity for one or more user interactions performed while connected to a Virtual Private Network. Embodiments of the present invention can then identify potential risks associated with a user and respective user interactions. Embodiments of the present invention can then, in response to determining a respective user interaction of the one or more interactions is suspicious, generate a real time risk score for the respective user interaction. Embodiments of the present invention can then, in response to the generate real time risk score exceeding a threshold level of risk for the respective user interaction, initiate a secondary authentication protocol.

Abstract: Methods, systems, and computer program products includes, for example, detecting a first personal electronic device associated with a first user in the presence of a second personal electronic device associated with a second user, determining the first personal electronic device in the presence of the second personal electronic device being associated with the first user and the second user being in a business setting, receiving user data regarding the second user in response to the determination of the first user and the second user being in the business setting, and storing the received user data regarding the second user in a first memory for access by the first user on the first personal electronic device.

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: Described are techniques including a computer-implemented method that comprises defining a respective priority classification for each of a plurality of sockets used for communicating between an initiator computational system and a target computational system. The method further comprises automatically assigning a respective priority classification to each of a plurality of Input/Output (IO) requests based on a type of data associated with each IO request. The method further comprises sending the plurality of IO requests to respective sockets of the plurality of sockets with a matching priority classification.

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.

Abstract: A method, computer system, and a computer program product for searching are provided. The method may include receiving a word and a context of the word. The context may include additional words. A first word embedding may be generated by inputting a sequence into a word embedding model that resultantly outputs the first word embedding. The sequence may include the word and the context that are concatenated to each other in the sequence. The first word embedding may be compared with other word embeddings. The other word embeddings may have been generated by inputting respective text portions of other texts into the word embedding model. A candidate match of the other texts may be presented. A respective word embedding of the candidate match may be, of the other word embeddings, most similar to the first word embedding according to the comparing.

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 quantum circuit includes a quantum signal unit. There is a first quantum chip comprising a plurality of qubit devices and bi-directionally coupled to the quantum signal unit. A first quantum entangling unit is bi-directionally coupled to the quantum signal unit and configured to generate an entanglement between a first and a second qubit device on the first quantum chip via the quantum signal unit.

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: Techniques for generating machine learning training data which corresponds to one or more downstream tasks are disclosed. In one example, a computer implemented method comprises generating one or more synthetic data instances for training a machine learning model, and determining a value of respective ones of the one or more synthetic data instances with respect to at least one task. One or more additional synthetic data instances for training the machine learning model are generated based at least in part on the values of the respective ones of the one or more synthetic data instances.

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 processor may generate an enforcement point. The enforcement point may include one or more adversarial detection models. The processor may receive user input data. The processor may analyze, at the enforcement point, the user input data. The processor may determine, from the analyzing, whether there is an adversarial attack in the user input data. The processor may generate an alert based on the determining.

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: An instructional design tool is provided for designing learning based applications. More specifically, the instructional design tool is configured to use captured expert knowledge for translating such knowledge into an environment used for instructional purposes. The instructional design tool includes at least one component configured to visually model a gaming scenario using recorded knowledge and graphical content defined by values associated with classes of respective models and translate the defined values into a standardized XML format.

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 computer-implemented method, according to one embodiment, includes: receiving, at a clustered filesystem from a formatted filesystem, a request to perform a data integrity check for a portion of data. A determination is made as to whether the request includes a filesystem type of the portion of data, and in response to determining that the request includes a filesystem type of the portion of data, another determination is made as to whether the clustered filesystem supports the data integrity check for the filesystem type. In response to determining the clustered filesystem supports the data integrity check, another determination is made as to whether the portion of data is currently available. Furthermore, the computer-implemented method includes causing the data integrity check to be performed in response to determining that the portion of data is currently available. Results of performing the data integrity check are also sent to the formatted filesystem.

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: A repository is configured in a hybrid data processing environment comprising a classical computing system and a quantum computing system, to hold a plurality of quantum circuit components (QCC(s)). A degree of difficulty in simulating the received QCC in the classical computing system is transformed into a classical hardness score. A degree of difficulty in implementing the received QCC in the quantum computing system is transformed into a quantum hardness score. A first parameter in a metadata data structure associated with the received QCC is populated with the classical hardness score. A second parameter in the metadata data structure associated with the received QCC is populated with the quantum hardness score. The received QCC is transformed into a library element by at least augmenting the received QCC with the metadata data structure. The library element is added to the repository.

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: Systems and techniques that facilitate partitioned template matching and/or symbolic peephole optimization are provided. In various embodiments, a system can comprise a template component, which can perform template matching on a Clifford circuit associated with a set of qubits. In various aspects, the system can comprise a partition component, which can partition, prior to the template matching, the Clifford circuit into a computation stage, a Pauli stage, and a SWAP stage. In various instances, the template matching can be performed on the computation stage. In various embodiments, the system can comprise a symbolic component, which can select a subset of qubits from the set of qubits, rewrite at least one entangling gate in the computation stage such that a target of the at least one entangling gate is in the subset of qubits, and replace the at least one rewired entangling gate with a symbolic Pauli gate.

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: To increase the efficiency of electronic design automation, at an end point of physical design synthesis optimization flow for a putative integrated circuit design having a plurality of nets, identify at least one congested region in the putative integrated circuit design. Identify those of the nets of the putative integrated circuit design traversing through the at least one congested region, to obtain a plurality of candidate nets for demotion. Demote a plurality of selected nets, selected from the plurality of candidate nets for demotion, from an upper routing layer of the putative integrated circuit design to a lower routing layer of the putative integrated circuit design. At least some of the plurality of selected nets experience a loss of timing quality of result after the demoting.

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: A method, system and apparatus for providing bound information accesses in buffer protection, including providing one-to-one mapping between a general-purpose register and bound information in a BI (bound information) register, saving loaded bound information in the BI register for future use, providing integrity of the bound information in the BI register that is maintained along program execution, and providing a pro-active load of the bound information with one-bit extra control on load instruction of the BI register.

Abstract: A computer-implemented system, platform, method and computer program product for optimizing a data analytics fraud prediction/detection pipeline that includes a combination of a classical machine learned classifier model with a quantum machine learned model to optimize the performance of the fraud prevention model. The feature selection uses different feature maps: one determined by the classic classifier and the other determined by the quantum model implementation that exploits the entanglement quantum property. The quantum method can include a quantum support vector machine implementing a built feature forward algorithm that uses a quantum kernel estimate for feature mapping. This quantum model can be run on a quantum computer or quantum simulator that can run a quantum algorithm built for extracting feature importance.

Abstract: One embodiment provides a method, including: producing, for each of a plurality of containers, a resource profile for each thread in each of the plurality of containers; identifying, for each of the plurality of containers and from, at least in part, the resource profiles, container dependencies between threads on a single of the plurality of containers; determining service dependencies between threads across different of the plurality of containers; scheduling, based upon the container dependencies and the service dependencies, threads to cores, wherein the scheduling is based upon minimizing thread processing times; and publishing the container dependencies and the service dependencies on a registry of the node clusters.

Abstract: Systems and techniques that facilitate policy-driven views of datasets are provided. In various embodiments, a system can comprise a data component that can access a dataset. In various instances, the system can further comprise a view policy component that can respectively correlate a set of security credentials to a set of view instructions associated with the dataset. In various embodiments, the system can further comprise an input component that can receive as input a first security credential that is listed in the set of security credentials. In various aspects, the system can further comprise an output component that can identify a first view instruction that is listed in the set of view instructions associated with the dataset, wherein the first view instruction is respectively correlated to the first security credential. In various cases, the output component can generate as output a view of the dataset based on the first view instruction.

Abstract: A method includes receiving a plurality of files where each file represents an object. The method further combines selected files of the plurality of files into an aggregation file and stores the aggregation file on low-latency storage media, such as disk storage media. The method represents the aggregation file with a single inode that is stored on the low-latency storage media. The method migrates the aggregate file to high-latency storage media, such as tape storage media, while leaving the single inode representing the aggregation file on the low-latency storage media. By collecting files into larger aggregation files, the number of files archived is significantly reduced and the files archived are of larger size. The reduced number of files and increased size of the files improves archival and retrieval performance due to reduced metadata operation overhead. A corresponding system and computer program product are also disclosed.

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, 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: 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: A method including: receiving, as input, an image; providing a neural network structure including a plurality of multilayer multi-scale neural networks, wherein the plurality of multilayer multi-scale neural networks are arranged sequentially, by laterally connecting corresponding scale-level layers between each two adjoining multilayer multi-scale neural networks in the sequence; and at a training stage, training the neural network structure on a training dataset, to obtain a trained machine learning model configured to perform a computer vision task which includes outputting at least one of: (i) a classification of the image into one class of a set of two or more classes, (ii) a segmentation of a least one object in the image, and (iii) a detection of at least one object in the image.

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: Techniques for generating a natural language question template for an artificial intelligence question and answer (QA) system are disclosed. A graph database query relating to a QA system is parsed using a predefined schema. The parsing includes extracting a first plurality of values from the graph database query relating to a where clause in the graph database query, extracting a second plurality of values from the graph database query relating to a return clause in the graph database query, identifying a QA template rule relating to the graph database query, based on a match clause in the graph database query. A natural language question template is generated based on the first plurality of values, the second plurality of values, and the identified QA template rule. The natural language question template is suitable for use by the QA system as part of generating a response to a natural language question.

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: 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 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: 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 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 semiconductor structure comprises a plurality of gate structures alternately stacked with a plurality of channel layers, and a plurality of epitaxial source/drain regions connected to the plurality of channel layers. The plurality of channel layers are connected to the plurality of epitaxial source/drain regions via a plurality of epitaxial extension regions. Respective pairs of adjacent channel layers of the plurality of channel layers are connected to a given one of the plurality of epitaxial source/drain regions via respective ones of the plurality of epitaxial extension regions.

Abstract: A computer system includes a processor core and a memory system in signal communication with the processor core. The memory system includes a first cache and a second cache. The first cache is arranged at a first level of a hierarchy in the memory system and is configured to store a plurality of first-cache entries. The second cache is arranged at a second level of the hierarchy that is lower than the first level, and stores a plurality of second-cache entries. The first cache maintains a directory that contains information for each of the first-cache entries. The second cache maintains a shadow pointer directory (SPD) that includes one or more SPD entries that maps each of the first-cache entries to a corresponding second cache entry at a lower-level cache location.

Abstract: Methods, computer program products, and/or systems are provided that perform the following operations: obtaining metadata associated with a content item, wherein the metadata includes at least one runtime metadata definition; identifying an environment for providing access to the content item based on a runtime metadata definition; implementing the environment based, at least in part, on the runtime metadata definition; and providing access to the content item in the environment.

Abstract: Provided are a computer program product, integrated cache manager, and method for maintaining data in a first level memory and buckets representing regions of memory devices to extend data cache. A plurality of buckets represent distinct regions of memory devices. The buckets are associated with different threshold access count ranges. Data having an access count is stored in one of the buckets associated with a threshold access count range including the access count of the data to store. Data evicted from a first level memory is copied to an initial bucket comprising one of the buckets. Data is moved from a source bucket comprising one of the buckets, including the initial bucket, to a target bucket of the buckets having a target threshold access count range including an access count of the data to move.

Abstract: A computer-implemented method, a computer system, and computer program product for associating security events. The method includes obtaining a result of implementation of one or more Locality-Sensitive Hashing (LSH) functions to feature data of a first event detected by a first device. The method also includes mapping the result to one or more positions in a data structure. In response to data elements of the one or more positions indicating first information associating with the one or more positions exists in a storage, the method includes obtaining the first information from the storage. The method further includes sending the first information to the first device.

Abstract: Aggregated log index-based log record identification is provided by maintaining log files of a database system on a plurality log storage devices, the log files including log records of changes to database objects, indexing the log files to obtain a collection of log indexes, where the indexing includes, for each log storage device, indexing log records stored on the log storage device to obtain a respective log index, then based on a request, identifying log storage devices that store log records for servicing the request, the log storage devices storing log indexes, of the collection of log indexes, that index an aggregate set of log records on the log storage devices, obtaining the log indexes from the log storage devices, and aggregating the log indexes to provide an aggregated log index that provides an index of the aggregate set of log records on the log storage devices.

Abstract: Methods, systems, and computer program products for partitioning and parallel loading of property graphs with constraints are provided herein. A computer-implemented method includes obtaining graph-related input data and corresponding constraint data, wherein the graph-related input data and corresponding constraint data are at least one of user-defined and input data model-based; generating at least one in-memory graph based at least in part on processing at least a portion of the obtained graph-related input data; partitioning the at least one in-memory graph into two or more sub-graphs by processing the at least one in-memory graph using one or more polynomial time partition algorithms; and generating at least one property graph by allocating, at least a portion of the two or more partitioned sub-graphs which satisfy the obtained constraint data, to two or more threads that run in parallel.

Abstract: A method includes: creating, by a computing device, a virtual consolidation layer; replicating, by the computing device, snippets that are results of a query; copying, by the computing device, the replicated snippets to the virtual consolidation layer; performing, by the computing device and by a machine learning model, matching of particular ones of the snippets in the virtual consolidation layer; and producing, by the computing device, a search result comprising the matched snippets.