18 resultados para Lagrangian submanifolds


Relevância:

10.00% 10.00%

Publicador:

Resumo:

Drilling of Ti6Al4V is investigated experimentally and numerically. A 3D finite element model developed based on Lagrangian approach using commercial finite element software ABAQUS/explicit. 3D complex drill geometry is included in the model. The drilling process simulations are performed at the combinations of three cutting speed and four feed rates. The effects of cutting parameters on the induced thrust force and torque are predicted by the developed model. For validation purpose, experimental trials have been performed in similar condition to the simulations. The forces and torques measured during experiment are compared to the results of the finite element analysis. The agreement of the experimental results for force and torque values with the FE results is very good. Moreover, surface roughness of the holes was measured for mapping of machining. Copyright © 2013 Inderscience Enterprises Ltd.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Aims: We aim to calculate the kinetic, magnetic, thermal, and total energy densities and the flux of energy in axisymmetric sausage modes. The resulting equations should contain as few parameters as possible to facilitate applicability for different observations. 

Methods: The background equilibrium is a one-dimensional cylindrical flux tube model with a piecewise constant radial density profile. This enables us to use linearised magnetohydrodynamic equations to calculate the energy densities and the flux of energy for axisymmetric sausage modes. 

Results: The equations used to calculate the energy densities and the flux of energy in axisymmetric sausage modes depend on the radius of the flux tube, the equilibrium sound and Alfvén speeds, the density of the plasma, the period and phase speed of the wave, and the radial or longitudinal components of the Lagrangian displacement at the flux tube boundary. Approximate relations for limiting cases of propagating slow and fast sausage modes are also obtained. We also obtained the dispersive first-order correction term to the phase speed for both the fundamental slow body mode under coronal conditions and the slow surface mode under photospheric conditions.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

This paper proposes an efficient learning mechanism to build fuzzy rule-based systems through the construction of sparse least-squares support vector machines (LS-SVMs). In addition to the significantly reduced computational complexity in model training, the resultant LS-SVM-based fuzzy system is sparser while offers satisfactory generalization capability over unseen data. It is well known that the LS-SVMs have their computational advantage over conventional SVMs in the model training process; however, the model sparseness is lost, which is the main drawback of LS-SVMs. This is an open problem for the LS-SVMs. To tackle the nonsparseness issue, a new regression alternative to the Lagrangian solution for the LS-SVM is first presented. A novel efficient learning mechanism is then proposed in this paper to extract a sparse set of support vectors for generating fuzzy IF-THEN rules. This novel mechanism works in a stepwise subset selection manner, including a forward expansion phase and a backward exclusion phase in each selection step. The implementation of the algorithm is computationally very efficient due to the introduction of a few key techniques to avoid the matrix inverse operations to accelerate the training process. The computational efficiency is also confirmed by detailed computational complexity analysis. As a result, the proposed approach is not only able to achieve the sparseness of the resultant LS-SVM-based fuzzy systems but significantly reduces the amount of computational effort in model training as well. Three experimental examples are presented to demonstrate the effectiveness and efficiency of the proposed learning mechanism and the sparseness of the obtained LS-SVM-based fuzzy systems, in comparison with other SVM-based learning techniques.