SpiderNet: A multi-server code service model design for computational grid support.
Bibliographic record
Abstract
One goal of a Computational Grid is to aggregate ensembles of shared, heterogeneous, and distributed resources to provide computational "power" [Foster00]. The increasing use of Web technology Internet and Intranet is making the Web an attractive framework for solving distributed applications, in particular, because the interface can be made platform independent. Several systems have been developed that make distributed computing available. However, these systems are either not web-based or not taking the enterprise Java technology [Chen97]. Typically, those systems are unnecessarily complicated and require long development. This thesis is an approach to research and development on distributed, multi-server code service system model---SpiderNet. While a service-based architecture for distributed computer systems is not new, a theory and practice approach on using EJB in multi-server environment is presented in this thesis report. It adapts enterprise Java and web application server technology trying to solve the fundamental problem of multi-server model: work balance for efficiency and fail over for availability. This thesis also demonstrates that with using Web and enterprise Java development toolkit, it is possible to build applications using a graphical "drag-and-drop" and web-based interface, thereby speeding up the application development. Source: Masters Abstracts International, Volume: 40-06, page: 1560. Adviser: Robert D. Kent. Thesis (M.Sc.)--University of Windsor (Canada), 2001.
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 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.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.002 | 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".