Previous studies have provided evidence that automatic emotion regulation, which is primed by control goals, can change emotion trajectory unconsciously. However, the cognitive mechanism and associated changes in depression remain unclear. The current study aimed to examine whether subliminal goal priming could change the emotional response inhibition among patients with major depressive disorder and their healthy controls. A group of patients with depression and a healthy control group were both primed subliminally by playing control goal related or neutral words for (...) 20 ms each; afterward, they judged the gender of happy or angry faces in an emotional Go/No-Go task. A group of depressed patients and a healthy control group both were both primed subliminally with control goal-related words or neutral words, and they judged the gender of happy or angry faces in an emotional Go/No-Go task. Among patients with depression, there were fewer false alarms of the No-Go response to emotional stimulus after priming with control goal rather than neutral words. Meanwhile, patients with MDD in the subliminal regulation goal priming condition reacted faster to happy rather than angry faces; no significant difference was found in the subliminal neutral priming condition. These findings suggest the malleability of inhibitory control in depression using subliminal priming goals. (shrink)

賈伯斯如果向莊子大力推銷iPhone，莊子會不會買？ 牛頓如果問莊子「蘋果為什麼不往上掉」，莊子會怎麼回答？跳脫學術窠臼、摒除艱深文句， 讀懂莊子、活用莊子之術，一本最好讀實用的莊子工具書！ 貴賤窮達、生涯抉擇、欲望滿足、情緒管理、生態環保… 張忠謀、王菲、成龍、梭羅、比爾．蓋茲名人的際遇… 人世間的大智慧、小處世，兩千多年前的莊子已經給了我們最寶貴的建議！ ★80篇讓你我安然自在的心靈啟示錄，80種讓人生提神醒腦的紅塵逍遙術！ ★賈伯斯、蓋茲、牛頓、柏拉圖……古今中外名人賢哲共同見證莊子的智慧！ ★縱橫兩岸文壇的心靈醫生王溢嘉，分享影響人生最重要的經典思想鉅著！ 滾滾紅塵，浪裡有多少浮沉？ 悠悠天地，你我該何處來去？ 體會深刻彌新的大智慧，掙脫感官與思維的重重枷鎖。 讓莊子陪你逍遙走紅塵，重新關照、定位自己的人生。 「我對莊子情有獨鍾，而且深受其惠，我很樂意將我的一些心得作全盤性、有系統的整理，提供給有興於想要做自己、參透生命奧義、逍遙紅塵的人做參考。 也正因為如此，我對《莊子》一書不做學術上或文本方面的討論，而純粹從一個現代知識分子的角度來閱讀與觀想，談的是《莊子》這本書或莊子這個人讓我產生什麼樣的感觸，以及能為現代人帶來什麼樣的啟發，好似他就是在 你我身邊，陪伴我們走過滾滾紅塵的一個智慧老人。」 ── 王溢嘉 從莊子的時代到此時現在，世界並沒有太大不同，但人們卻依舊在人與事的利害糾葛裡，無能釐清眼前的路。王溢嘉以一個現代知識分子的角度出發，整理出與現代人諸般處境相對應的觀點，用新穎、活潑的方式，重新歸納、整 理莊子深刻彌新，讓你我逍遙自在的生命智慧。 早一點讓莊子陪你走紅塵，人生就少了許多疑惑、困頓與痛苦，對迷惘的現代人更有提神醒腦、震聾啟瞶的作用。.

Many parameterized problems ask, given an instance and a natural number k as parameter, whether there is a solution of size k. We analyze the relationship between the complexity of such a problem and the corresponding maximality problem asking for a solution of size k maximal with respect to set inclusion. As our results show, many maximality problems increase the parameterized complexity, while “in terms of the W-hierarchy” minimality problems do not increase the complexity. We also address the corresponding construction, (...) listing, and counting problems. (shrink)

We observe that the W*-hierarchy, a variant (introduced by Downey, Fellows, and Taylor [7]) of the better known W-hierarchy, coincides with the W-hierarchy, though not level wise, but just as a whole hierarchy. More precisely, we prove that W[t] ⊆ W*[t] ⊆ W[2t − 2] for each t ≥ 2. It was known before that W[1] = W*[1] and W[2] = W*[2]. Our second main result is a new logical characterization of the W*-hierarchy in terms of "Fagin-definable problems." As a (...) by-product, we also obtain an improvement of our earlier characterization of the hierarchy in terms of model-checking problems. Furthermore, we obtain new complete problems for the classes W[3] and W*[3]. (shrink)

Let $\mathscr {C}$ be a class of finite and infinite graphs that is closed under induced subgraphs. The well-known Łoś–Tarski Theorem from classical model theory implies that $\mathscr {C}$ is definable in first-order logic by a sentence $\varphi $ if and only if $\mathscr {C}$ has a finite set of forbidden induced finite subgraphs. This result provides a powerful tool to show nontrivial characterizations of graphs of small vertex cover, of bounded tree-depth, of bounded shrub-depth, etc. in terms of forbidden (...) induced finite subgraphs. Furthermore, by the Completeness Theorem, we can compute from $\varphi $ the corresponding forbidden induced subgraphs. This machinery fails on finite graphs as shown by our results: – There is a class $\mathscr {C}$ of finite graphs that is definable in first-order logic and closed under induced subgraphs but has no finite set of forbidden induced subgraphs. – Even if we only consider classes $\mathscr {C}$ of finite graphs that can be characterized by a finite set of forbidden induced subgraphs, such a characterization cannot be computed from a first-order sentence $\varphi $ that defines $\mathscr {C}$ and the size of the characterization cannot be bounded by $f(|\varphi |)$ for any computable function f. Besides their importance in graph theory, the above results also significantly strengthen similar known theorems for arbitrary structures. (shrink)

Leonid Levin showed that every algorithm computing a function has an optimal inverter. Recently, we applied his result in various contexts: existence of optimal acceptors, existence of hard sequences for algorithms and proof systems, proofs of Gödel’s incompleteness theorems, analysis of the complexity of the clique problem assuming the nonuniform Exponential Time Hypothesis. We present all these applications here. Even though a simple diagonalization yields Levin’s result, we believe that it is worthwhile to be aware of the explicit result. The (...) purpose of this survey is to convince the reader of our view. (shrink)

Assume that the problem P0 is not solvable in polynomial time. Let T be a first-order theory containing a sufficiently rich part of true arithmetic. We characterize T∪{ConT} as the minimal extension of T proving for some algorithm that it decides P0 as fast as any algorithm B with the property that T proves that B decides P0. Here, ConT claims the consistency of T. As a byproduct, we obtain a version of Gödelʼs Second Incompleteness Theorem. Moreover, we characterize problems (...) with an optimal algorithm in terms of arithmetical theories. (shrink)

The undecidability of first-order logic implies that there is no computable bound on the length of shortest proofs of valid sentences of first-order logic. Some valid sentences can only have quite long proofs. How hard is it to prove such "hard" valid sentences? The polynomial time tractability of this problem would imply the fixed-parameter tractability of the parameterized problem that, given a natural number n in unary as input and a first-order sentence φ as parameter, asks whether φ has a (...) proof of length ≤ n. As the underlying classical problem has been considered by Gödel we denote this problem by p-Gödel. We show that p-Gödel is not fixed-parameter tractable if DTIME(h O(1) ) ≠ NTIME(h O(1) ) for all time constructible and increasing functions h. Moreover we analyze the complexity of the construction problem associated with p-Gödel. (shrink)

We give the first systematic study of strong isomorphism reductions, a notion of reduction more appropriate than polynomial time reduction when, for example, comparing the computational complexity of the isomorphim problem for different classes of structures. We show that the partial ordering of its degrees is quite rich. We analyze its relationship to a further type of reduction between classes of structures based on purely comparing for every n the number of nonisomorphic structures of cardinality at most n in both (...) classes. Furthermore, in a more general setting we address the question of the existence of a maximal element in the partial ordering of the degrees. (shrink)

Engineering failure investigations seek to reconstruct the actual causes of major engineering failures. The investigators need to establish the existence of certain past events and the actual causal relationships that these events bear to the failures in question. In this paper, I examine one method for reconstructing the actual causes of failure events, which I call "feature dependence". The basic idea of feature dependence is that some features of an event are informative about the features of its causes; therefore, the (...) investigators can use the features of a known failure event to reconstruct details of its causes. I make explicit the structure of feature dependence and the evidential basis of its key premises, and show how feature dependence works in the investigation of the American Airlines Flight 191 accident. (shrink)

Noted logician and philosopher addresses various forms of mathematical logic, discussing both theoretical underpinnings and practical applications. After historical survey, lucid treatment of set theory, model theory, recursion theory and constructivism and proof theory. Place of problems in development of theories of logic, logic’s relationship to computer science, more. Suitable for readers at many levels of mathematical sophistication. 3 appendixes. Bibliography. 1981 edition.

本书按文章的相关相近性质分为三卷:第一卷的主要内容是专著美感教育研究和有关美学美育,现实美,自然美诸问题的文章;第二卷既有论述马克思主义经典作家关于悲剧,艺术的不朽魅力和美的规律等方面的思想的文章,又 有探讨我国古代美学思想,特别是音乐美学思想的文章,还有评述马克思主义美学家蔡仪美学思想的一组文章;第三卷的主要部分是探讨体育与美育的关系以及体育运动美的特点,种类和欣赏等问题的论著,还有关于社会主义文 学与人道主义,与人情,与意识形态性等的关系的文章.

Wang Hui asks what it means for China to be modern and for modernity to be Chinese. Is there a rupture between tradition and modernity in China? How has Confucian thought evolved? Did China become modern in the Middle Ages? A deep intellectual history, The Rise of Modern Chinese Thought revises our senses of both modernity and Chinese philosophy.

本書採取史論結合的研究方法，堅持邏輯與歷史統一的原則，從儒學發展史的角度及易學哲學的高度，提煉出陳法哲學思想研究的若干重要命題，並以此為基礎展開系統研究；同時注重研究的學理性，緊密貼近陳法思想的本原， 既深入挖掘陳法哲學思想豐富的內涵，又充分展現其獨特個性色彩。本書使陳法哲學思想的原貌得以完整呈現，為系統研究中國易學和儒學發展史，為進一步深入研究貴州地方思想文化，提供有益參考和借鑒。.

Too often Buddhism has been subjected to the Procrustean box of western thought, whereby it is stretched to fit fixed categories or had essential aspects lopped off to accommodate vastly different cultural norms and aims. After several generations of scholarly discussion in English-speaking communities, it is time to move to the next hermeneutical stage. Buddhist philosophy must be liberated from the confines of a quasi-religious stereotype and judged on its own merits. Hence this work will approach Chinese Buddhism as a (...) philosophical tradition in its own right, not as an historical after-thought nor as an occasion for comparative discussions that assume the west alone sets the standards for or is the origin of philosophy and its methodologies. Viewed within their own context, Chinese Buddhist philosophers have much to contribute to a wide range of philosophical concerns, including metaphysics, epistemology, ethics, philosophy of language, philosophy of mind, and philosophy of religion, even though Western divisions of philosophy may not exhaust the rich contents of Chinese Buddhist Philosophy. (shrink)

作者通过讲述古希腊罗马哲学家丰富的思想和观点,探讨西方哲学精神的起源,揭示西方民族的精神取向,阐明西方民族思维方式的特征,帮助读者把握西方哲学的基本精神,养成理论思维的能力,培养高尚的情操,全面提高人 文素质.

This article uses a Chinese narrative of ‘nature-human harmony’ as the main thread to connect the contributions of ontological anthropology. I argue that the best of the critiques of nature-human or nature-culture dualism in social anthropology propose rebuilding a world that ‘pursues harmony while preserving difference’ in the double sense of nature and culture. Given that most social scientific problems are indeed related to utilitarian individualism, I argue that research on ‘ontology’ should re-engage the ancient notion of ‘ ji’, construed (...) as ‘others-comprised self’, which forms the foundation of a perspective of ‘broad human relationship’ between humans and their others (other humans, things, and divinities). Perspectivism inherits many categories of Western cosmology that it critiques and represents a kind of inert ontology. Grounded in the cosmology of life ( sheng), we hope to contribute to a new anthropology of the compatibility between self/others and subject/objects. (shrink)