Bibliographic record
Abstract
Among the severe security threats faced in distributed mobile computing environments, two are particularly troublesome: harmful agent and harmful host. This chapter consider security problems of both types: harmful agent and harmful host, and concentrates on two security problems, one for each type: locating a black hole and capturing an intruder. For each, the computational issues, the algorithmic techniques and solutions are discussed. The chapter discusses the black-hole search problem; the network decontamination and intruder capture problems. The main difference in the setting described in this chapter is that the agents, which are pieces of software, cannot be removed from the network; they can only move from a node to a neighboring one. These topics and techniques have a much wider theoretical scope and range. In particular, the problems themselves are related to long-investigated and well-established problems in automata theory, computational complexity, and graph theory. Controlled Vocabulary Terms communication networks; computer network security; mobile computing; wireless networks
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.012 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.002 | 0.002 |
| Scholarly communication | 0.004 | 0.006 |
| Open science | 0.003 | 0.005 |
| Research integrity | 0.003 | 0.004 |
| Insufficient payload (model declined to judge) | 0.011 | 0.003 |
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".