Paper coatings with multi-scale roughness evaluated at different sampling sizes

Papers have a complex hierarchical structure and the end-user functionalities such as hydrophobicity are controlled by a finishing layer. The application of an organic nanoparticle coating and drying of the aqueous dispersion results in an unique surface morphology with microscale domains that are internally patterned with nanoparticles. Better understanding of the multi-scale surface roughness patterns is obtained by monitoring the topography with non-contact profilometry (NCP) and atomic force microscopy (AFM) at different sampling areas ranging from 2000 μm × 2000 μm to 0.5 μm × 0.5 μm. The statistical roughness parameters are uniquely related to each other over the different measuring techniques and sampling sizes, as they are purely statistically determined. However, they cannot be directly extrapolated over the different sampling areas as they represent transitions at the nano-, micro-to-nano and microscale level. Therefore, the spatial roughness parameters including the correlation length and the specific frequency bandwidth should be taken into account for each measurement, which both allow for direct correlation of roughness data at different sampling sizes.     

Spectroscopy of the hyperfine structure of antiprotonic 4He and 3He

The spin magnetic moment $\mu^{\overline{p}}_{s}$ of the antiproton can be determined by comparing the measured transition frequencies in $\overline{p}^4$ He^?+? with three-body QED calculations. A comparison between the proton and antiproton can then be used as a test of CPT invariance. The highest measurement precision of the difference between the proton and the antiproton spin magnetic moments to date is 0.3%. A new experimental value of the spin magnetic moment of the antiproton was obtained as $\mu^{\overline{p}}_{s} = -2.7862(83)\mu_{N}$ , slightly better than the previously best measurement. This agrees with $\mu^{p}_{s}$ within 0.24%. In 2009, a new measurement with antiprotonic ³He has been started. A comparison between the theoretical calculations and experimental results would lead to a stronger test of the theory and address systematic errors therein. A measurement of this state will be the first HF measurement on $\overline{p}^3$ He^?+?. We report here on the new experimental setup and the first tests.     

Monotonicity of the reflected Bessel transition density on the diagonal

For α∈R$\alpha \in \mathbb{R}$, let p^R(t,x,x)$p^R(t,x,x)$ denote the diagonal of the transition density of the α$\alpha$-Bessel process in (0,1]$(0,1]$, killed at 0 and reflected at 1. As a function of x$x$, if either α≥3$\alpha \ge 3$ or α=1$\alpha =1$, then for t>0$t>0$, the diagonal is nondecreasing. This monotonicity property fails if 1≠α<3$1\ne \alpha <3$.     

Dimensional variance inequalities of Brascamp–Lieb type and a local approach to dimensional Prékopaʼs theorem

We give a new approach, inspired by Hörmander?s L²$L^2$-method, to weighted variance inequalities which extend results obtained by Bobkov and Ledoux. It provides in particular a local proof of the dimensional functional forms of the Brunn–Minkowski inequalities. We also present several applications of these variance inequalities, including reverse Hölder inequalities for convex functions, weighted Brascamp–Lieb inequalities and sharp weighted Poincaré inequalities for generalized Cauchy measures.     

On optimality conditions for vector variational inequalities

Optimality conditions for weak efficient, global efficient and efficient solutions of vector variational inequalities with constraints defined by equality, cone and set constraints are derived. Under various constraint qualifications, necessary optimality conditions for weak efficient, global efficient and efficient solutions in terms of the Clarke and Michel–Penot subdifferentials are established. With assumptions on quasiconvexity of constraint functions sufficient optimality conditions are also given.     

Varieties of wonder:: John Wilkins' mathematical magic and the perpetuity of invention

Akin to the mathematical recreations, John Wilkins' Mathematicall Magick ( 1648) elaborates the pleasant, useful and wondrous part of practical mathematics, dealing in particular with its material culture of machines and instruments. We contextualize the Mathematicall Magick by studying its institutional setting and its place within changing conceptions of art, nature, religion and mathematics. We devote special attention to the way Wilkins inscribes mechanical innovations within a discourse of wonder. Instead of treating ‘wonder’ as a monolithic category, we present a typology, showing that wonders were not only recreative, but were meant to inspire Wilkins' readers to new mathematical inventions.     

A branch-and-bound algorithm for the coupled task problem

The coupled task problem is to schedule jobs on a single machine where each job consists of two subtasks and where the second subtask has to be started after a given time interval with respect to the first one. The problem has several applications and is NP-hard. In this paper we present a branch-and-bound algorithm for this problem and compare its performance with four integer programming models.     

The Penalty Functions Method and Multiplier Rules Based on the Mordukhovich Subdifferential

We show that the finite-dimensional Fritz John multiplier rule, which is based on the limiting/Mordukhovich subdifferential, can be proved by using differentiable penalty functions and the basic calculus tools in variational analysis. The corresponding Kuhn–Tucker multiplier rule is derived from the Fritz John multiplier rule by imposing a constraint qualification condition or the exactness of an ?₁ penalty function. Complementing the existing proofs, our proofs provide another viewpoint on the fundamental multiplier rules employing the Mordukhovich subdifferential.     

Projected viscosity subgradient methods for variational inequalities with equilibrium problem constraints in Hilbert spaces

In this paper, we introduce and study some low computational cost numerical methods for finding a solution of a variational inequality problem over the solution set of an equilibrium problem in a real Hilbert space. The strong convergence of the iterative sequences generated by the proposed algorithms is obtained by combining viscosity-type approximations with projected subgradient techniques. First a general scheme is proposed, and afterwards two practical realizations of it are studied depending on the characteristics of the feasible set. When this set is described by convex inequalities, the projections onto the feasible set are replaced by projections onto half-spaces with the consequence that most iterates are outside the feasible domain. On the other hand, when the projections onto the feasible set can be easily computed, the method generates feasible points and can be considered as a generalization of Maingé’s method to equilibrium problem constraints. In both cases, the strong convergence of the sequences generated by the proposed algorithms is proven.