918 research outputs found

    New Developments in FormCalc 8.4

    Full text link
    We present new developments in FeynArts 3.9 and FormCalc 8.4, in particular the MSSMCT model file including the complete one-loop renormalization, vectorization/parallelization issues, and the interface to the Ninja library for tensor reduction.Comment: 7 pages, proceedings contribution to Loops & Legs 2014, April 27-May 2, 2014, Weimar, German

    Time-resolved observation of spin-charge deconfinement in fermionic Hubbard chains

    No full text
    Elementary particles such as the electron carry several quantum numbers, for example, charge and spin. However, in an ensemble of strongly interacting particles, the emerging degrees of freedom can fundamentally differ from those of the individual constituents. Paradigmatic examples of this phenomenon are one-dimensional systems described by independent quasiparticles carrying either spin (spinon) or charge (holon). Here we report on the dynamical deconfinement of spin and charge excitations in real space following the removal of a particle in Fermi-Hubbard chains of ultracold atoms. Using space- and time-resolved quantum gas microscopy, we track the evolution of the excitations through their signatures in spin and charge correlations. By evaluating multi-point correlators, we quantify the spatial separation of the excitations in the context of fractionalization into single spinons and holons at finite temperatures

    New approach for the induced charge calculation for cylindrical electrodes

    Get PDF

    Simulation of Resistive Cooling in cylindrical Penning Traps

    Get PDF

    Density-functional theory investigation of oxygen adsorption at Pd(11N)(N=3,5,7) vicinal surfaces

    Full text link
    We present a density-functional theory study addressing the on-surface adsorption of oxygen at the Pd(11N) (N =3,5,7) vicinal surfaces, which exhibit (111) steps and (100) terraces of increasing width. We find the binding to be predominantly governed by the local coordination at the adsorption site. This leads to very similar bonding properties at the threefold step sites of all three vicinal surfaces, while the binding at the central fourfold hollow site in the four atomic row terrace of Pd(117) is already very little disturbed by the presence of the neighboring steps.Comment: 9 pages including 4 figures; related publications can be found at http://www.fhi-berlin.mpg.de/th/th.htm

    Change of the work function of platinum electrodes induced by halide adsorption

    Get PDF
    The properties of a halogen-covered platinum(111) surface have been studied by using density functional theory (DFT), because halides are often present at electrochemical electrode/electrolyte interfaces. We focused in particular on the halogen-induced work function change as a function of the coverage of fluorine, chlorine, bromine and iodine. For electronegative adsorbates, an adsorption-induced increase of the work function is usually expected, yet we find a decrease of the work function for Cl, Br and I, which is most prominent at a coverage of approximately 0.25 ML. This coverage-dependent behavior can be explained by assuming a combination of charge transfer and polarization effects on the adsorbate layer. The results are contrasted to the adsorption of fluorine on calcium, a system in which a decrease in the work function is also observed despite a large charge transfer to the halogen adatom

    Matchings with lower quotas : algorithms and complexity

    Get PDF
    We study a natural generalization of the maximum weight many-to-one matching problem. We are given an undirected bipartite graph G=(A∪˙P,E) with weights on the edges in E, and with lower and upper quotas on the vertices in P. We seek a maximum weight many-to-one matching satisfying two sets of constraints: vertices in A are incident to at most one matching edge, while vertices in P are either unmatched or they are incident to a number of matching edges between their lower and upper quota. This problem, which we call maximum weight many-to-one matching with lower and upper quotas (WMLQ), has applications to the assignment of students to projects within university courses, where there are constraints on the minimum and maximum numbers of students that must be assigned to each project. In this paper, we provide a comprehensive analysis of the complexity of WMLQ from the viewpoints of classical polynomial time algorithms, fixed-parameter tractability, as well as approximability. We draw the line between NP-hard and polynomially tractable instances in terms of degree and quota constraints and provide efficient algorithms to solve the tractable ones. We further show that the problem can be solved in polynomial time for instances with bounded treewidth; however, the corresponding runtime is exponential in the treewidth with the maximum upper quota umax as basis, and we prove that this dependence is necessary unless FPT=W[1]. The approximability of WMLQ is also discussed: we present an approximation algorithm for the general case with performance guarantee umax+1, which is asymptotically best possible unless P=NP. Finally, we elaborate on how most of our positive results carry over to matchings in arbitrary graphs with lower quotas

    Pragmatic Ontology Evolution: Reconciling User Requirements and Application Performance

    Get PDF
    Increasingly, organizations are adopting ontologies to describe their large catalogues of items. These ontologies need to evolve regularly in response to changes in the domain and the emergence of new requirements. An important step of this process is the selection of candidate concepts to include in the new version of the ontology. This operation needs to take into account a variety of factors and in particular reconcile user requirements and application performance. Current ontology evolution methods focus either on ranking concepts according to their relevance or on preserving compatibility with existing applications. However, they do not take in consideration the impact of the ontology evolution process on the performance of computational tasks – e.g., in this work we focus on instance tagging, similarity computation, generation of recommendations, and data clustering. In this paper, we propose the Pragmatic Ontology Evolution (POE) framework, a novel approach for selecting from a group of candidates a set of concepts able to produce a new version of a given ontology that i) is consistent with the a set of user requirements (e.g., max number of concepts in the ontology), ii) is parametrised with respect to a number of dimensions (e.g., topological considerations), and iii) effectively supports relevant computational tasks. Our approach also supports users in navigating the space of possible solutions by showing how certain choices, such as limiting the number of concepts or privileging trendy concepts rather than historical ones, would reflect on the application performance. An evaluation of POE on the real-world scenario of the evolving Springer Nature taxonomy for editorial classification yielded excellent results, demonstrating a significant improvement over alternative approaches

    A Combined XPS and Computational Study of the Chemical Reduction of BMP‐TFSI by Lithium

    Get PDF
    Employing density functional theory (DFT) calculations and X-ray photoelectron spectroscopy (XPS), we identify products of the reaction of the ionic liquid N,N-butylmethylpyrrolidinum bis(trifluoromethylsulfonyl)imide (BMP-TFSI) with lithium in order to model the initial chemical processes contributing to the formation of the solid electrolyte interphase in batteries. Besides lithium oxide, sulfide, carbide and fluoride, we find lithium cyanide or cyanamide as possible, thermodynamically stable product in the Li-poor regime, whilst Li3_{3}N is the stable product in the Li-rich regime. The thermodynamically controlled reaction products as well as larger fragments of TFSI persisting due to kinetic barriers could be identified by a comparison of experimentally and computationally determined core level binding energies

    Acceptance of criteria for health and driver scoring in the general public in Germany

    Get PDF
    Numerous health insurers offer bonus programmes that score customers' health behaviour, and car insurers offer telematics tariffs that score driving behaviour. In many countries, however, only a minority of customers participate in these programmes. In a population-representative survey of private households in Germany (N = 2,215), we study the acceptance of the criteria (features) on which the scoring programmes are based: the features for driver scoring (speed, texting while driving, time of driving, area of driving, accelerating and braking behaviour, respectively) and for health scoring (walking distance per day, sleeping hours per night, alcohol consumption, weight, participation in recommended cancer screenings, smoking status). In a second step, we model participants' acceptance of both programmes with regard to the underlying feature acceptance. We find that insurers in Germany rarely use the features which the participants consider to be the most relevant and justifiable, that is, smoking status for health scoring and smartphone use for driver scoring. Heuristic models (fast-and-frugal trees) show that programme acceptance depends on the acceptance of a few features. These models can help to understand customers' preferences and to design scoring programmes that are based on scientific evidence regarding behaviours and factors associated with good health and safe driving and are thus more likely to be accepted
    corecore