{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000981078,0.001580027,0.0009521864,0.0004801375,0.0004807454,0.001182993,0.001071685,0.0009148595,0.002335035],"category_scores_gemma":[0.001631675,0.0005471141,0.0006542615,0.0007160914,0.001083759,0.00114437,0.001136142,0.001712414,0.0005562084],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001106075,"about_ca_system_score_gemma":0.001138349,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002490113,"about_ca_topic_score_gemma":0.00222472,"domain_scores_codex":[0.9995263,0.000166254,0.00001247484,0.00007901384,0.0001519608,0.00006399938],"domain_scores_gemma":[0.9996045,0.0002445436,0.00002541472,0.00002680405,0.00007637556,0.00002241434],"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.0000454935,0.00005875865,0.0001919713,0.00009378187,0.0000218626,0.00006138083,0.00005624785,0.8850026,0.003399925,0.06106205,0.002850022,0.04715595],"study_design_scores_gemma":[0.000003846277,0.00001846581,0.00003158252,0.000003530093,0.000002897591,0.00001060882,0.000006366215,0.9915991,0.0005261819,0.006946323,0.000847724,0.000003307562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00232292,0.0001593288,0.9949355,0.000150747,0.00002233125,0.00001626866,0.00001914794,0.00006149116,0.002312344],"genre_scores_gemma":[0.4613453,0.001492345,0.5231871,0.000395017,0.0002877623,0.0002693295,0.0002013124,0.0003853224,0.01243658],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002490113,"threshold_uncertainty_score":0.00802511,"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."}}