Zero-crossing analysis of Lévy walks for real-time feature extraction: Composite signal analysis for strengthening the IoT against DDoS attacks
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
This paper compares the probability similarities between a cyberattack, the distributed denial-of-service, and the mathematical model of probability, Lévy walks. This comparison aims to explore the validity of Lévy walks as a model resembling the DDoS probability features. This research also 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. The changing world of security systems is deeply considered, in an approach for its improvement. This as our society is highly dependent on electronically interconnected systems-of-systems demanding operational robustness and security. The approach proposed for providing a higher degree of security aiming to the development of cognitive security systems.
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.001 |
| 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