Best Proximity Point Theorems for p-Proximalα-η-β-Quasi Contractions in Metric Spaces with w0-Distance

In this paper,we propose a new class of non-self mappings called p-proximalα-η-β-quasi contraction,and introduce the concepts ofα-proximal admissible mapping with respect toηand(α,d)regular mapping with respect toη.Based on these new notions,we study the existence and uniqueness of best proximity point for this kind of new contractions in metric spaces with w;-distance and obtain a new theorem,which generalize and complement the results in[Ayari,M.I.et al.Fixed Point Theory Appl.,2017,2017:16]and[Ayari,M.I.et al.Fixed Point Theory Appl.,2019,2019:7].We give an example to show the validity of our main result.Moreover,we obtain several consequences concerning about best proximity point and common fixed point results for two mappings,and we present an application of a corollary to discuss the solutions to a class of systems of Volterra type integral equations.     

Network-Initialized Monte Carlo Based on Generative Neural Networks

We design generative neural networks that generate Monte Carlo configurations with complete absence of autocorrelation from which only short Markov chains are needed before making measurements for physical observables,irrespective of the system locating at the classical critical point,fermionic Mott insulator,Dirac semimetal,or quantum critical point.We further propose a network-initialized Monte Carlo scheme based on such neural networks,which provides independent samplings and can accelerate t...     

基于SRAM的通用存算一体架构平台在物联网中的应用

最近,存算一体(IMC)架构引起了广泛关注,并被认为有望成为突破冯诺依曼瓶颈的新型计算机架构,特别是在数据密集型(data-intensive)计算中能够带来显著的性能和功耗优势.其中,基于SRAM的IMC架构方案也被大量研究与应用.该文在一款基于SRAM的通用存算一体架构平台——DM-IMCA的基础上,探索IMC架构在物联网领域中的应用价值.具体来说,该文选取了物联网中包括信息安全、二值神经网络和图像处理在内的多个轻量级数据密集型应用,对算法进行分析或拆分,并将关键算法映射到DM-IMCA中的SRAM中,以达到加速应用计算的目的.实验结果显示,与基于传统冯诺依曼架构的基准系统相比,利用DM-IMCA来实现物联网中的轻量级计算密集型应用,可获得高达24倍的计算加速比.     

偏缠绕模的Frobenius性质

主要给出了偏缠绕模的Frobenius性质，推广了缠绕模相应的性质。     

A New Sufficient Degree Condition for a Graphic Sequence to Be Forcibly k-Edge-Connected

A graphic sequence π =(d₁, d₂,..., d_n) is said to be forcibly k-edge-connected if every realization of π is k-edge-connected. In this paper, we obtain a new sufficient degree condition for π to be forcibly k-edgeconnected. We also show that this new sufficient degree condition implies a strongest monotone degree condition for π to be forcibly 2-edge-connected and a conjecture about a strongest monotone degree condition for π to be forcibly 3-edge-connected due to...     

基于有限元的区域分解方法在永磁聚焦系统仿真中的应用

随着计算机技术以及并行求解技术的发展,区域分解方法越来越多地应用于计算电磁学的各个领域.针对微波管中的永磁聚焦系统仿真,该文提出一种基于有限元的非重叠区域分解方法,其引入一种新型传输条件,并采用内罚的方式推导出有限元弱形式.该区域分解法的最大优势是不需要引入多余的未知量,并且最终集成的有限元矩阵满足对称正定性,适合采用预处理共轭梯度法进行矩阵方程的求解.该文仿真了多个微波管永磁聚焦系统,并与商业软件Maxwell进行了详细的对比,结果表明所提出的区域分解方法和Maxwell精度相当,却拥有着更加优越的计算性能.