Corrigendum to: on the inheritance of the strongly π-extending property

In this corrigendum, we provide correct versions of Theorem 2.8 and Corollary 3.2, retract two consequences of the previous form of the Theorem 2.8. To this end, the main results of the article remain after the aforementioned changes.     

Meyniel's conjecture holds for random d‐regular graphs

In the game of cops and robber, the cops try to capture a robber moving on the vertices of the graph. The minimum number of cops required to win on a given graph G is called the cop number of G. The biggest open conjecture in this area is the one of Meyniel, which asserts that for some absolute constant C, the cop number of every connected graph G is at most . In a separate paper, we showed that Meyniel's conjecture holds asymptotically almost surely for the binomial random graph. The result was obtained by showing that the conjecture holds for a general class of graphs with some specific expansion‐type properties. In this paper, this deterministic result is used to show that the conjecture holds asymptotically almost surely for random d‐regular graphs when d = d(n) ≥ 3.     

Minimum-norm fixed point of nonexpansive mappings with applications

The purpose of this paper is to present two new iterative algorithms to find the minimum norm fixed point of nonexpansive nonself-mappings in the framework of Hilbert spaces. The results presented in this paper improve and extend the corresponding ones announced by Yao and Xu [Yao Y, Xu HK. Iterative methods for finding minimum norm fixed point of mappings with applications. Optimization. 2011;60:645–658] and many others. Some applications to convex minimization and split feast problems(SFP) are also included.     

Approximant crystals of icosahedral Mg–(Ga,Al)–Zn alloys

The zero field cooled (ZFC) and field cooled (FC) low-field magnetic moment m of a dense frozen ferrofluid containing Fe₅₅Co₄₅ particles of size 4.6nm in hexane exhibits irreversibility at temperatures T?T _b≈ 30?K. FC in μ ₀ H ≤ 1?T gives rise to shifted minor hysteresis loops below T _b. At T _c≈ 10?K, sharp peaks of m ^ZFC and of the ac susceptibility χ ′, a kink of the thermoremanent magnetic moment m ^TRM, a sizeable reduction of the coercive field H _c, and the appearance of a spontaneous moment m ^SFM indicate a phase transition with near mean-field critical behaviour of both m ^SFM and χ ′ . These features are explained within a core-shell model of nanoparticles, whose strongly disordered shells gradually become blocked below T _b, while their soft ferromagnetic cores couple dipolarly and become superferromagnetic (SFM) below T _c.     

Characterization of the Cone and Applications in Banach Spaces

Abstract

In this article, we first discuss the subduality and orthogonality of the cones and the dual cones when the norm is monotone in Banach spaces. Then, under different assumptions, the necessary and sufficient conditions for the ordering increasing property of the metric projection onto cones and order intervals are studied. Moreover, representations of the metric projection onto cones and order intervals are obtained. As applications, the solvability and approximation results of solutions to nonlinear discontinuous variational inequality and complementarity problems are proved by partial ordering methods.     

处理噪声问题的泰勒展开交替最小化算法

为了处理图像、计算机视觉和生物信息等领域中广泛存在的稀疏大噪声和高斯噪声问题,提出了一种利用交替方向最小化思想求解主成分追求松弛模型的泰勒展开交替最小化算法(TEAM).采用推广泰勒展开和收缩算子等技术推导出低秩矩阵和稀疏大噪声矩阵的迭代方向矩阵,加入连续技术提高算法的收敛速率,设计出TEAM算法的求解步骤.实验中,将TEAM算法与该领域的顶级算法作分析对比.结果表明,TEAM算法时间优势明显,误差优势略好.     

An explicit algorithm for monotone variational inequalities

We introduce a fully explicit method for solving monotone variational inequalities in Hilbert spaces, where orthogonal projections onto the feasible set are replaced by projections onto suitable hyperplanes. We prove weak convergence of the whole generated sequence to a solution of the problem, under only the assumptions of continuity and monotonicity of the operator and existence of solutions.     

用左手手势巧学常见单糖的结构式*

分享了一种巧用左手手势,结合一首五言口诀快速判断糖分子结构的方法。口诀为:“罗卓葡古塔,甘露艾半乳。核阿木来苏,酮糖果山古”,包含了常见的12种醛糖和6种酮糖。通过该方法,不仅能快速准确写出各种常见糖的Fischer投影式,而且还可应用于糖分子相应的Haworth透视式及椅式构象,值得在糖类教学中进行推广。