Optimal data allocation method considering privacy enhancement using E-CARGO
Bibliographic record
Abstract
With the rise in popularity of cloud computing, there is a growing trend toward the storage of data in a cloud environment. However, there is a significant increase in the risk of privacy information leakage, and users could face serious challenges as a result of data leakage. In this paper, we propose an allocation scheme for the storage of data in a collaborative edge-cloud environment, with a focus on enhanced data privacy. In addition, we explore an extended application of the approach to sourcing. Specifically, we first evaluate the datasets and servers. We then introduce several constraints and use the Environments-Classes, Agents, Roles, Groups, and Objects (E-CARGO) model to formalize the problem. Based on the qualification value, we can find the optimal allocation using the IBM ILOG CPLEX Optimization (CPLEX) Package. At a given scale, the allocation scheme scores based on our method improve by about 50% compared to the baseline method and the trust-based method. Moreover, we use a similar approach to analyze procurement issues in the supply chain to help companies reduce the carbon emissions. This shows that our proposed solution can store data in servers that better suit their requirements and is adaptable to other problems.
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.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.004 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.006 | 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".