Scalable simultaneous multi-qubit readout with 99.99% single-shot fidelity

We describe single-shot readout of a trapped-ion multi-qubit register using space and time-resolved camera detection. For a single qubit we measure 0.9(3)x10^{-4} readout error in 400us exposure time, limited by the qubit's decay lifetime. For a four-qubit register (a "qunybble") we measure an additional error of only 0.1(1)x10^{-4} per qubit, despite the presence of 4% optical cross-talk between neighbouring qubits. A study of the cross-talk indicates that the method would scale with negligible loss of fidelity to ~10000 qubits at a density <~1 qubit/um^2, with a readout time ~1us/qubit.Comment: 4 pages, 3 figures; simulations added to fig.3, with some further text and figure revisions. Main results unchanged

Consistent Gravitationally-Coupled Spin-2 Field Theory

Inspired by the translational gauge structure of teleparallel gravity, the theory for a fundamental massless spin-2 field is constructed. Accordingly, instead of being represented by a symmetric second-rank tensor, the fundamental spin-2 field is assumed to be represented by a spacetime (world) vector field assuming values in the Lie algebra of the translation group. The flat-space theory naturally emerges in the Fierz formalism and is found to be equivalent to the usual metric-based theory. However, the gravitationally coupled theory, with gravitation itself described by teleparallel gravity, is shown not to present the consistency problems of the spin-2 theory constructed on the basis of general relativity.Comment: 16 pages, no figures. V2: Presentation changes, including addition of a new sub-section, aiming at clarifying the text; version accepted for publication in Class. Quantum Grav

A note on the existence of soliton solutions in the Chern-Simons-CP(1) model

We study a gauged Chern-Simons-CP(1) system. We show that contrary to previous claims the model in the absences of a potential term cannot support finite size soliton solution in $R^2$.Comment: 12 pages, 5 figure

Fermiological Interpretation of Superconductivity/Non-superconductivity of FeTe_{1-x}Se_{x} Thin Crystal Determined by Quantum Oscillation Measurement

We have successfully observed quantum oscillation (QO) for FeTe_{1-x}Se_{x}. QO measurements were performed using non-superconducting and superconducting thin crystals of FeTe_{0.65}Se_{0.35} fabricated by the scotch-tape method. We show that the Fermi surfaces (FS) of the non-superconducting crystal are in good agreement with the rigid band shift model based on electron doping by excess Fe while that of the superconducting crystal is in good agreement with the calculated FS with no shift. From the FS comparison of both crystals, we demonstrate the change of the cross-sectional area of the FS, suggesting that the suppression of the FS nesting with the vector Q_{s} = (\pi, \pi) due to excess Fe results in the disappearance of the superconductivity.Comment: 8 pages, 4 figure

Automatic wheeze detection based on auditory modelling

Automatic wheeze detection has several potential benefits compared with reliance on human auscultation: it is experience independent, an automated historical record can easily be kept, and it allows quantification of wheeze severity. Previous attempts to detect wheezes automatically have had partial success but have not been reliable enough to become widely accepted as a useful tool. In this paper an improved algorithm for automatic wheeze detection based on auditory modelling is developed, called the frequency- and duration-dependent threshold algorithm. The mean frequency and duration of each wheeze component are obtained automatically. The detected wheezes are marked on a spectrogram. In the new algorithm, the concept of a frequency- and duration-dependent threshold for wheeze detection is introduced. Another departure from previous work is that the threshold is based not on global power but on power corresponding to a particular frequency range. The algorithm has been tested on 36 subjects, 11 of whom exhibited characteristics of wheeze. The results show a marked improvement in the accuracy of wheeze detection when compared with previous algorithms

Models for logics and conditional constraints in automated proofs of termination

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-13770-4_3Reasoning about termination of declarative programs, which are described by means of a computational logic, requires the definition of appropriate abstractions as semantic models of the logic, and also handling the conditional constraints which are often obtained. The formal treatment of such constraints in automated proofs, often using numeric interpretations and (arithmetic) constraint solving can greatly benefit from appropriate techniques to deal with the conditional (in)equations at stake. Existing results from linear algebra or real algebraic geometry are useful to deal with them but have received only scant attention to date. We investigate the definition and use of numeric models for logics and the resolution of linear and algebraic conditional constraints as unifying techniques for proving termination of declarative programs.Developed during a sabbatical year at UIUC. Supported by projects NSF CNS13-19109, MINECO TIN2010-21062-C02-02 and TIN2013-45732-C4-1-P, and GV BEST/2014/026 and PROMETEO/2011/052.Lucas Alba, S.; Meseguer, J. (2014). Models for logics and conditional constraints in automated proofs of termination. En Artificial Intelligence and Symbolic Computation. Springer Verlag (Germany). 9-20. https://doi.org/10.1007/978-3-319-13770-4_3S920Alarcón, B., Gutiérrez, R., Lucas, S., Navarro-Marset, R.: Proving Termination Properties with mu-term. In: Johnson, M., Pavlovic, D. (eds.) AMAST 2010. LNCS, vol. 6486, pp. 201–208. Springer, Heidelberg (2011)Alarcón, B., Lucas, S., Navarro-Marset, R.: Using Matrix Interpretations over the Reals in Proofs of Termination. In: Proc. of PROLE 2009, pp. 255–264 (2009)Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Talcott, C. (eds.): All About Maude - A High-Performance Logical Framework. LNCS, vol. 4350. Springer, Heidelberg (2007)Contejean, E., Marché, C., Tomás, A.-P., Urbain, X.: Mechanically proving termination using polynomial interpretations. J. of Aut. Reas. 34(4), 325–363 (2006)Endrullis, J., Waldmann, J., Zantema, H.: Matrix Interpretations for Proving Termination of Term Rewriting. J. of Aut. Reas. 40(2-3), 195–220 (2008)Fuhs, C., Giesl, J., Middeldorp, A., Schneider-Kamp, P., Thiemann, R., Zankl, H.: Maximal Termination. In: Voronkov, A. (ed.) RTA 2008. LNCS, vol. 5117, pp. 110–125. Springer, Heidelberg (2008)Futatsugi, K., Diaconescu, R.: CafeOBJ Report. AMAST Series. World Scientific (1998)Hudak, P., Peyton-Jones, S.J., Wadler, P.: Report on the Functional Programming Language Haskell: a non–strict, purely functional language. Sigplan Notices 27(5), 1–164 (1992)Lucas, S.: Context-sensitive computations in functional and functional logic programs. Journal of Functional and Logic Programming 1998(1), 1–61 (1998)Lucas, S.: Polynomials over the reals in proofs of termination: from theory to practice. RAIRO Theoretical Informatics and Applications 39(3), 547–586 (2005)Lucas, S., Marché, C., Meseguer, J.: Operational termination of conditional term rewriting systems. Information Processing Letters 95, 446–453 (2005)Lucas, S., Meseguer, J.: Proving Operational Termination of Declarative Programs in General Logics. In: Proc. of PPDP 2014, pp. 111–122. ACM Digital Library (2014)Lucas, S., Meseguer, J.: 2D Dependency Pairs for Proving Operational Termination of CTRSs. In: Proc. of WRLA 2014. LNCS, vol. 8663 (to appear, 2014)Lucas, S., Meseguer, J., Gutiérrez, R.: Extending the 2D DP Framework for CTRSs. In: Selected papers of LOPSTR 2014. LNCS (to appear, 2015)Meseguer, J.: General Logics. In: Ebbinghaus, H.-D., et al. (eds.) Logic Colloquium 1987, pp. 275–329. North-Holland (1989)Nguyen, M.T., de Schreye, D., Giesl, J., Schneider-Kamp, P.: Polytool: Polynomial interpretations as a basis for termination of logic programs. Theory and Practice of Logic Programming 11(1), 33–63 (2011)Ohlebusch, E.: Advanced Topics in Term Rewriting. Springer (April 2002)Prestel, A., Delzell, C.N.: Positive Polynomials. In: From Hilbert’s 17th Problem to Real Algebra. Springer, Berlin (2001)Podelski, A., Rybalchenko, A.: A Complete Method for the Synthesis of Linear Ranking Functions. In: Steffen, B., Levi, G. (eds.) VMCAI 2004. LNCS, vol. 2937, pp. 239–251. Springer, Heidelberg (2004)Schrijver, A.: Theory of linear and integer programming. John Wiley & Sons (1986)Zantema, H.: Termination of Context-Sensitive Rewriting. In: Comon, H. (ed.) RTA 1997. LNCS, vol. 1232, pp. 172–186. Springer, Heidelberg (1997

In-service Initial Teacher Education in the Learning and Skills Sector in England: Integrating Course and Workplace Learning

The aim of the paper is to advance understanding of in-service learning and skills sector trainee teachers’ learning and propose ways of improving their learning. A conceptual framework is developed by extending Billett’s (International Journal of Educational Research 47:232–240, 2008) conceptualisation of workplace learning, as a relationally interdependent process between the opportunities workplaces afford for activities and interactions and how individuals engage with these, to a third base of participation, the affordances of the initial teacher education course. Hager and Hodkinson’s (British Educational Research Journal 35:619–638, 2009) metaphor of ‘learning as becoming’ is used to conceptualise the ways trainees reconstruct learning in a continuous transactional process of boundary crossing between course and workplace. The findings of six longitudinal case studies of trainees’ development, and evidence from other studies, illustrate the complex interrelationships between LSS workplace affordances, course affordances and trainee characteristics and the ways in which trainees reconstruct learning in each setting. The experience of teaching and interacting with learners, interactions with colleagues, and access to workplace resources and training are important workplace affordances for learning. However, some trainees have limited access to these affordances. Teaching observations, course activities and experiences as a learner are significant course affordances. Trainees’ beliefs, prior experiences and dispositions vary and significantly influence their engagement with course and workplace affordances. It is proposed that better integration of course and workplace learning through guided participation in an intentional workplace curriculum and attention to the ways trainees choose to engage with this, together with the use of practical theorising has the potential to improve trainee learning

Experiments with a Malkus-Lorenz water wheel: Chaos and Synchronization

We describe a simple experimental implementation of the Malkus-Lorenz water wheel. We demonstrate that both chaotic and periodic behavior is found as wheel parameters are changed in agreement with predictions from the Lorenz model. We furthermore show that when the measured angular velocity of our water wheel is used as an input signal to a computer model implementing the Lorenz equations, high quality chaos synchronization of the model and the water wheel is achieved. This indicates that the Lorenz equations provide a good description of the water wheel dynamics.Comment: 12 pages, 7 figures. The following article has been accepted by the American Journal of Physics. After it is published, it will be found at http://scitation.aip.org/ajp

Observation of huge thermal spin currents in magnetic multilayers

Thermal spin pumping constitutes a novel mechanism for generation of spin currents; however their weak intensity constitutes a major roadblock for its usefulness. We report a phenomenon that produces a huge spin current in the central region of a multilayer system, resulting in a giant spin Seebeck effect in a structure formed by repetition of ferromagnet/metal bilayers. The result is a consequence of the interconversion of magnon and electron spin currents at the multiple interfaces. This work opens the possibility to design thin film heterostructures that may boost the application of thermal spin currents in spintronics

Phase transition in a stochastic prime number generator

We introduce a stochastic algorithm that acts as a prime number generator. The dynamics of such algorithm gives rise to a continuous phase transition which separates a phase where the algorithm is able to reduce a whole set of integers into primes and a phase where the system reaches a frozen state with low prime density. We present both numerical simulations and an analytical approach in terms of an annealed approximation, by means of which the data are collapsed. A critical slowing down phenomenon is also outlined.Comment: accepted in PRE (Rapid Comm.