Let an oracle be called low for prefix-free complexity on a set in case access to the oracle improves the prefix-free complexities of the members of the set at most by an additive constant. Let an oracle be called weakly low for prefix-free complexity on a set in case the oracle is low for prefix-free complexity on an infinite subset of the given set. Furthermore, let an oracle be called low and weakly for prefix-free complexity along a sequence in case (...) the oracle is low and weakly low, respectively, for prefix-free complexity on the set of initial segments of the sequence. Our two main results are the following characterizations. An oracle is low for prefix-free complexity if and only if it is low for prefix-free complexity along some sequences if and only if it is low for prefix-free complexity along all sequences. An oracle is weakly low for prefix-free complexity if and only if it is weakly low for prefix-free complexity along some sequence if and only if it is weakly low for prefix-free complexity along almost all sequences. As a tool for proving these results, we show that prefix-free complexity differs from its expected value with respect to an oracle chosen uniformly at random at most by an additive constant, and that similar results hold for related notions such as a priori probability. Furthermore, we demonstrate that on every infinite set almost all oracles are weakly low but are not low for prefix-free complexity, while by Shoenfield absoluteness there is an infinite set on which uncountably many oracles are low for prefix-free complexity. Finally, we obtain no-gap results, introduce weakly low reducibility, or WLK-reducibility for short, and show that all its degrees except the greatest one are countable. (shrink)

We study the problem of existence of maximal chains in the Turing degrees. We show that: 1. ZF+DC+"There exists no maximal chain in the Turing degrees" is equiconsistent with ZFC+"There exists an inaccessible cardinal"; 2. For all a ∈ 2ω.(ω₁)L[a] = ω₁ if and only if there exists a $\Pi _{1}^{1}[a]$ maximal chain in the Turing degrees. As a corollary, ZFC + "There exists an inaccessible cardinal" is equiconsistent with ZFC + "There is no (bold face) $\utilde{\Pi}{}_{1}^{1}$ maximal chain of (...) Turing degrees". (shrink)

We show that a computable function $f:\mathbb R\rightarrow \mathbb R$ has Luzin’s property if and only if it reflects $\Pi ^1_1$ -randomness, if and only if it reflects $\Delta ^1_1$ -randomness, and if and only if it reflects ${\mathcal {O}}$ -Kurtz randomness, but reflecting Martin–Löf randomness or weak-2-randomness does not suffice. Here a function f is said to reflect a randomness notion R if whenever $f$ is R-random, then x is R-random as well. If additionally f is known to have (...) bounded variation, then we show f has Luzin’s if and only if it reflects weak-2-randomness, and if and only if it reflects $\emptyset '$ -Kurtz randomness. This links classical real analysis with algorithmic randomness. (shrink)

We show that a computable function $f:\mathbb R\rightarrow \mathbb R$ has Luzin’s property if and only if it reflects $\Pi ^1_1$ -randomness, if and only if it reflects $\Delta ^1_1$ -randomness, and if and only if it reflects ${\mathcal {O}}$ -Kurtz randomness, but reflecting Martin–Löf randomness or weak-2-randomness does not suffice. Here a function f is said to reflect a randomness notion R if whenever $f$ is R-random, then x is R-random as well. If additionally f is known to have (...) bounded variation, then we show f has Luzin’s if and only if it reflects weak-2-randomness, and if and only if it reflects $\emptyset '$ -Kurtz randomness. This links classical real analysis with algorithmic randomness. (shrink)

We answer a question of Jockusch by constructing a hyperimmune-free minimal degree below a 1-generic one. To do this we introduce a new forcing notion called arithmetical Sacks forcing. Some other applications are presented.

We prove that there is no sw-complete c.e. real, negatively answering a question in [6].

Computably Lipschitz reducibility , was suggested as a measure of relative randomness. We say α≤clβ if α is Turing reducible to β with oracle use on x bounded by x+c. In this paper, we prove that for any non-computable real, there exists a c.e. real so that no c.e. real can cl-compute both of them. So every non-computable c.e. real is the half of a cl-maximal pair of c.e. reals.

We study lowness for genericity. We show that there exists no Turing degree which is low for 1-genericity and all of computably traceable degrees are low for weak 1-genericity.

We give a new proof of Friedman's conjecture that every uncountable Δ11 set of reals has a member of each hyperdegree greater than or equal to the hyperjump.

Let [NB]₁ denote the ideal generated by nonbounding c.e. degrees and NCup the ideal of noncuppable c.e. degrees. We show that both [NB]₁ ∪ NCup and the ideal generated by nonbounding and noncuppable degrees are new, in the sense that they are different from M, [NB]₁ and NCup—the only three known definable ideals so far.

We prove that there exists a noncomputable c.e. real which is low for weak 2-randomness, a definition of randomness due to Kurtz, and that all reals which are low for weak 2-randomness are low for Martin-Löf randomness.

We investigate the initial segment complexity of random reals. Let K denote prefix-free Kolmogorov complexity. A natural measure of the relative randomness of two reals α and β is to compare complexity K and K. It is well-known that a real α is 1-random iff there is a constant c such that for all n, Kn−c. We ask the question, what else can be said about the initial segment complexity of random reals. Thus, we study the fine behaviour of K (...) for random α. Following work of Downey, Hirschfeldt and LaForte, we say that αK β iff there is a constant such that for all n, . We call the equivalence classes under this measure of relative randomness K-degrees. We give proofs that there is a random real α so that lim supn K−K=∞ where Ω is Chaitin's random real. One is based upon work of Solovay, and the other exploits a new idea. Further, based on this new idea, we prove there are uncountably many K-degrees of random reals by proving that μ=0. As a corollary to the proof we can prove there is no largest K-degree. Finally we prove that if n ≠ m then the initial segment complexities of the natural n- and m-random sets and Ω︀) are different. The techniques introduced in this paper have already found a number of other applications. (shrink)

Objective: Patients with hypochondriasis hold unexplainable beliefs and a fear of having a lethal disease, with poor compliances and treatment response to psychotropic drugs. Although several studies have demonstrated that patients with hypochondriasis demonstrate abnormalities in brain structure and function, gray matter volume and functional connectivity in hypochondriasis still remain unclear.Methods: The present study collected T1-weighted and resting-state functional magnetic resonance images from 21 hypochondriasis patients and 22 well-matched healthy controls. We first analyzed the difference in the GMV between the (...) two groups. We then used the regions showing a difference in GMV between two groups as seeds to perform functional connectivity analysis. Finally, a support vector machine was applied to the imaging data to distinguish hypochondriasis patients from HCs.Results: Compared with the HCs, the hypochondriasis group showed decreased GMV in the left precuneus, and increased GMV in the left medial frontal gyrus. FC analyses revealed decreased FC between the left medial frontal gyrus and cuneus, and between the left precuneus and cuneus. A combination of both GMV and FC in the left precuneus, medial frontal gyrus, and cuneus was able to discriminate the hypochondriasis patients from HCs with a sensitivity of 0.98, specificity of 0.93, and accuracy of 0.95.Conclusion: Our study suggests that smaller left precuneus volumes and decreased FC between the left precuneus and cuneus seem to play an important role of hypochondriasis. Future studies are needed to confirm whether this finding is generalizable to patients with hypochondriasis. (shrink)

We prove that for any locally countable $\Sigma _{1}^{1}$ partial order P = 〈2ω,≤P〉, there exists a nonmeasurable antichain in P. Some applications of the result are also presented.

We prove that there is no maximal low d.c.e degree.

Mauldin [15] proved that there is an analytic set, which cannot be represented by $B\cup X$ for some Borel set B and a subset X of a $\boldsymbol{\Sigma }^0_2$ -null set, answering a question by Johnson [10]. We reprove Mauldin’s answer by a recursion-theoretical method. We also give a characterization of the Borel generated $\sigma $ -ideals having approximation property under the assumption that every real is constructible, answering Mauldin’s question raised in [15].

本书从界定证据相关性的内涵入手,分别探讨了逻辑上的相关性和法律上的相关性,从而澄清了一些在借鉴英美国家证据规则时出现的概念混淆。.

A real x is -Kurtz random if it is in no closed null set . We show that there is a cone of -Kurtz random hyperdegrees. We characterize lowness for -Kurtz randomness as being -dominated and -semi-traceable.

We prove that every Turing degree a bounding some non-GL₂ degree is recursively enumerable in and above (r.e.a.) some 1-generic degree.

We prove that the continuous function${\rm{\hat \Omega }}:2^\omega \to $ that is defined via$X \mapsto \mathop \sum \limits_n 2^{ - K\left} $ for all $X \in {2^\omega }$ is differentiable exactly at the Martin-Löf random reals with the derivative having value 0; that it is nowhere monotonic; and that $\mathop \smallint \nolimits _0^1{\rm{\hat{\Omega }}}\left\,{\rm{d}}X$ is a left-c.e. $wtt$-complete real having effective Hausdorff dimension ${1 / 2}$.We further investigate the algorithmic properties of ${\rm{\hat{\Omega }}}$. For example, we show that the maximal (...) value of ${\rm{\hat{\Omega }}}$ must be random, the minimal value must be Turing complete, and that ${\rm{\hat{\Omega }}}\left \oplus X{ \ge _T}\emptyset \prime$ for every X. We also obtain some machine-dependent results, including that for every $\varepsilon > 0$, there is a universal machine V such that ${{\rm{\hat{\Omega }}}_V}$ maps every real X having effective Hausdorff dimension greater than ε to a real of effective Hausdorff dimension 0 with the property that $X{ \le _{tt}}{{\rm{\hat{\Omega }}}_V}\left$; and that there is a real X and a universal machine V such that ${{\rm{\Omega }}_V}\left$ is rational. (shrink)

We show that the structure R of recursively enumerable degrees is not a Σ₁-elementary substructure of Dn, where Dn (n > 1) is the structure of n-r.e. degrees in the Ershov hierarchy.

COVID-19 often manifests with different outcomes in different patients, highlighting the complexity of the host-pathogen interactions involved in manifestations of the disease at the molecular and cellular levels. In this paper, we propose a set of postulates and a framework for systematically understanding complex molecular host-pathogen interaction networks. Specifically, we first propose four host-pathogen interaction (HPI) postulates as the basis for understanding molecular and cellular host-pathogen interactions and their relations to disease outcomes. These four postulates cover the evolutionary dispositions involved (...) in HPIs, the dynamic nature of HPI outcomes, roles that HPI components may occupy leading to such outcomes, and HPI checkpoints that are critical for specific disease outcomes. Based on these postulates, an HPI Postulate and Ontology (HPIPO) framework is proposed to apply interoperable ontologies to systematically model and represent various granular details and knowledge within the scope of the HPI postulates, in a way that will support AI-ready data standardization, sharing, integration, and analysis. As a demonstration, the HPI postulates and the HPIPO framework were applied to study COVID-19 with the Coronavirus Infectious Disease Ontology (CIDO), leading to a novel approach to rational design of drug/vaccine cocktails aimed at interrupting processes occurring at critical host-coronavirus interaction checkpoints. Furthermore, the host-coronavirus protein-protein interactions (PPIs) relevant to COVID-19 were predicted and evaluated based on prior knowledge of curated PPIs and domain-domain interactions, and how such studies can be further explored with the HPI postulates and the HPIPO framework is discussed. (shrink)

The Asian Logic Conference (ALC) is a major international event in mathematical logic. It features the latest scientific developments in the fields of mathematical logic and its applications, logic in computer science, and philosophical logic. The ALC series also aims to promote mathematical logic in the Asia-Pacific region and to bring logicians together both from within Asia and elsewhere for an exchange of information and ideas. This combined proceedings volume represents works presented or arising from the 14th and 15th ALCs.

The quality and quantity of training data are crucial to the performance of a deep-learning-based brain-computer interface system. However, it is not practical to record EEG data over several long calibration sessions. A promising time- and cost-efficient solution is artificial data generation or data augmentation. Here, we proposed a DA method for the motor imagery EEG signal called brain-area-recombination. For the BAR, each sample was first separated into two ones by left/right brain channels, and the artificial samples were generated by (...) recombining the half-samples. We then designed two schemas corresponding to the single- and multi-subject scenarios. Extensive experiments using the classifier of EEGnet were conducted on two public datasets under various training set sizes. In both schemas, the BAR method can make the EEGnet have a better performance of classification. To make a comparative investigation, we selected two common DA methods, and the BAR method beat them. Further, using the proposed BAR for augmentation, EEGnet achieved up to 8.3% improvement than a typical decoding algorithm CSP-SVM, note that both the models were trained on the augmented dataset. This study shows that BAR usage can significantly improve the classification ability of deep learning to MI-EEG signals. To a certain extent, it may promote the development of deep learning technology in the field of BCI. (shrink)

BackgroundWith the popularity of computers, the internet, and the global spread of COVID-19, more and more attention deficit hyperactivity disorder patients need timely interventions through the internet. At present, there are many online intervention schemes may help these patients. It is necessary to integrate data to analyze their effectiveness.ObjectivesOur purpose is to integrate the ADHD online interventions trials, study its treatment effect and analyze its feasibility, and provide reference information for doctors in other institutions to formulate better treatment plans.MethodsWe searched (...) PubMed, EMBASE and Cochrane libraries. We didn't limit the start date and end date of search results. Our last search was on December 1, 2021. The keyword is ADHD online therapy. We used the Cochrane bias risk tool to assess the quality of included studies, used the standardized mean difference as an effect scale indicator to measure data. Random effects model, subgroup analysis were used to analyze the data.ResultsSix randomized controlled trials were identified, including 261 patients with ADHD. These studies showed that online interventions was more effective than waiting list in improving attention deficit and social function of adults and children with ADHD. The attention deficit scores of subjects were calculated in six studies. The sample size of the test group was 123, the sample size of the control group was 133, and the combined SMD was −0.73. The social function scores of subjects were calculated in six studies. The sample size of the experimental group was 123 and the control group was 133. The combined SMD was −0.59.ConclusionsThe results show that online interventions of ADHD may be an effective intervention. In the future, we need more online intervention researches to improve the symptoms of different patients, especially for some patients who have difficulties in accepting face-to-face treatment. (shrink)

This study explores the research paradigms of contemporary business ethics research in 2001–2008. With citation data from the top two business ethics journals included in the Social Sciences Citation Index, this study conducts citation and co-citation analysis to identify the most important publications, scholars, and research themes in the business ethics area and then maps the intellectual structure of business ethics studies between 2001 and 2008. The results show that current business ethics studies cluster around four major research themes, including (...) morality and social contract theory, ethical decision making, corporate social responsibility, and stakeholder theory. This study helps profile the invisible network of knowledge production in business ethics and provides important insights on current research paradigms of business ethics studies. (shrink)

This study explores the research paradigms of contemporary business ethics research in 2001–2008. With citation data from the top two business ethics journals included in the Social Sciences Citation Index, this study conducts citation and co‐citation analysis to identify the most important publications, scholars, and research themes in the business ethics area and then maps the intellectual structure of business ethics studies between 2001 and 2008. The results show that current business ethics studies cluster around four major research themes, including (...) morality and social contract theory, ethical decision making, corporate social responsibility, and stakeholder theory. This study helps profile the invisible network of knowledge production in business ethics and provides important insights on current research paradigms of business ethics studies. (shrink)

Ben shu bi jiao yan jiu liang shu ming he hu kuo de wen hua qu xiang, zheng zhi qu xiang, xue shu zhi qu, zhong xi wen hua guan, ke xue yu min zhu guan dui chuan tong wen hua de tai du he dui zhong guo wen hua chu lu de xuan ze deng wen ti.

ObjectiveThis systematic review aims to analyze existing literature of the effects of transcranial direct current stimulation (tDCS) on motor skills learning of healthy adults and discuss the underlying neurophysiological mechanism that influences motor skills learning.MethodsThis systematic review has followed the recommendations of the Preferred Reporting Items for Systematic reviews and Meta-Analyses. The PubMed, EBSCO, and Web of Science databases were systematically searched for relevant studies that were published from database inception to May 2022. Studies were included based on the Participants, (...) Intervention, Comparison, Outcomes, and Setting inclusion strategy. The risk of bias was evaluated by using the Review manager 5.4 tool. The quality of each study was assessed with the Physiotherapy Evidence Database (PEDro) scale.ResultsThe electronic search produced 142 studies. Only 11 studies were included after filtering. These studies performed well in terms of distribution, blinding availability and selective reporting. They reported that tDCS significantly improved motor skills learning. The main outcomes measure were the improvement of the motor sequence tasks and specific motor skills. Nine studies showed that tDCS interventions reduced reaction time to complete motor sequence tasks in healthy adults and two studies showed that tDCS interventions improved golf putting task performance.ConclusionThe included studies showed that tDCS can help healthy adults to improve the motor skills learning by activating different brain regions, such as the primary motor cortex, left dorsolateral prefrontal cortex and right cerebellum. However, the number of included studies was limited, and the sample sizes were small. Therefore, more studies are urgently needed to validate the results of current studies and further explore the underlying neurophysiological mechanisms of tDCS in the future. (shrink)

In the real-world complex product design process, task allocating is an ongoing reactive process where the presence of unexpected design change is usually inevitable. Therefore, reallocating is necessary to respond to design change positively as a procedure to repair the affected task plan. General reallocating literature addressed the reallocating versions with fixed executing time. In this paper, a multi-objective reallocation model is developed with a feasible assumption that the task executing time is controllable. To illustrate this idea, a compressing executing (...) time strategy is proposed in CPD process, where the executing time can be controlled with a non-linear compression cost. When design change occurs during the executing, task-resource reallocating is required to absorb the interference effects. Reallocating implies an increase in design cost and system instability; the proposed method CETS can address this issue effectively. CETS considers three objectives: completing time, stability, and change-adaptation cost. An adaptive multi-objective hybrid genetic algorithm and tabu search is developed to solve this mathematical method. The computational results of specific simulation examples verify the superiority. It shows that CETS is sensitive to design change, and the proposed algorithm AMOGATS can be effective to achieve the allocating by coordinating the objective consistency. (shrink)

1. IntroductionCan the discourse of tianxia (“All-under-Heaven”) provide a peaceful resolution to the “Taiwan problem”? This article seeks to address this question. The urgency of such a resolution seems to be evident at this moment: since the Russian invasion of Ukraine, starting on February 24, 2022, observers of international politics have focused on the People’s Republic of China (PRC) with regard to its position on Russia’s aggression, on the one hand, and to its decision on Taiwan, on the other. Consequently, (...) the question of “Will Taiwan be the next Ukraine?” was raised so frequently that the PRC’s former minister of foreign affairs had to urge other states to stop drawing a comparison between Taiwan and Ukraine.1 However, such a call has not eased the concern over the PRC’s potential invasion of Taiwan, as key actors in international politics, such as the United States, the European Union, and the United Kingdom, continue to reiterate their position regarding a peaceful resolution between China and Taiwan,2 suggesting the lack of it to this day. (shrink)

PurposeTo investigate spontaneous brain activity in patients with dry eye and healthy control using the fractional amplitude of low frequency fluctuation technique with the aim of elucidating the relationship between the clinical symptoms of DE and changes in brain function.Material and MethodsA total of 28 patients with DE and 28 matched healthy volunteers were enrolled. Resting-state functional magnetic resonance imaging scans were performed in both groups. Then all subjects were required to complete a comprehensive Hospital Anxiety and Depression Scale. Receiver (...) operating characteristic curve analysis was used to evaluate the differences in fALFF values between the two groups and their diagnostic value. Linear correlations between HADS and fALFF values in different brain regions of DE patients were analyzed using the Pearson correlation coefficient.ResultsPatients with DE had significantly higher fALFF values in the left calcarine sulcus than the HC group, while fALFF values in the bilateral middle frontal gyrus and right MFG/right inferior frontal gyrus were significantly lower in DE patients than in HC group. fALFF values had a high diagnostic value for differentiating patients with DE from the HC group. Right MFG and right MFG/IFG were significantly correlated with HADS values.ConclusionOur study found that DE mainly involved functional disorders in the brain areas of the left CS, bilateral MFG and right MFG/right IFG, which helped us to find possible clinical features of DE disease and reflected the potential pathological mechanism of DE. (shrink)

ABSTRACTDeception has been reported to be influenced by task-relevant emotional information from an external stimulus. However, it remains unclear how task-irrelevant emotional information would influence deception. In the present study, facial expressions of different valence and emotion intensity were presented to participants, where they were asked to make either truthful or deceptive gender judgments according to the preceding cues. We observed the influence of facial expression intensity upon individuals’ cognitive cost of deceiving. Larger cost was observed for high intensity faces (...) compared to low intensity faces. These results provided insights on how automatic attraction of attention evoked by task-irrelevant emotional information in facial expressions influenced individuals’ cognitive cost of deceiving. (shrink)