A Real-Time Synchrophasor Data Compression Method Using Singular Value Decomposition
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
The proliferation of phasor measurement units (PMUs) presents new challenges in archiving and processing large amounts of synchrophasor data which necessitates advanced data compression methods. This paper proposes a singular value decomposition (SVD)-based method for compression of synchrophasor data, including magnitude, phase-angle, and complex phasor. The proposed method includes a dimensionality evaluation and reduction technique and a real-time progressive partitioning algorithm. The proposed dimensionality reduction technique employs the measurement uncertainty of PMUs and introduces a threshold criterion on the signal-to-noise ratio (SNR) of SVD modes. Singular modes with high SNR are retained, and those dominated by measurement error are discarded to achieve a high compression ratio (CR) while preserving the critical information with adequate accuracy. The proposed progressive partitioning separates the data corresponding to normal and disturbance conditions by monitoring the dimensionality variations in real-time. The partitions containing the data of similar dimensionality are separately compressed to further improve the accuracy and CR. The performance of the proposed method is evaluated and benchmarked against state-of-the-art methods using both field and simulated PMU data. The results show that the proposed method provides high CR while accurately preserving the critical information of events and disturbances.
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.
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 it