Mathematical analysis of agent swarm behavior in an agent-based electronic health record system
Bibliographic record
Abstract
System behavior, in a multi-agent system, can be difficult to predict and often, unexpected system behaviors will occur which lead to poor system performance. These unexpected system behaviors result from unforeseen group actions of agent groups, and agent-group behavior that is not directly coded by the agent designers. This paper presents a mathematical model to analyze agent swarm behavior in an agent-based system. Our mathematical model is composed of a set of differential equations, which will be the main focus of our study into agent dynamics and complex systems. We demonstrate our mathematical model by applying it to an agent-based health record system (ABHRS). The ABHRS is an electronic health record system which is enhanced using mobile agent technology. The main idea of the ABHRS is to allow patient health records to autonomously move through a computer network uniting scattered and distributed data into one consistent and complete data set or patient health record. ABHRS is an example of multi-agent swarm system, which composed of many simple agents and a system that is able to self-organized. A prototype ABHRS was developed in this work using TEEMA (TRLabs execution environment for mobile agents) platforms and experimental results using this prototype are presented. Our experimental results suggest that the ABHRS will in fact have predictable attributes such as growing clusters of mobile agents at Doctor, Pharmacy and Lab sites. In addition, our numerical (experimental) results closely match those of our theoretical model for the system
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.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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".