Bibliographic record
Abstract
With the development of robot technology, service robots have gradually come into people's lives, which also makes human-computer interaction more and more frequent. However, most of the current robot control algorithms have low accuracy and difficult operation, and people can't wait to find more effective algorithms. In order to design the most convenient and accurate intelligent education service robot, this paper uses SF algorithm and improved PCNN to establish a hybrid model, and proposes an improved saliency region extraction algorithm based on education service robot. The algorithm compares the standard database with the real environment, and the PR curve of the proposed algorithm is improved by about 5%. It is 10% higher than the SF algorithm in the AUC index, and the comprehensive F value is improved by 3.4% ~ 7.4%. This paper fully demonstrates that the saliency area generated by the proposed algorithm is closer to the true value, which can effectively suppress the high-brightness background area in the detection results of the SF algorithm. It also verifies that the PCNN model with the neuron propagation stimulation mechanism as the core more effective simulation of biological vision systems. Combining compressed sensing technology, this paper proposes a speech recognition scheme that is easy to implement in hardware. The algorithm performance of the robot is verified, and the optimal effect parameters are selected through comparative experiments. The method uses Chinese phonetic phrase (sentence) test to obtain good recognition results, and it can be used as an effective improvement scheme for the speech input of the proposed robot voice interaction system.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.002 | 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".