{"id":"W2097869860","doi":"10.1109/ccece.2005.1556896","title":"Enhanced multiuser resource allocation using near-continuous loading algorithms with adaptive coding for digital subscriber loops","year":2006,"lang":"en","type":"article","venue":"","topic":"Power Line Communications and Noise","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Digital subscriber line; Computer science; Granularity; Link adaptation; Algorithm; Coding (social sciences); Iterated function; Real-time computing; Electronic engineering; Computer network; Mathematics; Engineering","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.00008779731,0.0001703328,0.0001642209,0.00006256275,0.0001627674,0.0001646736,0.0001573814,0.00006818002,0.00001038093],"category_scores_gemma":[0.00001445632,0.0001563761,0.00004930552,0.0001874737,0.00004288768,0.0003832434,0.00003187504,0.0001138467,0.000008012701],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009316247,"about_ca_system_score_gemma":0.00001795905,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008820117,"about_ca_topic_score_gemma":0.00006602035,"domain_scores_codex":[0.9992101,0.000009487027,0.0002291268,0.0001757982,0.0001018457,0.0002736059],"domain_scores_gemma":[0.9993823,0.00009953869,0.00004454112,0.0003171354,0.0001095141,0.00004699476],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003842033,0.0005068559,0.001733239,0.0001800646,0.0004715258,0.00001166162,0.002857427,0.7308491,0.1776675,0.007308586,0.004850845,0.07317892],"study_design_scores_gemma":[0.000793853,0.00004738998,0.0003274098,0.00008035891,0.00003074378,0.000007103081,0.0003298082,0.95864,0.03373078,0.00005736261,0.005609776,0.0003453608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2870123,0.0001237389,0.7049763,0.00002472683,0.00005241858,0.0002983016,0.00001615983,0.0002917806,0.007204307],"genre_scores_gemma":[0.906718,0.000003685531,0.09241518,0.00001444265,0.00008434886,0.00003684048,0.0000602819,0.00005306329,0.0006141953],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6197056,"threshold_uncertainty_score":0.6376833,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01634108233984138,"score_gpt":0.224621785439253,"score_spread":0.2082807030994116,"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."}}