Zero-crossing analysis of Lévy walks for real-time feature extraction
Bibliographic record
Abstract
This paper presents a method, based on the Smirnov transform, for generating synthetic data with the statistical properties of Lévy-walks. This method for synthetic data generation can be utilized for generating arbitrary prescribed probability density functions (pdf). The Smirnov transform is used to solve a cybersecurity engineering problem associated with Internet traffic. The synthetic Lévy-walk process is intertwined with sections of other distinct characteristics (uniform noise, Gaussian noise, and an ordinary sinusoid) to create a composite signal, which is then analyzed with zero-crossing rate (ZCR) within a varying-size window. This paper shows that it is possible to identify the distinct sections present in the composite signal through ZCR. The differentiation of these sections shows an increasing ZCR value as the section under analysis exhibits a higher activity or complexity (from the sinusoid, to a synthetic Lévy-walk process, and uniform and Gaussian noise, respectively). The advantages of the ZCR computation directly in the time-domain are appealing for real-time implementations. The varying window in the ZCR produces more defined values as the window size increases.
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.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.002 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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".