{"id":"W2795284004","doi":"10.1109/tcsii.2018.2821268","title":"Optimizing Incremental Step Pulse Programming for RRAM Through Device–Circuit Co-Design","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits & Systems II Express Briefs","topic":"Advanced Memory and Neural Computing","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Institute of Population and Public Health; Ministry of Science and Technology, Taiwan","keywords":"Resistive random-access memory; Overhead (engineering); Computer science; Data retention; Voltage; Electronic engineering; Pulse (music); Circuit design; Electrical engineering; Engineering; Embedded system","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001100295,0.0004461801,0.000272061,0.0002159255,0.0001416693,0.0004261528,0.001039326,0.0002809005,0.001912729],"category_scores_gemma":[0.0002938751,0.0001509925,0.0001883241,0.0002396117,0.0001405857,0.00040526,0.0003347962,0.0003456537,0.0004291285],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003179283,"about_ca_system_score_gemma":0.0003905316,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001997447,"about_ca_topic_score_gemma":0.0007871434,"domain_scores_codex":[0.9999069,0.00001061225,0.000004039393,0.0000191946,0.00004060453,0.0000185487],"domain_scores_gemma":[0.9998897,0.00003066908,0.00002117526,0.00002075752,0.00002792958,0.000009706741],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001795531,0.0002153125,0.001148925,0.000483537,0.00009726412,0.0003559691,0.00009475149,0.1195347,0.6970339,0.01192379,0.00260718,0.1663251],"study_design_scores_gemma":[0.00003937572,0.000856655,0.001184182,0.00002460425,0.0000821916,0.0005749865,0.00004360814,0.7060679,0.2771672,0.003208701,0.01072238,0.00002820038],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2912294,0.0009590398,0.6828059,0.0002704232,0.0001355271,0.0002810487,0.0001516977,0.002033182,0.02213371],"genre_scores_gemma":[0.8752947,0.0002375674,0.1220103,0.00006945623,0.00002124922,0.0001638766,0.00008089949,0.0001197724,0.002002013],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001912729,"threshold_uncertainty_score":0.006398737,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06179542345632436,"score_gpt":0.2864078229932447,"score_spread":0.2246123995369203,"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."}}