Electroencephalogram has been widely utilized in emotion recognition. Psychologists have found that emotions can be divided into conscious emotion and unconscious emotion. In this article, we explore to classify subliminal emotions with EEG signals elicited by subliminal face stimulation, that is to select appropriate features to classify subliminal emotions. First, multi-scale sample entropy, wavelet packet energy, and wavelet packet entropy of EEG signals are extracted. Then, these features are fed into the decision tree and improved random forest, respectively. The classification (...) accuracy with Ei and WpEn is higher than MSpEn, which shows that Ei and WpEn can be used as effective features to classify subliminal emotions. We compared the classification results of different features combined with the decision tree algorithm and the improved random forest algorithm. The experimental results indicate that the improved random forest algorithm attains the best classification accuracy for subliminal emotions. Finally, subliminal emotions and physiological proof of subliminal affective priming effect are discussed. (shrink)

Du Weiming xian sheng shi dang dai yan jiu he chuan bo ru jia wen hua de zhong yao si xiang jia. Ta 1940 nian chu sheng yu Kunming, xian hou qiu xue yu Taiwan dong hai da xue he Meiguo Hafo da xue, ren jiao yu Pulinsidun da xue, Bokeli Jiazhou da xue. Zi 1981 nian, Du Weiming xian sheng yi zhi zai Hafo da xue Dong Ya xi dan ren li shi ji zhe xue jiao shou,qi jian huo (...) xuan Meiguo ren wen she hui ke xue yuan yuan shi, hai ceng dan ren Hafo Yanjing xue she she zhang. Chang qi yi lai, Du Weiming xian sheng zhi li yu ru xue di 3 qi fa zhan, quan shi Zhongguo wen hua, fan si xian dai jing shen, chang dao wen ming dui hua, zai hai nei wai xiang you hen gao de xue shu sheng yu. Du xian sheng fei chang re xin Zhongguo you xiu chuan tong wen hua zai ben tu de chuan bo, duo ci hui guo can jia jiao yu he xue shu jiao liu huo dong. Ta yu Beijing da xue you zhe te shu de yuan fen,zao zai 1985 nian jiu lai Beijing da xue jiang shou ru jia zhe xue. Zui jin Du Weiming xian sheng yi zheng shi shou pin wei Beijing da xue gao deng ren wen yan jiu yuan yuan zhang. (shrink)

This article explores micro- and macro-level variables that influence the incidence of bribery payouts by firms. A rich data set with information from 55 countries was utilized to achieve this objective. Results of logit regression models indicate that there are a number of micro- and macro-level factors that significantly affect the incidence of bribery payouts. This suggests that it is not only the characteristics of a firm but also the environment of doing business that affect the firm's bribery decision. The (...) results of this study provides information that may help firms develop strategies to reduce corruption in their respective industries and thereby improve their image of corporate social responsibility. The analysis also points to possible policy directions that governments could undertake in order to reduce the incidence of bribery in their country. (shrink)

In this paper, we propose a decidable single-agent modal logic for reasoning about goal-directed “knowing how”, based on ideas from linguistics, philosophy, modal logic, and automated planning in AI. We first define a modal language to express “I know how to guarantee \ given \” with a semantics based not on standard epistemic models but on labeled transition systems that represent the agent’s knowledge of his own abilities. The semantics is inspired by conformant planning in AI. A sound and complete (...) proof system is given to capture valid reasoning patterns, which highlights the compositional nature of “knowing how”. The logical language is further extended to handle knowing how to achieve a goal while maintaining other conditions. (shrink)

In the literature, different axiomatizations of Public Announcement Logic (PAL) have been proposed. Most of these axiomatizations share a “core set” of the so-called “reduction axioms”. In this paper, by designing non-standard Kripke semantics for the language of PAL, we show that the proof system based on this core set of axioms does not completely axiomatize PAL without additional axioms and rules. In fact, many of the intuitive axioms and rules we took for granted could not be derived from the (...) core set. Moreover, we also propose and advocate an alternative yet meaningful axiomatization of PAL without the reduction axioms. The completeness is proved directly by a detour method using the canonical model where announcements are treated as merely labels for modalities as in normal modal logics. This new axiomatization and its completeness proof may sharpen our understanding of PAL and can be adapted to other dynamic epistemic logics. (shrink)

In this paper1, we develop an epistemic logic to specify and reason about the information flow on the underlying communication channels. By combining ideas from Dynamic Epistemic Logic (DEL) and Interpreted Systems (IS), our semantics offers a natural and neat way of modelling multi-agent communication scenarios with different assumptions about the observational power of agents. We relate our logic to the standard DEL and IS..

Epistemic logic has become a major field of philosophical logic ever since the groundbreaking work by Hintikka [58]. Despite its various successful applications in theoretical computer science, AI, and game theory, the technical development of the field has been mainly focusing on the propositional part, i.e., the propositional modal logics of “knowing that”. However, knowledge is expressed in everyday life by using various other locutions such as “knowing whether”, “knowing what”, “knowing how” and so on (knowing-wh hereafter). Such knowledge expressions (...) are better captured in quantified epistemic logic, as was already discussed by Hintikka [58] and his sequel works at length. This paper aims to draw the attention back again to such a fascinating but largely neglected topic. We first survey what Hintikka and others did in the literature of quantified epistemic logic, and then advocate a new quantifier-free approach to study the epistemic logics of knowing-wh, which we believe can balance expressivity and complexity, and capture the essential reasoning patterns about knowing-wh. We survey our recent line of work on the epistemic logics of ‘knowing whether”, “knowing what” and “knowing how” to demonstrate the use of this new approach. (shrink)

Epistemic protocols are communication protocols aiming at transfer of knowledge in a controlled way. Typically, the preconditions or goals for protocol actions depend on the knowledge of agents, often in nested form. Informal epistemic protocol descriptions for muddy children, coordinated attack, dining cryptographers, Russian cards, secret key exchange are well known. The contribution of this paper is a formal study of a natural requirement on epistemic protocols, that the contents of the protocol can be assumed to be common knowledge. By (...) formalizing this requirement we can prove that there can be no unbiased deterministic protocol for the Russian cards problem. For purposes of our formal analysis we introduce an epistemic protocol language, and we show that its model checking problem is decidable. (shrink)

When we say “I know why he was late”, we know not only the fact that he was late, but also an explanation of this fact. We propose a logical framework of “knowing why” inspired by the existing formal studies on why-questions, scientific explanation, and justification logic. We introduce the Kyi\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\mathcal {K}}{}\textit{y}}_i$$\end{document} operator into the language of epistemic logic to express “agent i knows why φ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} (...) \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varphi$$\end{document}” and propose a Kripke-style semantics of such expressions in terms of knowing an explanation of φ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\varphi$$\end{document}. We obtain two sound and complete axiomatizations w.r.t. two different model classes depending on different assumptions about introspection. Finally we connect our logic with justification logic technically by providing an alternative semantics and an in-depth comparison on various design choices. (shrink)

本书内容包括20世纪90年代以后的生态社会主义概述, 20世纪90年代以后的生态社会主义的新变化与动因, 20世纪90年代以后的生态社会主义的主要新观点——反思与批判, 生态社会主义的实践和启示等.

Recent years witnessed a growing interest in non-standard epistemic logics of knowing whether, knowing how, knowing what, knowing why and so on. The new epistemic modalities introduced in those logics all share, in their semantics, the general schema of ∃x◻φ, e.g., knowing how to achieve φ roughly means that there exists a way such that you know that it is a way to ensure that φ. Moreover, the resulting logics are decidable. Inspired by those particular logics, in this work, we (...) propose a very general and powerful framework based on quantifier-free predicate language extended by a new modality, which packs exactly ∃x◻ together. We show that the resulting language, though much more expressive, shares many good properties of the basic propositional modal logic over arbitrary models, such as finite-tree-model property and van Benthem-like characterization w.r.t.\ first-order modal logic. We axiomatize the logic over S5 frames with intuitive axioms to capture the interaction between the new modality and know-that operator in an epistemic setting. (shrink)

A proposition is noncontingent, if it is necessarily true or it is necessarily false. In an epistemic context, ‘a proposition is noncontingent’ means that you know whether the proposition is true. In this paper, we study contingency logic with the noncontingency operator? but without the necessity operator 2. This logic is not a normal modal logic, because?→ is not valid. Contingency logic cannot define many usual frame properties, and its expressive power is weaker than that of basic modal logic over (...) classes of models without reflexivity. These features make axiomatizing contingency logics nontrivial, especially for the axiomatization over symmetric frames. In this paper, we axiomatize contingency logics over various frame classes using a novel method other than the methods provided in the literature, based on the ‘almost-definability’ schema AD proposed in our previous work. We also present extensions of contingency logic with dynamic operators. Finally, we compare our work to the related work in the fields of contingency logic and ignorance logic, where the two research communities have similar results but are apparently unaware of each other’s work. One goal of our paper is to bridge this gap. (shrink)

In this paper, we first propose a simple formal language to specify types of agents in terms of necessary conditions for their announcements. Based on this language, types of agents are treated as ‘first-class citizens’ and studied extensively in various dynamic epistemic frameworks which are suitable for reasoning about knowledge and agent types via announcements and questions. To demonstrate our approach, we discuss various versions of Smullyan’s Knights and Knaves puzzles, including the Hardest Logic Puzzle Ever (HLPE) proposed by Boolos (...) (in Harv Rev Philos 6:62–65, 1996). In particular, we formalize HLPE and verify a classic solution to it. Moreover, we propose a spectrum of new puzzles based on HLPE by considering subjective (knowledge-based) agent types and relaxing the implicit epistemic assumptions in the original puzzle. The new puzzles are harder than the previously proposed ones in the literature, in the sense that they require deeper epistemic reasoning. Surprisingly, we also show that a version of HLPE in which the agents do not know the others’ types does not have a solution at all. Our formalism paves the way for studying these new puzzles using automatic model checking techniques. (shrink)

本卷收入胡适哲学与文化方面的论文、函牍、讲演、札记80余篇。其中包括实验主义、我们对于西洋近代文明的态度等重要文章。所收文章全面反映了胡适哲学思想、学术主张和对于中西文化的态度,对于了解和研究胡适本人 以及现代中国学术史、现代中国启蒙运动等内容。.

This chapter narrates the author's fascination with the intriguing and elusive face and image of Hannah Arendt—as well as her life story. Experience and world events transformed her inner and outer appearance, etching her life story on her face. Her life story was that of an intellectual Jewish woman who experienced the European turmoil of the 20th century and tried to understand the sources of human evil and violence. The author traced her portrait from a very young woman to her (...) old age. The source materials included unfamiliar photos of Arendt at different stages of her life. (shrink)

胡適（1891-1962），安徽績溪人。原名嗣穈，後改名胡適，字適之，曾用筆名希彊、臧暉等。新文化運動的奠基人與領袖之一，倡導約翰・杜威的實用主義。1917年回國任教北大，參與編輯《新青年》《努力周報 》《獨立評論》等雜誌，先後擔任中華民國駐美大使、國立北京大學校長、台北「中央研究院」院長等職，著有《中國哲學史大綱》《嘗試集》《胡適文存》等書，並獲諾貝爾文學獎提名。.

本书是研究马克思主义哲学的成果汇集。这些成果从马克思主义哲学的视域,对当代重大现实问题和理论问题进行了认真的研究.

內容簡介 二十世紀的「現象學運動」影響了存在哲學（存在主義）、哲學詮釋學、解構主義、現代美學、藝術哲學等等，以及所謂「後現代的文化思潮」之發展。 二十一世紀的今日，我們對「中華古典哲學」的反思，似乎可以從歐洲的現象學運動之思潮中，找到一些足以對話和互為理解的可能。 本書就試著嘗試這種互為理解與東西文化交涉的努力，希望提供給對這個話題有興趣的讀者們，開顯出一扇觀照內外在的哲學之門，而通過這扇門能夠走向人生的智慧之旅。.

Facsimile of miscellaneous Persian and Arabic texts in Mullā Ṣadrā's handwriting.

al-Masāʼil al-qudsīyah -- Mutashābihāt al-Qurʼān -- Ajwibat al-masāʼil.

This paper shows how propositional dynamic logic can be interpreted as a logic for multi-agent belief revision. For that we revise and extend the logic of communication and change of [9]. Like LCC, our logic uses PDL as a base epistemic language. Unlike LCC, we start out from agent plausibilities, add their converses, and build knowledge and belief operators from these with the PDL constructs. We extend the update mechanism of LCC to an update mechanism that handles belief change as (...) relation substitution, and we show that the update part of this logic is more expressive than either that of LCC or that of doxastic/epistemic PDL with a belief change modality. It is shown that the properties of knowledge and belief are preserved under any update, and that the logic is complete. © 2008 Springer-Verlag Berlin Heidelberg. (shrink)

人人都有一雙藝術家的眼睛。 「不論你曾崇仰何人何物，並以誰為師，最後你必須回到你自己本身。 藝術從未遠人，只是人遠離了他真正的自己。 在都市中，我們先失去了我們的眼睛，然後我們失去了一切。」－史作檉 本書為史作檉談論藝術美學文章集結，強調人人都有藝術家的眼睛，只在於人們失去了觀看的方式與純粹的初衷。 共分四大篇九章節，從藝術本質談起，援引賈克梅第、康丁斯基、蒙德里安、李德等藝術家創作，從繪畫、雕塑、音樂，旁述及顏氏篆書中的圖形特性，進臻至哲學美學、形上美學，淺明清晰，在一本書的閱讀時間裡就可在繁多 的藝術理論中找到自己的「眼睛」與觀看角度。.

本书分为神话与诉讼,历史与诉讼,故事与诉讼,制度法理,学术争鸣,法学教育,治学人生等八辑,收录了剧与诉的随想,正义之舞,游戏与诉讼,圣殿骑士的死亡密码,走向刑事宪法,法官权力之源与品格之治,法国法学教 育三题,关问于山水之间等文章.

Security properties naturally combine temporal aspects of protocols with aspects of knowledge of the agents. Since BAN-logic, there have been several initiatives and attempts to incorpórate epistemics into the analysis of security protocols. In this paper, we give an overview of work in the field and present it in a unified perspective, with comparisons on technical subtleties that have been employed in different approaches. Also, we study to which degree the use of epistemics is essential for the analysis of security (...) protocols. We look for formal conditions under which knowledge modalities can bring extra expressive power to pure temporal languages. On the other hand, we discuss the cost of the epistemic operators in terms of model checking complexity. (shrink)

Study on Trilaksaṇa, the four seals of the Buddhist doctrine.