Abstract: Method for performing unsupervised clustering of a data set including a plurality of data points by means of minimization of a cost function by a classical digital computer. The classical digital computer locates each data point on a Bloch sphere and sends the position of the data point to a quantum computer. The quantum computer translates each position to a quantum state of a plurality of qubits and implements a quantum circuit on them. The quantum circuit modifies the quantum state of the qubits to a final quantum state based on a plurality of optimized variational parameters provided by an optimizer of the cost function performed in the classical digital computer, the final quantum state corresponding to the label in which each data point is clustered.

Abstract: A system and a computer-implemented method for ranking tabular data entities by likelihood of comprising answers for (natural language) queries, based on multimodal descriptions of the tabular data entities, comprising separate representations, which represent different aspects of the tabular data entities. The ranking is based on joint representations, generated from the query representation and separate representations of the tabular data entities' aspects, using gated multimodal units. The computer-implemented method may be used for applications such as web searches, data aggregation, and research tasks.

Abstract: Replicas are selected in a large distributed network, and the roles for these replicas are identified. In one example, a leader is selected from among candidate computing clusters. To make this selection, an activity monitor predicts or monitors the workload of one or more clients. Different activities of the workload are given corresponding weights. The delay in performing requested activities, modified by these weights is found, and the candidate leader with the lowest weighted delay is selected as the leader.

Abstract: A computer-implemented method is disclosed. The method includes: obtaining document data for a first web document; identifying one or more tradeable objects based on performing a contextual scan of webpage content of the first web document; generating supplementary display data associated with the first web document, the supplementary display data including one or more user interface elements for initiating data record access actions in connection with at least one data record associated with the one or more identified tradeable objects; and graphically presenting the supplementary display data with the webpage content of the first web document.

Abstract: The present disclosure relates to systems and methods for filtering electronic activities. Exemplary implementations may include ingesting a first electronic activity; identifying an associated entity; and selecting a first filtering model based on the entity, the first filtering model trained to indicate whether to restrict further processing of ingested electronic activities.

Abstract: A method and system for intelligently organizing one or more groups of relevant files may include retrieving a user data signal including user-specific data, analyzing the user data signal to identify a parameter relating to file relevance, identifying one or more relevant files in a storage medium based on the parameter at least one of a user category property, a lifecycle stage property, a relevant activity property, or an activity level property of one or more files in the storage medium, organizing the one or more relevant file into the one or more groups of relevant files, and providing for display data relating to the one or more groups of relevant files.

Abstract: A method for generating a database, having “receiving environmental noises” (e.g. disturbing noise) and “buffered environmental noises for a migrating time window” (like 30 or 60 seconds) alternatively “deriving a set of parameters relative to the environmental noises” and of “buffering the set of parameters for the migrating time window”, he buffered environmental noises or the buffered set of parameters being generally referred to as recording, furthermore “obtaining a signal”, which identifies a signal class (like disturbing noise) of a plurality of signal classes (disturbing noise and non-disturbing noise) in the environmental noises, and “storing the buffered recordings responsive to the signal” in a memory (e.g. internal or external memory). Obtaining and storing are repeated in order to set up the database which has a plurality of buffered recordings for the same signal class.

Abstract: The present embodiments relate generally to a computer device, system and method of identifying an application type of unknown data. The method may include: determining that the unknown data corresponds to database information, the database information comprising at least one table with at least one column; for a column of a table in the database information, determining if a column identifier of the column comprises a keyword associated with a particular application type; and if the column identifier comprises the keyword, identifying data stored in the database as belonging to an application that is of the particular application type.

Abstract: A method that includes obtaining results from multiple operations (e.g., searches) for a plurality of items (e.g., documents), determining a composite score for each of the plurality of items based on those of the results obtained for the item, and displaying information related to the composite score obtained for at least a portion of the plurality of items in a graphical user interface.

Abstract: To find enriching contextual information for an abbreviated domain name, a data enrichment engine can comb through web content source code corresponding to the abbreviated domain name. From textual content in the web content source code, the data enrichment engine can identify words with initial characters that match characters of the abbreviated domain name to thereby establish a relationship there-between. This relationship can facilitate more accurate and efficient domain name classification. The data enrichment engine can query a WHOIS server to find out if candidate domains having initial characters that match the characters of the abbreviated domain name are registered to the same entity. If so, keywords can be extracted from the candidate domains and used to find more relevant domains for domain risk analysis and detection. Candidate domains determined by the data enrichment engine can be provided to a downstream computing facility such as a domain filter.

Abstract: A method may include receiving, at a search engine, an indication that a first data object was created. The search engine may fetch metadata associated with the first data object, the metadata including a description of the first data object and a binding expression including relational information between the first data object and at least one other data object. The search engine may add data from the at least one other data object to the first data object. The search engine may store the metadata and the first data object in an index of the search engine, the index associated with the first data object. The search engine may receive a search phrase. The search engine may generate a search result that includes the relational information retrieved from the index. Related systems and articles of manufacture, including computer program products, are also provided.

Abstract: A system and method of managing highly-volatile statistics of a multi-threaded application environment. The statistics are represented by one or more statistics objects. Each statistics object of the one or more statistics objects is prefixed with an object header having a version counter with an initial version count of zero. Each statistics object is associated with a statistics class instance, each statistics class instance being associated with an associative registry that is configured to allocate smallest possible objects of a size equal to or greater than to that of the statistics objects, the registry segmenting the statistics objects according to a size class. Each allocated statistics object is constructed in the object frame after the object header. Then, the object header of each allocated statistics object is initialized. Once allocated, objects can be deallocated.

Abstract: The present application discloses a method for building a ranking model, a query auto-completion method and corresponding apparatuses, which relates to the technical field of intelligent search. An implementation includes: acquiring from a POI query log a query prefix input when a user selects a POI from query completion suggestions, POIs in the query completion suggestions corresponding to the query prefix and the POI selected by the user in the query completion suggestions; constructing positive and negative example pairs using the POI selected by the user and the POIs not selected by the user in the query completion suggestions corresponding to the same query prefix; and performing a training operation using the query prefix and the positive and negative example pairs corresponding to the query prefix to obtain the ranking model.

Abstract: A data storage system according to certain aspects can share a single snapshot for multiple applications and/or agents. For example, the data storage system can receive snapshot commands from multiple applications and/or agents, and can group them for a single snapshot (e.g., based on time of receipt of the snapshot commands). Data associated with the multiple applications and/or agents may reside on a single LUN or volume. The data storage system can take a single snapshot of the LUN or volume, and generate metadata regarding which portion of the snapshot is related to which application. The single snapshot can be stored in one or more secondary storage devices. The single snapshot may be partitioned into portions relating to different applications and stored separately.

Abstract: Disclosed are embodiments for providing batch performance using a stream processor. In one embodiment, a method is disclosed comprising receiving an event that includes a plurality of fields and extracting needed fields from the plurality of fields. The method then serializes the plurality of fields and generates a new event that includes the set of needed fields and a hidden field, the value of the hidden field comprising the serialized fields. The method then transmits the new event for processing using at least one processing stage of a stream processor. In response, the method reserializes a processed event generated by the stream processor and outputs the reserialized event to a downstream consumer.

Abstract: The present disclosure provides a search processing method and apparatus based on clipboard data. The method includes: in response to monitoring that the first data obtained from a search box comes from a clipboard, performing an identification process on first data in the search box to obtain a plurality of second data included in the first data and a type of each second data; determining search data corresponding respectively to the plurality of second data according to the type of each second data; displaying the search data corresponding respectively to the plurality of second data and determining target search data according to operations of a user on the search data corresponding respectively to the plurality of second data; and obtaining a search result according to the target search data.

Abstract: Methods, systems, and computer program products are provided that construct and execute multi-step query plans in a database application. A database application accepts a query such as, for example, a graph query. The database application generates a physical query plan comprising a set of execution steps that perform the query. The set of execution steps comprises at least an initial step, an intermediate step and a final step. The database executes the query by passing control to the initial step that, when complete, passes execution control to some other step. The intermediate step executes and when complete, may pass execution control to any other step including itself. Steps may be configured to communicate arbitrary data between steps. The generated query plan may also comprise multiple multi-step sequences, and such sequences may be configured to execute in the alternative based on intermediate query results, or a parameter included in the query.

Abstract: A computer-implemented method according to one embodiment includes receiving snapshot data for a node within a data center; determining one or more candidate labels for one or more software applications running on the node, utilizing the snapshot data; implementing a validation of the one or more candidate labels to determine one or more validated labels; and training a machine learning model, utilizing the one or more validated labels and the snapshot data.

Abstract: Disclosed herein are techniques related to automated generation of regular expressions. In some embodiments, a regular expression generator may receive input data comprising one or more character sequences. The regular expression generator may convert character sequences into a sets of regular expression codes and/or span data structures. The regular expression generator may identify a longest common subsequence shared by the sets of regular expression codes and/or spans, and may generate a regular expression based upon the longest common subsequence.

Abstract: Systems and methods for reducing overcollection of unstructured data are disclosed. In an embodiment, a computer system may access an image uploaded by a user through a user interface for a function provided by a service provider. The computer system may identify items of information that are contained in the image. The computer system may determine necessary items of information in the image based on the function. The computer system may mask unnecessary items of information in the image. The computer system may present a masked image to the user through the user interface, where the masked image removes the unnecessary items of information contained in the image and shows the necessary items of information to perform the function.