Search results for "upper"
showing 10 items of 987 documents
Koinzidenz von Plattenepithelkarzinomen der Speiseröhre und Kopf-Hals-Karzinomen: Risiko und Früherkennung
2007
Patients suffering from head and neck cancer (HNC) have or will develop a second esophageal squamous cell cancer (ESCC) in 5 - 14 %. When a second esophageal neoplasm occurs in a HNC patient, the prognosis is generally determined by the ESCC, and unfortunately it is poor. Prospective clinical studies in Japan, Brazil, Taiwan, France and Germany have shown that screening or surveillance using Lugol chromoesophagoscopy enables early detection of second esophageal neoplasias. Such a surveillance results in a survival benefit for HNC patients. Vice versa, ESCC patients also have a risk of 9.3 - 11.4 % for a head and neck cancer. Periodic otolaryngeal examination and pharyngoscopy is recommended…
The Eucharist or the Lord's Supper in the light of the Catholic-Pentecostal dialogue (1972-2015)
2019
The ongoing Catholic-Pentecostal dialogue highlighted a certain disproportion in the approach of each of the parties to the Eucharist or the Lord's Supper. For Pentecost Christians participation in the Lord's Supper is of secondary importance. Common conversations been shown that in Catholic spirituality the Eucharist occupies a significant and central place. It is the presence of the sacrifice that took place once and for all on the cross of Christ. Pentecostals are not unanimous, however, in the meaning of the Lord's Supper. For this community usually the Lord's Supper means only commemoration of Last Supper. They do not believe, however, that during it the bread and wine will transform t…
Depositional environment and biofacies characterisation of the Triassic (Carnian to Rhaetian) carbonate succession of Punta Bassano (Marettimo Island…
2007
AThe aims of this study are to reconstruct the geological setting of the Punta Bassano series (Marettimo Island, Egadi Archipelago, western Sicily) and its palaeogeographic evolution. The reference section for the Upper Triassic of Marettimo shows an alternation of marl and limestone beds together with brecciated levels. The limestones are both homogeneous mudstones with evaporite pseudomorphs and laminated with fenestrae. Foraminiferal, palynomorph, and ostracod associations constrain the Punta Bassano sequence to the Carnian-Rhaetian interval. The Punta Bassano succession represents a shallow inner ramp, ranging from open-marine environment with good water circulation to lagoonal and peri…
The Senate Territorial Groups
2013
Since the adoption of the Senate Rules in 1982 alongside the traditional parliamentary Groups (where Senators are associated by ideological affinity), there exist territorial Groups that try to reflect the autonomous organization of the State. The purpose of this work is to make a concise study of these Groups, which are undoubtedly one of the effects of the expression that the Upper House is the House of territorial representation, as contained in article 69 of the Constitution.
Search for relativistic magnetic monopoles with the ANTARES neutrino telescope
2012
Magnetic monopoles are predicted in various unified gauge models and could be produced at intermediate mass scales. Their detection in a neutrino telescope is facilitated by the large amount of light emitted compared to that from muons. This paper reports on a search for upgoing relativistic magnetic monopoles with the ANTARES neutrino telescope using a data set of 116 days of live time taken from December 2007 to December 2008. The one observed event is consistent with the expected atmospheric neutrino and muon background, leading to a 90% C.L. upper limit on the monopole flux between 1.3 ¿ 10¿17 and 8.9 ¿ 10¿17 cm¿2 s¿1 sr¿1 for monopoles with velocity ß ¿ 0.625.
Finite Satisfiability of the Two-Variable Guarded Fragment with Transitive Guards and Related Variants
2018
We consider extensions of the two-variable guarded fragment, GF2, where distinguished binary predicates that occur only in guards are required to be interpreted in a special way (as transitive relations, equivalence relations, pre-orders or partial orders). We prove that the only fragment that retains the finite (exponential) model property is GF2 with equivalence guards without equality. For remaining fragments we show that the size of a minimal finite model is at most doubly exponential. To obtain the result we invent a strategy of building finite models that are formed from a number of multidimensional grids placed over a cylindrical surface. The construction yields a 2NExpTime-upper bou…
Upperbounds on the probability of finding marked connected components using quantum walks
2019
Quantum walk search may exhibit phenomena beyond the intuition from a conventional random walk theory. One of such examples is exceptional configuration phenomenon -- it appears that it may be much harder to find any of two or more marked vertices, that if only one of them is marked. In this paper, we analyze the probability of finding any of marked vertices in such scenarios and prove upper bounds for various sets of marked vertices. We apply the upper bounds to large collection of graphs and show that the quantum search may be slow even when taking real-world networks.
Algorithms for Anti-Powers in Strings
2018
Abstract A string S [ 1 , n ] is a power (or tandem repeat) of order k and period n / k if it can be decomposed into k consecutive equal-length blocks of letters. Powers and periods are fundamental to string processing, and algorithms for their efficient computation have wide application and are heavily studied. Recently, Fici et al. (Proc. ICALP 2016) defined an anti-power of order k to be a string composed of k pairwise-distinct blocks of the same length ( n / k , called anti-period). Anti-powers are a natural converse to powers, and are objects of combinatorial interest in their own right. In this paper we initiate the algorithmic study of anti-powers. Given a string S, we describe an op…
On the Power of Non-adaptive Learning Graphs
2012
We introduce a notion of the quantum query complexity of a certificate structure. This is a formalisation of a well-known observation that many quantum query algorithms only require the knowledge of the disposition of possible certificates in the input string, not the precise values therein. Next, we derive a dual formulation of the complexity of a non-adaptive learning graph, and use it to show that non-adaptive learning graphs are tight for all certificate structures. By this, we mean that there exists a function possessing the certificate structure and such that a learning graph gives an optimal quantum query algorithm for it. For a special case of certificate structures generated by cer…
Adversary Lower Bound for the k-sum Problem
2013
We prove a tight quantum query lower bound $\Omega(n^{k/(k+1)})$ for the problem of deciding whether there exist $k$ numbers among $n$ that sum up to a prescribed number, provided that the alphabet size is sufficiently large. This is an extended and simplified version of an earlier preprint of one of the authors arXiv:1204.5074.