Bibliographic record
Abstract
Web services are software modules that expose their functionality over the Internet via well-defined interfaces. Although Web services are promising technologies in that they facilitate application-to-application communication over the Internet, they still rely on traditional distributed computing communication models such as the remote procedure call, in which a Web service requestor needs to have complete knowledge of a Web service provider interface. If a Web service requestor did not use the latest version of a Web service provider interface to generate a proxy service, then static binding to the Web service provider's services fails. In this paper, we provide functional requirements for a Service-Oriented Monitoring Registry (SOMR) that provides notification to service requestors when a version of an interface changes or a service becomes disabled. In order to present a more complete picture of SOMR we include four architectural views covering (i) the over-all system, (ii) its four tiers and their interconnection, (iii) details of the service tier and (iv) its deployment onto executable environments. SOMR provides public Web service registries that can be used by Web service providers, developers, and consumers to register their profiles so that whenever any change happens to Web service interfaces they are notified about these changes and can respond accordingly. In contrast with current static solutions, the proposed system provide a significant step toward achieving solutions that are consistent with the dynamic nature and evolution of Web services.
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.008 | 0.008 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.002 | 0.001 |
| Scholarly communication | 0.005 | 0.006 |
| Open science | 0.003 | 0.003 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.006 | 0.005 |
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".