![Logo](/assets/logo-d3f1fdf60522f0983e71f9fcc720cb7da5b55c0b748ed5bded3d2fbf81387bf0.png)
CORD-19:6e2db98aa242e3e84116afdfad5e250943c55ac5 / 4109-4444
Annnotations
CORD-19_Custom_license_subset
{"project":"CORD-19_Custom_license_subset","denotations":[{"id":"T31","span":{"begin":0,"end":335},"obj":"Sentence"}],"text":"Under this unified network framework, we specifically propose a new dynamic cascade model to describe harmful cascade diffusions, and define a detection time minimization (DTM) problem S * = argmin |S|=k,S⊆V D(S), where k is a given parameter determined by budget or monitor capacity, S is sensor nodes set, and D(S) is detection time."}
CORD-19-Sentences
{"project":"CORD-19-Sentences","denotations":[{"id":"TextSentencer_T31","span":{"begin":0,"end":335},"obj":"Sentence"},{"id":"TextSentencer_T31","span":{"begin":0,"end":335},"obj":"Sentence"},{"id":"T77206","span":{"begin":0,"end":335},"obj":"Sentence"}],"namespaces":[{"prefix":"_base","uri":"http://pubannotation.org/ontology/tao.owl#"}],"text":"Under this unified network framework, we specifically propose a new dynamic cascade model to describe harmful cascade diffusions, and define a detection time minimization (DTM) problem S * = argmin |S|=k,S⊆V D(S), where k is a given parameter determined by budget or monitor capacity, S is sensor nodes set, and D(S) is detection time."}
Epistemic_Statements
{"project":"Epistemic_Statements","denotations":[{"id":"T15","span":{"begin":0,"end":335},"obj":"Epistemic_statement"}],"text":"Under this unified network framework, we specifically propose a new dynamic cascade model to describe harmful cascade diffusions, and define a detection time minimization (DTM) problem S * = argmin |S|=k,S⊆V D(S), where k is a given parameter determined by budget or monitor capacity, S is sensor nodes set, and D(S) is detection time."}