Systems and methods for performing data protection operations including replication management or data copy operations. Agent-less data protections are performed. A management server is configured to perform data operations on a production host without installing an agent on the production host. A driver is adapted to aid in performing the data protection operations and communications between the management server and the driver such as commands are achieved via a storage array.

This invention relates to methods and systems for searching. It is particularly applicable to methods of searching which enable efficient identification of compatible portfolios. Embodiments of the invention propose methods of searching which address the huge search space issue associated with identifying compatible portfolios. In particular, embodiments of the invention start their search operations simultaneously from both sides by both trying to form valid portfolios from candidate products until a valid solution is found and trying to find conflicts from the defined compatibility rules until a conflict is found which leads to the conclusion that no valid solution exists. A conclusion from either process will stop the whole searching process which can significantly reduce blind and unnecessary searching in the whole search space. In embodiments of the invention, the two sides of the search process are also connected in a way which permits two-way communications between the processes to share information about invalid search branches during the execution of the search. The shared information is then used to direct the current and later stage of search execution. Such exchange of information can also significantly reduce the search space and create more efficient searching systems and methods, particularly by stopping search agents from carrying out invalid future searches in branches that another agent has already identified as invalid.

Systems and methods for executing queries on a bitmap index are disclosed. The system may receive a first data stream from a database and generate a bitmap index based on the first data stream. The system may receive an input selection of one or more data conditions from a user device and generate a Boolean expression based on the input selection. The system may query the bitmap index using the Boolean expression and generate a bitmap vector. The system may output a first data subset represented by the generated bitmap vector to a graphical user interface. The bitmap index may include probabilistic entries, and the system may validate the probabilistic entries by receiving a second data stream, identifying one or more entries correlated to the probabilistic entries, determining a divergence between the identified entries and the probabilistic entries, and updating parameters of a classifier model associated with the probabilistic entries.

Embodiments of the present invention provide systems and methods for associating rule mining. By way of example, embodiments obviate or mitigate performance and stability problems associated with conventional association rule mining approaches, by proposing concepts implementing association rule mining using rolling filtering bitmaps over dynamic data.

The present disclosure relates to a method and an apparatus for representation of a sparse matrix in a neural network. In some embodiments, an exemplary operation unit includes a buffer for storing a representation of a sparse matrix in a neural network, a sparse engine communicatively coupled with the buffer, and a processing array communicatively coupled with the sparse engine. The sparse engine includes circuitry to: read the representation of the sparse matrix from the buffer, the representation comprising a first level bitmap, a second level bitmap, and an element array; decompress the first level bitmap to determine whether a block of the sparse matrix comprises a non-zero element; and in response to the block comprising a non-zero element, decompress the second level bitmap using the element array to obtain the block of the sparse matrix. The processing array includes circuitry to execute the neural network with the sparse matrix.

Disclosed are systems and methods utilizing neural contextual bandit for improving interactions with and between computers in content generating, searching, hosting and/or providing systems supported by or configured with personal computing devices, servers and/or platforms. The systems interact to make item recommendations using latent relations and latent representations, which can improve the quality of data used in processing interactions between or among processors in such systems. The disclosed systems and methods use neural network modeling in automatic selection of a number of items for recommendation to a user and using feedback in connection with the recommendation for further training of the model(s).

Embodiments of the present invention provide a computer system, a computer program product, and a method that comprises generating a baseline prediction for each database in a plurality of databases, wherein the generated baseline prediction includes datapoints for each performance feature of a respective database in the plurality of databases; generating a linkage matrix using a dimension reduction algorithm in an equal-dimensional feature space based on a measured difference between actual performance datapoints of each respective database and respective datapoints associated with generated baseline prediction for each database in the plurality of databases; linking one or more databases in the plurality of databases based on the measured difference within the generated linkage matrix reaching a predetermined threshold of measured performance; and generating a design using the linked databases for a computer system capable of being displayed through a user interface.

Technologies for dynamic accelerator selection include a compute sled. The compute sled includes a network interface controller to communicate with a remote accelerator of an accelerator sled over a network, where the network interface controller includes a local accelerator and a compute engine. The compute engine is to obtain network telemetry data indicative of a level of bandwidth saturation of the network. The compute engine is also to determine whether to accelerate a function managed by the compute sled. The compute engine is further to determine, in response to a determination to accelerate the function, whether to offload the function to the remote accelerator of the accelerator sled based on the telemetry data. Also the compute engine is to assign, in response a determination not to offload the function to the remote accelerator, the function to the local accelerator of the network interface controller.

A method for servicing document search requests. The method includes receiving, by a document management service, a document search query from a requesting user, and injecting, into the document search query, a user access vector. The user access vector specifies, for the requesting user, access control lists that are associated with the requesting user. The method further includes identifying, in a document repository, documents that match the document search query with the injected user access vector. A matching document requires a match of terms in the search query with terms in the matching document, and a match of at least one access control list specified in the matching document and at least one of the access control lists specified in the user access vector.

A database management system is described that can encode data to generate a plurality of data vectors. The database management system can perform the encoding by using a dictionary. The database management system can adaptively reorder the plurality of data vectors to prepare for compression of the plurality of data vectors. During a forward pass of the adaptive reordering, most frequent values of a data vector of the plurality of data vectors can be moved-up in the data vector. During a backward pass of the adaptive reordering, content within a rest range of a plurality of rest ranges can be rearranged within the plurality of data vectors according to frequencies of the content. The reordering according to frequency can further sort the rest range by value. Related apparatuses, systems, methods, techniques, computer programmable products, computer readable media, and articles are also described.