923 resultados para ROTATION SET


Relevância:

20.00% 20.00%

Publicador:

Resumo:

The number, the angles of orientation and the stability in Rumyantsev Movchan's sense of oblique steady rotations of a symmetric heavy gyroscope with a cavity completely filled with a uniform viscous liquid, possessing a fixed point 0 on its symmetric axis. are given for various values of the parameters. By taking the square of the upright component of the angular momentum M2 as a control parameter, three types of bifurcation diagrams of the steady rotations, two types of jumps and two kinds of local catastrophes, one being the symmetric reduced cusp type and the other being of the symmetric reduced butterfly type, are obtained. By taking account of the M2-damping owing to the moment of unavoidable faint friction, two different modes for the gyroscope, initially in a stable quasi-steady upright rotation with a nutation angle theta(s) equal to zero, to topple over are found.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A variational method is developed to find approximate solutions to the generalized Grad-Shafranov equations for an adiabatic compression of the plasma with toroidal rotation, via the expansion in Fourier series in poloidal angle of the flux surface coordinates. The numerical results, which are carried out by the present method and by the usual two-dimensional method for a static equilibrium state, agree well.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A variational method is developed for adiabatic compression of plasma with both poloidal and toroidal rotation.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Decision Trees need train samples in the train data set to get classification rules. If the number of train data was too small, the important information might be missed and thus the model could not explain the classification rules of data. While it is not affirmative that large scale of train data set can get well model. This Paper analysis the relationship between decision trees and the train data scale. We use nine decision tree algorithms to experiment the accuracy, complexity and robustness of decision tree algorithms. Some results are demonstrated.