Locality and topology with fat link overlap actions

We study the locality and topological properties of fat link clover overlap (FCO) actions. We find that a small amount of fattening (2-4 steps of APE or 1 step of HYP) already results in greatly improved properties compared to the Wilson overlap (WO). We present a detailed study of the localisation of the FCO and its connection to the density of low modes of $A^\dagger A$. In contrast to the Wilson overlap, on quenched gauge backgrounds we do not find any dependence of the localization of the FCO on the gauge coupling. This suggests that the FCO remains local in the continuum limit. The FCO also faithfully reproduces the zero mode wave functions of typical lattice instantons, not like the Wilson overlap. After a general discussion of different lattice definitions of the topological charge we also show that the FCO together with the Boulder charge are likely to satisfy the index theorem in the continuum limit. Finally, we present a high statistics computation of the quenched topological susceptibility with the FCO action.Comment: 19 pages, LaTe

Customer emotions in service failure and recovery encounters

Emotions play a significant role in the workplace, and considerable attention has been given to the study of employee emotions. Customers also play a central function in organizations, but much less is known about customer emotions. This chapter reviews the growing literature on customer emotions in employee–customer interfaces with a focus on service failure and recovery encounters, where emotions are heightened. It highlights emerging themes and key findings, addresses the measurement, modeling, and management of customer emotions, and identifies future research streams. Attention is given to emotional contagion, relationships between affective and cognitive processes, customer anger, customer rage, and individual differences

The army and the Norwegian revolution Military and society in Norway to 1814

SIGLELD:D48335/84 / BLDSC - British Library Document Supply CentreGBUnited Kingdo

Rosacea flaccida n. sp., a new species of siphonophore (Calycophorae Prayinae) from the North Atlantic Ocean

Rosacea flaccida, a new prayine siphonophore, is described from specimens collected by SCUBA divers in the upper 30m of the subtropical and temperate North Atlantic Ocean. The new species has stoutly cylindrical, flaccid nectophores and delicate flattened bracts. The nectophores are morphologically similar to those of R. plicata sensu Bigelow, 1911 and R. cymbiformis (delle Chiaje, 1822) having a deep hydroecial groove and meandering lateral radial canals in the nectosac. In one of the nectophores there is a slight dorsal prolongation of the somatocyst at its apical end into the mesoglea. The eudoxid bracts are distinctive, being flattened dorsoventrally and divided, on the proximal side of the stem, into two lobes which are twisted at an angle of approximately 90° to the lobe on the distal side. Right and left longitudinal bracteal canals are well developed. The origin of the dorsal bracteal canal from the right longitudinal canal differs from that in the other Rosacea species but resembles the configuration found in the bracts of species of the genus Praya

Path-based reuse distance analysis

Profiling can effectively analyze program behavior and provide critical information for feedback-directed or dynamic optimizations. Based on memory profiling, reuse distance analysis has shown much promise in predicting data locality for a program using inputs other than the profiled ones. Both wholeprogram and instruction-based locality can be accurately predicted by reuse distance analysis. Reuse distance analysis abstracts a cluster of memory references for a particular instruction having similar reuse distance values into a locality pattern. Prior work has shown that a significant number of memory instructions have multiple locality patterns, a property not desirable for many instruction-based memory optimizations. This paper investigates the relationship between locality patterns and execution paths by analyzing reuse distance distribution along each dynamic path to an instruction. Here a path is defined as the program execution trace from the previous access of a memory location to the current access. By differentiating locality patterns with the context of execution paths, the proposed analysis can expose optimization opportunities tailored only to a specific subset of paths leading to an instruction. In this paper, we present an effective method for path-based reuse distance profiling and analysis. We have observed that a significant percentage of the multiple locality patterns for an instruction can be uniquely related to a particular execution path in the program. In addition, we have also investigated the influence of inputs on reuse distance distribution for each path/instruction pair. The experimental results show that the path-based reuse distance is highly predictable, as a function of the data size, for a set of SPEC CPU2000 programs

MOCVD of zirconium oxide from the zirconium guanidinate complex |ZrCp′{2-(iPrN)2CNMe2}2Cl]

Parallel to successful studies into use of [ZrCp'{¿ 2-(iPrN)2CNMe2} 2Cl] as a precursor to the deposition of zirconium carbonitride via CVD the same precursor was utilised for the MOCVD of thin films of ZrO 2 using borosilicate glass substrates. The deposited films were of mixed phase; films deposited at temperatures below 550 °C were predominantly orthorhombic (or tetragonal), whilst films deposited at 600 °C were approximately 1:1 mixtures of monoclinic and orthorhombic (or tetragonal) ZrO2. Additionally the monoclinic phase displayed preferred orientation. Compositional analysis showed that whilst the films had significant amounts of, principally graphitic, carbon contamination, which increased with increasing deposition temperature, chlorine contamination was negligible. © The Electrochemical Society

Verifying and reflecting quantifier elimination for Presburger arithmetic

We present an implementation and verification in higher-order logic of Cooper’s quantifier elimination for Presburger arithmetic. Reflection, i.e. the direct execution in ML, yields a speed-up of a factor of 200 over an LCF-style implementation and performs as well as a decision procedure hand-coded in ML

Complete integer decision procedures as derived rules in HOL

Abstract. I describe the implementation of two complete decision procedures for integer Presburger arithmetic in the HOL theorem-proving system. The first procedure is Cooper’s algorithm, the second, the Omega Test. Between them, the algorithms illustrate three different implementation techniques in a fully expansive system.