Manipulation of the graphene surface potential by ion irradiation

We show that the work function of exfoliated single layer graphene can be modified by irradiation with swift (E_{kin}=92 MeV) heavy ions under glancing angles of incidence. Upon ion impact individual surface tracks are created in graphene on SiC. Due to the very localized energy deposition characteristic for ions in this energy range, the surface area which is structurally altered is limited to ~ 0.01 mum^2 per track. Kelvin probe force microscopy reveals that those surface tracks consist of electronically modified material and that a few tracks suffice to shift the surface potential of the whole single layer flake by ~ 400 meV. Thus, the irradiation turns the initially n-doped graphene into p-doped graphene with a hole density of 8.5 x 10^{12} holes/cm^2. This doping effect persists even after heating the irradiated samples to 500{\deg}C. Therefore, this charge transfer is not due to adsorbates but must instead be attributed to implanted atoms. The method presented here opens up a new way to efficiently manipulate the charge carrier concentration of graphene.Comment: 6 pages, 4 figure

Monte Carlo Study of the Anisotropic Heisenberg Antiferromagnet on the Triangular Lattice

We report a Monte Carlo study of the classical antiferromagnetic Heisenberg model with easy axis anisotropy on the triangular lattice. Both the free energy cost for long wavelength spin waves as well as for the formation of free vortices are obtained from the spin stiffness and vorticity modulus respectively. Evidence for two distinct Kosterlitz-Thouless types of defect-mediated phase transitions at finite temperatures is presented.Comment: 8 pages, 10 figure

Shortening QBF Proofs with Dependency Schemes

We provide the first proof complexity results for QBF dependency calculi. By showing that the reflexive resolution path dependency scheme admits exponentially shorter Q-resolution proofs on a known family of instances, we answer a question first posed by Slivovsky and Szeider in 2014 [30]. Further, we conceive a method of QBF solving in which dependency recomputation is utilised as a form of inprocessing. Formalising this notion, we introduce a new calculus in which a dependency scheme is applied dynamically. We demonstrate the further potential of this approach beyond that of the existing static system with an exponential separation

Generalising unit-refutation completeness and SLUR via nested input resolution

We introduce two hierarchies of clause-sets, SLUR_k and UC_k, based on the classes SLUR (Single Lookahead Unit Refutation), introduced in 1995, and UC (Unit refutation Complete), introduced in 1994. The class SLUR, introduced in [Annexstein et al, 1995], is the class of clause-sets for which unit-clause-propagation (denoted by r_1) detects unsatisfiability, or where otherwise iterative assignment, avoiding obviously false assignments by look-ahead, always yields a satisfying assignment. It is natural to consider how to form a hierarchy based on SLUR. Such investigations were started in [Cepek et al, 2012] and [Balyo et al, 2012]. We present what we consider the "limit hierarchy" SLUR_k, based on generalising r_1 by r_k, that is, using generalised unit-clause-propagation introduced in [Kullmann, 1999, 2004]. The class UC, studied in [Del Val, 1994], is the class of Unit refutation Complete clause-sets, that is, those clause-sets for which unsatisfiability is decidable by r_1 under any falsifying assignment. For unsatisfiable clause-sets F, the minimum k such that r_k determines unsatisfiability of F is exactly the "hardness" of F, as introduced in [Ku 99, 04]. For satisfiable F we use now an extension mentioned in [Ansotegui et al, 2008]: The hardness is the minimum k such that after application of any falsifying partial assignments, r_k determines unsatisfiability. The class UC_k is given by the clause-sets which have hardness <= k. We observe that UC_1 is exactly UC. UC_k has a proof-theoretic character, due to the relations between hardness and tree-resolution, while SLUR_k has an algorithmic character. The correspondence between r_k and k-times nested input resolution (or tree resolution using clause-space k+1) means that r_k has a dual nature: both algorithmic and proof theoretic. This corresponds to a basic result of this paper, namely SLUR_k = UC_k.Comment: 41 pages; second version improved formulations and added examples, and more details regarding future directions, third version further examples, improved and extended explanations, and more on SLUR, fourth version various additional remarks and editorial improvements, fifth version more explanations and references, typos corrected, improved wordin

Portal vein obstruction after pediatric liver transplantation:A systematic review of current treatment strategies

INTRODUCTION: Portal vein obstruction (PVO) is a significant vascular complication after liver transplantation (LT) in pediatric patients. Current treatment strategies include percutaneous transluminal angioplasty (PTA), with or without stent placement, mesorex bypass (MRB), splenorenal shunt, mesocaval shunt, endovascular recanalization (EVR), splenic artery embolization and splenectomy. However, specific characteristics of patients undergoing intervention and selection of individual treatment and its efficacy have remained unclear. This review systematically analyzed biochemical and clinical characteristics, selection of treatment, efficacy, and post-procedural complications. METHODS: We systematically searched PubMed and Embase between January 1995 and March 2021 for studies on the management of PVO after LT. We analyzed the reports for biochemical and clinical characteristics at the timing of the intervention in different patients, selection of treatment, and reported efficacies. RESULTS: We found 22 cohort studies with 362 patients who had the following characteristics: biliary atresia (83%), living-donor LT (85%), thrombocytopenia (73%), splenomegaly (40%), ascites (16%), or gastrointestinal bleeding (26%). The 3-year primary patency of PTA without stent placement was similar to that with stent placement (70%-80% and 43%-94%, respectively). MRB was used as an initial treatment with a 3-year patency of 75% to 100%. One study showed that 5-year primary patency of EVR was 80%. Secondary patency was 90% to 100% after 3 years in all studies with PTA alone, PTA/stent placement, and stent placement alone. CONCLUSION: This is the first review of all treatment protocols in PVO after pediatric LT. We showed that an important group of patients has severe symptoms of portal hypertension. Efficacy of all treatment modalities was high in the included studies which make them important modalities for these patients

Dependency Schemes in QBF Calculi: Semantics and Soundness

We study the parametrisation of QBF resolution calculi by dependency schemes. One of the main problems in this area is to understand for which dependency schemes the resulting calculi are sound. Towards this end we propose a semantic framework for variable independence based on ‘exhibition’ by QBF models, and use it to express a property of dependency schemes called full exhibition that is known to be sufficient for soundness in Q-resolution. Introducing a generalised form of the long-distance resolution rule, we propose a complete parametrisation of classical long-distance Q-resolution, and show that full exhibition remains sufficient for soundness. We demonstrate that our approach applies to the current research frontiers by proving that the reflexive resolution path dependency scheme is fully exhibited

Safety, tolerability, and impact on allergic inflammation of autologous E.coli autovaccine in the treatment of house dust mite asthma - a prospective open clinical trial

Background: Asthma is increasing worldwide and results from a complex immunological interaction between genetic susceptibility and environmental factors. Autovaccination with E. coli induces a strong TH-1 immune response, thus offering an option for the treatment of allergic diseases. Methods: Prospective open trial on safety, tolerability, and impact on allergic inflammation of an autologous E.coli autovaccine in intermittent or mild persistent house dust mite asthma. Determination of exhaled nitric monoxide (eNO) before and after bronchial mite challenge initially and after nine months of autovaccination. Results: Median eNO increase after autovaccination was significantly smaller (from 27.3 to 33.8 ppb; p=0.334) compared to initial values (from 32.6 to 42.2 ppb; p=0.046) (p=0.034). In nine subjects and a total of 306 injections, we observed 101 episodes of local erythema (33.3%; median of maximal diameter 2.5 cm), 95 episodes of local swelling (31.1%; median of maximal diameter 3 cm), and 27 episodes of local pain (8.8%). Four subjects reported itching at the injection site with a total of 30 episodes (9.8%). We observed no serious adverse events. All organ functions (inclusive electrocardiogramm) and laboratory testing of the blood (clinical chemistry, hematology) and the urine (screening test, B-microglobuline) were within normal limits. Vital signs undulated within the physiological variability. Conclusion: The administration of autologous autovacine for the treatment of house dust mite asthma resulted in a reduction of the eNO increase upon bronchial mite challenge. In nine subjects and 306 injections, only a few mild local reactions and no systemic severe adverse events were observed. EudraCT Nr. 2005-005534-12 ClinicalTrials.gov ID NCT0067720

Zero-Temperature Phase Transitions of Antiferromagnetic Ising Model of General Spin on a Triangular Lattice

We map the ground-state ensemble of antiferromagnetic Ising model of spin-S on a triangular lattice to an interface model whose entropic fluctuations are proposed to be described by an effective Gaussian free energy, which enables us to calculate the critical exponents of various operators in terms of the stiffness constant of the interface. Monte Carlo simulations for the ground-state ensemble utilizing this interfacial representation are performed to study both the dynamical and the static properties of the model. This method yields more accurate numerical results for the critical exponents. By varying the spin magnitude in the model, we find that the model exhibits three phases with a Kosterlitz-Thouless phase transition at 3/2<S_{KT}<2 and a locking phase transition at 5/2 < S_L \leq 3. The phase diagram at finite temperatures is also discussed.Comment: 15 pages, LaTeX; 10 figures in PostScript files; The revised version appears in PRB (see Journal-ref). New electronic address of first author, [email protected]

DepQBF 6.0: A Search-Based QBF Solver Beyond Traditional QCDCL

We present the latest major release version 6.0 of the quantified Boolean formula (QBF) solver DepQBF, which is based on QCDCL. QCDCL is an extension of the conflict-driven clause learning (CDCL) paradigm implemented in state of the art propositional satisfiability (SAT) solvers. The Q-resolution calculus (QRES) is a QBF proof system which underlies QCDCL. QCDCL solvers can produce QRES proofs of QBFs in prenex conjunctive normal form (PCNF) as a byproduct of the solving process. In contrast to traditional QCDCL based on QRES, DepQBF 6.0 implements a variant of QCDCL which is based on a generalization of QRES. This generalization is due to a set of additional axioms and leaves the original Q-resolution rules unchanged. The generalization of QRES enables QCDCL to potentially produce exponentially shorter proofs than the traditional variant. We present an overview of the features implemented in DepQBF and report on experimental results which demonstrate the effectiveness of generalized QRES in QCDCL.Comment: 12 pages + appendix; to appear in the proceedings of CADE-26, LNCS, Springer, 201

Unified characterisations of resolution hardness measures

Various "hardness" measures have been studied for resolution, providing theoretical insight into the proof complexity of resolution and its fragments, as well as explanations for the hardness of instances in SAT solving. In this paper we aim at a unified view of a number of hardness measures, including different measures of width, space and size of resolution proofs. Our main contribution is a unified game-theoretic characterisation of these measures. As consequences we obtain new relations between the different hardness measures. In particular, we prove a generalised version of Atserias and Dalmau's result on the relation between resolution width and space from [5]