Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
Bibliographic record
Abstract
Welcome to ACM MobiHoc 2010, the 11th ACM International Symposium on Mobile Ad Hoc Networking and Computing! ACM MobiHoc is the premier international symposium dedicated to addressing challenges emerging from wireless ad hoc networking and computing. The mission of the symposium is to bring together researchers and practitioners from a broad spectrum of wireless networking research to present the most up-to-date results and achievements in the field. As in previous years, the paper selection process was highly competitive. The call for papers attracted 157 submissions from Asia, Canada, Europe, and the United States. All papers were reviewed through a double blind review process. Each paper was reviewed by at least three program committee members not connected with the authors; most papers received four reviews and for some papers even five reviews were written. After the online-discussion phase, the top 57 papers were selected to be discussed in detail at the TPC meeting. The TPC meeting took place at Microsoft Research in Redmond on May 27 and 28, 2010 and 26 papers were selected for inclusion in the technical program. The technical program covers a variety of topics, including mobility, modeling and analysis, routing and forwarding, scheduling, security, sensor networking, and spectrum allocation. Wehope that these proceedings will serve as a valuable reference for mobile networking researchers and practitioners. We hope that you will find this program interesting and thought-provoking and that the symposium will provide you with a valuable opportunity to share ideas with other researchers and practitioners from institutions around the world.
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.004 | 0.009 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.006 | 0.006 |
| Open science | 0.002 | 0.003 |
| Research integrity | 0.002 | 0.005 |
| Insufficient payload (model declined to judge) | 0.128 | 0.099 |
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".