Abstract: A social message monitoring method is implemented by receiving, from a social network server, a social message, and obtaining a theme probability vector of the social message, comparing the theme probability vector of the social message with a theme probability vector of each representative message to obtain a theme similarity, and acquiring a similarity between the social message and each representative message according to the theme similarity, and saving the social message in a message class that contains a representative message most similar to the social message, and outputting the message class to a social network client when a quantity of social messages in the message class reaches a first threshold or themes of social messages in the message class are consistent.

Abstract: A social message monitoring method is implemented by receiving, from a social network server, a social message, and obtaining a theme probability vector of the social message, comparing the theme probability vector of the social message with a theme probability vector of each representative message to obtain a theme similarity, and acquiring a similarity between the social message and each representative message according to the theme similarity, and saving the social message in a message class that contains a representative message most similar to the social message, and outputting the message class to a social network client when a quantity of social messages in the message class reaches a first threshold or themes of social messages in the message class are consistent.

Abstract: A computer-implemented method for performing simulation includes establishing a mesh of a physical domain with nodes. The nodes represent a discretized physical quantity. The method accesses one or more different algorithms for evolving the nodes through sequential time steps. The method determines a unique combination of parameter values for each algorithm. In some examples, the parameter values can control dissipation, dispersion, and overshoot for each algorithm, as well as whether each algorithm is implicit or explicit. In some examples, the method can select one or more subsets of the nodes, and/or identify one or more time increments. The method can evolve the nodes in time, optionally using different time increments for different nodes in the mesh, and/or optionally using different algorithms for different nodes in the mesh. The method can optionally identify if an algorithm has failed to converge to a solution, and can switch to a different algorithm.

Abstract: The present invention is a spring hinge for generating torque. The spring hinge includes a shaft and a single helical element. The shaft has a surface with an outer diameter and is capable of rotation. The single helical element is wrapped about the shaft. The helical element includes a first end and a second end. The helical element produces a variable torque between the first and second ends.