Effectiveness of an electronic inpatient medication record in reducing medication errors in Singapore

This study examined the effectiveness of an inpatient electronic medication record system in reducing medication errors in Singaporean hospitals. This pre- and post-intervention study involving a control group was undertaken in two Singaporean acute care hospitals. In one hospital the inpatient electronic medication record system was implemented while in another hospital the paper-based medication record system was used. The mean incidence difference in medication errors of 0.06 between pre-intervention (0.72 per 1000 patient days) and post-intervention (0.78 per 1000 patient days) for the two hospitals was not statistically significant (95%, CI: [0.26, 0.20]). The mean incidence differences in medication errors relating to prescription, dispensing, and administration were also not statistically different. Common system failures involved a lack of medication knowledge by health professionals and a lack of a systematic approach in identifying correct dosages. There was no difference in the incidence of medication errors following the introduction of the electronic medication record system. More work is needed on how this system can reduce medication error rates and improve medication safety. © 2013 Wiley Publishing Asia Pty Ltd.

On the choice of test for a unit root when the errors are conditionally heteroskedastic

It is well known that in the context of the classical regression model with heteroskedastic errors, while ordinary least squares (OLS) is not efficient, the weighted least squares (WLS) and quasi-maximum likelihood (QML) estimators that utilize the information contained in the heteroskedasticity are. In the context of unit root testing with conditional heteroskedasticity, while intuition suggests that a similar result should apply, the relative performance of the tests associated with the OLS, WLS and QML estimators is not well understood. In particular, while QML has been shown to be able to generate more powerful tests than OLS, not much is known regarding the relative performance of the WLS-based test. By providing an in-depth comparison of the tests, the current paper fills this gap in the literature.

The asymptotic distribution of the CADF unit root test in the presence of heterogeneous AR(p) errors

The CADF test of Pesaran (J Appl Econ 22:265–312, 2007) are among the most popular univariate tests for cross-section correlated panels around. Yet, the existing asymptotic analysis of this test statistic is limited to a model in which the errors are assumed to follow a simple AR(1) structure with homogenous autoregressive coefficients. One reason for this is that the model involves an intricate identification issue, as both the serial and cross-section correlation structures of the errors are unobserved. The purpose of the current paper is to tackle this issue and in so doing extend the existing analysis to the case of AR((Formula presented.)) errors with possibly heterogeneous coefficients.

Query verification schemes for cloud-hosted databases: a brief survey

Database query verification schemes provide correctness guarantees for database queries. Typically such guarantees are required and advisable where queries are executed on untrusted servers. This need to verify query results, even though they may have been executed on one’s own database, is something new that has arisen with the advent of cloud services. The traditional model of hosting one’s own databases on one’s own servers did not require such verification because the hardware and software were both entirely within one’s control, and therefore fully trusted. However, with the economical and technological benefits of cloud services beckoning, many are now considering outsourcing both data and execution of database queries to the cloud, despite obvious risks. This survey paper provides an overview into the field of database query verification and explores the current state of the art in terms of query execution and correctness guarantees provided for query results. We also provide indications towards future work in the area.

String matching query verification on the cloud-hosted databases

Database query verification schemes attempt to provide authenticity, completeness, and freshness guarantees for queries executed on untrusted cloud servers. A number of such schemes currently exist in the literature, allowing query verification for queries that are based on matching whole values (such as numbers, dates, etc.) or for queries based on keyword matching. However, there is a notable gap in the research with regard to query verification schemes for pattern-matching queries. Our contribution here is to provide such a verification scheme that provides correctness guarantees for pattern-matching queries executed on the cloud. We describe a trivial scheme, ȃŸż and show how it does not provide completeness guarantees, and then proceed to describe our scheme based on efficient primitives such as cryptographic hashing and Merkle hash trees along with suffix arrays. We also provide experimental results based on a working prototype to show the practicality of our scheme.Ÿż