Participation des maîtres aux modes de raisonnement des élèves

This paper analyses the relationship between teachers and students' reasoning

Photon mediated interaction between distant quantum dot circuits

Engineering the interaction between light and matter is an important goal in the emerging field of quantum opto-electronics. Thanks to the use of cavity quantum electrodynamics architectures, one can envision a fully hybrid multiplexing of quantum conductors. Here, we use such an architecture to couple two quantum dot circuits . Our quantum dots are separated by 200 times their own size, with no direct tunnel and electrostatic couplings between them. We demonstrate their interaction, mediated by the cavity photons. This could be used to scale up quantum bit architectures based on quantum dot circuits or simulate on-chip phonon-mediated interactions between strongly correlated electrons

A High Reliability Gas-driven Helium Cryogenic Centrifugal Compressor

A helium cryogenic compressor was developed and tested in real conditions in 1996. The achieved objective was to compress 0.018 kg/s Helium at 4 K @ 1000 Pa (10 mbar) up to 3000 Pa (30 mbar). This project was an opportunity to develop and test an interesting new concept in view of future needs. The main features of this new specific technology are described. Particular attention is paid to the gas bearing supported rotor and to the pneumatic driver. Trade off between existing technologies and the present work are presented with special stress on the bearing system and the driver. The advantages are discussed, essentially focused on life time and high reliability without maintenance as well as non pollution characteristic. Practical operational modes are also described together with the experimental performances of the compressor. The article concludes with a brief outlook of future work

Statistics of reduced words in locally free and braid groups: Abstract studies and application to ballistic growth model

We study numerically and analytically the average length of reduced (primitive) words in so-called locally free and braid groups. We consider the situations when the letters in the initial words are drawn either without or with correlations. In the latter case we show that the average length of the reduced word can be increased or lowered depending on the type of correlation. The ideas developed are used for analytical computation of the average number of peaks of the surface appearing in some specific ballistic growth modelComment: 29 pages, LaTeX, 7 separated Postscript figures (available on request), submitted to J. Phys. (A): Math. Ge

Information Gathering in Ad-Hoc Radio Networks with Tree Topology

We study the problem of information gathering in ad-hoc radio networks without collision detection, focussing on the case when the network forms a tree, with edges directed towards the root. Initially, each node has a piece of information that we refer to as a rumor. Our goal is to design protocols that deliver all rumors to the root of the tree as quickly as possible. The protocol must complete this task within its allotted time even though the actual tree topology is unknown when the computation starts. In the deterministic case, assuming that the nodes are labeled with small integers, we give an O(n)-time protocol that uses unbounded messages, and an O(n log n)-time protocol using bounded messages, where any message can include only one rumor. We also consider fire-and-forward protocols, in which a node can only transmit its own rumor or the rumor received in the previous step. We give a deterministic fire-and- forward protocol with running time O(n^1.5), and we show that it is asymptotically optimal. We then study randomized algorithms where the nodes are not labelled. In this model, we give an O(n log n)-time protocol and we prove that this bound is asymptotically optimal

Chebyshev type lattice path weight polynomials by a constant term method

We prove a constant term theorem which is useful for finding weight polynomials for Ballot/Motzkin paths in a strip with a fixed number of arbitrary `decorated' weights as well as an arbitrary `background' weight. Our CT theorem, like Viennot's lattice path theorem from which it is derived primarily by a change of variable lemma, is expressed in terms of orthogonal polynomials which in our applications of interest often turn out to be non-classical. Hence we also present an efficient method for finding explicit closed form polynomial expressions for these non-classical orthogonal polynomials. Our method for finding the closed form polynomial expressions relies on simple combinatorial manipulations of Viennot's diagrammatic representation for orthogonal polynomials. In the course of the paper we also provide a new proof of Viennot's original orthogonal polynomial lattice path theorem. The new proof is of interest because it uses diagonalization of the transfer matrix, but gets around difficulties that have arisen in past attempts to use this approach. In particular we show how to sum over a set of implicitly defined zeros of a given orthogonal polynomial, either by using properties of residues or by using partial fractions. We conclude by applying the method to two lattice path problems important in the study of polymer physics as models of steric stabilization and sensitized flocculation.Comment: 27 pages, 14 figure

Cycle-centrality in complex networks

Networks are versatile representations of the interactions between entities in complex systems. Cycles on such networks represent feedback processes which play a central role in system dynamics. In this work, we introduce a measure of the importance of any individual cycle, as the fraction of the total information flow of the network passing through the cycle. This measure is computationally cheap, numerically well-conditioned, induces a centrality measure on arbitrary subgraphs and reduces to the eigenvector centrality on vertices. We demonstrate that this measure accurately reflects the impact of events on strategic ensembles of economic sectors, notably in the US economy. As a second example, we show that in the protein-interaction network of the plant Arabidopsis thaliana, a model based on cycle-centrality better accounts for pathogen activity than the state-of-art one. This translates into pathogen-targeted-proteins being concentrated in a small number of triads with high cycle-centrality. Algorithms for computing the centrality of cycles and subgraphs are available for download