Modeling distributed asynchronous processes using events and calculus of communicating systems.
Bibliographic record
Abstract
Remote object invocation is one of the distributed communication approaches, which usually deals with the synchronous communication. However, this type of communication approach does not fully capture the decoupled communication behavior. As the need for decoupled communication between objects in distributed applications becomes critical, the request of asynchronous process notification is highly on demand. This thesis addresses the design of a distributed model for asynchronous communicating processes. This model is using the CORBA event services to enable decoupling of processes. It also supports event registration and notification features. Processes receive only the up-to-date notification in which they are interested. Our design allows an arbitrary number of producers and consumers to be specified in the system. The relationship between producer processes and consumer processes are defined by our prototype using embedded specification formalism. The semantics of the specification is based on Milner's Calculus of Communicating Systems. Using our prototype, software designers do not need to know the implementation details of the system under development. Future directions of research are discussed highlighting the potential benefits of modeling distributed asynchronous processes using events and calculus of communicating systems. Paper copy at Leddy Library: Theses & Major Papers - Basement, West Bldg. / Call Number: Thesis2000 .C341. Source: Masters Abstracts International, Volume: 40-03, page: 0720. Adviser: Indra Tjandra. Thesis (M.Sc.)--University of Windsor (Canada), 2000.
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.003 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.002 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.003 |
| Scholarly communication | 0.004 | 0.004 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
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".