Development of a facial-expression database of Chinese Han,Hui and Tibetan people

Recently, cross-cultural facial-expression recognition has become a research hotspot, and a standardised facial-expression material system can significantly help researchers compare and demonstrate the results of other studies. We developed a facial-expression database of Chinese Han, Hui and Tibetan ethnicities. In this study, six basic human facial expressions (and one neutral expression) were collected from 200 Han, 220 Hui and 210 Tibetan participants who lived in these regions. Four experts on each ethnicity evaluated the facial-expression images according to the expressions, and only those achieving inter-rater agreement were retained. Subsequently, 240 raters evaluated these images according to the seven emotions and rated the intensity of the expressions. Consequently, 2980 images were included in the database, including 930 images of Han individuals, 962 images of Hui individuals and 1088 images of Tibetan individuals. In conclusion, the facial-expression database of Chinese Han, Hui and Tibetan people was representative and reliable with a recognition rate of over 60%, making it well-suited for cross-cultural research on emotions.     

睡眠不足对人际交互的影响及其认知神经机制

睡眠不足会对人的认知、情感和人际交互产生诸多影响。这种影响在社会情绪层面表现为个体情绪共情和认知共情的减少,易激惹性与愤怒情绪的增加;在社会行为层面则表现为亲社会行为的减少和攻击行为的增加。在睡眠不足状态下,情绪系统和认知系统功能连接的减弱可能是这些变化的潜在机制。未来应结合生态效度较高的睡眠操作手段,系统考察睡眠不足如何导致各种高级社会情绪的改变,以及这些社会情绪的变化如何导致社会行为的变化。     

The Relation of Altruistic Orientation to Human Relationships and Moral Judgment in Chinese People

The altruistic orientation and moral judgment of 811 Chinese subjects were studied. Three hypotheses were examined: (1) The altruistic orientation of an actor at any level of moral judgment is larger to a recipient of closer relationship in any situation; (2) an actor at a higher level of moral judgment would be more willing to sacrifice their life for any recipient than an actor at a lower level of moral judgment; (3) an actor at a higher level of moral judgment would be less willing to: (a) Give up rescuing a stranger and turn to rescue close relatives or best friends; or (b) help close relatives or best friends by covering up their crime than an actor at a lower level of moral judgment. The empirical findings supported clearly the aforementioned hypotheses.     

儿童理解数量词“几个”、“很多”的发展特点

本工作采用了一种研究儿童理解不精确量词的经验方法,初步探讨了四岁至十岁儿童理解数量词“几个”、“很多”的发展特点。结果提示:儿童对两个数量词的理解与实验给出的论域(数量范围)关系密切;数量词“几个”比“很多”较早被年幼儿童所理解。其发展特点:四岁至十岁儿童在[0,10],[0,20]范围上,均能较好理解“几个”;六岁以上儿童只能在[0,10]的范围上理解“很多”的词义;四岁儿童则表现出把“很多”与“全部”混同。     

Formalization of functionally complete propositional calculus with the functor of implication as the only primitive term

The most difficult problem that Leniewski came across in constructing his system of the foundations of mathematics was the problem of defining definitions, as he used to put it. He solved it to his satisfaction only when he had completed the formalization of his protothetic and ontology. By formalization of a deductive system one ought to understand in this context the statement, as precise and unambiguous as possible, of the conditions an expression has to satisfy if it is added to the system as a new thesis. Now, some protothetical theses, and some ontological ones, included in the respective systems, happen to be definitions. In the present essay I employ Leniewski's method of terminological explanations for the purpose of formalizing ukasiewicz's system of implicational calculus of propositions, which system, without having recourse to quantification, I first extended some time ago into a functionally complete system. This I achieved by allowing for a rule of implicational definitions, which enabled me to define any propositionforming functor for any finite number of propositional arguments.To the memory of Jerzy Supecki     

Categorical and algebraic aspects of Martin-Löf Type Theory

In the paper there are introduced and discussed the concepts of an indexed category with quantifications and a higher level indexed category to present an algebraic characterization of some version of Martin-Löf Type Theory. This characterization is given by specifying an additional equational structure of those indexed categories which are models of Martin-Löf Type Theory. One can consider the presented characterization as an essentially algebraic theory of categorical models of Martin-Löf Type Theory. The paper contains a construction of an indexed category with quantifications from terms and types of the language of Martin-Löf Type Theory given in the manner of Troelstra [11]. The paper contains also an inductive definition of a valuation of these terms and types in an indexed category with quantifications.     

主观轮廓与明度对比的实验研究

本实验以被试的反应时为指标,用速示器呈现实验刺激,通过系统改变诱导区域的面积和反射率对主观轮廓知觉进行了研究。实验结果表明:随着主观轮廓图形诱导面积的减小和诱导部分反射率的增加,明度对比减弱,被试的反应时增加,并且各反应时之间存在显著差异。这表明诱导部分的面积和反射率都以明度对比为中介引起了主观轮廓知觉的系统改变。这说明视觉系统中侧抑制引起的明度对比在主观轮廓知觉中起重要作用。     

On a problem of P(α, δ, π) concerning generalized Alexandroff s cube

Universality of generalized Alexandroff's cube plays essential role in theory of absolute retracts for the category of , -closure spaces. Alexandroff's cube. is an , -closure space generated by the family of all complete filters. in a lattice of all subsets of a set of power .Condition P(, , ) says that is a closure space of all , -filters in the lattice ( ), .Assuming that P (, , ) holds, in the paper [2], there are given sufficient conditions saying when an , -closure space is an absolute retract for the category of , -closure spaces (see Theorems 2.1 and 3.4 in [2]).It seems that, under assumption that P (, , ) holds, it will be possible to givean uniform characterization of absolute retracts for the category of , -closure-spaces.Except Lemma 3.1 from [1], there is no information when the condition P (, , ) holds or when it does not hold.The main result of this paper says, that there are examples of cardinal numbers, , , such that P (, , ) is not satisfied.Namely it is proved, using elementary properties of Lebesgue measure on the real line, that the condition P (, ₁, 2 ) is not satisfied.Moreover it is shown that fulfillment of the condition is essential assumption in, Theorems 2.1 and 3.4 from [1] i.e. it cannot be eliminated.     

On decidable consequence operators

The main theorem says that a consequence operator is an effective part of the consequence operator for the classical prepositional calculus iff it is a consequence operator for a logic satisfying the compactness theorem, and in which every finitely axiomatizable theory is decidable.