2 resultados para Typesetting machines.

em Biblioteca Digital da Produção Intelectual da Universidade de São Paulo


Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper presents a method for electromagnetic torque ripple and copper losses reduction in (non-sinusoidal or trapezoidal) surface-mount permanent magnet synchronous machines (SM-PMSM). The method is based on an extension of classical dq transformation that makes it possible to write a vectorial model for this kind of machine (with a non-sinusoidal back-EMF waveform). This model is obtained by the application of that transformation in the classical machine per-phase model. That transformation can be applied to machines that have any type of back-EMF waveform, and not only trapezoidal or square-wave back-EMF waveforms. Implementation results are shown for an electrical converter, using the proposed vectorial model, feeding a non-sinusoidal synchronous machine (brushless DC motor). They show that the use of this vectorial mode is a way to achieve improvements in the performance of this kind of machine, considering the electromagnetic torque ripple and copper losses, if compared to a drive system that employs a classical six-step mode as a converter. Copyright (C) 2011 John Wiley & Sons, Ltd.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Support Vector Machines (SVMs) have achieved very good performance on different learning problems. However, the success of SVMs depends on the adequate choice of the values of a number of parameters (e.g., the kernel and regularization parameters). In the current work, we propose the combination of meta-learning and search algorithms to deal with the problem of SVM parameter selection. In this combination, given a new problem to be solved, meta-learning is employed to recommend SVM parameter values based on parameter configurations that have been successfully adopted in previous similar problems. The parameter values returned by meta-learning are then used as initial search points by a search technique, which will further explore the parameter space. In this proposal, we envisioned that the initial solutions provided by meta-learning are located in good regions of the search space (i.e. they are closer to optimum solutions). Hence, the search algorithm would need to evaluate a lower number of candidate solutions when looking for an adequate solution. In this work, we investigate the combination of meta-learning with two search algorithms: Particle Swarm Optimization and Tabu Search. The implemented hybrid algorithms were used to select the values of two SVM parameters in the regression domain. These combinations were compared with the use of the search algorithms without meta-learning. The experimental results on a set of 40 regression problems showed that, on average, the proposed hybrid methods obtained lower error rates when compared to their components applied in isolation.