Cumulative Residual q-Fisher Information and Jensen-Cumulative Residual χ2 Divergence Measures

In this work, we define cumulative residual q-Fisher (CRQF) information measures for the survival function (SF) of the underlying random variables as well as for the model parameter. We also propose q-hazard rate (QHR) function via q-logarithmic function as a new extension of hazard rate function. We show that CRQF information measure can be expressed in terms of the QHR function. We define further generalized cumulative residual χ2 divergence measures between two SFs. We then examine the cumulative residual q-Fisher information for two well-known mixture models, and the corresponding results reveal some interesting connections between the cumulative residual q-Fisher information and the generalized cumulative residual χ2 divergence measures. Further, we define Jensen-cumulative residual χ2 (JCR-χ2) measure and a parametric version of the Jensen-cumulative residual Fisher information measure and then discuss their properties and inter-connections. Finally, for illustrative purposes, we examine a real example of image processing and provide some numerical results in terms of the CRQF information measure.     

Lower Bounds on Multivariate Higher Order Derivatives of Differential Entropy

This paper studies the properties of the derivatives of differential entropy H(Xt) in Costa’s entropy power inequality. For real-valued random variables, Cheng and Geng conjectured that for m≥1, (−1)m+1(dm/dtm)H(Xt)≥0, while McKean conjectured a stronger statement, whereby (−1)m+1(dm/dtm)H(Xt)≥(−1)m+1(dm/dtm)H(XGt). Here, we study the higher dimensional analogues of these conjectures. In particular, we study the veracity of the following two statements: C1(m,n):(−1)m+1(dm/dtm)H(Xt)≥0, where n denotes that Xt is a random vector taking values in Rn, and similarly, C2(m,n):(−1)m+1(dm/dtm)H(Xt)≥(−1)m+1(dm/dtm)H(XGt)≥0. In this paper, we prove some new multivariate cases: C1(3,i),i=2,3,4. Motivated by our results, we further propose a weaker version of McKean’s conjecture C3(m,n):(−1)m+1(dm/dtm)H(Xt)≥(−1)m+11n(dm/dtm)H(XGt), which is implied by C2(m,n) and implies C1(m,n). We prove some multivariate cases of this conjecture under the log-concave condition: C3(3,i),i=2,3,4 and C3(4,2). A systematic procedure to prove Cl(m,n) is proposed based on symbolic computation and semidefinite programming, and all the new results mentioned above are explicitly and strictly proved using this procedure.     

Real hypersurfaces in complex two-plane Grassmannians with commuting Ricci tensor

In this paper, first we introduce the full expression for the Ricci tensor of a real hypersurface M$M$ in complex two-plane Grassmannians _G2(C^m+2)$G_2\left({\mathbb{C}}^{m+2}\right)$ from the equation of Gauss. Next we prove that a Hopf hypersurface in complex two-plane Grassmannians _G2(C^m+2)$G_2\left({\mathbb{C}}^{m+2}\right)$ with commuting Ricci tensor is locally congruent to a tube of radius r$r$ over a totally geodesic _G2(C^m+1)$G_2\left({\mathbb{C}}^{m+1}\right)$. Finally it can be verified that there do not exist any Hopf Einstein hypersurfaces in _G2(C^m+2)$G_2\left({\mathbb{C}}^{m+2}\right)$.     

Generalized Einstein real hypersurfaces in complex two-plane Grassmannians

In this paper we give a complete classification of pseudo-Einstein real hypersurfaces in complex two-plane Grassmannians _G2(C^m+2)$G_2\left({\mathbb{C}}^{m+2}\right)$. As an application of this result we prove that there do not exist Einstein Hopf or D^⊥${\mathfrak{D}}^{\perp }$-invariant Einstein real hypersurfaces in _G2(C^m+2)$G_2\left({\mathbb{C}}^{m+2}\right)$.     

Trapezoidal-Type Inequalities for Strongly Convex and Quasi-Convex Functions via Post-Quantum Calculus

In this paper, we establish new (p,q)κ1-integral and (p,q)κ2-integral identities. By employing these new identities, we establish new (p,q)κ1 and (p,q)κ2- trapezoidal integral-type inequalities through strongly convex and quasi-convex functions. Finally, some examples are given to illustrate the investigated results.     

Hypercontractive Inequalities for the Second Norm of Highly Concentrated Functions,and Mrs. Gerber’s-Type Inequalities for the Second Rényi Entropy

Let Tϵ, 0≤ϵ≤1/2, be the noise operator acting on functions on the boolean cube {0,1}n. Let f be a distribution on {0,1}n and let q>1. We prove tight Mrs. Gerber-type results for the second Rényi entropy of Tϵf which take into account the value of the qth Rényi entropy of f. For a general function f on {0,1}n we prove tight hypercontractive inequalities for the ℓ2 norm of Tϵf which take into account the ratio between ℓq and ℓ1 norms of f.     

Construction of a Family of Maximally Entangled Bases in ℂd ⊗ ℂd′

In this paper, we present a new method for the construction of maximally entangled states in Cd⊗Cd′ when d′≥2d. A systematic way of constructing a set of maximally entangled bases (MEBs) in Cd⊗Cd′ was established. Both cases when d′ is divisible by d and not divisible by d are discussed. We give two examples of maximally entangled bases in C2⊗C4, which are mutually unbiased bases. Finally, we found a new example of an unextendible maximally entangled basis (UMEB) in C2⊗C5.     

Robust AOA-Based Target Localization for Uniformly Distributed Noise via ℓp-ℓ1 Optimization

This paper addresses the problem of robust angle of arrival (AOA) target localization in the presence of uniformly distributed noise which is modeled as the mixture of Laplacian distribution and uniform distribution. Motivated by the distribution of noise, we develop a localization model by using the ℓp-norm with 0≤p<2 as the measurement error and the ℓ1-norm as the regularization term. Then, an estimator for introducing the proximal operator into the framework of the alternating direction method of multipliers (POADMM) is derived to solve the convex optimization problem when 1≤p<2. However, when 0≤p<1, the corresponding optimization problem is nonconvex and nonsmoothed. To derive a convergent method for this nonconvex and nonsmooth target localization problem, we propose a smoothed POADMM estimator (SPOADMM) by introducing the smoothing strategy into the optimization model. Eventually, the proposed algorithms are compared with some state-of-the-art robust algorithms via numerical simulations, and their effectiveness in uniformly distributed noise is discussed from the perspective of root-mean-squared error (RMSE). The experimental results verify that the proposed method has more robustness against outliers and is less sensitive to the selected parameters, especially the variance of the measurement noise.     

Estimating Drift Parameters in a Sub-Fractional Vasicek-Type Process

This study deals with drift parameters estimation problems in the sub-fractional Vasicek process given by dxt=θ(μ−xt)dt+dStH, with θ>0, μ∈R being unknown and t≥0; here, SH represents a sub-fractional Brownian motion (sfBm). We introduce new estimators θ^ for θ and μ^ for μ based on discrete time observations and use techniques from Nordin–Peccati analysis. For the proposed estimators θ^ and μ^, strong consistency and the asymptotic normality were established by employing the properties of SH. Moreover, we provide numerical simulations for sfBm and related Vasicek-type process with different values of the Hurst index H.     

Three ways to solve the Poisson equation on a sphere with Gaussian forcing

Motivated by the needs of vortex methods, we describe three different exact or approximate solutions to the Poisson equation on the surface of a sphere when the forcing is a Gaussian of the three-dimensional distance, ∇²ψ=exp(-2?²(1-cos(θ))-C^Gauss(?)${\nabla }^2\psi =\exp (-2{?}^2(1-\cos (\theta ))-C^{\mathit{Gauss}}(?)$. (More precisely, the forcing is a Gaussian minus the “Gauss constraint constant”, C^Gauss$C^{\mathit{Gauss}}$; this subtraction is necessary because ψ$\psi$ is bounded, for any type of forcing, only if the integral of the forcing over the sphere is zero [Y. Kimura, H. Okamoto, Vortex on a sphere, J. Phys. Soc. Jpn. 56 (1987) 4203–4206; D.G. Dritschel, Contour dynamics/surgery on the sphere, J. Comput. Phys. 79 (1988) 477–483]. The Legendre polynomial series is simple and yields the exact value of the Gauss constraint constant, but converges slowly for large ?$?$. The analytic solution involves nothing more exotic than the exponential integral, but all four terms are singular at one or the other pole, cancelling in pairs so that ψ$\psi$ is everywhere nice. The method of matched asymptotic expansions yields simpler, uniformly valid approximations as series of inverse even powers of ?$?$ that converge very rapidly for the large values of ?  (?>40)$(?>40)$ appropriate for geophysical vortex computations. The series converges to a nonzero O(exp(-4?²))$O(\exp (-4{?}^2))$ error everywhere except at the south pole where it diverges linearly with order instead of the usual factorial order.     

Topological and affine classification of complete noncompact flat 4-manifolds

In this paper we give topological and affine classification of complete noncompact flat 4-manifolds. In particular, we show that the number of diffeomorphism classes of them is equal to 44. The affine classification uses the results of [M. Sadowski, Affinely equivalent complete flat manifolds, Cent. Eur. J. Math. 2 (2) (2004) 332–338]. The affine and the topological equivalence classes are the same for flat manifolds not homotopy equivalent to S¹,T²$S^1,T^2$ or the Klein bottle.     

Three Efficient All-Erasure Decoding Methods for Blaum–Roth Codes

Blaum–Roth Codes are binary maximum distance separable (MDS) array codes over the binary quotient ring F2[x]/(Mp(x)), where Mp(x)=1+x+⋯+xp−1, and p is a prime number. Two existing all-erasure decoding methods for Blaum–Roth codes are the syndrome-based decoding method and the interpolation-based decoding method. In this paper, we propose a modified syndrome-based decoding method and a modified interpolation-based decoding method that have lower decoding complexity than the syndrome-based decoding method and the interpolation-based decoding method, respectively. Moreover, we present a fast decoding method for Blaum–Roth codes based on the LU decomposition of the Vandermonde matrix that has a lower decoding complexity than the two modified decoding methods for most of the parameters.     

Quantum Estimates for Different Type Intequalities through Generalized Convexity

This article estimates several integral inequalities involving (h−m)-convexity via the quantum calculus, through which Important integral inequalities including Simpson-like, midpoint-like, averaged midpoint-trapezoid-like and trapezoid-like are extended. We generalized some quantum integral inequalities for q-differentiable (h−m)-convexity. Our results could serve as the refinement and the unification of some classical results existing in the literature by taking the limit q→1−.     

Biminimal properly immersed submanifolds in the Euclidean spaces

We consider a complete nonnegative biminimal   submanifold M$M$ (that is, a complete biminimal submanifold with λ≥0$\lambda \ge 0$) in a Euclidean space E^N${\mathbb{E}}^N$. Assume that the immersion is proper  , that is, the preimage of every compact set in E^N${\mathbb{E}}^N$ is also compact in M$M$. Then, we prove that M$M$ is minimal. From this result, we give an affirmative partial answer to Chen’s conjecture. For the case of λ<0$\lambda <0$, we construct examples of biminimal submanifolds and curves.     

On complete spacelike hypersurfaces with two distinct principal curvatures in Lorentz–Minkowski space

We investigate complete spacelike hypersurfaces in Lorentz–Minkowski space with two distinct principal curvatures and constant m$m$th mean curvature. By using Otsuki’s idea, we obtain the global classification result. As their applications, we obtain some characterizations for hyperbolic cylinders. We prove that the only complete spacelike hypersurfaces in Lorentz–Minkowski (n+1)$(n+1)$-spaces (n≥3$n\ge 3$) of nonzero constant m$m$th mean curvature (m≤n−1$m\le n-1$) with two distinct principal curvatures λ$\lambda$ and μ$\mu$ satisfying inf(λ−μ)²>0$inf{(\lambda -\mu )}^2>0$ are the hyperbolic cylinders. We also obtain a global characterization for hyperbolic cylinder Hⁿ⁻¹(c)×R${\mathbb{H}}^{n-1}\left(c\right)\times \mathbb{R}$ in terms of square length of the second fundamental form.     

A Formal Framework for Knowledge Acquisition: Going beyond Machine Learning

Philosophers frequently define knowledge as justified, true belief. We built a mathematical framework that makes it possible to define learning (increasing number of true beliefs) and knowledge of an agent in precise ways, by phrasing belief in terms of epistemic probabilities, defined from Bayes’ rule. The degree of true belief is quantified by means of active information I+: a comparison between the degree of belief of the agent and a completely ignorant person. Learning has occurred when either the agent’s strength of belief in a true proposition has increased in comparison with the ignorant person (I+>0), or the strength of belief in a false proposition has decreased (I+<0). Knowledge additionally requires that learning occurs for the right reason, and in this context we introduce a framework of parallel worlds that correspond to parameters of a statistical model. This makes it possible to interpret learning as a hypothesis test for such a model, whereas knowledge acquisition additionally requires estimation of a true world parameter. Our framework of learning and knowledge acquisition is a hybrid between frequentism and Bayesianism. It can be generalized to a sequential setting, where information and data are updated over time. The theory is illustrated using examples of coin tossing, historical and future events, replication of studies, and causal inference. It can also be used to pinpoint shortcomings of machine learning, where typically learning rather than knowledge acquisition is in focus.     

An implicit high-order hybridizable discontinuous Galerkin method for nonlinear convection–diffusion equations

In this paper, we present hybridizable discontinuous Galerkin methods for the numerical solution of steady and time-dependent nonlinear convection–diffusion equations. The methods are devised by expressing the approximate scalar variable and corresponding flux in terms of an approximate trace of the scalar variable and then explicitly enforcing the jump condition of the numerical fluxes across the element boundary. Applying the Newton–Raphson procedure and the hybridization technique, we obtain a global equation system solely in terms of the approximate trace of the scalar variable at every Newton iteration. The high number of globally coupled degrees of freedom in the discontinuous Galerkin approximation is therefore significantly reduced. We then extend the method to time-dependent problems by approximating the time derivative by means of backward difference formulae. When the time-marching method is (p+1)$(p+1)$th order accurate and when polynomials of degree p?0$p?0$ are used to represent the scalar variable, each component of the flux and the approximate trace, we observe that the approximations for the scalar variable and the flux converge with the optimal order of p+1$p+1$ in the L²$L^2$-norm. Finally, we apply element-by-element postprocessing schemes to obtain new approximations of the flux and the scalar variable. The new approximate flux, which has a continuous interelement normal component, is shown to converge with order p+1$p+1$ in the L²$L^2$-norm. The new approximate scalar variable is shown to converge with order p+2$p+2$ in the L²$L^2$-norm. The postprocessing is performed at the element level and is thus much less expensive than the solution procedure. For the time-dependent case, the postprocessing does not need to be applied at each time step but only at the times for which an enhanced solution is required. Extensive numerical results are provided to demonstrate the performance of the present method.