Proceedings of the 38th International Symposium on Symbolic and Algebraic Computation
Notice bibliographique
Résumé
The 2013 International Symposium on Symbolic and Algebraic Computation (ISSAC) is the premier conference for research in symbolic computation and computer algebra. ISSAC 2013, held at Northeastern University in Boston, USA, is the 38th meeting in the series, which began in 1966 with the seminal ACM Symposium on Symbolic and Algebraic Manipulation. ISSAC 2013 is fully sponsored by the Association for Computing Machinery and its Special Interest Group on Symbolic Manipulation (ACM SIGSAM). The ISSAC meeting is a showcase for original research contributions on all aspects of computer algebra and symbolic mathematical computation, including: Algorithmic aspects: Exact and symbolic linear, polynomial and differential algebra Symbolic-numeric, homotopy, perturbation and series methods Computational algebraic geometry, group theory and number theory Computer arithmetic Summation, recurrence equations, integration, solution of ODEs and PDEs Symbolic methods in other areas of pure and applied mathematics Complexity of algebraic algorithms and algebraic complexity Software aspects: Design of symbolic computation packages and systems Language design and type systems for symbolic computation Data representation Considerations for modern hardware Algorithm implementation and performance tuning Mathematical user interfaces Application aspects: Applications that stretch the current limits of computer algebra algorithms or systems, use computer algebra in new areas or new ways, or apply it in situations with broad impact. The ISSAC Program Committee adhered to the highest standards and practices in the evaluation of submitted papers, and we are very pleased with the quality of the papers appearing at the conference. All papers submitted to ISSAC were judged, and accepted or rejected, solely according to their scientific novelty and excellence. An average of more than 3.3 referee reports were obtained for each submission, and 47 papers were ultimately accepted for publication. Each submitted paper was assigned to two Program Committee members, but all members could and did actively participate in the evaluation of other papers. Strict conflict of interest rules were enforced, disallowing any access to the evaluation process of papers by institutional colleagues, recent co-authors, supervisors, students or under any other biasing circumstance. All papers for which broad agreement was not obtained were voted upon in a final and binding ballot. The Program Committee thanks all the authors of all submitted papers for considering ISSAC for their best work, and hopes that the high quality of the accepted papers validates their choice of venues and encourages submission to ISSAC in the future. ACM SIGSAM sponsors awards for Distinguished Papers and Distinguished Student Authors at every ISSAC, and these will be selected by a vote of the Program Committee. While the winners are not known at the time of this writing, the quality of the candidates ensures that these papers should have great merit and impact on our field. ISSAC features invited talks, contributed papers, tutorials, posters and software demonstrations. These Proceedings contain all accepted contributed papers, and abstracts of the invited talks and tutorials. Abstracts of posters and software demonstrations will appear in an upcoming issue of the ACM SIGSAM Communications in Computer Algebra. We are thrilled with the exceptional scientific stature of our invited presenters, and the high quality of all the contributed works, and thank everyone for their investment in ISSAC 2013.
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,004 | 0,009 |
| Méta-épidémiologie (sens strict) | 0,001 | 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,002 | 0,002 |
| Communication savante | 0,010 | 0,006 |
| 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,116 | 0,048 |
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 ».