dAMP: A JXTA-BASED PEER-TO-PEER MEDIA PLAYER
Bibliographic record
Abstract
Traditional approaches for searching through websites for media files to download, and tracing broken links is a frustrating experience and a time consuming task for end users.This experience can be improved through Peer-to-Peer (P2P) computing.The notion of P2P or cooperative computing and resource sharing has been around for quite some time, but it wasn't utilized until file sharing solutions such as Napster and Gnutella emerged at the forefront of Internet services and opened up possibilities for flexible Web-based file sharing.These file sharing solutions, however, have their own limitations.For example, they still require a lot of manual management by the user.This paper describes the design and implementation of a distributed P2P media player called dAMP that brings about novel ways of discovering, downloading, and playing media files.The dAMP media player provides location transparency by enabling users to share and play media files as though the files are local.
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.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.003 | 0.005 |
| Open science | 0.004 | 0.003 |
| Research integrity | 0.001 | 0.003 |
| Insufficient payload (model declined to judge) | 0.016 | 0.006 |
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".