102 resultados para Honor Code
Resumo:
Detecting bugs as early as possible plays an important role in ensuring software quality before shipping. We argue that mining previous bug fixes can produce good knowledge about why bugs happen and how they are fixed. In this paper, we mine the change history of 717 open source projects to extract bug-fix patterns. We also manually inspect many of the bugs we found to get insights into the contexts and reasons behind those bugs. For instance, we found out that missing null checks and missing initializations are very recurrent and we believe that they can be automatically detected and fixed.
Resumo:
Code clone detection helps connect developers across projects, if we do it on a large scale. The cornerstones that allow clone detection to work on a large scale are: (1) bad hashing (2) lightweight parsing using regular expressions and (3) MapReduce pipelines. Bad hashing means to determine whether or not two artifacts are similar by checking whether their hashes are identical. We show a bad hashing scheme that works well on source code. Lightweight parsing using regular expressions is our technique of obtaining entire parse trees from regular expressions, robustly and efficiently. We detail the algorithm and implementation of one such regular expression engine. MapReduce pipelines are a way of expressing a computation such that it can automatically and simply be parallelized. We detail the design and implementation of one such MapReduce pipeline that is efficient and debuggable. We show a clone detector that combines these cornerstones to detect code clones across all projects, across all versions of each project.
Resumo:
We regularize compact and non-compact Abelian Chern–Simons–Maxwell theories on a spatial lattice using the Hamiltonian formulation. We consider a doubled theory with gauge fields living on a lattice and its dual lattice. The Hilbert space of the theory is a product of local Hilbert spaces, each associated with a link and the corresponding dual link. The two electric field operators associated with the link-pair do not commute. In the non-compact case with gauge group R, each local Hilbert space is analogous to the one of a charged “particle” moving in the link-pair group space R2 in a constant “magnetic” background field. In the compact case, the link-pair group space is a torus U(1)2 threaded by k units of quantized “magnetic” flux, with k being the level of the Chern–Simons theory. The holonomies of the torus U(1)2 give rise to two self-adjoint extension parameters, which form two non-dynamical background lattice gauge fields that explicitly break the manifest gauge symmetry from U(1) to Z(k). The local Hilbert space of a link-pair then decomposes into representations of a magnetic translation group. In the pure Chern–Simons limit of a large “photon” mass, this results in a Z(k)-symmetric variant of Kitaev’s toric code, self-adjointly extended by the two non-dynamical background lattice gauge fields. Electric charges on the original lattice and on the dual lattice obey mutually anyonic statistics with the statistics angle . Non-Abelian U(k) Berry gauge fields that arise from the self-adjoint extension parameters may be interesting in the context of quantum information processing.
Resumo:
CODE, the Center for Orbit Determination in Europe, is a joint venture of the following four institutions: Astronomical Institute, University of Bern (AIUB), Bern, Switzerland; Federal Office of Topography swisstopo, Wabern, Switzerland; Federal Agency of Cartography and Geodesy (BKG), Frankfurt a. M., Germany; Institut für Astronomische und Physikalische Geodäsie, Technische Universität München (IAPG, TUM), Munich, Germany. It acts as a global analysis center of the International GNSS Service (IGS). The operational computations are performed at AIUB using the latest development version of the Bernese GNSS Software. In this context an ultra-rapid solution series is generated considering GPS and GLONASS satellites. It is updated several times per day and contains 24 hours of observed and 24 hours of predicted orbit interval. More details are available in: Lutz, S., G. Beutler, S. Schaer, R. Dach, A. Jäggi; 2014: CODE's new ultra-rapid orbit and ERP products for the IGS. GPS Solutions. DOI 10.1007/s10291-014-0432-2
Resumo:
CODE, the Center for Orbit Determination in Europe, is a joint venture of the following four institutions: • Astronomical Institute, University of Bern (AIUB), Bern, Switzerland • Federal Office of Topography swisstopo, Wabern, Switzerland • Federal Agency of Cartography and Geodesy (BKG), Frankfurt a. M., Germany • Institut für Astronomische und Physikalische Geodäsie, Technische Universität München (IAPG, TUM), Munich, Germany It acts as a global analysis center of the International GNSS Service (IGS, Dow et al, 2009). The operational computations are performed at AIUB using the latest development version of the Bernese GNSS Software (Dach et al., 2015). In this context the contribution to the IGS repro02 effort is generated considering only the GPS satellites between 1994 and 2001 as well as the GPS and GLONASS satellites from 2002 to the end of 2013.
Resumo:
CODE, the Center for Orbit Determination in Europe, is a joint venture of the following four institutions: Astronomical Institute, University of Bern (AIUB), Bern, Switzerland;Federal Office of Topography swisstopo, Wabern, Switzerland; Federal Agency of Cartography and Geodesy (BKG), Frankfurt a. M., Germany; Institut für Astronomische und Physikalische Geodäsie, Technische Universität München (IAPG, TUM), Munich, Germany. It acts as a global analysis center of the International GNSS Service (IGS). The operational computations are performed at AIUB using the latest development version of the Bernese GNSS Software (Dach et al., 2015). In this context a rapid solution series is generated considering all active GPS and GLONASS satellites. It contains 24 hours of observed orbits and published at the day after the observations.