Constructing uniform designs: A heuristic integer programming method

In this paper, the wrap-around _L2$L_2$-discrepancy (WD) of asymmetrical design is represented as a quadratic form, thus the problem of constructing a uniform design becomes a quadratic integer programming problem. By the theory of optimization, some theoretic properties are obtained. Algorithms for constructing uniform designs are then studied. When the number of runs n$n$ is smaller than the number of all level-combinations m$m$, the construction problem can be transferred to a zero–one quadratic integer programming problem, and an efficient algorithm based on the simulated annealing is proposed. When n≥m$n\ge m$, another algorithm is proposed. Empirical study shows that when n$n$ is large, the proposed algorithms can generate designs with lower WD compared to many existing methods. Moreover, these algorithms are suitable for constructing both symmetrical and asymmetrical designs.     

Functional limit theorems for renewal shot noise processes with increasing response functions

We consider renewal shot noise processes with response functions which are eventually nondecreasing and regularly varying at infinity. We prove weak convergence of renewal shot noise processes, properly normalized and centered, in the space D[0,∞)$D[0,\infty )$ under the _J1$J_1$ or _M1$M_1$ topology. The limiting processes are either spectrally nonpositive stable Lévy processes, including the Brownian motion, or inverse stable subordinators (when the response function is slowly varying), or fractionally integrated stable processes or fractionally integrated inverse stable subordinators (when the index of regular variation is positive). The proof exploits fine properties of renewal processes, distributional properties of stable Lévy processes and the continuous mapping theorem.     

Remarks on a posteriori error estimation for finite element solutions

We utilize the classical hypercircle method and the lowest-order Raviart–Thomas H(div)$H(\mathrm{div})$ element to obtain a posteriori error estimates of the _P1$P_1$ finite element solutions for 2D Poisson's equation. A few other estimation methods are also discussed for comparison. We give some theoretical and numerical results to see the effectiveness of the methods.     

Hypergroups and invariant complemented subspaces

Let K   be a hypergroup with a Haar measure. The purpose of the present paper is to initiate a systematic approach to the study of the class of invariant complemented subspaces of _L∞(K)$L_{\infty }(K)$ and _C0(K)$C_0(K)$, the class of left translation invariant w^?$w^{?}$-subalgebras of _L∞(K)$L_{\infty }(K)$ and finally the class of non-zero left translation invariant C^?$C^{?}$-subalgebras of _C0(K)$C_0(K)$ in the hypergroup context with the goal of finding some relations between these function spaces. Among other results, we construct two correspondences: one, between closed Weil subhypergroups and certain left translation invariant w^?$w^{?}$-subalgebras of _L∞(K)$L_{\infty }(K)$, and another, between compact subhypergroups and a specific subclass of the class of left translation invariant C^?$C^{?}$-subalgebras of _C0(K)$C_0(K)$. By the help of these two characterizations, we extract some results about invariant complemented subspaces of _L∞(K)$L_{\infty }(K)$ and _C0(K)$C_0(K)$.