Surface roughness and height-height correlations dependence on thickness of YBaCuO thin films

For high Tc superconducting multilayer applications, smooth interfaces between the individual layers are required. However, in general, e.g., YBaCuO grows in a 3D screw-dislocation or island nucleation growth mode, introducing a surface roughness. In this contribution we study the surface layer roughness as a function of different deposition techniques as well as deposition parameters. Special attention will be paid to the increase in film roughness with increasing film thickness. For these studies we used scanning probe microscopy. From these experiments, we obtained an island density decreasing with a square root dependence on the film thickness. Furthermore, height-height correlations indicate that the film growth can be described by a ballistic growth process, with very limited effective surface diffusion. The correlation lengths ¿ are on the order of the island size, inferring that the island size forms the mean diffusion barrier. This results in a representation of non-correlated islands, which can be considered as autonomous systems

Complete physical simulation of the entangling-probe attack on the BB84 protocol

We have used deterministic single-photon two qubit (SPTQ) quantum logic to implement the most powerful individual-photon attack against the Bennett-Brassard 1984 (BB84) quantum key distribution protocol. Our measurement results, including physical source and gate errors, are in good agreement with theoretical predictions for the Renyi information obtained by Eve as a function of the errors she imparts to Alice and Bob's sifted key bits. The current experiment is a physical simulation of a true attack, because Eve has access to Bob's physical receiver module. This experiment illustrates the utility of an efficient deterministic quantum logic for performing realistic physical simulations of quantum information processing functions.Comment: 4 pages, 5 figure

A Note on Scheduling Problems with Irregular Starting Time Costs

In [9], Maniezzo and Mingozzi study a project scheduling problem with irregular starting time costs. Starting from the assumption that its computational complexity status is open, they develop a branch-and-bound procedure, and identify special cases that are solvable in polynomial time. In this note, we review three previously established, related results which show that the general problem is solvable in polynomial time

Bewaring van Chinese koolrassen (seizoen 1981 / 1982)

Verslag van een vergelijkingsproef naar de bewaarbaarheid van 45 Chinese koolrasse

Conditioning bounds for traveltime tomography in layered media

This paper revisits the problem of recovering a smooth, isotropic, layered wave speed profile from surface traveltime information. While it is classic knowledge that the diving (refracted) rays classically determine the wave speed in a weakly well-posed fashion via the Abel transform, we show in this paper that traveltimes of reflected rays do not contain enough information to recover the medium in a well-posed manner, regardless of the discretization. The counterpart of the Abel transform in the case of reflected rays is a Fredholm kernel of the first kind which is shown to have singular values that decay at least root-exponentially. Kinematically equivalent media are characterized in terms of a sequence of matching moments. This severe conditioning issue comes on top of the well-known rearrangement ambiguity due to low velocity zones. Numerical experiments in an ideal scenario show that a waveform-based model inversion code fits data accurately while converging to the wrong wave speed profile

Scheduling with AND/OR precedence constraints

In many scheduling applications it is required that the processing of some job must be postponed until some other job, which can be chosen from a pre-given set of alternatives, has been completed. The traditional concept of precedence constraints fails to model such restrictions. Therefore, the concept has been generalized to so-called AND/OR precedence constraints which can cope with this kind of requirement