Bibliographic record
Abstract
The program CRACK is a computer algebra package written in REDUCE for the solution of over-determined systems of algebraic, ordinary or partial differential equations with at most polynomial non-linearity. It is available as part of version 3.8 of the REDUCE system (dated April 2004) and the latest development version can be downloaded from http://lie.math.brocku.ca/crack/. The purpose of this poster is to accompany a software demonstration of CRACK at ISSAC 2005. The poster is supposed to give a graphical overview of CRACK, emphasizing features which are special to the package. Those are • a rich interface, with visualization aids for inspecting large systems, including - for each equation its properties, history and investigations that have already been done with the equation, - the occurrence of all derivatives of selected functions in any equation, - a statistical overview of the system (number of equations and functions in dependence of number of independent variables), - a matrix display of occurrences of unknown constants/functions in all equations, - a count of the total number of appearances of each unknown, - the determination of not under-determined subsystems, - a listing of all sub- and sub-sub-.. cases investigated so far, with their assumptions, number of steps and number of solutions, - graphical displays of size related measures of the computation done so far; • a discussion of possibilities to trade interactively or automatically the speed of the solution process versus safety (avoidance of expression swell): - only length-reducing versus complete Gröbner basis computation steps. - substitutions in shorter equations only, i.e. only in a sub-system versus substitutions in the complete system, - growth bounded substitutions versus general substitutions, - case splittings (induced by factorizations, substitutions with potentially vanishing coefficients or adhoc case distinctions) versus Gröbner basis steps, - an investment in the length reduction of equations to reach sparse systems with multiple benefits; • algorithmic extensions which include - the ability to collect and apply syzygies which result as a by-product in the process of computing a differential Gröbner basis to integrate linear PDEs. - the treatment of inequalities: their usage, active collection and derivation, and their constant update in an ongoing reduction process based on newly derived equations. - the capability added by Winfried Neun (ZIB Berlin) to run in a truly parallel mode on a beowulf cluster, recently also ported to 64bit AMD processors. - post-computation procedures, especially the possibility to merge solutions of parametric linear algebraic systems and to automate the production of web-pages for solutions that are found. - the ability to separate expressions with respect to independent variables which occur polynomially but with variable exponents, leading to automatically investigated case distinctions of exponents being equal or not; • safety enhancing measures as - the ability to backup and re-load the whole session, - the automatic storing of the complete keyboard input during a session with the opportunity to feed this stored input into a new session, - the possibility to impose time restrictions of notoriously slow sub-steps, like factorizations and sometimes the computation and reduction of S-polynomials in a Gröbner basis computations, - a method to interrupt an ongoing automatic computation and change it to interactive mode The poster in landscape format will display the above four topics in boxes. For some of the sub-items above a screen output will give a visual impression, like the matrix indicating occurrences of unknowns in equations. In the following publications the solution of large overdetermined systems was a crucial ingredient: • the solution of large bi-linear algebraic systems and automatic merging of obtained solutions: - Wolf, T., Efimovskaya, O. V.: Classification of integrable quadratic Hamiltonians on e(3), Regular and Chaotic Dynamics, vol 8, no 2 (2003), p 155--162. - Sokolov, V. V., Wolf, T.: Classification of integrable polynomial vector evolution equations, J. Phys. A: Math. Gen. 34 (2001) 11139--11148. - Tsuchida, T. and Wolf, T.: Classification of integrable coupled systems with one scalar and one vector unknown, preprint nlin.SI/0412003 (2004) 60 pages, to appear in J. Phys. A: Math. Gen. - Sokolov, V. V. and Wolf, T.: Integrable quadratic Hamiltonians on so(4) and so(3, 1), preprint (2004) 16 pages, nlin.SI/0405066. - Kiselev, A. and Wolf, T.: New recursive chains of N=1 homogeneous superequations, to appear in proceedings of "Symmetry in Nonlinear Mathematical Physics", Kyiv 2005. • the solution of extensive overdetermined ODE/PDE-systems: - Anco, S. and Wolf, T.: Some symmetry classifications of hyperbolic vector evolution equations, nlin.SI/0412015, JNMP, Volume 12, Supplement 1 (2005), p 13--31.
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.005 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.002 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.002 |
| Open science | 0.002 | 0.003 |
| Research integrity | 0.001 | 0.003 |
| Insufficient payload (model declined to judge) | 0.122 | 0.037 |
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".