BackgroundIndividuals with mind-wandering experience their attention decoupling from their main task at hand while others with flow experience fully engage in their task with the optimum experience. There seems to be a negative relationship between mind-wandering and flow. However, it remains unclear to what extent mind-wandering exerts an impact on flow. And it is also elusive whether physical activity and mindfulness, which are as important factors that affected individuals’ attentional control and psychological health, are beneficial in explaining the association between (...) mind-wandering and flow. The current study investigated the relationship between mind-wandering and flow, and the potential mediation effects of physical activity and mindfulness in this association.MethodsA cross-sectional exploratory study design, including multiple scales such as the Mind-Wandering Questionnaire, the International Physical Activity Questionnaire Short Form, Mindfulness Attention and Awareness Scale, and the Short Dispositional Flow Scale was applied. Descriptive statistics and bivariate correlation coefficients were applied in the analysis of these data. A multiple mediation model was used to examine the relationships between mind-wandering, flow, physical activity, and mindfulness.ResultsMind-wandering was inversely associated with physical activity, mindfulness and flow, respectively; and flow was positively related to physical activity and mindfulness, respectively. Moreover, multiple mediation results demonstrated that physical activity and mindfulness, respectively, mediated the relationship between mind-wandering and flow.ConclusionThese findings are helpful to understand how our minds attend to the present moment, and the crucial roles of physical activity and mindfulness in the association between mind-wandering and flow. An implication of these is the possibility that the effective strategies aimed at enhancing both the levels of physical activity and mindfulness are needed to reduce the negative impact of mind-wandering on flow. (shrink)

The ever-increasing application of algorithms to decision-making in a range of social contexts has prompted demands for algorithmic accountability. Accountable decision-makers must provide their decision-subjects with justifications for their automated system’s outputs, but what kinds of broader principles should we expect such justifications to appeal to? Drawing from political philosophy, I present an account of algorithmic accountability in terms of the democratic ideal of ‘public reason’. I argue that situating demands for algorithmic accountability within this justificatory framework enables us to (...) better articulate their purpose and assess the adequacy of efforts toward them. (shrink)

Decisions based on algorithmic, machine learning models can be unfair, reproducing biases in historical data used to train them. While computational techniques are emerging to address aspects of these concerns through communities such as discrimination-aware data mining and fairness, accountability and transparency machine learning, their practical implementation faces real-world challenges. For legal, institutional or commercial reasons, organisations might not hold the data on sensitive attributes such as gender, ethnicity, sexuality or disability needed to diagnose and mitigate emergent indirect discrimination-by-proxy, such (...) as redlining. Such organisations might also lack the knowledge and capacity to identify and manage fairness issues that are emergent properties of complex sociotechnical systems. This paper presents and discusses three potential approaches to deal with such knowledge and information deficits in the context of fairer machine learning. Trusted third parties could selectively store data necessary for performing discrimination discovery and incorporating fairness constraints into model-building in a privacy-preserving manner. Collaborative online platforms would allow diverse organisations to record, share and access contextual and experiential knowledge to promote fairness in machine learning systems. Finally, unsupervised learning and pedagogically interpretable algorithms might allow fairness hypotheses to be built for further selective testing and exploration. Real-world fairness challenges in machine learning are not abstract, constrained optimisation problems, but are institutionally and contextually grounded. Computational fairness tools are useful, but must be researched and developed in and with the messy contexts that will shape their deployment, rather than just for imagined situations. Not doing so risks real, near-term algorithmic harm. (shrink)

本书介绍了朱熹生活的时代、身世和经历,朱熹的经济思想、政治学说,朱熹哲学的逻辑结构,朱熹的史学思想、教育思想等内容。.

We investigate the notion of hyperimmunity with respect to how it can be applied to Π{\sp 0}{\sb 1} classes and their Muchnik degrees. We show that hyperimmunity is a strong enough concept to prove the existence of Π{\sp 0}{\sb 1} classes with intermediate Muchnik degree—in contrast to Post's attempts to construct intermediate c.e. degrees.

As government pressure on major technology companies builds, both firms and legislators are searching for technical solutions to difficult platform governance puzzles such as hate speech and misinformation. Automated hash-matching and predictive machine learning tools – what we define here as algorithmic moderation systems – are increasingly being deployed to conduct content moderation at scale by major platforms for user-generated content such as Facebook, YouTube and Twitter. This article provides an accessible technical primer on how algorithmic moderation works; examines some (...) of the existing automated tools used by major platforms to handle copyright infringement, terrorism and toxic speech; and identifies key political and ethical issues for these systems as the reliance on them grows. Recent events suggest that algorithmic moderation has become necessary to manage growing public expectations for increased platform responsibility, safety and security on the global stage; however, as we demonstrate, these systems remain opaque, unaccountable and poorly understood. Despite the potential promise of algorithms or ‘AI’, we show that even ‘well optimized’ moderation systems could exacerbate, rather than relieve, many existing problems with content policy as enacted by platforms for three main reasons: automated moderation threatens to further increase opacity, making a famously non-transparent set of practices even more difficult to understand or audit, further complicate outstanding issues of fairness and justice in large-scale sociotechnical systems and re-obscure the fundamentally political nature of speech decisions being executed at scale. (shrink)

The gradation of know-how is a prominent challenge to intellectualism. Know-how is prima facie gradable, whereas know-that is not, so the former is unlikely to be a species of the latter. Recently, Pavese refuted this challenge by explaining the gradation of know-how as concerning either the quantity or the quality of practical answers one knows to a question. Know-how per se remains absolute. This paper argues, however, that in addition to the quantity and quality of practical answers, know-how also differs (...) in how reliably the agent is supposed to fulfil the task given her default constitution. Intellectualism is still troubled by the gradability challenge. (shrink)

Ratio, Volume 34, Issue 4, Page 303-311, December 2021.

This article adopts Husserl’s transcendental phenomenology to explore the complex relationship between patients and physicians. It delves into the coexistence of two distinct voices in the realm of medicine and health: the “voice of medicine” and the “voice of life-world.” Divided into three sections, the article emphasizes the importance of shifting from a scientific-medical attitude to a more personalistic approach in physician–patient interactions. This shift aims to prevent depersonalization and desubjectification. Additionally, it highlights the equal and irreducible nature of patients (...) while acknowledging the vital role physicians hold in the realm of illness. The article stresses the need for a balanced and equitable relationship between both parties, rooted in the shared life-world. Moreover, empathy is underscored as a crucial element in fostering meaningful dialogue, wherein understanding diverse perspectives and attitudes towards illness is paramount. The article argues that differences between patients and physicians are necessary for empathy, while shared similarities form its foundation. Ultimately, a harmonious relationship facilitates empathy and enables the constitution of a new sense of life for both patients and physicians. (shrink)

张奎良(1937- ),辽宁新民人,中国马克思主义学会常务理事,东北地区马哲史学会会长等.

本书包括四大部分:甲部,哲学史前提的不完备性;乙部,语言的权限;丙部,记忆的承诺;丁部,偶在论。.

Let w and M be the countable distributive lattices of Muchnik and Medvedev degrees of non-empty Π1 0 subsets of 2ω, under Muchnik and Medvedev reducibility, respectively. We show that all countable distributive lattices are lattice-embeddable below any non-zero element of w . We show that many countable distributive lattices are lattice-embeddable below any non-zero element of M.

本书收录了作者的《问题与思路——一种“注意链”的现象描述》、《语言空间》、《解释学的边界性》等12篇有关研究语言哲学的论文。.

This is a contribution to the study of the Muchnik and Medvedev lattices of non-empty Π01 subsets of 2ω. In both these lattices, any non-minimum element can be split, i. e. it is the non-trivial join of two other elements. In fact, in the Medvedev case, ifP > MQ, then P can be split above Q. Both of these facts are then generalised to the embedding of arbitrary finite distributive lattices. A consequence of this is that both lattices have decidible (...) ∃-theories. (shrink)

《中国哲学史史料学》是著名的哲学家张岱年先生的著作。张先生曾任清华大学哲学系教授、北京大学哲学系教授，他也曾为北大哲学系研究生设中国哲学史史料学课程，本书是他整理课程讲义的成果。 观与材料的统一，是哲学史研究的基本要求；掌握信实的材料，是达到这一要求的前提。张先生说，本书的任务，就是对中国哲学史的材料行考订、鉴别，确定其历史年代与史料价值。 本书列举了从先秦到近代的重要的中国哲学史料，简要地介绍了每一种史料的重要观和学术价值，清晰地考证了其成书年代，并引用史学家的观，吸纳了出土简帛文献及现当代学者的研究成果，来帮助读者更好地理解史料内容， 十分具有引导性。本书考证有理有据，语言简洁干练，引文准确精审，是学习和研究中国哲学必备的经典门书。 此次出版，是以河北人民大学出版社1996年版的《张岱年全集》（第四卷）页269-445为底本，以三联书店1982年版《中国哲学史史料学》为校本行修订的。《附录》所列若干重要文献目录，具有极高的文献价值 ，因底本无而校本有，便附于此版正文之后。.

Count Me In (CMI) was launched in 2015 as a patient-driven research initiative aimed at accelerating the study of cancer genomics through direct participant engagement, electronic consent and open-access data sharing. It is an example of a large-scale direct-to-patient (DTP) research project which has since enrolled thousands of individuals. Within the broad scope of ‘citizen science’, DTP genomics research is defined here as a specific form of ‘top-down’ research endeavour developed and overseen by institutions within the traditional human subjects research (...) context; in novel ways, it engages and recruits patients with defined diseases, consents them for medical information and biospecimens sharing, and stores and disseminates genomic information. Importantly, these projects simultaneously aim to empower participants in the research process while increasing sample size, particularly in rare disease states. Using CMI as a case study, this paper discusses how DTP genomics research raises new questions in the context of traditional human subjects research ethics, including issues surrounding participant selection, remote consent, privacy and return of results. It aims to demonstrate how current research ethics frameworks may be insufficient in this context, and that institutions, institutional review boards and investigators should be aware of these gaps and their role in ensuring the conduct of ethical, novel forms of research together with participants. Ultimately, a broader question is raised of whether the rhetoric of participatory genomics research advocates for an ethic of personal and social duty for contributing to the advancement of generalisable knowledge about health and disease. (shrink)

本书包括;绪论;横渠学——张载的气学思想;二程学——程颢、程颐的道学思想;阳明学——王守仁的心学思想;船山学——王夫之的气学思想等。.

An infinite binary sequence is complex if the Kolmogorov complexity of its initial segments is bounded below by a computable function. We prove that a Π₁⁰ class P contains a complex element if and only if it contains a wtt-cover for the Cantor set. That is, if and only if for every Y⊆ω there is an X in P such that X≥wtt Y. We show that this is also equivalent to the Π₁⁰ class's being large in some sense. We give (...) an example of how this result can be used in the study of scattered linear orders. (shrink)

国家社会科学基金项目中国社会科学院哲学研究所重点项目中国社会科学院哲学研究所出版基金资助项目.

This article assumes that a profession is a number of individuals in the same occupation voluntarily organized to earn a living by openly serving a moral ideal in a morally-permissible way beyond what law, market, morality, and public opinion would otherwise require. Our question is whether the concept of profession may have a far wider range than the term, so that, for example, pointing out that a certain language lacks a word for “profession” in our sense, is not enough to (...) show that those who speak the language also lack the concept. We believe the survey of 71 Chinese reported here begins to answer that question. This article has four parts. The first describes who was interviewed, how, when, and so on. The second describes some important features of the survey’s questions, explaining how the questions track the concept of profession. The third part reports and interprets the results relevant to our question. The forth defends a tentative answer to the question with which we began—arguing the survey supports the claim that China has a profession of engineering. This article should serve as a “proof of concept”, that is, a model for similar studies around the world both of engineering and of other occupations thought to be professions. (shrink)

The Cartesian thesis that some justifications are infallible faces a gradation puzzle. On the one hand, infallible justification tolerates absolutely no possibility for error. On the other hand, infallible justifications can vary in evidential force: e.g. two persons can both be infallible regarding their pains while the one with stronger pain is nevertheless more justified. However, if a type of justification is gradable in strength, why can it always be absolute? This paper explores the potential of this gradation challenge by (...) rejecting Fumerton's recent ‘semantic decision' solution. On Fumerton's suggestion, the putative gradation of infallible justifications is essentially semantic. It concerns only how we use the relevant term but not how well we perceive the truth. Regardless of its intuitive appeal, Fumerton's solution does not cover all the related situations. There is an irreducibly epistemic sense in which infallible justifications vary in degrees. (shrink)

Two sources of possible disagreement in bioethics may be associated with pessimism about what bioethics can achieve. First, pluralism implies that bioethics engages with interlocutors who hold divergent moral beliefs. Pessimists might believe that these disagreements significantly limit the extent to which bioethics can provide normatively robust guidance in relevant areas. Second, the interdisciplinary nature of bioethics suggests that interlocutors may hold divergent views on the nature of bioethics itself—particularly its practicality. Pessimists may suppose that interdisciplinary disagreements could frustrate the (...) goals of bioethics. In this article, I explore how wonder may alleviate the concerns of the first group of pessimists regarding problems associated with pluralism, provided that we are willing to accept some interdisciplinary frustrations. Then, I invite readers of this issue of The Journal of Medicine & Philosophy to test these intuitions by considering the role of wonder in these articles. (shrink)

We use the notions of effective dimension and Kolmogorov complexity to describe a geometry on the set of infinite binary sequences. Geometric concepts that we define and use include angle, projections and scalar multiplication. A question related to compressibility is addressed using these ideas.

The property of smallness for Π01 classes is introduced and is investigated with respect to Medvedev and Muchnik degree. It is shown that the property of containing a small Π01 class depends only on the Muchnik degree of a Π01 class. A comparison is made with the idea of thinness for Π01 classesmsthm.

An infinite binary sequence is complex if the Kolmogorov complexity of its initial segments is bounded below by a computable function. We prove that a $\Pi _{1}^{0}$ class P contains a complex element if and only if it contains a wtt-cover for the Cantor set. That is, if and only if for every Y ⊆ ω there is an X in P such that X ⩾wtt Y. We show that this is also equivalent to the $\Pi _{1}^{0}$ class's being large (...) in some sense. We give an example of how this result can be used in the study of scattered linear orders. (shrink)

We consider two axioms of second-order arithmetic. These axioms assert, in two different ways, that infinite but narrow binary trees always have infinite paths. We show that both axioms are strictly weaker than Weak König's Lemma, and incomparable in strength to the dual statement (WWKL) that wide binary trees have paths.

Screen time has become a hot button issue in psychology with researchers fiercely debating its mental effects. If we want to understand the psychological dynamics of technology use, however, a numerical conceptualization of screen time will lead us to gloss over crucial distinctions. To make this point, the present article takes a hermeneutic approach to a negative form of screen time known as ‘phubbing’, which is the practice of snubbing conversational partners in favor of one’s phone. Using interview data, it (...) is demonstrated that whether or not phone use amounts to phubbing, that is, whether or not it tips over and becomes harmful, depends on a host of contextual factors such as relation (who), content (what), purpose (why), timing (when), and communication (how). These findings demonstrate that not all screen time is created equal: what is harmful and inappropriate in one context is benign in another, and vice versa. Simply put, screen time is not a numerical entity whose causal effects we can measure and explain, but a meaningful activity that we must try to understand. (shrink)

We divide the class of infinite computable trees into three types. For the first and second types, 0' computes a nontrivial self-embedding while for the third type 0'' computes a nontrivial self-embedding. These results are optimal and we obtain partial results concerning the complexity of nontrivial self-embeddings of infinite computable trees considered up to isomorphism. We show that every infinite computable tree must have either an infinite computable chain or an infinite Π01 antichain. This result is optimal and has connections (...) to the program of reverse mathematics. (shrink)