{"id":"W2096902129","doi":"10.1109/icc.2006.254709","title":"A Concave Minimization Approach to Dynamic Spectrum Management for Digital Subscriber Lines","year":2006,"lang":"en","type":"article","venue":"2006 IEEE International Conference on Communications","topic":"Power Line Communications and Noise","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Digital subscriber line; Minification; Mathematical optimization; Convex optimization; Concave function; Computer science; Convex function; Sequence (biology); Optimization problem; Linear programming; Reduction (mathematics); Function (biology); Computational complexity theory; Regular polygon; Dynamic programming; Spectrum (functional analysis); Spread spectrum; Mathematics; Algorithm; Telecommunications; Code division multiple access","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008138346,0.0001873836,0.0001445441,0.0002625668,0.0001496342,0.0002109243,0.001382825,0.00005979395,0.00003148488],"category_scores_gemma":[0.0000167226,0.0002055511,0.0000825011,0.0002178955,0.00006247972,0.0002029397,0.0001338874,0.0001443671,0.0001032989],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001734843,"about_ca_system_score_gemma":0.00002297492,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002247777,"about_ca_topic_score_gemma":0.00013105,"domain_scores_codex":[0.9990234,0.00002133992,0.0003744985,0.0002005934,0.0001781179,0.0002020977],"domain_scores_gemma":[0.9983577,0.0000974278,0.00006073658,0.001195238,0.0002286552,0.0000602072],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006715526,0.001325849,0.0002666934,0.00005809974,0.0002876549,9.297218e-7,0.0002964188,0.09047008,0.0009580916,0.8466326,0.04994588,0.009690543],"study_design_scores_gemma":[0.0006457051,0.0000403316,0.001667262,0.00007613774,0.00003020173,0.000004469361,0.000140152,0.8638906,0.0002727041,0.00829572,0.1245278,0.0004088983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.005950333,0.0001919319,0.4208806,0.006696266,0.0006503318,0.001206293,0.0009894291,0.000508049,0.5629267],"genre_scores_gemma":[0.9680023,0.0002746114,0.02554217,0.0001198844,0.00007250078,0.0005374354,0.00170957,0.00003842459,0.003703143],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9620519,"threshold_uncertainty_score":0.838213,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04723828310420473,"score_gpt":0.2962215680881629,"score_spread":0.2489832849839581,"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."}}