检索结果-内蒙古大学图书馆

arXiv 2025年

作者： Zhang, Xiaoqing Shi, Hanfeng Li, Xiangyu Ye, Haili Xu, Tao Li, Na Hu, Yan Lv, Fan Chen, Jiangfan Liu, Jiang Center for High Performance Computing and Shenzhen Key Laboratory of Intelligent Bioinformatics Shenzhen Institute of Advanced Technology Chinese Academy of Sciences Shenzhen China Research Institute of Trustworthy Autonomous Systems Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen518055 China State Key Laboratory of Ophthalmology Optometry and Vision Science Wenzhou Medical University Wenzhou China Centre for Computational Science and Mathematical Modelling Coventry University Coventry United Kingdom School of Computer Science University of Nottingham Ningbo China Ningbo315100 China School of Ophthalmology and Optometry Wenzhou Medical University Wenzhou325035 China Department of Electronic and Information Engineering Changchun University Changchun130022 China

Parkinson’s disease (PD) is a prevalent neurodegenerative disorder globally. The eye’s retina is an extension of the brain and has great potential in PD screening. Recent studies have suggested that texture features extracted from retinal layers can be adopted as biomarkers for PD diagnosis under optical coherence tomography (OCT) images. Frequency domain learning techniques can enhance the feature representations of deep neural networks (DNNs) by decomposing frequency components involving rich texture features. Additionally, previous works have not exploited texture features for automated PD screening in OCT. Motivated by the above analysis, we propose a novel Adaptive Wavelet Filter (AWF) that serves as the Practical Texture Feature Amplifier to fully leverage the merits of texture features to boost the PD screening performance of DNNs with the aid of frequency domain learning. Specifically, AWF first enhances texture feature representation diversities via channel mixer, then emphasizes informative texture feature representations with the well-designed adaptive wavelet filtering token mixer. By combining the AWFs with the DNN stem, AWFNet is constructed for automated PD screening. Additionally, we introduce a novel Balanced Confidence (BC) Loss by mining the potential of sample-wise predicted probabilities of all classes and class frequency prior, to further boost the PD screening performance and trustworthiness of AWFNet. The extensive experiments manifest the superiority of our AWFNet and BC over state-of-the-art methods in terms of PD screening performance and trustworthiness. © 2025, CC BY-NC-SA.

关键词： Neurodegenerative diseases

来源：评论

学校读者我要写书评

暂无评论

On the Properties of Kullback-Leibler Divergence Between Multivariate Gaussian Distributions

arXiv

引用

arXiv 2021年

作者： Zhang, Yufeng Liu, Wanwei Chen, Zhenbang Wang, Ji Li, Kenli The College of Computer Science and Electronic Engineering Hunan University Changsha China The College of Computer National University of Defense Technology Changsha China State Key Laboratory of High Performance Computing National University of Defense Technology China

Kullback-Leibler (KL) divergence is one of the most important divergence measures between probability distributions. In this paper, we prove several properties of KL divergence between multivariate Gaussian distributions. First, for any two n-dimensional Gaussian distributions N1 and N2, we give the supremum of KL(N1||N2) when KL(N2||N1) ≤ Ε (Ε > 0). For small Ε, we show that the supremum is Ε + 2Ε1.5 + O(Ε2). This quantifies the approximate symmetry of small KL divergence between Gaussians. We also find the infimum of KL(N1||N2) when KL(N2||N1) ≥ M (M > 0). We give the conditions when the supremum and infimum can be attained. Second, for any three n-dimensional Gaussians N1, N2, and N3, we find an upper bound of KL(N1||N3) if KL(N1||N2) ≤ Ε1 and KL(N2||N3) ≤ Ε2 for Ε1, Ε2 ≥ 0. For small Ε1 and Ε2, we show the upper bound is 3Ε1 + 3Ε2 + 2√Ε1Ε2 + o(Ε1) + o(Ε2). This reveals that KL divergence between Gaussians follows a relaxed triangle inequality. Importantly, all the bounds in the theorems presented in this paper are independent of the dimension n. Finally, We discuss the applications of our theorems in explaining counterintuitive phenomenon of flow-based model, deriving deep anomaly detection algorithm, and extending one-step robustness guarantee to multiple steps in safe reinforcement learning. Copyright © 2021, The Authors. All rights reserved.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

可持续发展情景下丝绸之路沿线国家土地利用及其对陆地碳库影响

引用

Science Bulletin 2023年第7期68卷 740-749页

作者：曹敏田雅吴凯陈旻陈玉胡雪孙中昶左丽君林键骆磊朱瑞许振赐 Temenoujka Bandrova Milan Konecny 袁文平郭华东林珲闾国年 Key Laboratory of Virtual Geographic Environment Ministry of EducationNanjing Normal UniversityNanjing 210023China International Research Center of Big Data for Sustainable Development Goals Beijing 100094China Jiangsu Center for Collaborative Innovation in Geographical Information Resource Development and Application Nanjing 210023China School of Geography and Environment Jiangxi Normal UniversityNanchang 330022China Aerospace Information Research Institute Chinese Academy of SciencesBeijing 100094China The Key Laboratory of Urban Land Resources Monitoring and Simulation Ministry of Natural ResourcesShenzhen 518034China Sierra Nevada Research Institute University of CaliforniaMerced CA 95348USA Institute of High Performance Computing Agency for ScienceTechnology and ResearchSingapore 138632Singapore Department of Geography the University of Hong KongHong Kong 999077China Laboratory on Cartography University of ArchitectureCivil Engineering and GeodesySofia 1164Bulgaria Laboratory on Geoinformatics and Cartography Institute of GeographyMasaryk UniversityBrno 60177Czech Republic School of Atmospheric Sciences Southern Marine Science and Engineering Guangdong Laboratory(Zhuhai)Sun Yat-sen UniversityZhuhai 519082China Key Laboratory of Poyang Lake Wetland and Watershed Research Ministry of EducationJiangxi Normal UniversityNanchang 330022China

可持续发展目标(SDGs)呼吁全世界共同采取行动,促进繁荣并保护地球.本研究面向SDGs构建了环境、粮食和经济等可持续发展情景,预测2020~2030年丝绸之路沿线国家的土地利用变化,并分析其对陆地碳库的影响。研究表明:未来土地利用变化及其... 详细信息

可持续发展目标(SDGs)呼吁全世界共同采取行动,促进繁荣并保护地球.本研究面向SDGs构建了环境、粮食和经济等可持续发展情景,预测2020~2030年丝绸之路沿线国家的土地利用变化,并分析其对陆地碳库的影响。研究表明:未来土地利用变化及其对陆地碳库的影响在不同情景下存在显著差异。在可持续环境情景下,林地得到了有效保护,相较于2020年中国林地碳储量增加了约0.60%;在可持续粮食情景下,耕地流失得到了缓解,尤其在南亚及东南亚地区的耕地面积呈现上升趋势:在可持续经济情景下,城市扩张速度加快,引起的碳损失量最多这项研究有助于推进丝绸之路沿线甚至全球可持续发展进程,为探寻可持续发展路径提供了科学依据。

关键词： Sustainable development goals(SDGs) Land-use projection Carbon pool Scenarios System dynamics model Cellular automata

来源：评论

学校读者我要写书评

暂无评论

On the general position numbers of maximal outerplanar graphs

arXiv

引用

arXiv 2022年

作者： Tian, Jing Xu, Kexiang Chao, Daikun College of Mathematics Nanjing University of Aeronautics & Astronautics Nanjing210016 China MIIT Key Laboratory of Mathematical Modelling and High Performance Computing of Air Vehicles Nanjing210016 China College of Automation Engineering Nanjing University of Aeronautics & Astronautics Nanjing210016 China

A subset R ⊆ V (G) of a graph G is a general position set if any triple set R0 of R is non-geodesic in G, that is, no vertex of R0 lies on any geodesic between the other two vertices of R0 in G. Let R be the set of general position sets of a graph G. The general position number of a graph G, denoted by gp(G), is defined as gp(G) = max{|R|: R ∈ R}. In this paper, we determine the bounds on the gp-numbers for any maximal outerplane graph and characterize the corresponding extremal graphs. © 2022, CC BY.

关键词： Geodesy

来源：评论

学校读者我要写书评

暂无评论

high ORDER ASYMPTOTIC PRESERVING FINITE DIFFERENCE WENO SCHEMES WITH CONSTRAINED TRANSPORT FOR MHD EQUATIONS IN ALL SONIC MACH NUMBERS

arXiv

引用

arXiv 2022年

作者： Chen, Wei Wu, Kailiang Xiong, Tao School of Mathematical Sciences Xiamen University Xiamen Fujian361005 China Guangdong Shenzhen518055 China School of Mathematical Sciences Xiamen University Fujian Provincial Key Laboratory of Mathematical Modeling and High-Performance Scientific Computing Xiamen Fujian361005 China

In this paper, a high-order semi-implicit (SI) asymptotic preserving (AP) and divergence-free finite difference weighted essentially nonoscillatory (WENO) scheme is proposed for magnetohydrodynamic (MHD) equations. We consider the sonic Mach number Ε ranging from 0 to O(1). high-order accuracy in time is obtained by SI implicit-explicit Runge–Kutta (IMEX-RK) time discretization. high-order accuracy in space is achieved by finite difference WENO schemes with characteristic-wise reconstructions. A constrained transport method is applied to maintain a discrete divergence-free condition. We formally prove that the scheme is AP. Asymptotic accuracy (AA) in the incompressible MHD limit is obtained if the implicit part of the SI IMEX-RK scheme is stiffly accurate. Numerical experiments are provided to validate the AP, AA, and divergence-free properties of our proposed approach. Besides, the scheme can well capture discontinuities such as shocks in an essentially nonoscillatory fashion in the compressible regime, while it is also a good incompressible solver with uniform large-time step conditions in the low sonic Mach limit. © 2022, CC BY.

关键词： Mach number

来源：评论

学校读者我要写书评

暂无评论

A parallel iteration algorithm for greedy selection based IDW mesh deformation in openFOAM 3

A parallel iteration algorithm for greedy selection based ID...

引用

3rd IEEE International Conference on Electronic Information technology and Computer Engineering, EITCE 2019

作者： Zhao, Ran Li, Chao Guo, Xiaowei Fan, Sijiang Wang, Yi Liu, Yi Yang, Canqun National University of Defense Technology State Key Laboratory of High Performance Computing Changsha410073 China

ISBN: (纸本)9781728135847

Inverse Distance Weighting (IDW) interpolation based mesh deformation is an explicit technique adopted by large-scale mesh computation for Computational Fluid Dynamic (CFD). To obtain the optimum interpolating points set, greedy algorithm is utilized widely in the interpolation process. However, greedy algorithm will bring additional time cost because of its recycling point selection. This paper proposes a parallel iteration algorithm for greedy selection based IDW mesh deformation in OpenFOAM (a widely used software of CFD).The iteration method is proposed based on that some computing values are recycling in greedy loop and it make the computational complexity reduce from O(n3) to O(n2). The parallel algorithm is based on the re-decompositon method which can greatly keep the load balancing. The experiments are operated on a three-dimensional undulating fish model with 3.7 × 105 mesh cells. Results show that our parallel iteration method could obtain a more than 18.2 times performance increase, compared with the conventional greedy algorithm applied in IDW interpolation. © 2019 IEEE.

关键词： Interpolation

来源：评论

学校读者我要写书评

暂无评论

performance test for big data workloads on various emerging memories 2nd

Performance test for big data workloads on various emerging ...

引用

2nd International Conference on Computer, Communication and Computational Sciences, IC4S 2017

作者： Qian, Cheng State Key Laboratory of High Performance Computing National University of Defense Technology Changsha410073 China

ISBN: (纸本)9789811303432

Mismatch of performance improvement between CPU and main memory (also called memory wall) is making main memory become an increasingly significant factor contributing to overall system performance. In recent years, the rising of big data applications even aggravates the memory wall problem. Thus, it is necessary to analyze the memory performance for different memory systems while running big data applications. In this paper, we test and analyze five different memory systems by running both conventional workloads and big data workloads. Through comparison and analysis, we make several conclusions to guide the design of main memory system for big data workloads. © Springer Nature Singapore Pte Ltd. 2019.

关键词： Big data

来源：评论

学校读者我要写书评

暂无评论

On the Equity of Nuclear Norm Maximization in Unsupervised Domain Adaptation

arXiv

引用

arXiv 2022年

作者： Zhang, Wenju Zhang, Xiang Liao, Qing Lan, Long Wang, Mengzhu Wang, Wei Peng, Baoyun Ding, Zhengming Institute for Quantum Information State Key Laboratory of High Performance Computing National University of Defense Technology Changsha China College of Computer National University of Defense Technology Changsha China Department of Computer Science and Technology Harbin Institute of Technology Shenzhen China DUT-RU International School of Information Science & Engineering Dalian University of Technology Dalian China Tulane University New OrleansLA United States

Nuclear norm maximization has shown the power to enhance the transferability of unsupervised domain adaptation model (UDA) in an empirical scheme. In this paper, we identify a new property termed equity, which indicates the balance degree of predicted classes, to demystify the efficacy of nuclear norm maximization for UDA theoretically. With this in mind, we offer a new discriminability-and-equity maximization paradigm built on squares loss, such that predictions are equalized explicitly. To verify its feasibility and flexibility, two new losses termed Class Weighted Squares Maximization (CWSM) and Normalized Squares Maximization (NSM), are proposed to maximize both predictive discriminability and equity, from the class level and the sample level, respectively. Importantly, we theoretically relate these two novel losses (i.e., CWSM and NSM) to the equity maximization under mild conditions, and empirically suggest the importance of the predictive equity in UDA. Moreover, it is very efficient to realize the equity constraints in both losses. Experiments of cross-domain image classification on three popular benchmark datasets show that both CWSM and NSM contribute to outperforming the corresponding counterparts. © 2022, CC BY.

关键词： Image classification

来源：评论

学校读者我要写书评

暂无评论

OrdinalFix: Fixing Compilation Errors via Shortest-Path CFL Reachability

OrdinalFix: Fixing Compilation Errors via Shortest-Path CFL ...

引用

IEEE International Conference on Automated Software Engineering (ASE)

作者： Wenjie Zhang Guancheng Wang Junjie Chen Yingfei Xiong Yong Liu Lu Zhang Key Laboratory of High Confidence Software Technologies MoE School of Computer Science Peking University P. R. China College of Intelligence and Computing Tianjin University P. R. China College of Information Science and Technology Beijing University of Chemical Technology P. R. China

The development of correct and efficient software can be hindered by compilation errors, which must be fixed to ensure the code's syntactic correctness and program language constraints. Neural network-based approaches have been used to tackle this problem, but they lack guarantees of output correctness and can require an unlimited number of modifications. Fixing compilation errors within a given number of modifications is a challenging task. We demonstrate that finding the minimum number of modifications to fix a compilation error is NP-hard. To address compilation error fixing problem, we propose OrdinalFix, a complete algorithm based on shortest-path CFL (context-free language) reachability with attribute checking that is guaranteed to output a program with the minimum number of modifications required. Specifically, OrdinalFix searches possible fixes from the smallest to the largest number of modifications. By incorporating merged attribute checking to enhance efficiency, the time complexity of OrdinalFix is acceptable for application. We evaluate OrdinalFix on two datasets and demonstrate its ability to fix compilation errors within reasonable time limit. Comparing with existing approaches, OrdinalFix achieves a success rate of 83.5 %, surpassing all existing approaches (71.7%).

关键词：

来源：评论

学校读者我要写书评

暂无评论

Anti-Ramsey numbers of loose paths and cycles in uniform hypergraphs

arXiv

引用

arXiv 2024年

作者： Li, Tong Tang, Yucong Wang, Guanghui Yan, Guiying Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China Department of Mathematics Nanjing University of Aeronautics and Astronautics Nanjing211106 China Key Laboratory of Mathematical Modeling and High Performance Computing of Air Vehicles NUAA MIIT Nanjing211106 China School of Mathematics Shandong University Jinan250100 China School of Mathematical Sciences University of Chinese Academy of Sciences Beijing100049 China

For a fixed family of r-uniform hypergraphs F, the anti-Ramsey number of F, denoted by ar(n, r, F), is the minimum number c of colors such that for any edge-coloring of the complete r-uniform hypergraph on n vertices with at least c colors, there is a rainbow copy of some hypergraph in F. Here, a rainbow hypergraph is an edge-colored hypergraph with all edges colored differently. Let Pk and Ck be the families of loose paths and loose cycles with k edges in an r-uniform hypergraph, respectively. In this paper, we determine the exact values of ar(n, r, Pk) and ar(n, r, Ck) for all k ≥ 4 and r ≥ 3. Copyright © 2024, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：