{"id":"W2349956703","doi":"","title":"Data Reusing Algorithm of Cholesky Decomposition on Clusters","year":2011,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Cholesky decomposition; Computer science; Parallel computing; Overhead (engineering); Decomposition; Minimum degree algorithm; Reuse; Algorithm; Operating system; Incomplete Cholesky factorization","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001252537,0.0001416248,0.000151136,0.0001846838,0.0001216557,0.00003950551,0.003437335,0.00006711115,0.000003147862],"category_scores_gemma":[0.000001171072,0.0001453422,0.00003151276,0.0004617956,0.0001047976,0.0006504093,0.001822619,0.0001417674,0.00006943757],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004403788,"about_ca_system_score_gemma":0.00002452693,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001268954,"about_ca_topic_score_gemma":0.000002233959,"domain_scores_codex":[0.9987517,0.00002125975,0.000282265,0.0006118141,0.0001323027,0.0002006712],"domain_scores_gemma":[0.9971513,0.00004945594,0.0001733695,0.002513979,0.0000680784,0.00004378321],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000001996036,0.0001747423,0.000009896024,0.0000100669,0.00001535709,0.000002412374,0.000177296,0.00003610238,0.005366899,0.0189761,0.001497764,0.9737313],"study_design_scores_gemma":[0.001568506,0.0003966323,0.002798565,0.0002101041,0.00006208071,0.0002016515,0.0001382386,0.1711609,0.2735687,0.06042985,0.4879418,0.001522944],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004402049,0.00005565079,0.9977846,0.0001900858,0.00002871292,0.0003920525,0.0001286703,0.0004566568,0.000523428],"genre_scores_gemma":[0.01025889,0.00001437532,0.9892111,0.0002530323,0.00003713658,0.00006574749,0.0001383603,0.00001163901,0.000009669795],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9722084,"threshold_uncertainty_score":0.638748,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0519508066615474,"score_gpt":0.3032243294386723,"score_spread":0.2512735227771249,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}