Hewlett Packard Enterprise Development LP

Hewlett-packard Development Company, L.p.

Entit Software LLC

Hernan Laffitte

Vinay K Deolalikar

Jun Li

Choudur K Lakshminarayan

Krishnamurthy Viswanathan

Eric Wu

Fei Chen

Donald E Bollinger

Maria Gonzalez

Examples relate to deploying distributed applications using virtual nodes. In some examples, virtual nodes are created and are each assigned a core subset of a number of processing cores, an Internet protocol (IP) address, and an in-memory file system configured to provide access to a portion of physically shared memory. At this stage, a distributed application that is configured to be deployed to a plurality of machine nodes is deployed to the plurality of virtual nodes. On a first virtual node, a reference to a first dataset stored in physically shared memory is sent to a second virtual node, where the physically shared memory is accessible to each of the plurality of virtual nodes. Next, on the second virtual node, the first dataset is accessed through the in-memory file system of the first virtual node.

Virtual node deployments of cluster-based applications modified to exchange reference to file systems

In one implementation, a poster engine may maintain a thread history associated with a response poster, a status engine may maintain a potential thread status of a thread of a forum based on the thread history, and a pool engine may maintain an inspection pool based on the potential thread status. In another implementation, a thread status of a thread of the forum may be maintained based on a correlation rating of a response poster and a pool having a number of threads based on the thread status may be provided.

Forum inspection based on correlation rating of response poster

A technique to generate a feature set. A plurality of samples from a data set can be clustered. Features can be selected based on the clusters. The features can be added to the feature set. Additional samples can be clustered and features selected and added to the feature set until a convergence threshold is reached.

Generating a feature set

Examples herein involve graph processing using a shared memory. An example method includes distributing vertices of a graph to a plurality of graph partition processors of a system, the graph partition processors to process non-overlapping sets of vertices of the graph; storing a master copy of a vertex state of the graph in a shared memory of the system; instructing the graph partition processors to iteratively process respective vertices of the graph partitions based on local copies of the state of the graph stored in respective local memories of the graph partition processors; and updating the master copy of the state of the graph in the shared memory based on the iterative processing of the partitions of the vertices by the graph partition processors until convergence of the graph.

Graph processing using a shared memory

In a method for generating a query plan for estimating a number of unique entry counts of an attribute in a database, a sample of entries in the database is identified, at least one of a sampling percent and a coefficient of variance of the entries in the sample is identified, and a skewness of the entries in the sample is calculated. In addition, at least one of a plurality of estimators is selected based upon the skewness of the entries and at least one of the sampling percent and the coefficient of variance of the entries in the sample. Moreover, a query plan is generated from the selected at least one of the plurality of estimators. A query optimizer for performing the method is provided.

Generating a query plan for estimating a number of unique attributes in a database

A method of generating training documents for training a classifying device comprises, with a processor, sampling from a distribution of words in a number of original documents, and creating a number of pseudo-documents from the distribution of words, the pseudo-documents comprising a similar distribution of words as the original documents. A device for classifying textual documents comprises a processor; and a memory communicatively coupled to the processor, the memory comprising a sampling module to, when executed by the processor, determine the distribution of words in a number of original documents, a pseudo-document creation module to, when executed by the processor, create a number of pseudo-documents from the distribution of words, the pseudo-documents comprising a similar distribution of words as the original documents, and a training module to, when executed by the processor, train the device to classify textual documents based on the pseudo-documents.

Generating training documents

Systems and methods for clustering a plurality of feature vectors. A hierarchical clustering algorithm is performed on the plurality of feature vectors to provide a plurality of clusters and a cluster similarity measure for each cluster representing the quality of the cluster. Each cluster of the plurality of clusters with a cluster similarity measure meeting a threshold value is accepted. A clustering algorithm is performed on each cluster that fails to meet the threshold value to provide a set of subclusters each having an associated cluster similarity measure. Each subcluster having a cluster similarity measure meeting the threshold value is accepted.

Adaptive hierarchical clustering algorithm

A method of generating training documents for training a classifying device comprises, with a processor, determining a number of sub-samples in a number of original documents, and creating a number of pseudo-documents from the sub-samples, the pseudo-documents comprising a portion of the number of sub-samples. A device for training a classifying device comprises a processor, and a memory communicatively coupled to the processor. The memory comprises a sampling module to, when executed by the processor, determine a number of sub-samples in a number of original documents, a pseudo-document creation module to, when executed by the processor, create a number of pseudo-documents from the sub-samples, the pseudo-documents comprising a portion of the number of sub-samples, and a training module to, when executed by the processor, train a classifying device to classify textual documents based on the pseudo-documents.

Growing community of inventors

Mountain View, CA, United States of America

Hernan Laffitte