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

Acta Technica CSAV (Ceskoslovensk Akademie Ved) 2017年第1期62卷 361-369页

作者： Jiang, Hanyang Wang, Danhua Hengyang Normal University Hengyang421002 China Hunan Provincial Key Laboratory of Intelligent Information Processing and Application Hengyang421002 China

CPU/GPU dynamic coordination technology is gradually applied to the development of parallel algorithms, but the current algorithm has some shortcomings in terms of efficiency and power consumption. Therefore, it is necessary to further study the parallel algorithm based on dynamic coordination control and scheduling. Based on the power cap technology, this paper sets up the device frequency and the single computing node of the synchronization system by studying the synchronization system of the computer, controlling DVFS and mapping mode. In order to avoid power failure and load imbalance, this paper has developed a new empirical model of performance and synchronization system, these models make the most of the power of the system to reduce the power consumption to a predetermined level, Good settings can be done. © 2017 Institute of Thermomechanics CAS, v.v.i.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Pseudo Multi-Source Domain Extension and Selective Pseudo-Labeling for Unsupervised Domain Adaptive Medical Image Segmentation 48

Pseudo Multi-Source Domain Extension and Selective Pseudo-La...

引用

48th IEEE International Conference on Acoustics, Speech and Signal processing, ICASSP 2023

作者： Liu, Xiaokang Wang, Zhiqiang Hu, Kai Gao, Xieping Xiangtan University Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan411105 China Xiangnan University College of Medical Imaging Laboratory and Rehabilitation Chenzhou423000 China Hunan Normal University Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Changsha410081 China

ISBN: (纸本)9781728163277

Unsupervised domain adaptation (UDA) attracts extra attention in medical image processing because no additional labels are required when adapting to different distributions. In this work, we propose a novel unsupervised domain adaptation framework named as Domain Expansion and PseudoLabeling (DEPL). We extend the domain of a labeled source domain data to four different distributed domains and use adversarial learning to align the image appearance level and feature level from the four different domains to the unlabeled target domain. In addition, we propose a selective pseudolabeling mechanism, namely using strong confidence pseudolabeling to boost model performance. We evaluate our model for the MR to CT adaptation segmentation task on the public dataset MMWHS. Compared to seven other state-of-the-art segmentation methods, our DEPL achieves the best Dice similarity coefficient by 82.4%, which is at least 3.9% higher than the other UDA segmentation methods. © 2023 IEEE.

关键词： Adversarial learning domain extension Image segmentation Selective pseudo-labeling Unsupervised domain adaptive

来源：评论

学校读者我要写书评

暂无评论

HTL-WASI preconditioner for finite element discretization of complex ADR equation and its application

引用

Journal of Computational and Applied Mathematics 2025年 470卷

作者： Yang, Ronghua Wang, Junxian Shu, Shi School of Mathematics and Computational Science Xiangtan University Xiangtan Hunan411105 China Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education National Center for Applied Mathematics in Hunan Xiangtan Hunan411105 China Hunan Key Laboratory for Computation and Simulation in Science and Engineering Xiangtan University Xiangtan Hunan411105 China

The convection diffusion reaction (ADR) equation is widely used in engineering applications. In this paper, we focus on a complex ADR equation arising from Helmholtz equation with impedance boundary conditions, prove the coerceiveness and boundedness of the sesquilinear functional and discuss the fast solver of the discretization. Firstly, we design a Weighted Additive Schwarz with Impedance (WASI) preconditioner, in order to overcome the dependence of the WASI preconditioner on the number of subdomains and the overlapping width, an ideal coarse space is designed. Although it can be proved that the corresponding hybrid two-level preconditioner is the exact inverse of the ADR coefficient matrix, the dimension of this coarse space is too big. In order to overcome this deficiency, a smaller dimensional coarse space was constructed by introducing local generalized eigenvalue problems (GEP) on each subdomain, and the descent rate of the corresponding two-level preconditioned GMRES method was rigorously analyzed which does not depend on mesh size, overlapping width, wave number k, and the absorption parameter. Since the size of the coarse space is sensitive to k and the GEP on each subdomain needs to be solved, the computational cost is too high. Therefore, we design an iterative method based on an economical two-level preconditioner, and establish a heuristic convergence theory that is supported by numerical results. Numerical experiments show the robustness of GMRES with the corresponding economical two-level preconditioner(HTLE-WASI-GMRES). Finally, for the Helmholtz finite element discretization, by using the Shifted Laplace technique and ADR equation, we design a novel fast solver combining with HTLE-WASI-GMRES for ADR equation. Numerical experiments have demonstrated the effectiveness of the algorithm. © 2025

关键词： Convergence of numerical methods

来源：评论

学校读者我要写书评

暂无评论

Design and Analysis of a Modified ZNN with Dynamic Parameter for Time Varying Generalized Sylvester Equation

Design and Analysis of a Modified ZNN with Dynamic Parameter...

引用

2022 International Conference on Machine Learning, Cloud computing and intelligent Mining, MLCCIM 2022

作者： Zhang, Yongsheng Chen, Jifeng He, Yongjun Peng, Hao Li, Ping College of Information and Mechatronics Engineering Hunan International Economics University Changsha410205 China Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha410205 China

ISBN: (数字)9781665498586

ISBN: (纸本)9781665498586

The time varying generalized Sylvester equation (TVGSE) is widely used in many domains such as mathematics, engineering and control system. Differing from the zeroing neural network (ZNN) and varying parameter ZNN (VPZNN), a novel neural network algorithm based on a novel time-varying parameter, named modified VPZNN (MVPZNN), is presented and studied for handling TVGSE in this work. In particular, the proposed MVPZNN possesses faster convergence capacity when activated by the linear and sign-bi-power activation function, respectively. Numerical simulation indicates that MVPZNN has superiority in convergence rate in coping with TVGSE compared with fixed parameter ZNN and other VPZNN models. © 2022 IEEE.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

Fixed-Parameter Tractability for Book Drawing with Bounded Number of Crossings per Edge 15th

Fixed-Parameter Tractability for Book Drawing with Bounded...

引用

15th International Conference on Algorithmic Aspects in information and Management, AAIM 2021

作者： Liu, Yunlong Li, Yixuan Huang, Jingui College of Information Science and Engineering Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha410081 China Hunan Xiangjiang Artificial Intelligence Academy Changsha China

ISBN: (纸本)9783030931759

The problem book drawing with a bounded number of crossings per edge asks, given a graph G= (V, E) and two integers k, b, whether there is a k-page book drawing of G such that the maximum number of crossings per edge is at most b. In this paper, we study this problem from a parameterized complexity viewpoint. Specifically, we investigate the problem parameterized by both the maximum number b of crossings per edge and the vertex cover number τ of G, and show that this parameterized problem admits a kernel of size (3 b+ 1 ) · 2O(τ) and admits a fixed-parameter tractable algorithm running in time O((3b+1)·2(3b+2)·2O(τ)+τ·|V| ). Together with our previous result for fixed-order book drawing with a bounded number of crossings per edge (COCOA 2020), our result provides a more complete answer to a question posed by Bhore et al. (J. Graph Alg. Appl. 2020). © 2021, Springer Nature Switzerland AG.

关键词： Parameterization

来源：评论

学校读者我要写书评

暂无评论

On book thickness parameterized by the vertex cover number

引用

Science China(information Sciences) 2022年第4期65卷 112-113页

作者： Yunlong LIU Jie CHEN Jingui HUANG School of Information Science and Engineering Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University

Dear editor,Book thickness for graphs forms a major theme in graph theory and has a broad application in the fields of sorting permutations, fault tolerant VLSI design, parallel computing, and others. The book Thickness problem, even if the vertex order is taken as part of the input, was shown to be NP-complete in general [1, 2]. Just because of this, parameterized algorithms have been proposed to deal with it [3].

关键词： Book Thickness Vertex Cover Number Linear Order 1-page embedding graph kernel

来源：评论

学校读者我要写书评

暂无评论

BGRA-Net: Boundary-Guided and Region-Aware Convolutional Neural Network for the Segmentation of Breast Ultrasound Images

BGRA-Net: Boundary-Guided and Region-Aware Convolutional Neu...

引用

2021 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2021

作者： Zhang, Xiang Li, Xuanya Hu, Kai Gao, Xieping Xiangtan University Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan411105 China Baidu Inc. Beijing100085 China Key Laboratory of Medical Imaging and Artifical Intelligence of Hunan Province Xiangnan University Chenzhou423000 China Hunan Normal University Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Changsha410081 China

ISBN: (纸本)9781665401265

In this paper, we propose a novel convolutional neural network based on boundary-guided and region-aware (BGRA-Net) for breast tumor segmentation in ultrasound images. In particular, in the encoding stage, we propose a boundary-guided module (BGM) to guide the learning of boundary features in the decoding stage by explicitly strengthening the extracted boundary information. Meanwhile, in the decoding stage, we propose a region-aware module (RAM) to integrate different levels of detailed and semantic features to improve the comprehensive representation of tumor regional features. Besides, a scale-adaptive module (SAM) is further proposed to capture the characteristics of tumors with different sizes between the encoding and decoding stages. To evaluate the effectiveness of our BGRA-Net, we conduct extensive experiments on the UDIAT dataset and compare it with eight state-of-the-art methods. The experimental results show that our BGRA-Net outperforms the state-of-the-art methods and can achieve accurate segmentation of breast tumors with ambiguous boundaries. © 2021 IEEE.

关键词： Tumors

来源：评论

学校读者我要写书评

暂无评论

NONMONOTONE LOCAL MINIMAX METHODS FOR FINDING MULTIPLE SADDLE POINTS

引用

Journal of Computational Mathematics 2024年第3期42卷 851-884页

作者： Wei Liu Ziqing Xie Wenfan Yi South China Research Center for Applied Mathematics and Interdisciplinary Studies South China Normal UniversityGuangzhou 510631China Key Laboratory of Computing and Stochastic Mathematics(Ministry of Education) Hunan Normal UniversityChangshaHunan 410081China Hunan Provincial Key Laboratory of Intelligent Information Processing and Applied Mathematics School of MathematicsHunan UniversityChangshaHunan 410082China

In this paper,by designing a normalized nonmonotone search strategy with the BarzilaiBorwein-type step-size,a novel local minimax method(LMM),which is a globally convergent iterative method,is proposed and analyzed to find multiple(unstable)saddle points of nonconvex functionals in Hilbert *** to traditional LMMs with monotone search strategies,this approach,which does not require strict decrease of the objective functional value at each iterative step,is observed to converge faster with less ***,based on a normalized iterative scheme coupled with a local peak selection that pulls the iterative point back onto the solution submanifold,by generalizing the Zhang-Hager(ZH)search strategy in the optimization theory to the LMM framework,a kind of normalized ZH-type nonmonotone step-size search strategy is introduced,and then a novel nonmonotone LMM is *** feasibility and global convergence results are rigorously carried out under the relaxation of the monotonicity for the functional at the iterative ***,in order to speed up the convergence of the nonmonotone LMM,a globally convergent Barzilai-Borwein-type LMM(GBBLMM)is presented by explicitly constructing the Barzilai-Borwein-type step-size as a trial step-size of the normalized ZH-type nonmonotone step-size search strategy in each ***,the GBBLMM algorithm is implemented to find multiple unstable solutions of two classes of semilinear elliptic boundary value problems with variational structures:one is the semilinear elliptic equations with the homogeneous Dirichlet boundary condition and another is the linear elliptic equations with semilinear Neumann boundary *** numerical results indicate that our approach is very effective and speeds up the LMMs significantly.

关键词： Multiple saddle points Local minimax method Barzilai-Borwein gradient method Normalized nonmonotone search strategy Global convergence

来源：评论

学校读者我要写书评

暂无评论

On Fixed-Order Book Thickness Parameterized by the Pathwidth of the Vertex Ordering 14th

On Fixed-Order Book Thickness Parameterized by the Pathwidth...

引用

14th International Conference on Algorithmic Aspects in information and Management, AAIM 2020

作者： Liu, Yunlong Chen, Jie Huang, Jingui Wang, Jianxin Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha410081 China School of Computer Science and Engineering Central South University Changsha410083 China

ISBN: (纸本)9783030576011

Given a graph (Formula Presented) and a fixed linear order (Formula Presented) of V, the problem fixed-order book thickness asks whether there is a page assignment (Formula Presented) such that (Formula Presented) is a k-page book embedding of G. Recently, Bhore et al.(GD2019) presented an algorithm parameterized by the pathwidth of the vertex ordering (denoted by (Formula Presented)). In this paper, we first re-analyze the running time for Bhore et al.’s algorithm, and prove a bound of (Formula Presented) improving on Bhore et al.’s bound of (Formula Presented). We further show that this parameterized problem does not admit a polynomial kernel unless NP (Formula Presented) coNP/poly. Finally, we show that the general fixed-order book thickness problem, in which a budget of at most c crossings over all pages was given, admits an algorithm running in time (Formula Presented). © 2020, Springer Nature Switzerland AG.

关键词： Budget control

来源：评论

学校读者我要写书评

暂无评论

Dynamic maintenance of decision rules for decision attribute values’ changing 25th

Dynamic maintenance of decision rules for decision attribute...

引用

25th International Conference on Neural information processing, ICONIP 2018

作者： Wang, Yingyao Dai, Jianhua Shi, Hong School of Computer Science and Technology Tianjin University Tianjin300350 China Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing College of Information Science and Engineering Hunan Normal University Changsha410081 China

ISBN: (纸本)9783030041816

Rule induction method based on rough set theory (RST) which can generate a minimal set of decision rules by using attribute reduction and approximations has received much attention recently. In real-life, the variation of objects, attributes and attributes’ values affects reducts and approximations, e.g., the coarsening and refining of attributes’ values. The goal of this paper is dynamic maintenance of decision rules for decision attribute values’ coarsening and refining. Two incremental rough-set based methods are proposed to deal with this issue by updating assignment discernibility matrix dynamically without recomputing the reducts from the beginning, which increases the efficiency. © Springer Nature Switzerland AG 2018.

关键词： Rough set theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：