Abstract: An augmented reality (AR) development system includes computer hardware including an AR system and a development server. The development server is configured to perform identifying a plurality of microservices to be deployed into an architecture, at least one integration layer in the architecture, and at least one application programming interface (API) layer in the architecture. The AR system is configured to perform generating a first visualization of the architecture that includes: a plurality of representations respectively corresponding to the plurality of microservices to be deployed in the architecture and a plurality of distinct and visually identifiable locations that respectively correspond to a unique combination of a specific API layer and a specific integration layer; receiving an indication for modifying a placement of one of the plurality of microservices within the first visualization; and generating a second visualization of the architecture based upon the indication.

Abstract: Methods, computer program products, and systems are presented. The method computer program products, and systems can include, for instance: running an application on one or more computing node, the application providing user access to a database; receiving by the application registration data from a user for registering the user into a service; in response to the receiving the registration data from the user, generating a user schema that defines access rights of the user to the database, wherein the generated user schema includes a set of shared data structure objects instantiated in a storage system associated to the application, and a set of private data structure objects.

Abstract: In an approach, a processor receives a data manipulation request on a target database. A processor sends the data manipulation request to a source database. The source database attempts to persist a data manipulation action relating to the data manipulation request. Responsive to a successful attempt to persist the data manipulation action: the source database sends a log position of the data manipulation action to a data replication engine; a processor replicates the data manipulation request triggering the data manipulation action in the target database; and a processor confirms to the target database that the data manipulation action in the target database has been completed.

Abstract: A computer-implemented method dynamically switches access plans for a query during concurrent query execution. The method includes receiving a first query configured to be processed by a database system. The method also includes generating, for the first query, an access plan for each of identified resource sets. The method includes determining a first set of available resources that represent an available capacity for the database system. The method further includes selecting a first resource set of the one or more resource sets, where the selecting is based on the first set of available resources being closest to the first resource set. The method also includes selecting, based on the first set of available resources, a first access plan of the one or more access plans. The method includes executing the first query and returning results of the first query to a source of the first query.

Abstract: Provided is a method for assigning register tags to instructions at issue time. The method comprises receiving an instruction for execution by a microprocessor. The method further comprises dispatching the instruction to an issue queue without assigning a register tag to the instruction. The method further comprises determining that the instruction is ready to issue. In response to determining that the instruction is ready to issue, the method comprises assigning an available register tag to the instruction. The method further comprises issuing the instruction.

Abstract: A computer-implemented method, a computer system, and a computer program product for trajectory similarity search is provided. The present invention may include, in response to receiving, by one or more processors, a search request for at least one trajectory similar to a query trajectory, determining, by one or more processors, a respective similarity between a query trajectory and a plurality of trajectories by calculating, in a synchronized way, a spatial distance measure and a time difference measure between the query trajectory and the plurality of trajectories. The present invention may further include, identifying, by one or more processors, the at least one trajectory from the plurality of trajectories based on the respective similarity between the query trajectory and the plurality of trajectories.

Abstract: A computer-implemented method according to one aspect includes determining and storing characteristics of a plurality of cloud vendors; dividing a workload into a plurality of logical stages; determining characteristics of each of the plurality of logical stages; and for each of the plurality of logical stages, assigning the logical stage to one of the plurality of cloud vendors, based on a comparison of the characteristics of the plurality of cloud vendors to the characteristics of the logical stage. Data migration between the cloud vendors is performed during an implementation of the workload to ensure data is located at necessary cloud vendors during the corresponding tasks of the workload.

Abstract: In one general embodiment, a computer-implemented method includes determining when two satellites in low Earth orbit (LEO) and having duplicate instances of data stored thereon will be within a predefined distance of one another. A third satellite is identified to store a replication copy of the instance of data for at least a duration that the two satellites will be within the predefined distance of one another. A copy of the instance of data is caused to be transmitted to the third satellite for storage thereon.

Abstract: Provided are a computer program product, system, and method for a data set connection manager having a plurality of data sets to represent one data set. A request is processed to open a connection to a data set having members, wherein the connection is used to perform read and write requests to the members in the data set. In response to establishing the connection, establishing for the connection a primary data set having all the members; a secondary data set to which updated members in the primary data set are written; and a pending delete data set to pending delete members comprising members that are updated.

Abstract: Accelerator access control whereby an application's access to an accelerator is revoked in order to allow the system to perform a system function. In one or more embodiments, when an application is executing, a credit system is utilized to provide credits for controlled access to the accelerator. When request information is received to remove access to a credit associated with the application's access to the accelerator, the credit is marked to fail with operating system interfaces. Also, in one or more embodiments, if the credit is in use for accessing the accelerator, an effective address associated with the credit is unmapped from the accelerator.

Abstract: A solution is proposed for verifying authenticity of documents. A corresponding method comprises calculating signatures representative of segments splitting a current document. The signatures are searched in an authoritative memory structure containing corresponding signatures of segments splitting authoritative documents whose content is certified by authoritative sources. Authenticity information of the current document is determined according to a result of this search. A computer program and a computer program product for performing the method are also proposed. Moreover, a system for implementing the method is proposed.

Abstract: Protection of a kernel from a sniff and code reuse attack. A kernel mode page table in initialized in a kernel. The kernel page entries in the kernel mode page table are set from s-pages to u-pages. Supervisor mode access prevention is enabled in the u-pages. Code contained in the kernel page entries in the u-pages is executed, the kernel page entries in the u-pages are capable of execution but are not capable of being accessed and read directly.

Abstract: Methods, systems, and computer program products for service-to-service scheduling in container orchestrators are provided herein. A computer-implemented method includes reserving, by a network orchestrator, network resources requested between a plurality of services, wherein each of the services is implemented as one or more replicas running on a set of nodes of a cluster, managed by the network orchestrator, that use the network resources to serve incoming requests to the plurality services; monitoring utilization of the network resources; and scheduling, by the network orchestrator based on the monitoring, one or more new replicas of the plurality of services and the incoming requests to the plurality of services in a collaborative manner to increase at least one network performance characteristic.

Abstract: In a method for encryption of sensitive data, an encrypted user private key is received in a Trusted Execution Environment (TEE) in a worker node in a container management system, the encrypted user private key being an encrypted version of a user private key for decrypting a message from a user in the container management system. The user private key is obtained in the TEE, and the encrypted user private key being decrypted into the user private key with a provider private key that is received from an encryption manager for managing the container management system. With these embodiments, the user private key may be transmitted to the worker node safely, such that the worker node may use the user private key to decrypt messages from the user. Therefore, the security level of the container management system may be increased.

Abstract: A processor may segment a media key block into two or more subsets. Each of the two or more subsets may be respectively associated with a particular group of receivers, and each receiver of the particular group of receivers may be in a blockchain network. The processor may receive, from a first receiver, a request for permission to process the media key block. The processor may identify which of the two or more subsets that the first receiver is associated. The processor may provide a media key block value to the first receiver.

Abstract: A secret key is communicated to a receiver system. A one-time pad is generated using the secret key and a counter. An encrypted message is generated by performing an XOR operation on a first message using the one-time pad. The encrypted message and the counter are sent to the receiver system.

Abstract: Methods and systems for software analysis include determining a similarity score for an ordered input set and at least one ordered cluster set that represents a distance between the ordered input set and the at least one ordered cluster set. It is determined that he ordered input is similar to a first cluster of the at least one ordered cluster set, based on the similarity score. The ordered input set is merged to the first cluster of the at least one cluster set to generate a merged set that preserves an ordering of the ordered input set and the first cluster. Software analysis is performed using the merged set.

Abstract: Methods, computer program products, and/or systems are provided that perform the following operations: obtaining video data; dividing the video data into a plurality of video fragments based, at least in part, on page detection; extracting one or more elements from each of the plurality of video fragments; determining element type data for each of the one or more extracted elements; generating element style data for the one or more extracted elements; determining page flow for the plurality of video fragments; and generating one or more pages based, at least in part, on the one or more elements extracted from the plurality of video fragments, the element type data, the element style data, and the page flow.

Abstract: VFET devices having symmetric, sharp channel-to-source/drain junctions and techniques for fabrication thereof using a late source/drain epitaxy process are provided. In one aspect, a VFET device includes: at least one vertical fin channel disposed on a substrate; a gate stack alongside the at least one vertical fin channel; a bottom source/drain region directly below the at least one vertical fin channel having, for example, an inverted T-shape with a flat bottom; and a top source/drain region over the at least one vertical fin channel. A method of fabricating a VFET device is also provided.

Abstract: One or more systems, devices, or methods of use provided herein relate to a process of long-range coupling qubits in a quantum computing device with energy loss protection. A system can comprise a first transmon coupler capable of selectively coupling a first tunable coupler qubit to a first fluxonium qubit; a second transmon coupler capable of selectively coupling a second tunable coupler qubit to a second fluxonium qubit. Additionally, in one or more embodiments, the system can include a long-range coupler capable of selectively coupling the first fluxonium qubit to the second fluxonium qubit. The first transmon coupler can be coupled to a first B mode of the first tunable coupler qubit, and the second transmon coupler can be coupled to a second B mode of the second tunable coupler qubit.