{"id":"W2495984805","doi":"10.1109/iccd.1993.393327","title":"A field programmable accelerator for compiled-code applications","year":2002,"lang":"en","type":"article","venue":"","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Porting; Computer science; Overhead (engineering); Code (set theory); Software; Set (abstract data type); Field (mathematics); Operating system; Embedded system; Programming language; Computer architecture","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002863013,0.0007809332,0.0003392127,0.0007192389,0.00055178,0.001061185,0.001070909,0.0007379773,0.01402989],"category_scores_gemma":[0.0007217997,0.0005226646,0.0004216234,0.0008276275,0.0003241693,0.001023137,0.0006299345,0.001097155,0.01014531],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003850383,"about_ca_system_score_gemma":0.0007139862,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001153063,"about_ca_topic_score_gemma":0.002463335,"domain_scores_codex":[0.9996787,0.0000408582,0.00001940588,0.00003512493,0.0001795529,0.00004625635],"domain_scores_gemma":[0.9996672,0.00006995672,0.00002478075,0.00009288367,0.0001109392,0.00003422482],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0005032836,0.000385427,0.002071757,0.0007644061,0.0001063988,0.0009961528,0.0003087344,0.02248885,0.1272146,0.05828401,0.2061958,0.5806805],"study_design_scores_gemma":[0.0001181212,0.0003166909,0.001045096,0.0000827127,0.00004301641,0.001128188,0.00003662277,0.1152216,0.08900575,0.0113266,0.7815862,0.00008935958],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0143628,0.002003354,0.8211076,0.0006807882,0.0009765815,0.0004402587,0.001057263,0.09097747,0.06839392],"genre_scores_gemma":[0.1198968,0.002706646,0.7378073,0.001155937,0.0003358001,0.0005123029,0.005085873,0.009544561,0.1229548],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01402989,"threshold_uncertainty_score":0.04693466,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04107641473282982,"score_gpt":0.2864183862510598,"score_spread":0.24534197151823,"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."}}