Higher self-control capacity predicts lower anxiety-impaired cognition during math examinations

We assumed that self-control capacity, self-efficacy, and self-esteem would enable students to keep attentional control during tests. Therefore, we hypothesized that the three personality traits would be negatively related to anxiety-impaired cognition during math examinations. Secondary school students (N = 158) completed measures of self-control capacity, self-efficacy, and self-esteem at the beginning of the school year. Five months later, anxiety-impaired cognition during math examinations was assessed. Higher self-control capacity, but neither self-efficacy nor self-esteem, predicted lower anxiety-impaired cognition 5 months later, over and above baseline anxiety-impaired cognition. Moreover, self-control capacity was indirectly related to math grades via anxiety-impaired cognition. The findings suggest that improving self-control capacity may enable students to deal with anxiety-related problems during school tests.

The block numerical range of analytic operator functions

We introduce the block numerical range Wn(L) of an operator function L with respect to a decomposition H = H1⊕. . .⊕Hn of the underlying Hilbert space. Our main results include the spectral inclusion property and estimates of the norm of the resolvent for analytic L . They generalise, and improve, the corresponding results for the numerical range (which is the case n = 1) since the block numerical range is contained in, and may be much smaller than, the usual numerical range. We show that refinements of the decomposition entail inclusions between the corresponding block numerical ranges and that the block numerical range of the operator matrix function L contains those of its principal subminors. For the special case of operator polynomials, we investigate the boundedness of Wn(L) and we prove a Perron-Frobenius type result for the block numerical radius of monic operator polynomials with coefficients that are positive in Hilbert lattice sense.

On restricted families of projections in ℝ3

We study projections onto non-degenerate one-dimensional families of lines and planes in R 3 . Using the classical potential theoretic approach of R. Kaufman, one can show that the Hausdorff dimension of at most 12 -dimensional sets [Math Processing Error] is typically preserved under one-dimensional families of projections onto lines. We improve the result by an ε , proving that if [Math Processing Error], then the packing dimension of the projections is almost surely at least [Math Processing Error]. For projections onto planes, we obtain a similar bound, with the threshold 12 replaced by 1 . In the special case of self-similar sets [Math Processing Error] without rotations, we obtain a full Marstrand-type projection theorem for 1-parameter families of projections onto lines. The [Math Processing Error] case of the result follows from recent work of M. Hochman, but the [Math Processing Error] part is new: with this assumption, we prove that the projections have positive length almost surely.

Risk measures with the CxLS property

In the present contribution, we characterise law determined convex risk measures that have convex level sets at the level of distributions. By relaxing the assumptions in Weber (Math. Finance 16:419–441, 2006), we show that these risk measures can be identified with a class of generalised shortfall risk measures. As a direct consequence, we are able to extend the results in Ziegel (Math. Finance, 2014, http://onlinelibrary.wiley.com/doi/10.1111/mafi.12080/abstract) and Bellini and Bignozzi (Quant. Finance 15:725–733, 2014) on convex elicitable risk measures and confirm that expectiles are the only elicitable coherent risk measures. Further, we provide a simple characterisation of robustness for convex risk measures in terms of a weak notion of mixture continuity.

Stereological estimation of particle shape and orientation from volume tensors

In the present paper, we describe new robust methods of estimating cell shape and orientation in 3D from sections. The descriptors of 3D cell shape and orientation are based on volume tensors which are used to construct an ellipsoid, the Miles ellipsoid, approximating the average cell shape and orientation in 3D. The estimators of volume tensors are based on observations in several optical planes through sampled cells. This type of geometric sampling design is known as the optical rotator. The statistical behaviour of the estimator of the Miles ellipsoid is studied under a flexible model for 3D cell shape and orientation. In a simulation study, the lengths of the axes of the Miles ellipsoid can be estimated with CVs of about 2% if 100 cells are sampled. Finally, we illustrate the use of the developed methods in an example, involving neurons in the medial prefrontal cortex of rat.

A total variation discontinuous Galerkin approach for image restoration

The focal point of this paper is to propose and analyze a P 0 discontinuous Galerkin (DG) formulation for image denoising. The scheme is based on a total variation approach which has been applied successfully in previous papers on image processing. The main idea of the new scheme is to model the restoration process in terms of a discrete energy minimization problem and to derive a corresponding DG variational formulation. Furthermore, we will prove that the method exhibits a unique solution and that a natural maximum principle holds. In addition, a number of examples illustrate the effectiveness of the method.