Is the news making us unhappy? The influence of daily news exposure on emotional states

There is evidence that exposure to negative news is making people feel bad, but not much is known about why this only affects some people or whether this also applies to everyday news exposure. This study examined the direct and indirect effects of daily news exposure on people's affective states. Using ecological momentary assessment (EMA), 63 respondents (24 men and 39 women) reported their news exposure and affective states five times a day for 10 days. In addition, personal relevance of the news and personality characteristics, neuroticism and extraversion, were assessed. Results showed that negative news perceptions were related to more negative affect and less positive affect, and these effects were moderated by personal relevance, but not personality characteristics. The implications of these outcomes are discussed.     

老年人记忆补偿的长期稳定性和变异性：来自维多利亚纵向研究的证据

两种记忆状况组来自于参与加拿大维多利亚纵向研究(VLS)的老年人原样本。一种是未受损伤的控制组(NIC), 另一种是轻度记忆损伤组(MMD)。在基线水平和纵向水平上(即5次追踪或12年)比较了他们在日常生活中对记忆补偿技术的使用。我们使用多水平模型(以年龄和教育水平为协变量)来检验基线水平的差异和长期的变化模式。基线的结果表明MMD组被试报告了近期在日常生活中使用记忆补偿策略方面有更大的增长。纵向的结果表明记忆补偿的使用在12年中具有明显的稳定性, 但是与努力相关的补偿机制存在显著组间差异。教育水平这一协变量(可认为是潜在的认知储备指标)和三种记忆补偿策略随时间的不同变化相关。     

Classical Non-Associative Lambek Calculus

We introduce non-associative linear logic, which may be seen as the classical version of the non-associative Lambek calculus. We define its sequent calculus, its theory of proof-nets, for which we give a correctness criterion and a sequentialization theorem, and we show proof search in it is polynomial.     

Satisfiability Testing for Boolean Formulas Using Δ-trees

The tree-based data structure of -tree for propositional formulas is introduced in an improved and optimised form. The -trees allow a compact representation for negation normal forms as well as for a number of reduction strategies in order to consider only those occurrences of literals which are relevant for the satisfiability of the input formula. These reduction strategies are divided into two subsets (meaning- and satisfiability-preserving transformations) and can be used to decrease the size of a negation normal form A at (at most) quadratic cost. The reduction strategies are aimed at decreasing the number of required branchings and, therefore, these strategies allow to limit the size of the search space for the SAT problem.