E-business information fuzzy retrieval system based on block chain anti-attack algorithm
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
The current e-business information retrieval system ignores the threat of distributed denial of service attack from computer network, which results in low retrieval recall, accuracy, and efficiency. For this problem, a design method of fuzzy retrieval system for e-business information based on block chain technology is proposed in this paper. A fuzzy retrieval system of e-business information is designed, which includes three layers of client, application server and data server. The construction rules of the rule library used by the system are researched. The keyword expansion method of association word list, compound word list and synonymous word list is given. The dynamic knowledge base of the system is built and updated in real-time. Security control of e-business information documents in the system is implemented by using anti-attack performance of block chain technology. Experimental results show that the proposed method improves the recall, accuracy and average accuracy of the system and the retrieval efficiency is high.
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.002 | 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.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.002 |
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