Mathematical analysis and experimental validation of transient over-voltage higher than 2 per unit along industrial ASDM long cables
Bibliographic record
Abstract
A mathematical technique to compute incident and reflected waves in long cable PWM drives has been developed. The mathematical formulas describing these waves are developed in the frequency domain. The inverse Laplace transform is then applied to obtain the time domain sets of equations for their computation at any point along the cable. This technique has permitted to investigate over-voltage transients and the dv/dt not only at the motor terminals, but all along the inverter-to-motor cable. As a result, the oscillation frequency, the critical cable length and the possible peak voltage could be determined. Over- voltage investigations has been done for i) inverter wide and spaced output voltage pulses ii) successive small and close pulses. Contrary to most previous papers, this work shows analytically that i) in the first case over-voltage can go up to 2 p.u ii) in the second case over-voltage can go higher than the known 2 p.u level and can reach up to 4 p.u in the worst conditions. This paper includes simulations and experiments that were carried out on an industrial 5 kVA ASD prototype using a 4-wire braided-shielded long cable. The simulation results are compared with the obtained experimental waveforms so as to validate the proposed technique.
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.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.001 | 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".