A total of 393 potholes(368 fluvial and 25 marine potholes)were studied at seven different sites in both the fluvial and marine environments.Diverse bedrock properties and large-scale delivery of tools and grinders re...A total of 393 potholes(368 fluvial and 25 marine potholes)were studied at seven different sites in both the fluvial and marine environments.Diverse bedrock properties and large-scale delivery of tools and grinders regulate the dynamic growth,truncation,and amalgamation of potholes.Therefore,the principal objectives of the study are(i)to examine the relationship between the growth of potholes and substrate lithological with structural characteristics(applying geospatial and Schmidt hammer for rock strength analysis)and(ii)to measure the morphology,and size of tools and grinders,processes of truncation and amalgamation in hydro-geomorphic environment using various indices and field techniques.The result showed that large potholes are stretched in the direction of lineament axes and roughly parallel to the river flow direction.Here,the steady growth of pothole depth-diameter is controlled by active bedrock structures,tools,or grinders,and monsoonal high-velocity bank full discharge.Consequently,the deepening and widening of potholes are relatively slow at Bindu,Deuli,and marine beach Neil Island due to fewer structures and little supply of tools or grinders.In small stretches,(Damodar,Subarnarekha,and Rarhu)canyons and gorge-like features(bedrock incision)are formed at Rajrappa,Bhakuyadi,and Guridih sites due to cyclic truncation and amalgamation.Truncation and amalgamation processes restrict the vertical depth threshold value of potholes within 3m,particularly at Rajrappa,Bhakuyadi,and Guridih sites.Scientific study of the pothole's dynamic growth is greatly necessary for the different environmental engineering and river hydraulic projects like excavation,dredging,and dam or barrage construction.Successively,it is essential to compute the cost of rock excavation or dredging,primarily for the mechanical strength of the bedrock river channel and its stability.展开更多
Alzheimer's disease is characterized by two major neuropathological hallmarks—the extracellularβ-amyloid plaques and intracellular neurofibrillary tangles consisting of aggregated and hyperphosphorylated Tau pro...Alzheimer's disease is characterized by two major neuropathological hallmarks—the extracellularβ-amyloid plaques and intracellular neurofibrillary tangles consisting of aggregated and hyperphosphorylated Tau protein.Recent studies suggest that dysregulation of the microtubuleassociated protein Tau,especially specific proteolysis,could be a driving force for Alzheimer's disease neurodegeneration.Tau physiologically promotes the assembly and stabilization of microtubules,whereas specific truncated fragments are sufficient to induce abnormal hyperphosphorylation and aggregate into toxic oligomers,resulting in them gaining prion-like characteristics.In addition,Tau truncations cause extensive impairments to neural and glial cell functions and animal cognition and behavior in a fragment-dependent manner.This review summarizes over 60 proteolytic cleavage sites and their corresponding truncated fragments,investigates the role of specific truncations in physiological and pathological states of Alzheimer's disease,and summarizes the latest applications of strategies targeting Tau fragments in the diagnosis and treatment of Alzheimer's disease.展开更多
结合自然邻居搜索算法改进了密度峰值聚类(clustering by fast search and find of density peaks,CFSFDP)算法存在的一系列问题,提出基于自然邻居搜索优化策略的密度峰值聚类(density peak clustering algorithm optimized by natural ...结合自然邻居搜索算法改进了密度峰值聚类(clustering by fast search and find of density peaks,CFSFDP)算法存在的一系列问题,提出基于自然邻居搜索优化策略的密度峰值聚类(density peak clustering algorithm optimized by natural neighbor search,NaN-CFSFDP)算法。基于自然邻居搜索算法提出了一种离群样本的检测方法,针对CFSFDP算法中截断距离d_(c)人工准确取值较难的问题,结合自然邻居搜索算法改进了d_(c)的计算方式,实现了d_(c)的自动取值。重新设计并统一了CFSFDP算法的样本密度度量规则,使其更关注每个样本的局部信息。由于数据集中因类簇间的密度差异大,密度峰值点集中于稠密簇使得簇丢失,因此提出样本共享自然邻居和类簇共享自然邻居的概念,构造新的类簇融合算法。合成数据集和真实数据集上的实验结果表明,在大多数情况下,NaN-CFSFDP算法在聚类性能上优于或至少与比较方法相当,且与CFSFDP算法及其改进算法相比参数更少。展开更多
人工智能(AI)和物联网(IoT)技术的迅速发展,对计算能效提出了更高的要求,终端设备在硬件资源开销方面同样面临巨大挑战.为了应对能效问题,新型低功耗近似计算单元的设计得到了广泛研究.在数字信号处理和图像处理等应用场景中,存在大量...人工智能(AI)和物联网(IoT)技术的迅速发展,对计算能效提出了更高的要求,终端设备在硬件资源开销方面同样面临巨大挑战.为了应对能效问题,新型低功耗近似计算单元的设计得到了广泛研究.在数字信号处理和图像处理等应用场景中,存在大量的浮点运算.这些应用消耗了大量的硬件资源,但它们具有一定的容错性,没有必要进行完全精确的计算.据此,提出了一种基于移位近似算法MTA(multiplication to shift addition)和非对称截断的单精度可重构近似浮点乘法器设计方法.首先,采用了一种低功耗的近似算法MTA,将部分操作数的乘法运算转换为移位加法.其次,为了在精度和成本之间取得平衡,设计了针对操作数高有效位的非对称截断处理,并对截断后保留的部分进行精确计算.通过采用不同位宽的MTA近似计算和改变截断后部分积阵列的行数,生成了广阔的设计空间,从而可以在精度和成本之间进行多种权衡调整.与精确浮点乘法器相比,所提出设计MTA5T5的精度损失(MRED)仅约为0.32%,功耗降低了85.80%,面积减少了79.53%.对于精度较低的MTA3T3,其精度损失约为1.92%,而功耗和面积分别降低了90.55%和85.80%.最后,进行了FIR滤波和图像处理的应用测试,结果表明所提出的设计在精度和开销方面具有显著优势.展开更多
We consider the multiplicity of solutions to a p(x)-Laplacian problem involving supercritical Sobolev growth via Ricceri’s principle.By means of truncation combined with De Giorgi iteration,we can extend the results ...We consider the multiplicity of solutions to a p(x)-Laplacian problem involving supercritical Sobolev growth via Ricceri’s principle.By means of truncation combined with De Giorgi iteration,we can extend the results of subcritical and critical growth to supercritical growth and obtain at least three solutions to the p(x)-Laplacian problem.展开更多
In this paper,we introduce the real pairwise completely positive(RPCP)matrices with one of them is necessarily positive semidefinite while the other one is necessarily entrywise nonnegative,which has a real pairwise c...In this paper,we introduce the real pairwise completely positive(RPCP)matrices with one of them is necessarily positive semidefinite while the other one is necessarily entrywise nonnegative,which has a real pairwise completely positive(RPCP)decomposition.We study the properties of RPCP matrices and give some necessary and sufficient conditions for a matrix pair to be RPCP.First,we give an equivalent decomposition for the RPCP matrices,which is different from the RPCP-decomposition and show that the matrix pair(X,X)is RPCP if and only if X is completely positive.Besides,we also prove that the RPCP matrices checking problem is equivalent to the separable completion problem.A semidefinite algorithm is also proposed for detecting whether or not a matrix pair is RPCP.The asymptotic and finite convergence of the algorithm are also discussed.If it is RPCP,we can further give a RPCP-decomposition for it;if it is not,we can obtain a certificate for this.展开更多
文摘A total of 393 potholes(368 fluvial and 25 marine potholes)were studied at seven different sites in both the fluvial and marine environments.Diverse bedrock properties and large-scale delivery of tools and grinders regulate the dynamic growth,truncation,and amalgamation of potholes.Therefore,the principal objectives of the study are(i)to examine the relationship between the growth of potholes and substrate lithological with structural characteristics(applying geospatial and Schmidt hammer for rock strength analysis)and(ii)to measure the morphology,and size of tools and grinders,processes of truncation and amalgamation in hydro-geomorphic environment using various indices and field techniques.The result showed that large potholes are stretched in the direction of lineament axes and roughly parallel to the river flow direction.Here,the steady growth of pothole depth-diameter is controlled by active bedrock structures,tools,or grinders,and monsoonal high-velocity bank full discharge.Consequently,the deepening and widening of potholes are relatively slow at Bindu,Deuli,and marine beach Neil Island due to fewer structures and little supply of tools or grinders.In small stretches,(Damodar,Subarnarekha,and Rarhu)canyons and gorge-like features(bedrock incision)are formed at Rajrappa,Bhakuyadi,and Guridih sites due to cyclic truncation and amalgamation.Truncation and amalgamation processes restrict the vertical depth threshold value of potholes within 3m,particularly at Rajrappa,Bhakuyadi,and Guridih sites.Scientific study of the pothole's dynamic growth is greatly necessary for the different environmental engineering and river hydraulic projects like excavation,dredging,and dam or barrage construction.Successively,it is essential to compute the cost of rock excavation or dredging,primarily for the mechanical strength of the bedrock river channel and its stability.
基金supported by the Neural Regeneration Co-innovation Center of Jiangsu Province,Nantong University(to DC)the National Natural Science Foundation of China,Nos.81872853(to DC),81870941(to JHG)the Science and Technology Project of Nantong City,Nos.JC22022022(to FW)and JC2021059(to JM)。
文摘Alzheimer's disease is characterized by two major neuropathological hallmarks—the extracellularβ-amyloid plaques and intracellular neurofibrillary tangles consisting of aggregated and hyperphosphorylated Tau protein.Recent studies suggest that dysregulation of the microtubuleassociated protein Tau,especially specific proteolysis,could be a driving force for Alzheimer's disease neurodegeneration.Tau physiologically promotes the assembly and stabilization of microtubules,whereas specific truncated fragments are sufficient to induce abnormal hyperphosphorylation and aggregate into toxic oligomers,resulting in them gaining prion-like characteristics.In addition,Tau truncations cause extensive impairments to neural and glial cell functions and animal cognition and behavior in a fragment-dependent manner.This review summarizes over 60 proteolytic cleavage sites and their corresponding truncated fragments,investigates the role of specific truncations in physiological and pathological states of Alzheimer's disease,and summarizes the latest applications of strategies targeting Tau fragments in the diagnosis and treatment of Alzheimer's disease.
文摘结合自然邻居搜索算法改进了密度峰值聚类(clustering by fast search and find of density peaks,CFSFDP)算法存在的一系列问题,提出基于自然邻居搜索优化策略的密度峰值聚类(density peak clustering algorithm optimized by natural neighbor search,NaN-CFSFDP)算法。基于自然邻居搜索算法提出了一种离群样本的检测方法,针对CFSFDP算法中截断距离d_(c)人工准确取值较难的问题,结合自然邻居搜索算法改进了d_(c)的计算方式,实现了d_(c)的自动取值。重新设计并统一了CFSFDP算法的样本密度度量规则,使其更关注每个样本的局部信息。由于数据集中因类簇间的密度差异大,密度峰值点集中于稠密簇使得簇丢失,因此提出样本共享自然邻居和类簇共享自然邻居的概念,构造新的类簇融合算法。合成数据集和真实数据集上的实验结果表明,在大多数情况下,NaN-CFSFDP算法在聚类性能上优于或至少与比较方法相当,且与CFSFDP算法及其改进算法相比参数更少。
文摘人工智能(AI)和物联网(IoT)技术的迅速发展,对计算能效提出了更高的要求,终端设备在硬件资源开销方面同样面临巨大挑战.为了应对能效问题,新型低功耗近似计算单元的设计得到了广泛研究.在数字信号处理和图像处理等应用场景中,存在大量的浮点运算.这些应用消耗了大量的硬件资源,但它们具有一定的容错性,没有必要进行完全精确的计算.据此,提出了一种基于移位近似算法MTA(multiplication to shift addition)和非对称截断的单精度可重构近似浮点乘法器设计方法.首先,采用了一种低功耗的近似算法MTA,将部分操作数的乘法运算转换为移位加法.其次,为了在精度和成本之间取得平衡,设计了针对操作数高有效位的非对称截断处理,并对截断后保留的部分进行精确计算.通过采用不同位宽的MTA近似计算和改变截断后部分积阵列的行数,生成了广阔的设计空间,从而可以在精度和成本之间进行多种权衡调整.与精确浮点乘法器相比,所提出设计MTA5T5的精度损失(MRED)仅约为0.32%,功耗降低了85.80%,面积减少了79.53%.对于精度较低的MTA3T3,其精度损失约为1.92%,而功耗和面积分别降低了90.55%和85.80%.最后,进行了FIR滤波和图像处理的应用测试,结果表明所提出的设计在精度和开销方面具有显著优势.
基金supported by the Fundamental Research Funds for the Central Universities(2024KYJD2006).
文摘We consider the multiplicity of solutions to a p(x)-Laplacian problem involving supercritical Sobolev growth via Ricceri’s principle.By means of truncation combined with De Giorgi iteration,we can extend the results of subcritical and critical growth to supercritical growth and obtain at least three solutions to the p(x)-Laplacian problem.
文摘In this paper,we introduce the real pairwise completely positive(RPCP)matrices with one of them is necessarily positive semidefinite while the other one is necessarily entrywise nonnegative,which has a real pairwise completely positive(RPCP)decomposition.We study the properties of RPCP matrices and give some necessary and sufficient conditions for a matrix pair to be RPCP.First,we give an equivalent decomposition for the RPCP matrices,which is different from the RPCP-decomposition and show that the matrix pair(X,X)is RPCP if and only if X is completely positive.Besides,we also prove that the RPCP matrices checking problem is equivalent to the separable completion problem.A semidefinite algorithm is also proposed for detecting whether or not a matrix pair is RPCP.The asymptotic and finite convergence of the algorithm are also discussed.If it is RPCP,we can further give a RPCP-decomposition for it;if it is not,we can obtain a certificate for this.
