with    u = 0 for |x| = R, u = 0 for |x| = R̂; or u = 0 for |x| = R, ∂u ∂|x| = 0 for |x| = R̂; or ∂u ∂|x| = 0 for |x| = R, u = 0 for |x| = R̂ is radially symmetric, then it can be transformed into the so called two-point SturmLiouville problem    x′′(t) = −f(t, x(t)), 0 ≤ t ≤ 1, αx(0)− βx′(0) = 0, γx(1) + δx′(1) = 0. where α, β, γ, δ are positive constants. Paper [19] may be the first one ...

Modern multi-core microprocessors implement weak memory consistency models; programming for these architectures is a challenge. This paper solves a problem open for ten years, and originally posed by Rinard: we identify sufficient conditions for a data flow analysis to be sound w.r.t. weak memory models. We first identify a class of analyses that are sound, and provide a formal proof of soundne...

Vanadium dioxide (VO ) 2 , a promising multifunctional smart material, has shown strong promise in microactuation, memory, and optical applications. During thermally induced insulator-tometal phase transition of VO2, the changes of its electrical, mechanical, and optical properties demonstrate pronounced, complex hysteresis with respect to the temperature, which presents a challenge in the util...

We show how to enhance the performance of a Smolyak method for solving dynamic economic models. First, we propose a more efficient implementation of the Smolyak method for interpolation, namely, we show how to avoid costly evaluations of repeated basis functions in the conventional Smolyak formula. Second, we extend the Smolyak method to include anisotropic constructions that allow us to target...

This work is concerned with nonlinear inverse problems where the solution is assumed to have a sparse expansion with respect to several preassigned bases or frames. We develop a scheme which allows to minimize a Tikhonov functional where the usual quadratic regularization term is replaced by one–homogeneous (typically weighted `p, 1 ≤ p ≤ 2) penalties on the coefficients (or isometrically trans...

Abstract — Digital signal processing algorithms are repetitive in nature. These algorithms are described by iterative data-flow graphs where nodes represent computations and edges represent communications. For all data-flow graphs, there exists a fundamental lower bound on the iteration period referred to as the iteration bound. Determining the iteration bound for signal processing algorithms d...

Abstract. Digital signal processing algorithms are repetitive in nature. These algorithms are described by iterative data-flow graphs where nodes represent computations and edges represent communications. For all data-flow graphs, there exists a fundamental lower bound on the iteration period referred to as the iteration bound. Determining the iteration bound for signal processing algorithms de...

we show that the variational inequality $vi(c,a)$ has aunique solution for a relaxed $(gamma , r)$-cocoercive,$mu$-lipschitzian mapping $a: cto h$ with $r>gamma mu^2$, where$c$ is a nonempty closed convex subset of a hilbert space $h$. fromthis result, it can be derived that, for example, the recentalgorithms given in the references of this paper, despite theirbecoming more complicated, are not...

a power digraph, denoted by $g(n,k)$, is a directed graph with $z_{n}={0,1,..., n-1}$ as the set of vertices and $l={(x,y):x^{k}equiv y~(bmod , n)}$ as the edge set, where $n$ and $k$ are any positive integers. in this paper, the structure of $g(2q+1,k)$, where $q$ is a sophie germain prime is investigated. the primality tests for the integers of the form $n=2q+1$ are established in terms of th...