The widely used evidence-based police interviewing technique, the Cognitive Interview, is not effective for witnesses with autism spectrum disorder (ASD). The present study examined whether a modification of the Cognitive Interview that removes the social element, the Self-Administered Interview, is more useful in facilitating recall by ASD witnesses. One of the main components of the Cognitive...

Acute promyelocytic leukemia (APL) is a hyper-acute leukemia and presents with cytopenias and disseminated intravascular coagulation. Jehovah’s Witnesses with APL offer a unique challenge during induction by refusing transfusion and pose a difficult challenge in this curable disease. Our focus over the last 8 years has been decreasing early deaths in APL in both academic and community centers. ...

BACKGROUND Infants born at 23 weeks' gestation have a poor prognosis and require intensive care, including blood transfusions, to survive. Generally speaking, the decision to forgo life support is acceptable. Jehovah's Witnesses believe that life is sacred and want lifesaving interventions except for blood transfusions. Therefore, an ethical dilemma exists when a baby is born on the edge of via...

OBJECTIVES To establish the prevalence and distribution of witnesses, victims, and perpetrators of different types of violence in the general population and the proportion of victims consulting health services or reporting the incident to authorities. METHODS Cross sectional survey of a random sample of 3007 inhabitants between the ages of 15 and 60 in the city of Bogotá, Colombia, in 1997, b...

We propose an improvement of the famous IC3 algorithm for model checking safety properties of finite state systems. We collect models computed by the SAT-solver during the clause propagation phase of the algorithm and use them as witnesses for why the respective clauses could not be pushed forward. It only makes sense to recheck a particular clause for pushing when its witnessing model falsifie...

We consider the problem of finding the smallest proof of unsatisfiability of a 2CNF formula. In particular, we look at Resolution refutations and at minimum unsatisfiable subsets of the clauses of the CNF. We give a characterization of minimum tree-like Resolution refutations that explains why, to find them, it is not sufficient to find shortest paths in the implication graph of the CNF. The ch...

The interest on quantum entanglement has dramatically increased during the last two decades due to the emerging field of quantum information theory [1, 2]. It turns out that quantum entanglement may be used as basic resources in quantum information processing and communication. The prominent examples are quantum cryptography, quantum teleportation, quantum error correction codes and quantum com...

We instrument a higher-order logic programming search procedure to generate and check small proof witnesses for the Twelf system, an implementation of the logical framework LF. In particular, we extend and generalize ideas from Necula and Rahul [16] in two main ways: 1) We consider the full fragment of LF including dependent types and higher-order terms and 2) We study the use of caching of sub...

Given a satisfiable 3-SAT formula, how hard is it to find an assignment to the variables that has Hamming distance at most n/2 to a satisfying assignment? More generally, consider any polynomial-time verifier for any NP-complete language. A d(n)-Hammingapproximation algorithm for the verifier is one that, given any member x of the language, outputs in polynomial time a string a with Hamming dis...