Improved Multi-Order Distributed HOSVD with Its Incremental Computing for Smart City Services
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
Smart city, a focus of many researchers from academia and industry, is a successful example of Cyber-Physical-Social Systems (CPSS). Based on the rapid and efficient processing of large-scale data, Smart city, an example of CPSS, has revolutionized the service provision model by providing proactive services for humans. However, to operationalize the services provided in smart cities, a comprehensive analysis of heterogeneous and large-scale big data is required. Further, to speed up data processing and improve the adaptability and extensibility of big data, CPSS big data processing should be realized in the form of blocks and avoid redundant computing on historical data. In this paper, as an extension of multi-order distributed and incremental High-Order Singular Value Decomposition (HOSVD) computing, Ring-based Tree algorithm and Tree-based Tree algorithm are proposed for the problems of increasing scale of processable data and computational efficiency. The experimental and simulation results demonstrate that the proposed algorithms have high performance in terms of error, improvement factor, and improvement factor ratio. At last, to demonstrate the performance of our improved algorithms, a case study about CPSS big data processing is provided.
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.001 |
| Science and technology studies | 0.002 | 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