Towards Seamless Service Mobility for Mobile Devices Communicating Within Wireless Grids
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 proliferation of wireless infrastructures and devices is expected to enable new types of value-added applications. Example applications include support of a multi-player game where resources of different devices are shared to collaboratively play a game. Users of such applications require continuous and seamless access to resources while roaming between different access technologies. This calls for a generic wireless service management platform that adequately manages service discovery, distribution, security, billing, and mobility. This paper introduces a Service Roaming Protocol (SRP) as the mechanism to manage service mobility. SRP's main advantage over exiting mobility management algorithm is its context-awareness. The SRP algorithm uses mobile user's geographic location, terminal's capabilities, personal profile, and resources of other grid devices, to provide efficient management of mobile users and services. SRP operation relies on primitives provided by a wireless grid middleware. These primitives include service definition and efficient service distribution and mobility. The wireless grid middleware provides a platform-independent solution to overcome heterogeneity of mobile terminals and provides autonomous service management for mobile grid users. This helps transforming a wireless infrastructure from an infrastructure built for only broadband Internet access into an infrastructure that supports collaborative applications.
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.003 | 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.000 |
| Open science | 0.003 | 0.001 |
| 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