Proceedings of the 2013 workshop on Programming based on actors, agents, and decentralized control
Notice bibliographique
Résumé
AGERE! 2013 was the third iteration of AGERE! held alongside SPLASH. workshop -- which focuses on concerns of modelling, design and programming of systems, where decentralized control is an underlying assumption -- has emerged as a venue that brings together approaches from a family of paradigms variously referred to as Actors, active objects, agents, etc. Actors and more broadly object-oriented concurrent programming -- which couple object-oriented programming with concurrency -- offer a clean and powerful model for computation, which is gaining in popularity with adoption in mainstream languages, frameworks and libraries. Agents and agent-oriented programming provide a further layer of abstraction on top of actors and objects, conceiving concurrent/distributed systems as organizations of autonomous task-oriented entities featuring proactive and reactive behaviors, and interacting in a shared environment. The growing interest in libraries and frameworks supporting Actors or Actor-like mechanisms for use in mainstream platforms calls for tackling of both conceptual and practical hurdles that practitioners may face in using them. For example, how do we best integrate active and passive entities or entities based on different models of concurrency? More generally, it calls for tackling all those problems which become important as soon as these approaches start aiming to become the solution of choice for modelling, designing and programming large and complex software systems. Accordingly, AGERE!'s general theme has evolved to address the question of how these models and abstractions can help improve the way we think about about problems, the way we design, implement, test and validate models and systems, and finally, inform the tools we develop to aid these processes. AGERE! 2013 hosted two invited lectures, one by Yoshiki Ohshima from VPRI and another by Ole Lehrmann Madsen. Ohshima's talk -- titled The future of personal computing system -- reporting VPRI's work as part of the the STEP project -- discussed how the complexity of system construction can be tackled by creating meta-languages which allow us to build and experiment with new domain-specific languages. With these new languages, we can describe different parts of systems in a cleaner and more intention-revealing manner. From a conceptual point of view, remain the fundamental building blocks of the approach; however, decentralization of control and asynchronous interactions - alongside synchronous ones - appear to be a part of the foundation as well. Madsen's talk -- titled SIMULA style concurrent objects -- introduced sub-pattern restrictions as a mechanism used for defining safe concurrency abstractions in a new experimental version of Beta. Besides specific mechanisms, Beta -- being the successor of Simula -- has been designed to naturally support the modelling of concurrent activities, where Simula was originally designed to model and simulate activities in the real world.
Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.
Comment cette classification a été obtenuedéplier
Prédiction machine sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Le volet Gemma est une étiquette directe du modèle pour chaque travail de la base, lue sur la notice réduite au titre. Le volet Codex est un classifieur appris des 10 348 étiquettes directes de Codex et calibré sur les taux pondérés de l'échantillon; les champs sans appui suffisant ne portent aucun appel Codex. Le mode candidate est l'union des deux volets; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont pas des étiquettes humaines.
Scores du classifieur distillé par catégorie (deux têtes)
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,005 | 0,006 |
| Méta-épidémiologie (sens strict) | 0,001 | 0,001 |
| Méta-épidémiologie (sens large) | 0,001 | 0,002 |
| Bibliométrie | 0,001 | 0,001 |
| Études des sciences et des technologies | 0,001 | 0,002 |
| Communication savante | 0,005 | 0,005 |
| Science ouverte | 0,002 | 0,003 |
| Intégrité de la recherche | 0,002 | 0,005 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,018 | 0,003 |
Scores machine (provisoires)
Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.
Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.
score_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découleClassification
machine, non validéePrédiction automatique; un appel candidat d’une seule source (Gemma direct ou Codex distillé), pas un consensus.
Le détail, modèle par modèle et score par score, se trouve en fin de page sous « Comment cette classification a été obtenue ».