Multi-kilowatt single-mode ytterbium-doped large-core fiber laser

We have demonstrated a highly efficient cladding-pumped ytterbium-doped fiber laser, generating >2.1 kW of continuous-wave output power at 1.1 µm with 74% slope efficiency with respect to launched pump power. The beam quality factor (M2) was better than 1.2. The maximum output power was only limited by available pump power, showing no evidence of roll-over even at the highest output power. We present data on how the beam quality depends on the fiber parameter, based on our current and past fiber laser developments. We also discuss the ultimate power-capability of our fiber in terms of thermal management, Raman nonlinear scattering, and material damage, and estimate it to 10 k

Topological entropy and secondary folding

A convenient measure of a map or flow's chaotic action is the topological entropy. In many cases, the entropy has a homological origin: it is forced by the topology of the space. For example, in simple toral maps, the topological entropy is exactly equal to the growth induced by the map on the fundamental group of the torus. However, in many situations the numerically-computed topological entropy is greater than the bound implied by this action. We associate this gap between the bound and the true entropy with 'secondary folding': material lines undergo folding which is not homologically forced. We examine this phenomenon both for physical rod-stirring devices and toral linked twist maps, and show rigorously that for the latter secondary folds occur.Comment: 13 pages, 8 figures. pdfLaTeX with RevTeX4 macro

Periodic orbits of period 3 in the disc

Let f be an orientation preserving homeomorphism of the disc D2 which possesses a periodic point of period 3. Then either f is isotopic, relative the periodic orbit, to a homeomorphism g which is conjugate to a rotation by 2 pi /3 or 4 pi /3, or f has a periodic point of least period n for each n in N*.Comment: 7 page

Modular termination verification for non-blocking concurrency

© Springer-Verlag Berlin Heidelberg 2016.We present Total-TaDA, a program logic for verifying the total correctness of concurrent programs: that such programs both terminate and produce the correct result. With Total-TaDA, we can specify constraints on a thread’s concurrent environment that are necessary to guarantee termination. This allows us to verify total correctness for nonblocking algorithms, e.g. a counter and a stack. Our specifications can express lock- and wait-freedom. More generally, they can express that one operation cannot impede the progress of another, a new non-blocking property we call non-impedance. Moreover, our approach is modular. We can verify the operations of a module independently, and build up modules on top of each other

Beyond-brand effect of television food advertisements on food choice in children: The effects of weight status

Copyright © The Authors 2007.Objective - To investigate the effect of television food advertising on children’s food intake, specifically whether childhood obesity is related to a greater susceptibility to food promotion. Design - The study was a within-subject, counterbalanced design. The children were tested on two occasions separated by two weeks. One condition involved the children viewing food advertisements followed by a cartoon, in the other condition the children viewed non-food adverts followed by the same cartoon. Following the cartoon, their food intake and choice was assessed in a standard paradigm. Setting - The study was conducted in Liverpool, UK. Subjects - Fifty-nine children (32 male, 27 female) aged 9–11 years were recruited from a UK school to participate in the study. Thirty-three children were normal-weight (NW), 15 overweight (OW) and 11 obese (OB). Results - Exposure to food adverts produced substantial and significant increases in energy intake in all children (P < 0·001). The increase in intake was largest in the obese children (P = 0·04). All children increased their consumption of high-fat and/or sweet energy-dense snacks in response to the adverts (P < 0·001). In the food advert condition, total intake and the intake of these specific snack items correlated with the children’s modified age- and gender-specific body mass index score. Conclusions - These data suggest that obese and overweight children are indeed more responsive to food promotion, which specifically stimulates the intake of energy-dense snacks.University of Liverpoo

Verification of Snapshotable Trees using Access Permissions and Typestate

Abstract. We use access permissions and typestate to specify and verify a Java library that implements snapshotable search trees, as well as some client code. We formalize our approach in the Plural tool, a sound modular typestate checking tool. We describe the challenges to verifying snapshotable trees in Plural, give an abstract interface specification against which we verify the client code, provide a concrete specification for an implementation and describe proof patterns we found. We also relate this verification approach to other techniques used to verify this data structure.

Hyperbolic outer billiards : a first example

We present the first example of a hyperbolic outer billiard. More precisely we construct a one parameter family of examples which in some sense correspond to the Bunimovich billiards.Comment: 11 pages, 8 figures, to appear in Nonlinearit

Specification and verification of atomic operations in GPGPU programs

We propose a specification and verification technique based on separation logic to reason about data race freedom and functional correctness of GPU kernels that use atomic operations as synchronisation mechanism. Our approach exploits the notion of resource invariant from Concurrent Separation Logic (CSL) to capture the behaviour of atomic operations. However, because of the different memory levels in the GPU architecture, we adapt this notion of resource invariant to these memory levels, i.e., group resource invariants capture the behaviour of atomic operations that access locations in local memory, while kernel resource invariants capture the behaviour of atomic operations that access locations in global memory. We show soundness of our approach and we provide tool support that enables us to verify kernels from standard benchmarks suites

Verification of loop parallelisations

Writing correct parallel programs becomes more and more difficult as the complexity and heterogeneity of processors increase. This issue is addressed by parallelising compilers. Various compiler directives can be used to tell these compilers where to parallelise. This paper addresses the correctness of such compiler directives for loop parallelisation. Specifically, we propose a technique based on separation logic to verify whether a loop can be parallelised. Our approach requires each loop iteration to be specified with the locations that are read and written in this iteration. If the specifications are correct, they can be used to draw conclusions about loop (in)dependences. Moreover, they also reveal where synchronisation is needed in the parallelised program. The loop iteration specifications can be verified using permission-based separation logic and seamlessly integrate with functional behaviour specifications. We formally prove the correctness of our approach and we discuss automated tool support for our technique. Additionally, we also discuss how the loop iteration contracts can be compiled into specifications for the code coming out of the parallelising compiler