A method of optimal design for minimization of force ripple in linear brushless permanent magnet motor
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Gweon, Dae-Gab | ko |
| dc.contributor.author | Chung, MJ | ko |
| dc.contributor.author | Lee, MG | ko |
| dc.contributor.author | Lee, .Q. | ko |
| dc.contributor.author | Kim, .M. | ko |
| dc.date.accessioned | 2011-06-30T07:26:14Z | - |
| dc.date.available | 2011-06-30T07:26:14Z | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.created | 2012-02-06 | - |
| dc.date.issued | 2000-10 | - |
| dc.identifier.citation | IEEE/IAS, pp.36 - 39 | - |
| dc.identifier.uri | http://hdl.handle.net/10203/24309 | - |
| dc.description.sponsorship | The work described in this paper was carried out at the Korea Advanced Institute of Science and Technology with the financial support of the Korea Research Foundation made in the program year of 1998 of the South Korea. | en |
| dc.language | English | - |
| dc.language.iso | en_US | en |
| dc.publisher | IEEE | - |
| dc.title | A method of optimal design for minimization of force ripple in linear brushless permanent magnet motor | - |
| dc.type | Conference | - |
| dc.identifier.wosid | 000166107300010 | - |
| dc.type.rims | CONF | - |
| dc.citation.beginningpage | 36 | - |
| dc.citation.endingpage | 39 | - |
| dc.citation.publicationname | IEEE/IAS | - |
| dc.identifier.conferencecountry | IT | - |
| dc.identifier.conferencelocation | Rome | - |
| dc.embargo.liftdate | 9999-12-31 | - |
| dc.embargo.terms | 9999-12-31 | - |
| dc.contributor.localauthor | Gweon, Dae-Gab | - |
| dc.contributor.nonIdAuthor | Chung, MJ | - |
| dc.contributor.nonIdAuthor | Lee, MG | - |
| dc.contributor.nonIdAuthor | Lee, .Q. | - |
| dc.contributor.nonIdAuthor | Kim, .M. | - |
- Appears in Collection
- ME-Conference Papers(학술회의논문)
- Files in This Item
This item is cited by other documents in WoS
| ⊙ Detail Information in WoSⓡ | Click to see |  |
| ⊙ Cited 1 items in WoS | Click to see citing articles in |  |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.