When faced with a new design problem, Engineers most often tend to rely on their accumulated knowledge of science, mathematics, and appropriate experience to reach suitable solutions. Case-Based Reasoning is a new engineering paradigm that reflects this fact by suggesting solutions to novel problems based on the recall and reuse of specific experiences. Such a paradigm relies on previous successful design solutions that are stored in the form of separate cases in a database. / The aim of this thesis is to develop a process that will provide examples which can be used to set up a database of optimized designs for various electromagnetic devices such as loudspeakers and actuators. Each stored design will represent an optimum solution to a specific set of requirements for an electromagnetic device. These designs will eventually be used by a case-based reasoning system to reach a solution for possible requested future designs. The process will also involve developing a parameterization of a particular class of devices as well as testing optimization processes to be applied to the initial designs in order to ensure that the solutions stored in the case database represent effective and realistic devices which satisfy the requirements. This thesis also presents test results that illustrate how each optimized design conforms to certain requirements set as an input objective.
| Identifer | oai:union.ndltd.org:LACETR/oai:collectionscanada.gc.ca:QMM.99766 |
| Date | January 2006 |
| Creators | Hammoud, Samer. |
| Publisher | McGill University |
| Source Sets | Library and Archives Canada ETDs Repository / Centre d'archives des thèses électroniques de Bibliothèque et Archives Canada |
| Language | English |
| Detected Language | English |
| Type | Electronic Thesis or Dissertation |
| Format | application/pdf |
| Coverage | Master of Engineering (Department of Electrical and Computer Engineering.) |
| Rights | © Samer Hammoud, 2006 |
| Relation | alephsysno: 002614362, proquestno: AAIMR32594, Theses scanned by UMI/ProQuest. |
Page generated in 0.0019 seconds