基于不对称区间估计的有调节的中介模型检验

有调节的中介模型是中介过程受到调节变量影响的模型。评介了基于Bootstrap不对称置信区间和贝叶斯不对称可靠区间进行有调节的中介模型检验的3种方法, 包括亚组分析法、差异分析法和系数乘积法。模拟研究发现, 偏差校正的百分位Bootstrap置信区间和无先验信息的贝叶斯可靠区间在有调节的中介模型检验中表现相当, 都优于百分位Bootstrap置信区间的表现。建议使用系数乘积法进行第一阶段或第二阶段被调节的中介模型检验, 使用差异分析法进行两阶段被调节的中介模型检验, 并用一个实际例子演示如何用不对称区间估计检验有调节的中介模型。随后评述了3种有调节的中介模型检验方法在国内心理学的应用现状, 并展望了检验的拓展方向。     

Elimination problems in logic: a brief history

A common aim of elimination problems for languages of logic is to express the entire content of a set of formulas of the language, or a certain part of it, in a way that is more elementary or more informative. We want to bring out that as the languages for logic grew in expressive power and, at the same time, our knowledge of their expressive limitations also grew, elimination problems in logic underwent some change. For languages other than that for monadic second-order logic, there remain important open problems.     

Improving Independence of Elderly People by Introducing Smart Products: The Guide Me Localization Case

What are the potential benefits of introducing technological innovations when working on issues with a wider societal impact? Focusing on a specific care and housing corporation for elderly people, the Sustainable System Innovation process has been used to translate an innovation challenge on macro societal level: “How can we deal with the challenges that occur due to the aging of society?” to a concrete innovation challenge on microtechnological and user level: “How can a tracking device be designed for optimal use by elderly person and care giver?”     

What is Classical Mereology?

Classical mereology is a formal theory of the part-whole relation, essentially involving a notion of mereological fusion, or sum. There are various different definitions of fusion in the literature, and various axiomatizations for classical mereology. Though the equivalence of the definitions of fusion is provable from axiom sets, the definitions are not logically equivalent, and, hence, are not inter-changeable when laying down the axioms. We examine the relations between the main definitions of fusion and correct some technical errors in prominent discussions of the axiomatization of mereology. We show the equivalence of four different ways to axiomatize classical mereology, using three different notions of fusion. We also clarify the connection between classical mereology and complete Boolean algebra by giving two “neutral” axiom sets which can be supplemented by one or the other of two simple axioms to yield the full theories; one of these uses a notion of “strong complement” that helps explicate the connections between the theories.     

How successful would a phone‐pillow be: Using dual process theory to predict the success of hybrids involving dissimilar products

Drawing on dual process theory from psycholinguistics, results reveal that, in order for respondents to develop preferences for hybrids from dissimilar categories the products underlying the hybrid need to be structurally aligned based on links between individual functions, and that these links also need to be situated in concrete consumer goals (study 1). In addition, it was found that category similarity interacts with these two factors (study 2). Specifically, prompting the potential consumer to think about structural alignment and consumer goals increased the success of hybrids made up of dissimilar products, but decreased the success of hybrids involving similar products.     

The countable homogeneous universal model of B 2

We give a detailed account of the Algebraically Closed and Existentially Closed members of the second Lee class B ₂ of distributive p-algebras, culminating in an explicit construction of the countable homogeneous universal model of B ₂. The axioms of Schmid [7], [8] for the AC and EC members of B ₂ are reduced to what we prove to be an irredundant set of axioms. The central tools used in this study are the strong duality of Clark and Davey [3] for B ₂ and the method of Clark [2] for constructing AC and EC algebras using a strong duality. Applied to B ₂, this method transfers the entire discussion into an equivalent dual category X ₂ of Boolean spaces which carry a pair of tightly interacting orderings. The doubly ordered spaces of X ₂ prove to be much more readily constructed and analyzed than the corresponding algebras in B ₂.     

Teacher Use Of Interventions In General Education Settings: Measurement And Analysis Of The Independent Variable

This study examined the integrity with which 4 general education teachers implemented an intervention designed to improve the academic performance of elementary school students. Treatment integrity was measured daily using permanent products. The results showed that the 4 teachers markedly increased the integrity of the delivered treatment when they were provided with performance feedback. The results suggest that academic performance improved for the group of students as integrity improved.     

Projection of a binary criterion into a model of hierarchical classes

A formal analysis is made of how to project an attribute criterion into the hierarchical classes model for object by attribute data proposed by De Boeck and Rosenberg. The projection is conceptualized as the prediction of the attribute criterion by means of a logical rule defined on the basis of attribute combinations from the model. Eliminative and constructive strategies are proposed to find logical rules with maximal predictive power and minimal formula complexity. Logical analyses of a real data set are reported and compared with a logistic regression to demonstrate the usefulness of the logical strategies, and to show the complementarity of logical and probabilistic approaches.The first suthor is Senior Research Assistant of the National Fund for Scientific Research (Belgium). We would like to thank the Editor, the reviewers, Seymour Rosenberg, and Luc Delbeke for their helpful comments on earlier drafts of this article.     

The Classification of Propositional Calculi

We discuss Smirnovs problem of finding a common background for classifying implicational logics. We formulate and solve the problem of extending, in an appropriate way, an implicational fragment H of the intuitionistic propositional logic to an implicational fragment TV of the classical propositional logic. As a result we obtain logical constructions having the form of Boolean lattices whose elements are implicational logics. In this way, whole classes of new logics can be obtained. We also consider the transition from implicational logics to full logics. On the base of the lattices constructed, we formulate the main classification principles for propositional logics.