{"id":"W2145505680","doi":"10.1109/vetecs.2009.5073289","title":"A Continuous Communication Path Availability Analysis in Vehicular Ad Hoc Networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Unavailability; Computer science; Wireless ad hoc network; Path (computing); Computer network; Node (physics); Markov process; Topology (electrical circuits); Network topology; Transmission (telecommunications); Range (aeronautics); Mobility model; Distributed computing; Mathematics; Telecommunications; Engineering; Statistics; Wireless","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.001791062,0.00045392,0.0005245991,0.001412543,0.0005148054,0.0008793309,0.0009391785,0.0006539879,0.0008021092],"category_scores_gemma":[0.01041574,0.0004573333,0.0004618145,0.001249286,0.001589135,0.002138148,0.0007339302,0.000899374,0.0001248308],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008134364,"about_ca_system_score_gemma":0.0005708405,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002794828,"about_ca_topic_score_gemma":0.0008986464,"domain_scores_codex":[0.9988965,0.0003583874,0.00003710361,0.0001835455,0.0003853346,0.0001390647],"domain_scores_gemma":[0.9888884,0.008655095,0.0009132469,0.0003903933,0.0009517998,0.000201092],"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.0000766421,0.00003130897,0.005144987,0.0001371475,0.00006981744,0.0003429406,0.000240354,0.9355339,0.003296347,0.0423095,0.0004404574,0.01237669],"study_design_scores_gemma":[0.000003520864,0.00004258071,0.00130735,0.000009607739,0.0000123598,0.0001182771,0.00004546764,0.9853594,0.0003497119,0.01242373,0.0003145644,0.00001344519],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3035283,0.002820847,0.6900629,0.0004207985,0.00005570388,0.00004701508,0.0001577874,0.0001951747,0.002711439],"genre_scores_gemma":[0.9889809,0.0006517451,0.009633794,0.00002842696,0.00004984702,0.00003344918,0.00006842928,0.00001906244,0.0005343236],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002794828,"threshold_uncertainty_score":0.009472132,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007942330576945,"score_gpt":0.2282454157442849,"score_spread":0.22030308516734,"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."}}