OBJECTIVE At times, caregivers make life-and-death decisions for loved ones. Yet very little is known about the factors that make caregivers more or less accurate as surrogate decision makers for their loved ones. Previous research suggests that in low stress situations, individuals with high attachment-related anxiety are attentive to their relationship partners' wishes and concerns, but get o...

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.

In this paper we address the problem of identifying what local properties the sub-components of a system have to satisfy in order to guarantee a (security) property on the behaviour of the whole system. We associate each action with a value. Hence, we end up with quantitative properties on them, which are specified through a modal logic equipped with a parametric algebraic structure (i.e., a c-...