{"id":"W2132812596","doi":"10.1109/dcc.2009.11","title":"Adaptive Rate Allocation Algorithm for Transmission of Multiple Embedded Bit Streams over Time-Varying Noisy Channels","year":2009,"lang":"en","type":"article","venue":"","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Algorithm; Transmission (telecommunications); Computer science; Channel (broadcasting); Image (mathematics); Network packet; Distortion (music); Binary number; Binary symmetric channel; Time complexity; Binary image; Decoding methods; Mathematical optimization; Image processing; Mathematics; Channel code; Computer vision; Bandwidth (computing); Telecommunications; Computer network","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.0009740415,0.0005065592,0.0006570015,0.0004839097,0.0003702485,0.0006053653,0.001058642,0.0006402401,0.001025249],"category_scores_gemma":[0.002714314,0.0002603058,0.0002685128,0.0004350529,0.0005471152,0.0008638642,0.0005823905,0.0006891503,0.0003217833],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000583631,"about_ca_system_score_gemma":0.0007311821,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001294219,"about_ca_topic_score_gemma":0.001162419,"domain_scores_codex":[0.9994208,0.0001577544,0.00004206616,0.00007489777,0.0002584997,0.00004598656],"domain_scores_gemma":[0.999132,0.0004125648,0.0001138121,0.00008188841,0.0002351571,0.00002462524],"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.0005409435,0.00009807902,0.0006390446,0.0001345352,0.00006199769,0.0001872497,0.0002914074,0.5541101,0.04177259,0.02917277,0.001809384,0.3711819],"study_design_scores_gemma":[0.00003217184,0.00004854616,0.00009397197,0.000006567471,0.00001030944,0.000103174,0.00001100998,0.9905883,0.006169565,0.001933299,0.000990881,0.00001207627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007784236,0.0001299877,0.9912941,0.00005205118,0.00001893381,0.00003281797,0.000008770236,0.0001939892,0.0004851861],"genre_scores_gemma":[0.3084007,0.0003275186,0.6878465,0.00006414871,0.0000484018,0.0002430251,0.00006264084,0.00006338974,0.00294363],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001294219,"threshold_uncertainty_score":0.005151272,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01819713975255483,"score_gpt":0.2800921718639965,"score_spread":0.2618950321114417,"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."}}