A web-based tool for teaching pharmacy practice competency

Aims to implement and assess the effectiveness of the Strathclyde Computerized Randomized Interactive Prescription Tutor (SCRIPT) in teaching a competency-based undergraduate pharmacy course. Data on students' access to SCRIPT, collected by quantitative electronic data capture, were analyzed to determine student usage patterns and correlations between usage and grades in class assessments. Data on students' perceptions were collected by electronic questionnaire and semistructured interviews. Teaching staff members also were interviewed. Two hundred forty-three students accessed SCRIPT a median of 23 times each. Students accessed SCRIPT predominantly at times outside normal teaching hours and tended to access the tool more often in the 48 hours preceding class assessments. Feedback from students indicated overall satisfaction with the tool to compliment the timetabled teaching sessions but highlighted that more specific feedback on the examples was required. All staff comments were positive. Students and teaching staff members valued SCRIPT as a tool to compliment teaching of the competency-based pharmacy practice classes in the MPharm degree

On Multiphase-Linear Ranking Functions

Multiphase ranking functions ($\mathit{M{\Phi}RFs}$) were proposed as a means to prove the termination of a loop in which the computation progresses through a number of "phases", and the progress of each phase is described by a different linear ranking function. Our work provides new insights regarding such functions for loops described by a conjunction of linear constraints (single-path loops). We provide a complete polynomial-time solution to the problem of existence and of synthesis of $\mathit{M{\Phi}RF}$ of bounded depth (number of phases), when variables range over rational or real numbers; a complete solution for the (harder) case that variables are integer, with a matching lower-bound proof, showing that the problem is coNP-complete; and a new theorem which bounds the number of iterations for loops with $\mathit{M{\Phi}RFs}$. Surprisingly, the bound is linear, even when the variables involved change in non-linear way. We also consider a type of lexicographic ranking functions, $\mathit{LLRFs}$, more expressive than types of lexicographic functions for which complete solutions have been given so far. We prove that for the above type of loops, lexicographic functions can be reduced to $\mathit{M{\Phi}RFs}$, and thus the questions of complexity of detection and synthesis, and of resulting iteration bounds, are also answered for this class.Comment: typos correcte

Unified force law for granular impact cratering

Experiments on the low-speed impact of solid objects into granular media have been used both to mimic geophysical events and to probe the unusual nature of the granular state of matter. Observations have been interpreted in terms of conflicting stopping forces: product of powers of projectile depth and speed; linear in speed; constant, proportional to the initial impact speed; and proportional to depth. This is reminiscent of high-speed ballistics impact in the 19th and 20th centuries, when a plethora of empirical rules were proposed. To make progress, we developed a means to measure projectile dynamics with 100 nm and 20 us precision. For a 1-inch diameter steel sphere dropped from a wide range of heights into non-cohesive glass beads, we reproduce prior observations either as reasonable approximations or as limiting behaviours. Furthermore, we demonstrate that the interaction between projectile and medium can be decomposed into the sum of velocity-dependent inertial drag plus depth-dependent friction. Thus we achieve a unified description of low-speed impact phenomena and show that the complex response of granular materials to impact, while fundamentally different from that of liquids and solids, can be simply understood

From one solution of a 3-satisfiability formula to a solution cluster: Frozen variables and entropy

A solution to a 3-satisfiability (3-SAT) formula can be expanded into a cluster, all other solutions of which are reachable from this one through a sequence of single-spin flips. Some variables in the solution cluster are frozen to the same spin values by one of two different mechanisms: frozen-core formation and long-range frustrations. While frozen cores are identified by a local whitening algorithm, long-range frustrations are very difficult to trace, and they make an entropic belief-propagation (BP) algorithm fail to converge. For BP to reach a fixed point the spin values of a tiny fraction of variables (chosen according to the whitening algorithm) are externally fixed during the iteration. From the calculated entropy values, we infer that, for a large random 3-SAT formula with constraint density close to the satisfiability threshold, the solutions obtained by the survey-propagation or the walksat algorithm belong neither to the most dominating clusters of the formula nor to the most abundant clusters. This work indicates that a single solution cluster of a random 3-SAT formula may have further community structures.Comment: 13 pages, 6 figures. Final version as published in PR

Non-polynomial Worst-Case Analysis of Recursive Programs

We study the problem of developing efficient approaches for proving worst-case bounds of non-deterministic recursive programs. Ranking functions are sound and complete for proving termination and worst-case bounds of nonrecursive programs. First, we apply ranking functions to recursion, resulting in measure functions. We show that measure functions provide a sound and complete approach to prove worst-case bounds of non-deterministic recursive programs. Our second contribution is the synthesis of measure functions in nonpolynomial forms. We show that non-polynomial measure functions with logarithm and exponentiation can be synthesized through abstraction of logarithmic or exponentiation terms, Farkas' Lemma, and Handelman's Theorem using linear programming. While previous methods obtain worst-case polynomial bounds, our approach can synthesize bounds of the form $\mathcal{O}(n\log n)$ as well as $\mathcal{O}(n^r)$ where $r$ is not an integer. We present experimental results to demonstrate that our approach can obtain efficiently worst-case bounds of classical recursive algorithms such as (i) Merge-Sort, the divide-and-conquer algorithm for the Closest-Pair problem, where we obtain $\mathcal{O}(n \log n)$ worst-case bound, and (ii) Karatsuba's algorithm for polynomial multiplication and Strassen's algorithm for matrix multiplication, where we obtain $\mathcal{O}(n^r)$ bound such that $r$ is not an integer and close to the best-known bounds for the respective algorithms.Comment: 54 Pages, Full Version to CAV 201

The Relationship Between HR Practices and Firm Performance: Examining Causal Order

Significant research attention has been devoted to examining the relationship between HR practices and firm performance, and the research support has assumed HR as the causal variable. Using data from 45 business units (with 62 data points), this study examines how measures of HR practices correlate with past, concurrent, and future operational performance measures. The results indicate that correlations with performance measures at all three times are both high and invariant, and that controlling for past or concurrent performance virtually eliminates the correlation of HR with future performance. Implications are discussed

Estimation of greenhouse gas emissions from spontaneous combustion/fire of coal in opencast mines – Indian context

There are a significant number of uncontrolled coal mine fires (primarily due to spontaneous combustion of coal), which are currently burning all over the world. These spontaneous combustion sources emit greenhouse gases (GHGs). A critical review reveals that there are no standard measurement methods to estimate GHG emissions from mine fire/spontaneous combustion areas. The objective of this research paper was to estimate GHGs emissions from spontaneous combustion of coals in the Indian context. A sampling chamber (SC) method was successfully used to assess emissions at two locations of the Enna Opencast Project (OCP), Jharia Coalfield (JCF), for 3 months. The study reveals that measured cumulative average emission rate for CO2 varies from 75.02 to 286.03 gs−1m−1 and CH4 varies from 41.49 to 40.34 gs−1m−1 for low- and medium-temperature zones. The total GHG emissions predicted from this single fire affecting mines of JCF vary from 16.86 to 20.19 Mtyr−

Binary pattern tile set synthesis is NP-hard

In the field of algorithmic self-assembly, a long-standing unproven conjecture has been that of the NP-hardness of binary pattern tile set synthesis (2-PATS). The $k$-PATS problem is that of designing a tile assembly system with the smallest number of tile types which will self-assemble an input pattern of $k$ colors. Of both theoretical and practical significance, $k$-PATS has been studied in a series of papers which have shown $k$-PATS to be NP-hard for $k = 60$, $k = 29$, and then $k = 11$. In this paper, we close the fundamental conjecture that 2-PATS is NP-hard, concluding this line of study. While most of our proof relies on standard mathematical proof techniques, one crucial lemma makes use of a computer-assisted proof, which is a relatively novel but increasingly utilized paradigm for deriving proofs for complex mathematical problems. This tool is especially powerful for attacking combinatorial problems, as exemplified by the proof of the four color theorem by Appel and Haken (simplified later by Robertson, Sanders, Seymour, and Thomas) or the recent important advance on the Erd\H{o}s discrepancy problem by Konev and Lisitsa using computer programs. We utilize a massively parallel algorithm and thus turn an otherwise intractable portion of our proof into a program which requires approximately a year of computation time, bringing the use of computer-assisted proofs to a new scale. We fully detail the algorithm employed by our code, and make the code freely available online