Proceedings of the 36th international symposium on Symbolic and algebraic computation
Notice bibliographique
Résumé
ISSAC 2011 is a continuation of a well-established series of international conferences for the presentation of the latest advances in the field of Symbolic and Algebraic Computation. The first meeting of the series (1966) was held in Washington, DC, and sponsored by the Association for Computing Machinery (ACM). Since then, the abbreviated name of the meeting has evolved from SYMSAM, SYMSAC, EUROSAM, EUROCAL to finally settle on the present name ISSAC. This 36th meeting took place in San Jose, CA, from June 8 to June 11. For the first time, ISSAC was affiliated with the Federated Computing Research Conference (FCRC). FCRC assembles a spectrum of conferences and workshops into a week-long meeting, to foster communication among researchers in different fields in computer science and engineering. The topics represented at ISSAC include, but are not limited to: Algorithmic aspects: Exact and symbolic linear, polynomial and differential algebra. Symbolicnumeric, homotopy, and series methods. Computational geometry, group theory, number theory, quantifier elimination and logic. Summation, recurrence equations, integration, ODE & PDE. Theoretical and practical aspects, including algebraic complexity, and techniques for important special cases. Software aspects: Design of packages and systems, data representation. Parallel and distributed algebraic computing, considerations for modern hardware. User interface issues, and use of computer algebra systems with other software such as systems for digital libraries, simulation and optimization, automated theorem-proving, computer-aided design, automatic differentiation, and courseware. Application aspects: Applications that stretch the current limits of symbolic and algebraic computation, use it in new ways, or apply it in situations with broad impact, in particular to the natural sciences, life sciences, engineering, economics and finance, and education. ISSAC 2011 featured invited talks, contributed papers, tutorials, poster sessions and software presentations. This volume contains all the contributed papers which were presented at the meeting as well as the abstracts of the invited talks and of the tutorials. A total of 83 papers were submitted; each was distributed to members of the program committee and external reviewers. Reviewing included a rebuttal phase for certain papers. An average of 3.5 referee reports was obtained for each submission and 44 papers were selected. They are representative of the various facets of today's research in computer algebra, ranging from purely theoretical results to software development and important applications. They also offer an illustration of the field's vitality after a history of half a century, and of its future prospects.
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,003 | 0,008 |
| Méta-épidémiologie (sens strict) | 0,002 | 0,001 |
| Méta-épidémiologie (sens large) | 0,002 | 0,002 |
| Bibliométrie | 0,002 | 0,003 |
| Études des sciences et des technologies | 0,001 | 0,002 |
| Communication savante | 0,008 | 0,005 |
| Science ouverte | 0,002 | 0,004 |
| Intégrité de la recherche | 0,002 | 0,005 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,085 | 0,037 |
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 ».