Abstract: A system, method, and device for managing updates to a hypercube is provided. The method includes (i) obtaining a hypercube comprising a plurality of locations, wherein a particular location has an anchor object that stores version information for the particular location, and the particular location comprises a first formula that is evaluated to return a value for the particular location, (ii) in response to receiving the request for the value, determining that the particular location comprises the first formula, (iii) in response to determining that the particular location comprises the first formula, evaluating the first formula to obtain a result, and (iv) storing the result for the particular location in association with the version information for the particular location.

Abstract: Various embodiments of the present disclosure provide federated query processing techniques for dynamically tailoring the use and parameters of intermediary local sources based on the identification of federated query. The techniques include receiving an execution plan for executing a federated query that include a plurality of executable tasks for generating a result set from a plurality of third-party data sources. The techniques include generating a result set hash for the result set based on the execution plan and determining a query uniqueness status for the federated query based on a comparison between the result set hash and a plurality of historical result set hashes. In response to determining that the federated query is a unique query, the techniques include generating a time interval that is tailored to the unique query.

Abstract: Techniques described herein relate to a method for managing workflows. The method may include obtaining, from a client, by a registration manager associated with accelerator pools, a request to perform a portion of a workflow using accelerators; identifying a minimum quantity and a maximum quantity of accelerators associated with the request; identifying a storage to store data associated with the portion of the workflow; identifying an accelerator pool of the accelerator pools that includes at least the maximum quantity of accelerators; establishing a connection between the client, the storage, and accelerators of the accelerator pool to perform the portion of the workflow; and initiating the performance of the portion of the workflow using the storage, the client, and the accelerators of the accelerator pool.

Abstract: Described herein are systems and methods that manage machine backups, including the creation of virtual machine packages sufficient to instantiate virtual machines corresponding to the backups. In one aspect, a compute infrastructure includes many machines, which may be either physical or virtual. From time to time, snapshots of the states of these target machines are pulled and saved. Virtual machine packages corresponding to these snapshots are also created. A virtual machine package can be used to instantiate a virtual machine (VM) emulating the target machine with the saved state on a destination virtual machine platform. At some point, the initial VM package for a target machine is created by converting the snapshot to a VM package. However, this may take a long time. Later VM packages can instead be created by updating a prior VM package according to differences between the corresponding snapshots, rather than performing the full conversion process.

Abstract: A method and a computer system for determining the relevance of a text. The method includes: determining the similarity of the text to texts in a portfolio, where the text is compared with each of the texts in the portfolio as part of an individual comparison while determining a similarity value which indicates the similarity between the two texts in each case; assigning the similarity value to one of the two texts in the respectively performed individual comparison which was published at an earlier time or was first captured by a capture system at an earlier time; calculating a relevance value from the similarity values which were determined in the individual comparisons and were assigned to the text, and storing the calculated relevance value and/or transmitting the calculated relevance value to a communication end system via a computer network.

Abstract: Methods, systems, and computer program products for a content management system. Embodiments operate within or in conjunction with such a content management system. The content management system stores content objects for access by various collaborators, including extra-system collaborators. A user of the content management system configures extra-enterprise shared link URLs that permit the extra-system collaborators to access shared content objects over an Internet connection. A shared link event graph data structure is formed based on access requests over the extra-enterprise shared link URLs. An interactive user interface module is generated by processing a shared link report query over the shared link event graph data structure to select a subject set of the extra-enterprise shared link URLs, and to generate a data set of the interactive user interface module based at least in part on results from the query. A user interacts with the interactive user interface module to generate insights.

Abstract: Systems and methods for detecting unrestricted file upload (UFU) vulnerabilities in Node.js (e.g., Node.js web applications) are provided. A lightweight framework can be used, drawing on a comprehensive evaluation of unique UFU-type attack types from multiple sources. By tailoring these attack instances to the Node.js ecosystem, systems and methods of embodiments of the subject invention offer more thorough coverage of potential attack vectors than existing technologies and tools.

Abstract: A scoring system to assign an exposure metric to a service accessed by multiple end-user devices in an application layer of a cloud-based system. The scoring system includes multiple tenants comprising multiple end-user devices and a scoring server. The scoring server configures dimensions that are functions of the service. The scoring server identifies a resource and determines a resource metric that is a weight of the resource in a dimension. The scoring server further receives a policy and calculates a policy metric that is distance of the policy from origin of a vector space. The scoring server also aggregates the policies and/or the dimensions based on the policy metric, retrieves a dimension metric, and computes the exposure metric for the service. Finally, the scoring server stores the exposure metric of the services and alerts the end-user device about the status of the service.

Abstract: Operations include determining whether to cache resources accessed by a query based on the execution time of the query. The system identifies a set of executions of a same query. The system determines a cumulative execution time for the set of executions of the same query. If the cumulative execution time exceeds a threshold value, then the system caches a resource used for execution of the query.

Abstract: Solutions for providing a data traffic session with proxy-call session control function (P-CSCF) restoration include: receiving an indication, by an application server (AS), that a user equipment (UE) is registered with a first proxy node; receiving, at a subscriber information node, from a call session control function (e.g., over an N70 interface), a first message triggering proxy node restoration; based on at least receiving the first message triggering proxy node restoration, transmitting, by the subscriber information node, to a management node, a second message triggering proxy node restoration; receiving an indication, by the AS, that the UE is registered with a second proxy node different than the first proxy node; and based on at least receiving a session initiation message, establishing the data traffic session for the UE with the second proxy node.

Abstract: Containers are generated including data containers storing segments of files, segment tree containers storing upper-level segments of segment trees representing the files, and cloud containers storing headers from the data and segment tree containers. A header for a data container includes fingerprints identifying the segments of files. A header for a segment tree container includes fingerprints identifying the upper-level segments. The containers are sent to cloud storage for storage as a cloud unit. The cloud unit is attached to a deduplicated storage appliance by storing at the appliance the segment tree and cloud containers, cloud configuration details, and an index. The cloud configuration details identify the cloud storage having the cloud unit. The index maps the fingerprints to the containers. When a cloud unit is to be detached, the segment tree and cloud containers, and index from the local storage are deleted, but the cloud configuration details are maintained.

Abstract: Systems, methods, and apparatus are provided for modification of RPA controls during a workflow without impacting bot performance. A background scan initiated in parallel to an RPA application workflow may identify values for an application control parameter and a corresponding bot control parameter. Hashes of the values may be validated against a key value pair stored as a block in a distributed ledger. If changes have been made to the application control values, the bot control value will not match the application control value and validation will fail. If validation fails, an override may be generated for the bot value. An updated bot value may be stored in a temporary cache until the workflow is complete. Following completion of the workflow, a new block may be added to the blockchain storing a new key value pair including the application control value and the updated bot control value.

Abstract: A method including a) receiving a computer generated data set of sequencing constraints describing a software system to be executed on an automation system and including software components and runnable function entities distributed over the number of computing nodes; b) generating a transition matrix from the data set of sequencing constraints, the transition matrix having a plurality of matrix elements each of them describing, by a transition value, a transition from a runnable function entity to another runnable function entity; c) receiving a computer generated communication matrix describing communication links between the computing nodes in the automation system; d) generating a Markov chain out of the data set of sequencing constraints and the communication matrix; e) generating a distribution function from the Markov chain describing used resources of the computing nodes by the software components and runnable function entities; and f) optimizing the allocation of resources.

Abstract: A technique for synchronizing workgroups is provided. Multiple workgroups execute a wait instruction that specifies a condition variable and a condition. A workgroup scheduler stops execution of a workgroup that executes a wait instruction and an advanced controller begins monitoring the condition variable. In response to the advanced controller detecting that the condition is met, the workgroup scheduler determines whether there is a high contention scenario, which occurs when the wait instruction is part of a mutual exclusion synchronization primitive and is detected by determining that there is a low number of updates to the condition variable prior to detecting that the condition has been met. In a high contention scenario, the workgroup scheduler wakes up one workgroup and schedules another workgroup to be woken up at a time in the future. In a non-contention scenario, more than one workgroup can be woken up at the same time.

Abstract: Systems, apparatuses, methods, and computer program products are disclosed for managing open issues. An example method includes obtaining a dashboard access request for a portion of open issues managed by the issue management system, the issue management system storing variables associated with each open issue of the open issues; obtaining a dashboard data package based on scores for the portion of open issues, the scores indicating a severity level of the open issues of the portion of open issues and being based on the variables that are stored in the issue management system; and performing an action set using the dashboard data package to manage the portion of open issues.

Abstract: A device, system and method for assigning portions of a global resource limit to application engines based on relative load is provided. A system comprises a plurality of application engines that share a global resource limit; and a plurality of operator engines. The plurality of operator engines are each configured to: monitor a respective metric representative of respective load at a respective application engine; share the respective metric with others of the plurality of operator engines; determine a relative load at the respective application engine based on the respective metric and respective metrics received from the others of the plurality of operator engines; and assign a portion of the global resource limit to the respective application engine based on the relative load.

Abstract: Methods and systems disclosed herein recite the use of linking cryptography-based digital repositories in order to perform blockchain operations in decentralized applications. For example, the system may link a first cryptography-based, storage application (e.g., a first digital wallet) with a second first cryptography-based, storage application (e.g., a second digital wallet). The first cryptography-based, storage application may correspond to a first private key, and wherein the first private key is stored on a first user device. The second cryptography-based, storage application corresponds to a first partial private key and a second partial private key, wherein the first partial private key is stored on a first remote device, and wherein the second partial private key is stored on the first user device.

Abstract: Disclosed embodiments relate to software control of graphics hardware that supports logical slots. In some embodiments, a GPU includes circuitry that implements a plurality of logical slots and a set of graphics processor sub-units that each implement multiple distributed hardware slots. Control circuitry may determine mappings between logical slots and distributed hardware slots for different sets of graphics work. Various mapping aspects may be software-controlled. For example, software may specify one or more of the following: priority information for a set of graphics work, to retain the mapping after completion of the work, a distribution rule, a target group of sub-units, a sub-unit mask, a scheduling policy, to reclaim hardware slots from another logical slot, etc. Software may also query status of the work.

Abstract: A computing device and method is disclosed. The computing device includes a plurality of processing cores, and a tile scheduler configured to update a cost matrix of each of the plurality of processing cores based on meta information of each of first tiles previously allocated to the plurality of processing cores and meta information of each of second tiles, and allocate the second tiles with respect to the plurality of processing cores using the updated cost matrix of each of the plurality of processing cores.

Abstract: A transitioning process to integrate a computer-related service with one or more other computer-related services. The computer-related service and the one or more other computer-related services are analyzed to determine whether there is a conflict in integrating the computer-related service in the computing environment. A determination is made based on the analyzing whether one or more changes are to be made to a selected component. At least the analyzing and the determining are part of an automated process generated to integrate the computer-related service, and the automated process is at least a part of the transitioning process. An indication of a performance impact of executing at least the automated process to integrate the computer-related service is obtained. The transitioning process is to continue based on the performance impact meeting one or more selected criteria and based on determining that there are not one or more changes to be made to the selected component.