Previous self-harm is a major predictor of non-fatal repetition and subsequent suicide. Owens et al (pp. 193–199), in a systematic review, estimate the rates of these outcomes following self-harm and find the link between self-harm and suicide to be a strong one. Non-fatal repetition occurred in around 15% of people in the year after an attempt, with up to 2% committing suicide over this time. ...

A stroma-dependent cell line (HB-1) was established from myelogenous leukemic cells of CBA/N mouse. Characterization of the cells showed that HB-1 proliferated on hematopoietic supportive stromal cells (MS-10), but did not survive or proliferate on hematopoietic nonsupportive cells (MS-K). Direct contact between HB-1 and MS-10 appears to be necessary for HB-1 to proliferate on MS-10. We found t...

We deal with the problem of preserving various versions of completeness in (< κ)–support iterations of forcing notions, generalizing the case " S–complete proper is preserved by CS iterations for a stationary co-stationary S ⊆ ω 1 ". We give applications to Uniformization and the Whitehead problem. In particular, for a strongly inaccessible cardinal κ and a stationary set S ⊆ κ with fat complem...

The KO(t)Bu-mediated annulation of acetonitrile with aldehyde was observed, in which the cleavage of four C(sp(3))-H bonds occurred and a total of eight new bonds were formed during the synthesis of substituted dihydropyridinones in the presence of peroxide. Furthermore, dihydropyridinones have been transformed into pyridinones using KO(t)Bu in DMSO.

Do the partial order and ortholattice operations of a quantum logic correspond to the logical implication and connectives of classical logic? Re-phrased, how far might a classical understanding of quantum mechanics be, in principle, possible? A celebrated result by Kochen and Specker answers the above question in the negative. However, this answer is just one among different possible ones, not ...

Motivated by problems of comparative genomics and paleogenomics, we introduce the Gapped Consecutive-Ones Property Problem (k,δ)-C1P: given a binary matrix M and two integers k and δ, can the columns of M be permuted such that each row contains at most k sequences of 1’s and no two consecutive sequences of 1’s are separated by a gap of more than δ 0’s. The classical C1P problem, which is known ...

We investigate the complexity of bit counting algorithms in different sets of instructions.