In physics and chemistry, quantum systems are typically modeled using energy constraints formulated as Hamiltonians. Investigations into such systems often focus on the evolution of the Hamiltonians under various initial conditions, an approach summarized as Adiabatic Quantum Computing ( AQC ). Although this perspective may initially seem foreign to functional programmers, we demonstrate that conventional functional programming abstractions—specifically, the Traversable and Monad type classes—naturally capture the essence of AQC . To illustrate this connection, we introduce EnQ , a functional programming library designed to express diverse optimization problems as energy constraint computations ( ECC ). The library comprises three core components: generating the solution space, associating energy costs with potential solutions, and searching for optimal or near-optimal solutions. Because EnQ is implemented using standard Haskell, it can be executed directly through conventional classical Haskell compilers. More interestingly, we develop and implement a process to compile EnQ programs into circuits executable on quantum hardware. We validate EnQ ’s effectiveness through a number of case studies, demonstrating its capacity to express and solve classical optimization problems on quantum hardware, including search problems, type inference, number partitioning, clique finding, and graph coloring.

Synthetic Separation Logic (SSL) is a formalism that powers SuSLik, the state-of-the-art approach for the deductive synthesis of provably-correct programs in C-like languages that manipulate heap-based linked data structures. Despite its expressivity, SSL suffers from two shortcomings that hinder its utility. First, its main specification component, inductive predicates, only admits first-order definitions of data structure shapes, which leads to the proliferation of “boiler-plate” predicates for specifying common patterns. Second, SSL requires concrete definitions of data structures to synthesise programs that manipulate them, which results in the need to change a specification for a synthesis task every time changes are introduced into the layout of the involved structures. We propose to significantly lift the level of abstraction used in writing Separation Logic specifications for synthesis – both simplifying the approach and making the specifications more usable and easy to read and follow. We avoid the need to repetitively re-state low-level representation details throughout the specifications – allowing the reuse of different implementations of the same data structure by abstracting away the details of a specific layout used in memory. Our novel high-level front-end language called Pika significantly improves the expressiveness of SuSLik. We implemented a layout-agnostic synthesiser from Pika to SuSLik enabling push-button synthesis of C programs with in-place memory updates, along with the accompanying full proofs that they meet Separation Logic-style specifications, from high-level specifications that resemble ordinary functional programs. Our experiments show that our tool can produce C code that is comparable in its performance characteristics and is sometimes faster than Haskell.

We develop a novel latent-bandit algorithm for tackling the cold-start problem for new users joining a recommender system. This new algorithm significantly outperforms the state of the art, simultaneously achieving both higher accuracy and lower regret.

The role of individual case characteristics, such as symptoms or demographics, in norovirus transmissibility is poorly understood. Six nursing home norovirus outbreaks occurring in South Carolina, U.S. from 2014 to 2016 were examined. We aimed to quantify the contribution of symptoms and other case characteristics in norovirus transmission using the reproduction number (REi) as an estimate of individual case infectivity and to examine how transmission changes over the course of an outbreak. Individual estimates of REi were calculated using a maximum likelihood procedure to infer the average number of secondary cases generated by each case. The associations between case characteristics and REi were estimated using a weighted multivariate mixed linear model. Outbreaks began with one to three index case(s) with large estimated REi's (range: 1.48 to 8.70) relative to subsequent cases. Of the 209 cases, 155 (75%) vomited, 164 (79%) had diarrhea, and 158 (76%) were nursing home residents (vs. staff). Cases who vomited infected 2.12 (95% CI: 1.68, 2.68) times the number of individuals as non-vomiters, cases with diarrhea infected 1.39 (95% CI: 1.03, 1.87) times the number of individuals as cases without diarrhea, and resident-cases infected 1.53 (95% CI: 1.15, 2.02) times the number of individuals as staff-cases. Index cases tended to be residents (vs. staff) who vomited and infected considerably more secondary cases compared to non-index cases. Results suggest that individuals, particularly residents, who vomit are more infectious and tend to drive norovirus transmission in U.S. nursing home norovirus outbreaks. While diarrhea also plays a role in norovirus transmission, it is to a lesser degree than vomiting in these settings. Results lend support for prevention and control measures that focus on cases who vomit, particularly if those cases are residents.

The healthcare industry has placed significant effort on reducing pressure injuries as they often occur while patients are seeking treatment for an unrelated condition, lengthen the stay of the patient, impact treatment options, are extremely painful, and can result in death. Current work has shown that an increase in nursing care can reduce pressure injury occurrence, but increased nursing care is not sustainable. The Braden Scale is the current method of stratifying patients by risk of forming a pressure injury, but previous work has shown that the Braden Scale is not an accurate predictor of pressure injury formation. We present an objective mobility measure of pressure injury risk that can be used in addition to the Braden Scale using a wearable pressure-sensing device. By assessing the current pressure readings in real-time we can determine when a patient is mobile and present this data to the clinic. In future we aim to use this mobility measurement in a Cloud-based system that can compare the mobility measurements to similar patients to assess risk with increased accuracy.

Embedded Domain Specific Languages are a powerful tool for developing customized languages to fit specific problem domains. Shallow EDSLs allow a programmer to program using many of the features of a host language and its syntax, but sacrifice performance. Deep EDSLs provide better performance and flexibility, through the ability to manipulate the abstract syntax tree of the DSL program, but sacrifice syntactical similarity to the host language. Using Haskino, an EDSL designed for small embedded systems based on the Arduino line of microcontrollers, and a compiler plugin for the Haskell GHC compiler, we show a method for combining the best aspects of shallow and deep EDSLs. The programmer is able to write in the shallow EDSL, and have it automatically transformed into the deep EDSL. This allows the EDSL user to benefit from powerful aspects of the host language, Haskell, while meeting the demanding resource constraints of the small embedded processing environment.

OBJECTIVE: Patient access to their electronic health care record (EHR) and Web-based communication between patients and providers can potentially improve the quality of health care, but little is known about patients' attitudes toward this combined electronic access. The objective of our study was to evaluate patients' values and perceptions regarding Web-based communication with their primary care providers in the context of access to their electronic health care record. METHODS: We conducted an online survey of 4,282 members of the Geisinger Health System who are registered users of an application (MyChart) that allows patients to communicate electronically with their providers and view selected portions of their EHR. To supplement the survey, we also conducted focus groups with 25 patients who were using the system and conducted one-on-one interviews with ten primary care clinicians. We collected and analyzed data on user satisfaction, ease of use, communication preferences, and the completeness and accuracy of the patient EHR. RESULTS: A total of 4,282 registered patient EHR users were invited to participate in the survey; 1,421 users (33%) completed the survey, 60% of them female. The age distribution of users was as follows: 18 to 30 (5%), 31 to 45 (24%), 46 to 64 (54%), 65 and older (16%). Using a continuous scale from 1 to 100, the majority of users indicated that the system was easy to use (mean scores ranged from 78 to 85) and that their medical record information was complete, accurate, and understandable (mean scores ranged from 65 to 85). Only a minority of users was concerned about the confidentiality of their information or about seeing abnormal test results after receiving only an explanatory electronic message from their provider. Patients preferred e-mail communication for some interactions (e.g., requesting prescription renewals, obtaining general medical information), whereas they preferred in-person communication for others (e.g., getting treatment instructions). Telephone or written communication was never their preferred communication channel. In contrast, physicians were more likely to prefer telephone communication and less likely to prefer e-mail communication. CONCLUSION: Patients' attitudes about the use of Web messaging and online access to their EHR were mostly positive. Patients were satisfied that their medical information was complete and accurate. A minority of patients was mildly concerned about the confidentiality and privacy of their information and about learning of abnormal test results electronically. Clinicians were less positive about using electronic communication than their patients. Patients and clinicians differed substantially regarding their preferred means of communication for different types of interactions.