Zobrazeno 1 - 10
of 59
pro vyhledávání: '"Justin Hsu"'
Autor:
Abhimanyu Sud, Kathleen Doukas, Katherine Hodgson, Justin Hsu, Amber Miatello, Rahim Moineddin, Morag Paton
Publikováno v:
BMC Medical Education, Vol 21, Iss 1, Pp 1-12 (2021)
Abstract Background Continuing health professions education (CHPE) is an important policy intervention for the opioid epidemic. Besides effectiveness or impact, health policy implementation should be studied to understand how an intervention was deli
Externí odkaz:
https://doaj.org/article/fac44881007c4315a58f9b5391c5e11a
Publikováno v:
Logical Methods in Computer Science, Vol Volume 15, Issue 4 (2019)
Recent developments in formal verification have identified approximate liftings (also known as approximate couplings) as a clean, compositional abstraction for proving differential privacy. This construction can be defined in two styles. Earlier defi
Externí odkaz:
https://doaj.org/article/4bb4567898494012ad3434e7b842561b
Publikováno v:
The Journal of Privacy and Confidentiality, Vol 7, Iss 2 (2017)
We present a practical, differentially private algorithm for answering a large number of queries on high dimensional datasets. Like all algorithms for this task, ours necessarily has worst-case complexity exponential in the dimension of the data. How
Externí odkaz:
https://doaj.org/article/8061ee11d63245759d4f0645c1680942
Autor:
Justin Hsu, 許戎民
81
The urban population and Industries in Taiwan are concentrating and polarizing to the northern and southern metropolitan areas of the island. In the mean time, how to prepare a plan to attract appropriate industries and to motivate private in
The urban population and Industries in Taiwan are concentrating and polarizing to the northern and southern metropolitan areas of the island. In the mean time, how to prepare a plan to attract appropriate industries and to motivate private in
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/48442739296458768804
Publikováno v:
Proceedings of the ACM on Programming Languages. 6:1583-1612
We propose a symbolic execution method for programs that can draw random samples. In contrast to existing work, our method can verify randomized programs with unknown inputs and can prove probabilistic properties that universally quantify over all po
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::cbac5f56afcbe3e8235d278848598145
https://doi.org/10.1145/3563344
https://doi.org/10.1145/3563344
Autor:
Steffen Pounders, Kelly Burns, Jennifer Haverkamp, Laura Krech, Amy Koestner, Jeffrey C. Gawel, Charles J. Gibson, Mikalah Gribbell, Douglas Kwazneski, Alistair J. Chapman, Justin Hsu, Gaby Iskander
Publikováno v:
Trauma. 24:294-300
Introduction The Brain Injury Guidelines (BIG) direct surgeons to implement risk-stratified treatment plans for patients with traumatic brain injury (TBI). BIG categorize patients into one of three severity categories, from lowest to highest risk (BI
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5ea5f3824f677dc81d005b4cb11e9633
https://doi.org/10.1177/14604086211017374
https://doi.org/10.1177/14604086211017374
Publikováno v:
Proceedings of the ACM on Programming Languages. 4:1-30
Probabilistic independence is a useful concept for describing the result of random sampling—a basic operation in all probabilistic languages—and for reasoning about groups of random variables. Nevertheless, existing verification methods handle in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::789e9f8b24a481acf15ba236d168fb0b
https://doi.org/10.1145/3371123
https://doi.org/10.1145/3371123
Publikováno v:
Proceedings of the ACM on Programming Languages. 4:1-28
Guarded Kleene Algebra with Tests (GKAT) is a variation on Kleene Algebra with Tests (KAT) that arises by restricting the union ($+$) and iteration ($*$) operations from KAT to predicate-guarded versions. We develop the (co)algebraic theory of GKAT a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::77e66e4699ff012d8f240f9e29928fb2
https://doi.org/10.1145/3371129
https://doi.org/10.1145/3371129
Formal reasoning about hashing-based probabilistic data structures often requires reasoning about random variables where when one variable gets larger (such as the number of elements hashed into one bucket), the others tend to be smaller (like the nu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0f312b403c80e0f6161662f396f3aeed
http://arxiv.org/abs/2111.14917
http://arxiv.org/abs/2111.14917
Publikováno v:
LICS
We propose a model of the substructural logic of Bunched Implications (BI) that is suitable for reasoning about quantum states. In our model, the separating conjunction of BI describes separable quantum states. We develop a program logic where pre- a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d08f0e979c3126f7391b16e350cf72ce
https://doi.org/10.1109/lics52264.2021.9470673
https://doi.org/10.1109/lics52264.2021.9470673