{"id":"W4252400262","doi":"10.1016/j.scico.2004.07.005","title":"Generation of fast interpreters for Huffman compressed bytecode","year":2005,"lang":"en","type":"article","venue":"Science of Computer Programming","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Opcode; Computer science; Bytecode; Operand; Byte; Huffman coding; Operating system; Just-in-time compilation; Virtual memory; Virtual machine; Parallel computing; Programming language; Algorithm; Memory management; Data compression","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006524216,0.000141938,0.0002343061,0.0002420934,0.000186925,0.0002040991,0.001766242,0.00003769071,0.00000217375],"category_scores_gemma":[0.00001964596,0.000121213,0.00009181899,0.0005444653,0.0003253864,0.00148575,0.0006149865,0.0000677338,0.000001675875],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003478171,"about_ca_system_score_gemma":0.0001084953,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001234094,"about_ca_topic_score_gemma":0.000003388086,"domain_scores_codex":[0.9982378,0.00002486685,0.0004318525,0.0004819208,0.0004716117,0.0003519134],"domain_scores_gemma":[0.9986336,0.00006057031,0.0002806478,0.0006041678,0.0003191855,0.0001018841],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005047068,0.00009355829,0.00004775336,0.00002963896,0.000006166273,2.509241e-7,0.0008486199,0.003010642,0.03204997,0.007069057,0.0002344087,0.9566049],"study_design_scores_gemma":[0.0002859896,0.000237692,0.0001382936,0.00006541094,0.000003587797,0.000003927703,0.0000147232,0.9135373,0.08173051,0.0002023678,0.003648695,0.0001315526],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03937841,0.00005403314,0.9594457,0.0001689151,0.0004868746,0.0003362071,0.000006007573,0.000071104,0.00005271699],"genre_scores_gemma":[0.4710429,0.000001394738,0.5287895,0.0000314044,0.0001104173,0.00001163074,0.000003965333,0.000003736731,0.000005136691],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9564734,"threshold_uncertainty_score":0.4942922,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03493034153137976,"score_gpt":0.2944728923562536,"score_spread":0.2595425508248738,"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."}}