We develop a generic game platform that can be used to model various real-world systems with multiple intelligent cloud-computing pools and parallel-queues for resources-competing users. Inside the platform, the software structure is modelled as Blockchain. All the users are associated with Big Data arrival streams whose random dynamics is modelled by triply stochastic renewal reward processes (TSRRPs). Each user may be served simultaneously by multiple pools while each pool with parallel- servers may also serve multi-users at the same time via smart policies in the Blockchain, e.g. a Nash equilibrium point myopically at each fixed time to a game-theoretic scheduling problem. To illustrate the effectiveness of our game platform, we model the performance measures of its internal data flow dynamics (queue length and workload processes) as reflecting diffusion with regime-switchings (RDRSs) under our scheduling policies. By RDRS models, we can prove our myopic game-theoretic policy to be an asymptotic Pareto minimal-dual-cost Nash equilibrium one globally over the whole time horizon to a randomly evolving dynamic game problem. Iterative schemes for simulating our multi-dimensional RDRS models are also developed with the support of numerical comparisons.

We study the solvability problem for the multidimensional Riccati equation −∇$u$=|∇$u$|^{q}+ω, where$q$>1 and ω is an arbitrary nonnegative function (or measure). We also discuss connections with the classical problem of the existence of positive solutions for the Schrödinger equation −Δ$u$−ω$u$=0 with nonnegative potential ω. We establish explicit criteria for the existence of global solutions on$R$^{n}in terms involving geometric (capacity) estimates or pointwise behavior of Riesz potentials, together with sharp pointwise estimates of solutions and their gradients. We also consider the corresponding nonlinear Dirichlet problem on a bounded domain, as well as more general equations of the type$−Lu=f(x, u, ∇u)$+ω where, and$L$is a uniformly elliptic operator.

Surface conformal maps between genus-0 surfaces play important roles in applied mathematics and engineering, with applications in medical image analysis and computer graphics. Previous work (Gu and Yau in Commun Inf Syst 2(2):121–146, 2002) introduces a variational approach, where global conformal parameterization of genus-0 surfaces was addressed through minimizing the harmonic energy, with two weaknesses: its gradient descent iteration is slow, and its solutions contain undesired parameterization foldings when the underlying surface has long sharp features. In this paper, we propose an algorithm that significantly accelerates the harmonic energy minimization and a method that iteratively removes foldings by taking advantages of the weighted Laplace–Beltrami eigen-projection. Experimental results show that the proposed approaches compute genus-0 surface harmonic maps much faster than the existing algorithm in Gu and Yau (Commun Inf Syst 2(2):121–146, 2002) and the new results contain no foldings.

We present the third in the series of papers describing Poisson properties of planar directed networks in the disk or in the annulus. In this paper we concentrate on special networks$N$_{$u,v$}in the disk that correspond to the choice of a pair ($u, v$) of Coxeter elements in the symmetric group$S$_{$n$}and the corresponding networks $N_{u,v}^\circ$ in the annulus. Boundary measurements for$N$_{$u,v$}represent elements of the Coxeter double Bruhat cell$G$^{$u,v$}⊂GL_{$n$}. The Cartan subgroup$H$acts on$G$^{$u,v$}by conjugation. The standard Poisson structure on the space of weights of$N$_{$u,v$}induces a Poisson structure on$G$^{$u,v$}, and hence on the quotient$G$^{$u,v$}/$H$, which makes the latter into the phase space for an appropriate Coxeter–Toda lattice. The boundary measurement for $N_{u,v}^\circ$ is a rational function that coincides up to a non-zero factor with the Weyl function for the boundary measurement for$N$_{$u,v$}. The corresponding Poisson bracket on the space of weights of $N_{u,v}^\circ$ induces a Poisson bracket on the certain space $ {\mathcal{R}_n} $ of rational functions, which appeared previously in the context of Toda flows.

In these notes we collect some results about finite-dimensional representations of $U_{q}(\mathfrak {gl}(1\mid1))$ and related invariants of framed tangles, which are well-known to experts but difficult to find in the literature. In particular, we give an explicit description of the ribbon structure on the category of finite-dimensional $U_{q}(\mathfrak {gl}(1\mid1))$ -representations and we use it to construct the corresponding quantum invariant of framed tangles. We explain in detail why this invariant vanishes on closed links and how one can modify the construction to get a non-zero invariant of framed closed links. Finally we show how to obtain the Alexander polynomial by considering the vector representation of $U_{q}(\mathfrak {gl}(1\mid1))$ .