Zobrazeno 1 - 10
of 21
pro vyhledávání: '"Eric Hayden"'
Programming languages like P4 enable specifying the behavior of network data planes in software. However, with increasingly powerful and complex applications running in the network, the risk of faults also increases. Hence, there is growing recogniti
Externí odkaz:
http://arxiv.org/abs/2206.03457
Autor:
Rudy Peterson, Eric Hayden Campbell, John Chen, Natalie Isak, Calvin Shyu, Ryan Doenges, Parisa Ataei, Nate Foster
Publikováno v:
Proceedings of the 12th ACM SIGPLAN International Conference on Certified Programs and Proofs.
Publikováno v:
Biophysical Journal. 122:428a
Programming languages like P4 enable specifying the behavior of network data planes in software. However, with increasingly powerful and complex applications running in the network, the risk of faults also increases. Hence, there is growing recogniti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0eaed521d93814a6fd8b8d9ff8c82d0b
Autor:
Joseph Kitzhaber, Ashlyn Trapp, James Beck, Edoardo Serra, Francesca Spezzano, Eric Hayden, Jessica Roberts
Publikováno v:
Proceedings of the AAAI Conference on Artificial Intelligence. 36:12985-12986
The ability to study "gain of function" mutations has important implications for identifying and mitigating risks to public health and national security associated with viral infections. Numerous respiratory viruses of concern have RNA genomes (e.g.,
Publikováno v:
AIAA AVIATION 2021 FORUM.
Publikováno v:
Michael Greenberg
Temporal logics over finite traces are not the same as temporal logics over potentially infinite traces. Ro\c{s}u first proved completeness for linear temporal logic on finite traces (LTLf) with a novel coinductive axiom. We offer a different proof,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0a07748ade64130f6fa56be2b2951d9e
http://arxiv.org/abs/2107.06045
http://arxiv.org/abs/2107.06045
Publikováno v:
Michael Greenberg
Kleene algebras with tests (KATs) offer sound, complete, and decidable equational reasoning about regularly structured programs. Interest in KATs has increased greatly since NetKAT demonstrated how well extensions of KATs with domain-specific primiti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::171960f8017a37b49d9a3de9f06a9a2f
Publikováno v:
Journal of Intelligent Material Systems and Structures. 23:703-718
In this study, lossy polymeric infills are introduced into metallic honeycombs with the goal that the resulting filled honeycombs simultaneously have high stiffness and appreciable loss factor. A finite element analysis is conducted with the honeycom
Publikováno v:
AIPR
The imaging of ground objects by circular synthetic aperture radar (CSAR) is a well-known technique that can benefit from the use of multiple receivers in a multistatic configuration. Although static receivers have been employed to determine the loca