{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004415812,0.0002884194,0.0003684277,0.0002230279,0.0002461016,0.0003527192,0.0005725163,0.0002738485,0.0006618507],"category_scores_gemma":[0.001306808,0.0001502043,0.0001730009,0.0002630313,0.0005747947,0.0007767592,0.0005998519,0.0003866057,0.0001438354],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003430973,"about_ca_system_score_gemma":0.0003683469,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007519832,"about_ca_topic_score_gemma":0.0009713863,"domain_scores_codex":[0.999658,0.000124223,0.00001033446,0.00004630831,0.0001158974,0.00004511787],"domain_scores_gemma":[0.9994935,0.0002734365,0.00006267358,0.00007608502,0.00006550637,0.00002882265],"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.0003296975,0.0001379639,0.000642947,0.0000453094,0.00003428088,0.00009235865,0.0001980693,0.6494793,0.0386781,0.02519774,0.0006397688,0.2845244],"study_design_scores_gemma":[0.00001364633,0.00005285256,0.00006876512,0.000001914716,0.000003026438,0.00002069061,0.000007278009,0.9934736,0.00313903,0.002865861,0.0003467738,0.000006558032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05095707,0.0001272188,0.9476619,0.00004974021,0.00001246179,0.0000146007,0.000005525435,0.0001778802,0.0009934995],"genre_scores_gemma":[0.8581516,0.00005998008,0.1406984,0.0000455269,0.00002603947,0.00003527325,0.00001304528,0.00002442021,0.0009456972],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0007519832,"threshold_uncertainty_score":0.002489388,"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."}}