Bibliographic record
Abstract
This volume contains the Proceedings of the Fourth Workshop on Coalgebraic Methods in Computer Science (CMCS 2001). The Workshop was held in Genova, Italy on April 6 and 7, 2001, as a satellite event of ETAPS 2001. The aim of the CMCS workshop series is to bring together researchers with a common interest in theory of coalgebras and its applications. Previous workshops have been organized in Lisbon (1998), Amsterdam (1999) and Berlin (2000). The proceedings appeared as ENTCS Vols. 11,19 and 33. During the last few years it is becoming increasingly clear that a great variety of state-based dynamical systems, like transition systems, automata, process calculi and class-based systems can be captured uniformly as coalgebras. The first three volumes together with the current volume demonstrate that theory of coalgebras and its applications are developing into a field of its own interest presenting a deep mathematical foundation, a growing field of applications and interactions with various other fields, such as reactive and interactive system theory, object oriented and concurrent programming, formal system specification, modal logic, dynamical systems, control systems, category theory, algebra, analysis, etc. The Program Committee of CMCS 2001 consisted of Alexandru Baltag ( Department of Software Technology, CWI ) Andrea Corradini ( Department of Computer Science, University of Pisa ) Bart Jacobs ( Department of Computer Science, University of Nijmegen ) Marina Lenisa ( Department of Mathematics and Computer Science, University of Udine ) Ugo Montanari ( Department of Computer Science, University of Pisa ) Larry Moss ( Department of Mathematics, Indiana University, Bloomington ) Ataru T. Nakagawa ( Software Research Associates, Tokyo ) Dusko Pavlovic ( Kestrel Institute, Palo Alto ) John Power ( Laboratory for Foundations of Computer Science, University of Edinburgh ) Horst Reichel ( Institute of Theoretical Computer Science, Dresden University of Technology ) Jan Rutten ( Department of Software Technology, CWI ) The Invited Speakers of CMCS 2001 were Robin Cockett (University of Calgary) and Gordon Plotkin (University of Edinburgh). The papers in this volume were reviewed by the program committee members and by Falk Bartels, Anna Bucalo, Corina Cirstea, Pietro Di Gianantonio, Marcelo Fiore, Jesse Hughes, Alexander Kurz, Anna Labella, Lambert Meertens, Marino Miculan, Marco Pistore, Grigore Rosu, Doug Smith. This volume will be published in the series Electronic Notes in Theoretical Computer Science (ENTCS). This series is published electronically through the facilities of Elsevier Science B.V. and its auspices. The volumes in the ENTCS series can be accessed at the URL http://www.elsevier.nl/locate/entcs A printed version of the current volume is distributed to the participants at the workshop in Genova. We are very grateful to the following persons, whose help has been crucial for the success of CMCS 2001: Maura Cerioli and Gianna Reggio for their help with the organization of the Workshop as satellite event of ETAPS 2001; and Mike Mislove, Managing Editor of the ENTCS series, for his assistance with the use of the ENTCS style files. Thanks are also due to the Department of Computer Science of the University of Pisa, which has covered the printing cost of the copies distributed in Genova. Andrea Corradini, Marina Lenisa, Ugo Montanari March 13, 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.001 | 0.007 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.003 | 0.003 |
| Science and technology studies | 0.002 | 0.001 |
| Scholarly communication | 0.006 | 0.005 |
| Open science | 0.002 | 0.003 |
| Research integrity | 0.002 | 0.003 |
| Insufficient payload (model declined to judge) | 0.615 | 0.446 |
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".