Algorithmic Debugging of Real-World Haskell Programs: Deriving Dependencies from the Cost Centre Stack

Existing algorithmic debuggers for Haskell require a transformation of all modules in a program, even libraries that the user does not want to debug and which may use language features not supported by the debugger. This is a pity, because a promising ap- proach to debugging is therefore not applicable to many real-world programs. We use the cost centre stack from the Glasgow Haskell Compiler profiling environment together with runtime value observations as provided by the Haskell Object Observation Debugger (HOOD) to collect enough information for algorithmic debugging. Program annotations are in suspected modules only. With this technique algorithmic debugging is applicable to a much larger set of Haskell programs. This demonstrates that for functional languages in general a simple stack trace extension is useful to support tasks such as profiling and debugging

Breaking New Ground in Germany: Work Visa and Labour Law Aspects

[Excerpt] The purpose of this booklet is to provide a summary of the laws and procedures applicable to anyone who enters Germany and takes up employment. It does not explore all issues in detail.The law is correct as of April 1, 2006

Example of two different potentials which have practically the same fixed-energy phase shifts

It is shown that the Newton-Sabatier procedure for inverting the fixed-energy phase shifts for a potential is not an inversion method but a parameter-fitting procedure. Theoretically there is no guarantee that this procedure is applicable to the given set of the phase shifts, if it is applicable, there is no guaran- tee that the potential it produces generates the phase shifts from which it was reconstructed. Moreover, no generic potential, specifically, no potential which is not analytic in a neighborhood of the positive real semiaxis can be reconstructed by the Newton-Sabatier procedure. A numerical method is given for finding spherically symmetric compactly supported potentials which produce practically the same set of fixed-energy phase shifts for all values of angular momentum. Concrete example of such potentials is given

Online Bivariate Outlier Detection in Final Test Using Kernel Density Estimation

In parametric IC testing, outlier detection is applied to filter out potential unreliable devices. Most outlier detection methods are used in an offline setting and hence are not applicable to Final Test, where immediate pass/fail decisions are required. Therefore, we developed a new bivariate online outlier detection method that is applicable to Final Test without making assumptions about a specific form of relations between two test parameters. An acceptance region is constructed using kernel density estimation. We use a grid discretization in order to enable a fast outlier decision. After each accepted device the grid is updated, hence the method is able to adapt to shifting measurements

Self-adjointness of perturbed bi-Laplacians on infinite graphs

We give a sufficient condition for the essential self-adjointness of a perturbation of the square of the magnetic Laplacian on an infinite weighted graph. The main result is applicable to graphs whose degree function is not necessarily bounded. The result allows perturbations that are not necessarily bounded from below by a constant.Comment: We edited the introduction and updated the bibliographical information for some references. We moved the examples towards the front of the articl