{"id":"W4389309777","doi":"10.1142/s0218126624501664","title":"A Low-Cost and Fault-Tolerant Stochastic Architecture for the Bernsen Algorithm Using Bitstream Correlation","year":2023,"lang":"en","type":"article","venue":"Journal of Circuits Systems and Computers","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Fundamental Research Funds for the Central Universities; Natural Sciences and Engineering Research Council of Canada","keywords":"Stochastic computing; Bitstream; Computer science; Algorithm; Overhead (engineering); Binary number; Pixel; Noise (video); Thresholding; Fault tolerance; Computer engineering; Image (mathematics); Artificial intelligence; Decoding methods; Mathematics; Arithmetic; Distributed computing","routes":{"ca_aff":true,"ca_fund":true,"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.0007905415,0.000151777,0.0002812926,0.0002597986,0.0002330531,0.0003201633,0.0003753197,0.00006635876,9.539589e-8],"category_scores_gemma":[0.00004582473,0.0001050492,0.00008094143,0.0003373473,0.00004174055,0.0002255124,0.0001034096,0.0002214416,3.725314e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004398496,"about_ca_system_score_gemma":0.00006607955,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004655177,"about_ca_topic_score_gemma":0.000003538736,"domain_scores_codex":[0.9987844,0.00007951551,0.0004143205,0.0002032873,0.0002888146,0.0002296182],"domain_scores_gemma":[0.9983385,0.0007383404,0.0004411383,0.000198946,0.0001845161,0.00009862051],"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.000008799289,0.00002663434,0.0002004366,0.0001131138,0.0001129168,0.00004017865,0.004774884,0.2087705,0.00054964,0.0007085945,0.0008920384,0.7838022],"study_design_scores_gemma":[0.0003839465,0.0001414331,0.0008367931,0.0005224666,0.00002972366,0.001476123,0.0001931521,0.9954801,0.00002676497,0.0004738063,0.0003077466,0.0001279601],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0405854,0.0004303088,0.956359,0.0003092541,0.001770339,0.0004423217,0.00000413026,0.00009539931,0.000003854302],"genre_scores_gemma":[0.9880656,0.00002271319,0.01141895,0.00006865078,0.0003709363,0.00001116603,7.555619e-7,0.00001779971,0.00002344613],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9474802,"threshold_uncertainty_score":0.428378,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02620867648515554,"score_gpt":0.2672539993132319,"score_spread":0.2410453228280764,"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."}}