Proceedings of the 2009 conference on Symbolic numeric computation
Bibliographic record
Abstract
The aim of SNC 2009 is to offer a forum for researchers in symbolic and numeric computation to present their work, interact, exchange ideas and identify important problems in this research area. SNC 2009 continues a successful tradition of previous highly successful workshops in the area of symbolic and numeric computation: SNAP 96, held July 15-17, 1996 in Sophia Antipolis, France SNC 2005, held July 19-21, 2005 in Xi'an, China SNC 2007, held July 25-27, 2007 in London Ontario, Canada A warm thank you goes to all those that worked hard to make SNC 2009 happen and in particular the local organizers, the program committee members, the anonymous referees, the invited speakers and the participants. The SNC 2009 Call For Papers solicited submissions in several topics: Hybrid symbolic-numeric algorithms Approximate polynomial GCD and factorization Symbolic-numeric methods for solving polynomial systems Resultants and structured matrices for symbolic-numeric computation Differential equations for symbolic-numeric computation Symbolic-numeric methods for geometric computation Symbolic-numeric algorithms in algebraic geometry Symbolic-numeric algorithms for nonlinear optimization Numeric computation of characteristic sets and Groebner bases Implementation of symbolic-numeric algorithms Approximate algebraic algorithms Applications of symbolic-numeric computation SNC 2009 is sponsored by the University of Tsukuba (http://www.tsukuba.ac.jp/english/). SNC 2009 is in cooperation with ACM SIGSAM (http://www.sigsam.org/) and we wish to thank the Chair of SIGSAM, Dr. Mark Giesbrecht, for his continuous help and support. SNC 2009 is also in cooperation with JSSAC, the Japan Society for Symbolic and Algebraic Computation (http://www.jssac.org/). We hope that the current book of proceedings of SNC 2009 will become a useful resource for researchers in Symbolic-Numeric Computation and other related research areas. We also hope that it will become another testament of the liveliness and vibrancy of this research area and a precursor of the future developments that await us ahead.
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.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| 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".