Combined FEA-Matlab Optimization of Capacitive Micromachined Ultrasound Transducer Cell
Bibliographic record
Abstract
A novel approach to the design of a Capacitive Micromachined Ultrasound Transducer (CMUT) cells is presented, using a Genetic Algorithm (GA) based optimization that couples finite element simulations with parameter changes tuned through Matlab scripts. The optimization goal is a maximization of the CMUT efficiency in coupling the electrical, mechanical and acoustic energy domains. Global constraints are related to the pull-in actuation voltage, resonant frequency (set to 5–6MHz, suitable for biomedical applications) and limits on the achievable geometric dimensions. A CMUT is a relatively new MEMS device used to generate and sense ultrasound waves through electrical actuation. Our CMUT design aims to generate ultrasound waves in the 5–6 MHz range, suitable for breast tumor detection. The electro-mechano-acoustical nonlinear coupling makes the design and optimization process difficult, requiring several cycles of finite element analysis. Therefore, a genetic constrained optimization algorithm implemented in Matlab is coupled with finite element simulations of a parameterized structure modeled in COMSOL Multiphysics, in order to maximize the efficiency of the CMUT cell. The main goal is to achieve maximum transducer efficiency, reflected in a better operating device with lower power consumption. The Matlab-FEA optimization loop is driven by the transducer electro-mechanical efficiency, used as a main performance measure to vary the CMUT geometry parameters from one generation to another.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.003 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".