Research on Efficient Parallel Computing Methods for Industrial Big Data Streams in Agile Low Code Development Environments
Bibliographic record
Abstract
Industrial Big Data Streams (IBDS) play a pivotal role in the digital transformation of industries, aligning with the special issue's emphasis on computational innovations to manage high-velocity, high-volume data.Traditional approaches to stream processing often fall short in addressing the challenges posed by the dynamic nature, heterogeneity, and real-time demands of IBDS environments, leading to inefficiencies in scalability, adaptability, and resource utilization.To overcome these limitations, this study introduces an Adaptive Stream Processing Framework (ASPF), which integrates distributed computing, machine learning, and dynamic resource allocation to process IBDS with low latency and high throughput.Complementing ASPF, a Dynamic Hierarchical Decision Strategy (DHDS) ensures multi-level decision-making for optimal resource distribution and real-time adaptation.The ASPF leverages predictive analytics and anomaly detection to enhance operational insights, while the DHDS employs distributed consensus and reinforcement learning to dynamically balance workloads and maintain system resilience.Simulation results demonstrate a 25% improvement in data processing efficiency and a 20% reduction in energy consumption compared to conventional methods, underscoring the 17 potential of this hybrid framework to revolutionize industrial data 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.
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.002 | 0.008 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.003 |
| Insufficient payload (model declined to judge) | 0.002 | 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".