Domain Representations Induced by Dyadic Subbases

We study domain representations induced by dyadic subbases and show that a proper dyadic subbase S of a second-countable regular space X induces an embedding of X in the set of minimal limit elements of a subdomain D of $\{0,1,\perp\}\omega$. In particular, if X is compact, then X is a retract of the set of limit elements of D

Dyadic Subbases and Representations of Topological Spaces

We explain topological properties of the embedding-based approach to computability on topological spaces. With this approach, he considered a special kind of embedding of a topological space into Plotkin\u27s $T^omega$, which is the set of infinite sequences of $T = {0,1,bot }$. We show that such an embedding can also be characterized by a dyadic subbase, which is a countable subbase $S = (S_0^0, S_0^1, S_1^0, S_1^1, ldots)$ such that $S_n^j$ $(n = 0,1,2,ldots; j = 0,1$ are regular open and $S_n^0$ and $S_n^1$ are exteriors of each other. We survey properties of dyadic subbases which are related to efficiency properties of the representation corresponding to the embedding

On the Complexity of Lattice Puzzles

In this paper, we investigate the computational complexity of lattice puzzle, which is one of the traditional puzzles. A lattice puzzle consists of 2n plates with some slits, and the goal of this puzzle is to assemble them to form a lattice of size n x n. It has a long history in the puzzle society; however, there is no known research from the viewpoint of theoretical computer science. This puzzle has some natural variants, and they characterize representative computational complexity classes in the class NP. Especially, one of the natural variants gives a characterization of the graph isomorphism problem. That is, the variant is GI-complete in general. As far as the authors know, this is the first non-trivial GI-complete problem characterized by a classic puzzle. Like the sliding block puzzles, this simple puzzle can be used to characterize several representative computational complexity classes. That is, it gives us new insight of these computational complexity classes

Random Iteration Algorithm for Graph-Directed Sets

A random iteration algorithm for graph-directed sets is defined and discussed. Similarly to the Barnsley-Elton\u27s theorem, it is shown that almost all sequences obtained by this algorithm reflect a probability measure which is invariant with respect to the system of contractions with probabilities

わが国におけるスポーツ観に関する研究 : スポーツの教育的価値との関係を中心に

The purpose of this study is to clarify the relationship between the formation of attitudes about sport and the educational value of sports in Japan today. This study pays particular attention to the spread and development of sports through academic training to schools and organized sport clubs. This change in organized school sports has brought with it a change in our attitudes about the educational value of sports. This change in school sports education has strengthened the positive attitudes towards sports in education, although at times this has an adverse effect.In a word our views about the value of sports has grown more complex, and our attitudes about sports in education are becoming more varied

A Study of Refusal Strategies by American and International Students at an American University

Refusals are delicate speech acts for non-native speakers to negotiate because they require negative responses to an interlocutor\u27s invitation or request. In addition to cultural variation, variables such as gender and modes of communication (e.g., emails) add dimensions to the complexity when performing refusals. The main objective of this study is to investigate the difference in refusal strategies between American and international college students as well as gender variation. Using a written Discourse Completion Task, six situations were developed and grouped in two stimulus types eliciting refusals to an invitation and a request. Each stimulus type involved an email refusal to professors, friends, and a staff member of an academic department. The refusals of sixteen undergraduate American students and thirty-two international students were analyzed in terms of frequency, order, and content of semantic formulas. The results of this study suggest that when using email, all groups demonstrated preference for direct refusal. American females preferred expressions of gratitude and stating positive opinions, whereas American male provided reasons and alternatives. The international students used a greater variety of semantic formulas; however, they lacked positive opinions and providing alternatives. Additionally, the international students tended to use more regret than the American students. The international students (both male and female) also tended to use more specific excuses as compared to more general excuses used by the Americans

Extracting total Amb programs from proofs

We present a logical system CFP (Concurrent Fixed Point Logic) supporting the extraction of nondeterministic and concurrent programs that are provably total and correct. CFP is an intuitionistic first-order logic with inductive and coinductive definitions extended by two propositional operators: Rrestriction, a strengthening of implication, and an operator for total concurrency. The source of the extraction are formal CFP proofs, the target is a lambda calculus with constructors and recursion extended by a constructor Amb (for McCarthy's amb) which is interpreted operationally as globally angelic choice and is used to implement nondeterminism and concurrency. The correctness of extracted programs is proven via an intermediate domain-theoretic denotational semantics. We demonstrate the usefulness of our system by extracting a nondeterministic program that translates infinite Gray code into the signed digit representation. A noteworthy feature of CFP is the fact that the proof rules for restriction and concurrency involve variants of the classical law of excluded middle that would not be interpretable computationally without Amb.Comment: 39 pages + 4 pages appendix. arXiv admin note: text overlap with arXiv:2104.1466

JNK signalling in cancer: In need of new, smarter therapeutic targets

Copyright © 2013 The British Pharmacological Society. This is the accepted version of the following article: Bubici, C. and Papa, S. (2014), JNK signalling in cancer: in need of new, smarter therapeutic targets. British Journal of Pharmacology, 171: 24–37, which has been published in final form at http://onlinelibrary.wiley.com/doi/10.1111/bph.12432/abstract.The JNKs are master protein kinases that regulate many physiological processes, including inflammatory responses, morphogenesis, cell proliferation, differentiation, survival and death. It is increasingly apparent that persistent activation of JNKs is involved in cancer development and progression. Therefore, JNKs represent attractive targets for therapeutic intervention with small molecule kinase inhibitors. However, evidence supportive of a tumour suppressor role for the JNK proteins has also been documented. Recent studies showed that the two major JNK proteins, JNK1 and JNK2, have distinct or even opposing functions in different types of cancer. As such, close consideration of which JNK proteins are beneficial targets and, more importantly, what effect small molecule inhibitors of JNKs have on physiological processes, are essential. A number of ATP-competitive and ATP-non-competitive JNK inhibitors have been developed, but have several limitations such as a lack of specificity and cellular toxicity. In this review, we summarize the accumulating evidence supporting a role for the JNK proteins in the pathogenesis of different solid and haematological malignancies, and discuss many challenges and scientific opportunities in the targeting of JNKs in cancer.Kay Kendall Leukemia Fund, Italian Association for Cancer Research and Foundation for Liver Research