{"id":"W7096525568","doi":"","title":"Recommended Citation Jabbar, Syed, "An Efficient Scheme for Non-bifurcated Traffic Grooming in WDM Networks " (2010). Electronic Theses and Dissertations. Paper 340. AN EFFICIENT SCHEME FOR NON-BIFURCATED TRAFFIC GROOMING IN WDM NETWORKS","year":2010,"lang":"en","type":"article","venue":"","topic":"Williams Syndrome Research","field":"Neuroscience","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Windsor; Scheme (mathematics); Traffic grooming; Permission; Wavelength-division multiplexing","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005121132,0.000426189,0.0006333976,0.001467782,0.0009585251,0.001695702,0.0009037253,0.0007503257,0.135497],"category_scores_gemma":[0.002541297,0.0002859999,0.000199832,0.003289086,0.0004479484,0.002030002,0.0007853867,0.0006635999,0.03226988],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001277292,"about_ca_system_score_gemma":0.0008526194,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003647373,"about_ca_topic_score_gemma":0.008517792,"domain_scores_codex":[0.9997714,0.00002609821,0.00001318053,0.00003936456,0.0001268777,0.00002302359],"domain_scores_gemma":[0.9990791,0.0001551417,0.00004205667,0.00009991418,0.0005614492,0.00006234101],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009848822,0.00005001786,0.0004368597,0.0004732446,0.00001234442,0.0001209288,0.0001232996,0.001144552,0.002607497,0.01923248,0.6523634,0.323337],"study_design_scores_gemma":[0.00002813265,0.00007072736,0.001444285,0.0002216283,0.00002572641,0.000293502,0.0001480507,0.004900696,0.003261522,0.007619468,0.9819581,0.0000281268],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.01907686,0.06317821,0.1155207,0.03402142,0.09831975,0.001283486,0.006908443,0.002013641,0.6596775],"genre_scores_gemma":[0.0633457,0.03544848,0.04079892,0.001815586,0.007036821,0.0002765922,0.003233217,0.0005056903,0.8475389],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.135497,"threshold_uncertainty_score":0.4532826,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04151056856212262,"score_gpt":0.3200412669841101,"score_spread":0.2785306984219874,"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."}}