{"id":"W2112947567","doi":"10.1109/tnet.2005.852876","title":"Non-convex optimization and rate control for multi-class services in the Internet","year":2005,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":284,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Mathematical optimization; Sigmoid function; The Internet; Concave function; Convergence (economics); Network congestion; Dual (grammatical number); Class (philosophy); Convex function; Transmission (telecommunications); Function (biology); Regular polygon; Computer network; Telecommunications; Artificial neural network; Artificial intelligence; Mathematics","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.003075732,0.001132552,0.001223083,0.0006629185,0.000621461,0.001996602,0.001350058,0.001236628,0.002097073],"category_scores_gemma":[0.007421045,0.000521037,0.0006123226,0.001027757,0.001752309,0.002434063,0.00105968,0.001621086,0.0002910657],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00223209,"about_ca_system_score_gemma":0.001079731,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004518956,"about_ca_topic_score_gemma":0.002398143,"domain_scores_codex":[0.9984198,0.0008616549,0.00004236696,0.0002144966,0.0002660574,0.0001957467],"domain_scores_gemma":[0.9973804,0.001958986,0.0002481207,0.0001063678,0.0001951056,0.0001109437],"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.00007007458,0.00005018121,0.0002642613,0.00005291651,0.00001943219,0.00009107099,0.00005963987,0.9076252,0.0009733142,0.07603087,0.0007643093,0.01399871],"study_design_scores_gemma":[0.000008038001,0.000009376114,0.00005515728,0.000002741197,0.000002344458,0.00001045388,0.00000853036,0.9850091,0.0001546998,0.01450699,0.0002292434,0.000003385343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03277287,0.0008867844,0.9600007,0.0008042809,0.00006991903,0.0000525366,0.00003174786,0.00007951946,0.005301692],"genre_scores_gemma":[0.9038283,0.001306702,0.08667465,0.0001932218,0.0001856421,0.0001645721,0.00005541771,0.0001034712,0.007488059],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004518956,"threshold_uncertainty_score":0.01626623,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01933816349824027,"score_gpt":0.2448934649100482,"score_spread":0.2255553014118079,"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."}}