Optimizing the performance of electrostatic comb-drive actuators using neural networks
Bibliographic record
Abstract
This paper investigates the application of two different meshing techniques used by the finite element method to analyze Micro-Electro-Mechanical Systems (MEMS) or structures. In this work, particular interest is focused on the application of these two techniques to comb-drive actuators, where a parametric study is carried out to optimize the design parameters of a lateral Electrostatic comb-drive actuator. In this case, the thickness, gab size, applied driving voltage and the number of Comb fingers are varied. The two meshing techniques applied are commonly known as, the Exposed Face Meshing method (EFM), and the Volume Refining Meshing (VRM) method. On one hand, the EFM algorithm permits the independent refinement of the electrostatic and the mechanical meshes while keeping full compatibility between the two meshed domains. On the other hand, the VRM method requires both, the electrostatic and the mechanical meshes, to be refined together at the same time; which result in a large problem size for complex structures with high aspect ratio. While the VRM method requires meshing of air gaps between the conductors, the EFM method uses the boundary element technique to map and calculate the electrostatic forces on the surfaces of the structure conductors, which eliminates the need to mesh the air gaps between the conductors, which is proved to be more efficient. In the current work, a calibration tool that can be used to enhance the efficiency of FE results produced by the VRM technique is developed. In this process, the results obtained from both meshing techniques of the para-metrically studied comb-drive are used to train a Feedforward Backpropagation Neural Network. This network is constructed using the FE results obtained from the (EFM) as the training target or output. The result obtained from the (VRM) technique is then fed as input to the network, which can then be calibrated using the EFM results.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".