This article describes an atomic force microscope (AFM) that can operate in any scanning electron microscope (SEM) or SEM combined with a focused ion-beam (FIB) column. The combination of AFM, SEM imaging, energy-dispersive X-ray spectrometry (EDX), FIB milling, and nanofabrication methods (field-emission scanning probe lithography, tip-based electron beam induced deposition, and nanomachining) provides a new tool for correlative nanofabrication and microscopy. Piezoresistive, thermo-mechanically actuated cantilevers (active cantilevers) are used for fast imaging and nanofabrication. Thus, the AFM with active cantilevers integrated into an SEM (AFMinSEM) can generate and characterize nanostructures in situ without breaking vacuum or contaminating the sample.

Elemental, chemical, and structural analysis of polycrystalline materials at the micron scale is frequently carried out using microfocused synchrotron X-ray beams, sometimes on multiple instruments. The Maia pixelated energy-dispersive X-ray area detector enables the simultaneous collection of X-ray fluorescence (XRF) and diffraction because of the relatively large solid angle and number of pixels when compared with other systems. The large solid angle also permits extraction of surface topography because of changes in self-absorption. This work demonstrates the capability of the Maia detector for simultaneous measurement of XRF and diffraction for mapping the short- and long-range order across the grain structure in a Ni polycrystalline foil.

We propose a method to generate a max-stable process in C[0, 1] from a max-stable random vector in R d by generalizing the max-linear model established by Wang and Stoev (2011). For this purpose, an interpolation technique that preserves max-stability is proposed. It turns out that if the random vector follows some finite-dimensional distribution of some initial max-stable process, the approximating processes converge uniformly to the original process and the pointwise mean-squared error can be represented in a closed form. The obtained results carry over to the case of generalized Pareto processes. The introduced method enables the reconstruction of the initial process only from a finite set of observation points and, thus, a reasonable prediction of max-stable processes in space becomes possible. A possible extension to arbitrary dimensions is outlined.

The presence of multiple fields during inflation might seed a detectable amount of non-Gaussianity in the curvature perturbations, which in turn becomes observable in present data sets like the cosmic microwave background (CMB) or the large scale structure (LSS). Within this proceeding we present a fully analytic method to infer inflationary parameters from observations by exploiting higher-order statistics of the curvature perturbations. To keep this analyticity, and thereby to dispense with numerically expensive sampling techniques, a saddle-point approximation is introduced whose precision has been validated for a numerical toy example. Applied to real data, this approach might enable to discriminate among the still viable models of inflation.

Linear typing schemes can be used to guarantee non-interference and so the soundness of in-place update with respect to a functional semantics. But linear schemes are restrictive in practice, and more restrictive than necessary to guarantee soundness of in-place update. This limitation has prompted research into static analysis and more sophisticated typing disciplines to determine when in-place update may be safely used, or to combine linear and non-linear schemes. Here we contribute to this direction by defining a new typing scheme that better approximates the semantic property of soundness of in-place update for a functional semantics. We begin from the observation that some data are used only in a “read-only” context, after which it may be safely re-used before being destroyed. Formalising the in-place update interpretation in a machine model semantics allows us to refine this observation, motivating three usage aspects apparent from the semantics that are used to annotate function argument types. The aspects are (1) used destructively, (2), used read-only but shared with result, and (3) used read-only and not shared with the result. The main novelty is aspect (2), which allows a linear value to be safely read and even aliased with a result of a function without being consumed. This novelty makes our type system more expressive than previous systems for functional languages in the literature. The system remains simple and intuitive, but it enjoys a strong soundness property whose proof is non-trivial. Moreover, our analysis features principal types and feasible type reconstruction, as shown in M. Konečn'y (In TYPES 2002 workshop, Nijmegen, Proceedings, Springer-Verlag, 2003).

We present a method which allows to calculate gas sorption in complex polymers where, as slow processes, gas induced plasticization and volume dilation are important factors. Since the relaxational swelling of the polymer matrix that is observed at elevated gas concentrations takes hours or days, the swelling process is orders of magnitudes too slow to simulate the respective molecular dynamics in reasonable time and effort. To address this apparent incompatibility of experiment and simulation, we use single representative reference states from experiment and construct atomistic packing models according to these specifications. Gas sorption of CO2 and CH4 was successfully calculated on polysulfone, a 6FDA-polyimide, and a polymer of intrinsic microporosity, PIM-1, at 308 K and pressures up to 50 bar.

We show that real-number computations in the interval-domain environment are ‘inherently parallel’ in a precise mathematical sense. We do this by reducing computations of the weak parallel-or operation on the Sierpinski domain to computations of the addition operation on the interval domain.

A classical quantified modal logic is used to define a “feasible” arithmetic whose provably total functions are exactly the polynomial-time computable functions. Informally, one understands ⃞∝ as “∝ is feasibly demonstrable”.

differs from a system that is as powerful as Peano Arithmetic only by the restriction of induction to ontic (i.e., ⃞-free) formulas. Thus, is defined without any reference to bounding terms, and admitting induction over formulas having arbitrarily many alternations of unbounded quantifiers. The system also uses only a very small set of initial functions.

To obtain the characterization, one extends the Curry-Howard isomorphism to include modal operations. This leads to a realizability translation based on recent results in higher-type ramified recursion. The fact that induction formulas are not restricted in their logical complexity, allows one to use the Friedman A translation directly.

The development also leads us to propose a new Frege rule, the “Modal Extension” rule: if ⊢ ∝ a then ⊢ A ↔ ∝ for new symbol A.

We use a syntactical notion of Kripke models to obtain interpretations of subsystems of arithmetic in their intuitionistic counterparts. This yields, in particular, a new proof of Buss' result that the Skolem functions of Bounded Arithmetic are polynomial time computable.

Intensive care patients with organ failure often suffer an acute catabolic state. Leptin is a 16-kDa hormone which is produced by mature adipocytes and correlates with human energy expenditure. We investigated whether continuous venovenous haemofiltration, which may eliminate molecules up to 20–30 kDa, is capable of removing human leptin. Leptin measurements were made in the plasma of 15 patients with sepsis before continuous venovenous haemofiltration (T0) and during the procedure at 24 h (T1), 48 h (T2), and 72 h (T3), using samples taken before and after haemofiltration. In addition, measurements were made in the ultrafiltrate at T1–T3. The plasma leptin level at T0 was 17.6 ng mL−1. The concentration at T1 was 17.5 ng mL−1 pre-filter and 26.5 ng mL−1 post-filter (T2: 14.2/23.2 ng mL−1; T3: 12.4/16.3 ng mL−1).This concentration effect after haemofiltration was also seen with albumin. The values measured at T3 tended to be lower than those recorded at T1. The mean leptin levels in the ultrafiltrate were 0.15–0.18 ng mL−1. The range of leptin levels in the ultrafiltrate was thus only 0.5–3% of that measured in plasma. We conclude that human leptin is only minimally elimininated into the ultrafiltrate by continuous venovenous haemofiltration and that plasma leptin levels may decrease during sepsis.

This paper was guest-edited by Harry Mairson and Bruce Kapron, for our intended Special Issue on Functional Programming and Computational Complexity. Other papers submitted for the special issue were either out-of-scope or otherwise unsuitable for JFP. Even though only one paper met their high standards, this did not make Harry and Bruce's job any easier, and we thank them for their efforts.

In previous work the author has introduced a lambda calculus SLR with modal and linear types which serves as an extension of Bellantoni–Cook's function algebra BC to higher types. It is a step towards a functional programming language in which all programs run in polynomial time. While this previous work was concerned with the syntactic metatheory of SLR in this paper we develop a semantics of SLR in terms of Chu spaces over a certain category of sheaves from which it follows that all expressible functions are indeed in PTIME. We notice a similarity between the Chu space interpretation and CPS translation which as we hope will have further applications in functional programming.

We use the category of presheaves over PTIME-functions in order to show that Cook and Urquhart's higher-order function algebra PV ω defines exactly the PTIME-iunctions. As a byproduct we obtain a syntax-free generalisation of PTIME-computability to higher types.

By restricting to sheaves for a suitable topology we obtain a model for intuitionistic predicate logic with -induction over PV ω and use this to re-establish that the provably total functions in this system are polynomial time computable. Finally, we apply the category-theoretic approach to a new higher-order extension of Bellantoni-Cook's system BC of safe recursion.

We formulate a typed version of call-by-value λ-calculus containing variants of Felleisen's control operators A and C that provide explicit access to continuations and logically extend the propositions-as-types correspondence to classical propositional logic. We give an equational theory for this calculus, which is shown to be sound and complete with respect to a class of categorical models based on continuation-passing-style semantics.

We give a direct type-theoretic characterization of the basic mechanisms of object-oriented programming, including objects, methods, message passing, and subtyping, by introducing an explicit constructor for object types and suitable introduction, elimination, and equality rules. The resulting abstract framework provides a basis for justifying and comparing previous encodings of objects based on recursive record types (Cardelli, 1984; Cardelli, 1992; Bruce, 1994; Cook et al., 1990; Mitchell, 1990a) and encodings based on existential types (Pierce & Turner, 1994).

The process of reviewing test data for anomalies after a firing of the Space Shuttle Main Engine (SSME) is a complex, time-consuming task. A project is under way to provide the team of SSME experts with a knowledge-based system to assist in the review and diagnosis task. A model-based approach was chosen because it can be adapted to changes in engine design, is easier to maintain, and can be explained more easily. A complex thermodynamic fluid system like the SSME introduces problems during modeling, analysis, and diagnosis which have as yet been insufficiently studied. We developed a qualitative constraint-based diagnostic system inspired by existing qualitative modeling and constraint-based reasoning methods which addresses these difficulties explicitly. Our approach combines various diagnostic paradigms seamlessly, such as the model-based and heuristic association-based paradigms, in order to better approximate the reasoning process of the domain experts. The end-user interface allows expert users to actively participate in the reasoning process, both by adding their own expertise and by guiding the diagnostic search performed by the system.