A framework for finding and accessing mobile web services
Bibliographic record
Abstract
Mobile devices have become an integral part of everyone's daily life. The ability to install new applications has allowed users to fully customize their devices to their needs and preferences. However, there is the problem of developing a different client program for different devices due to the software and hardware differences of each device. Not only would this incur higher software development costs, but it is also inconvenient for the user to find the appropriate version for their device. The use of Web services may solve this problem as they are platform-independent, 'but the exchanging of XML messages involved with Web services uses large amounts of data and requires a powerful processor. Mobile devices are currently not suitable for processing such data and the exchange of such large amounts of data over the cellular network may incur heavy data charges. To solve this problem, we will introduce a framework for mobile devices to find and access Web services through their mobile browser. A registry allows users to search for services while a gateway is used to invoke the Web services and process the XML requests and responses. Therefore, the amount of processing is kept to a minimum on the mobile device. A proof of concept prototype implementation with the ability to register, search, and access Web services was constructed and tested to evaluate the effectiveness of the proposed framework. The results from these tests clearly demonstrate the benefits of using a gateway as an intermediary between the Web service and the mobile device as well as the effectiveness ofthe overall framework.
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.006 | 0.006 |
| Meta-epidemiology (narrow) | 0.002 | 0.002 |
| Meta-epidemiology (broad) | 0.002 | 0.003 |
| Bibliometrics | 0.004 | 0.002 |
| Science and technology studies | 0.003 | 0.003 |
| Scholarly communication | 0.008 | 0.009 |
| Open science | 0.007 | 0.006 |
| Research integrity | 0.005 | 0.005 |
| Insufficient payload (model declined to judge) | 0.005 | 0.004 |
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".