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

arXiv 2024年

作者： Feng, Fang Hu, Yuming Yu, Yue Zhao, Jikun School of Mathematics and Statistics Nanjing University of Science and Technology Nanjing China Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education National Center for Applied Mathematics in Hunan School of Mathematics and Computational Science Xiangtan University Hunan Xiangtan411105 China School of Mathematics and Statistics Zhengzhou University Zhengzhou450001 China

In this paper, we develop a residual-type a posteriori error estimation for an interior penalty virtual element method (IPVEM) for the Kirchhoff plate bending problem. Building on the work in [18], we adopt a modified discrete variational formulation that incorporates the H1-elliptic projector in the jump and average terms. This allows us to simplify the numerical implementation by including the H1-elliptic projector in the computable error estimators. We derive the reliability and efficiency of the a posteriori error bound by constructing an enriching operator and establishing some related error estimates that align with C0-continuous interior penalty finite element methods. As observed in the a priori analysis, the interior penalty virtual elements exhibit similar behaviors to C0continuous elements despite its discontinuity. This observation extends to the a posteriori estimate since we do not need to account for the jumps of the function itself in the discrete scheme and the error estimators. As an outcome of the error estimator, an adaptive VEM is introduced by means of the mesh refinement strategy with the one-hanging-node rule. Numerical results from several benchmark tests confirm the robustness of the proposed error estimators and show the efficiency of the resulting adaptive VEM. Copyright © 2024, The Authors. All rights reserved.

关键词： Discrete element methods

来源：评论

学校读者我要写书评

暂无评论

EEG Signals Classification in Time-Frequency Images by Fusing Rotation-Invariant Local Binary Pattern and Gray Level Co-occurrence Matrix Features 1st

EEG Signals Classification in Time-Frequency Images by Fus...

引用

1st CAAI International Conference on Artificial Intelligence, CICAI 2021

作者： Hu, Zhongyi Luo, Zhenzhen Jin, Shan Li, Zuoyong College of Computer and Artificial Intelligence Intelligent Information Systems Institute Wenzhou University Wenzhou China Zhejiang Topcheer Information Technology Co. Ltd Zhejiang China Fujian Provincial Key Laboratory of Information Processing and Intelligent Control College of Computer and Control Engineering Minjiang University Fuzhou China

ISBN: (纸本)9783030930455

Automatic epilepsy diagnosis system based on EEG signals is critical in the classification of epilepsy. This disease classification through doctors’ visual observation of transient EEG signals is more art than science. This paper proposes a novel EEG signals classification method based on time-frequency images by fusing rotation-invariant local binary pattern and gray level co-occurrence matrix features. Specifically, a continuous wavelet transform is applied to perform wavelet decomposition of mutated EEG signals and obtain their time-frequency images. Then, the binary particle swarm optimization algorithm is used to eliminate redundant features in feature selection and optimize the hyperparameters of SVM. The proposed method was verified by its comparison with other available cutting-edge classification methods. The proposed EEG signals classification framework achieved a better classification effect, which will help expert clinicians and neuroscientists to make more accurate and rapid epilepsy diagnosis. © 2021, Springer Nature Switzerland AG.

关键词： Neurology

来源：评论

学校读者我要写书评

暂无评论

Blockchain-Based Multi-Cloud Data Storage System Disaster Recovery

Blockchain-Based Multi-Cloud Data Storage System Disaster Re...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Feiyu Wang Jian-tao Zhou College of Computer Science Inner Mongolia University Hohhot Inner Mongolia China Inner Mongolia Engineering Laboratory for Cloud Computing and Service Software Inner Mongolia Key Laboratory of Social Computing and Data Processing Inner Mongolia Engineering Laboratory for Big Data Analysis Technology Engineering Research Center of Ecological Big Data Ministry of Education National & Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian China

Cloud storage services have been used by most businesses and individual users. However, data loss, service interruptions and cyber attacks often lead to cloud storage services not being provided properly, and these incidents have caused financial losses to users. Second, traditional and single-cloud model disaster recovery services are no longer suitable for the current complex cloud storage systems. Therefore, a scheme to provide disaster recovery for cloud storage services in a multi-cloud storage environment is needed in real production. In this paper, we propose a disaster recovery scheme based on blockchain technology. The proposed scheme outlined in this study aims to address the issue of data availability within the cloud storage landscape. The proposed scheme achieves this goal by dividing data into hot and cold categories, verifying the integrity of copy data via blockchain technology, and utilizing blockchain networks to manage multi-cloud storage systems. Experimental findings demonstrate that the proposed scheme yields superior results in terms of computation and time overheads.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Pdm-Ssd: Single-Stage 3d Object Detector with Point Dilation Mechanism

SSRN

引用

SSRN 2024年

作者： Liang, Ao Hua, Haiyang Fang, Jian Chen, Wenyu Zhao, Huaici Wang, Guogang Key Laboratory of Opto-Electronic Information Processing Chinese Academy of Sciences Shenyang110016 China Shenyang Institute of Automation Chinese Academy of Sciences Shenyang110016 China Institutes for Robotics and Intelligent Manufacturing Shenyang110169 China University of Chinese Academy of Sciences Beijing100049 China Key Laboratory of Optical Information and Simulation Technology Shenyang110016 China College of Information Engineering Shenyang University of Chemical Technology Shenyang110142 China

Current point-based detectors can only learn from the provided points, with limited receptive fields and insufficient global learning capabilities for such targets. In this paper, we present a novel Point Dilation Mechanism for single-stage 3D detection (PDM-SSD) that takes advantage of two representations. Specifically, we first use a PointNet-style 3D backbone for efficient feature encoding. Then, a neck with Point Dilation Mechanism (PDM) is used to expand the feature space, which involves two key steps: point dilation and feature filling. The former expands points to a certain size grid centered around the sampled points in Euclidean space. The latter fills the unoccupied grid with feature for backpropagation in terms of direction and scale. Next, we associate multiple dilation centers and fuse coefficients to obtain sparse grid features through height compression. Finally, we design a hybrid detection head for joint learning. The experiments confirm the effectiveness and efficiency of the proposed method. In particular, PDM-SSD achieves state-of-the-art results among single-modal methods on the challenging KITTI dataset, with an inference speed of 68 frames. We also demonstrate the advantages of PDM-SSD in detecting sparse and incomplete objects through numerous object-level instances. Additionally, PDM can serve as an auxiliary network to establish a connection between sampling points and object centers, thereby improving the accuracy of the model without sacrificing inference speed. Our code is available at \url{https://***/AlanLiangC/***}. © 2024, The Authors. All rights reserved.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

Lossless and Universal 3D Object Encryption with Differentiated Visual Effects upon Decryption: A Novel Paradigm

引用

IEEE Transactions on Dependable and Secure computing 2025年

作者： Zhao, Ruoyu Zhang, Yushu Mou, Jun Puech, William Weng, Jian School of Computing and Artificial Intelligence Jiangxi University of Finance and Economics Nanchang330013 China Jiangxi Provincial Key Laboratory of Multimedia Intelligent Processing Nanchang330013 China School of Information Science and Engineering Dalian Polytechnic University Dalian116000 China Centre National de la Recherche Scientifique Université de Montpellier Montpellier34095 France College of Information Science and Technology Jinan University Guangzhou510632 China

A recently proposed 3D object encryption scheme enables hierarchical decryption, allowing a single encryption to display varied visual effects upon decryption. This has potential applications in complex scenarios where 3D objects require access at different security levels. However, it has two main issues: lossless decryption is not possible due to precision loss from the IEEE 754 standard, and it is customized for a specific AES algorithm, limiting support for others. Motivated by this, a novel paradigm for 3D object encryption with differentiated visual effects upon decryption is proposed. In this paradigm, the precision loss is preserved within the 3D encrypted object, allowing the 3D object after fully decrypting to be identical to the original, and thus it is lossless. Meanwhile, the data to be encrypted is reduced to three blocks, which are generalized bitstreams. Bitstream encryption algorithms that do not produce ciphertext expansion can be applied, and it operates independently of the other components in the paradigm, making it universal. Finally, a prototype of this paradigm is constructed, using the same encryption algorithm as in the previous scheme for comparative experiments. Two 3D object datasets are used to conduct the experiments and results demonstrate that it achieves lossless decryption and has a time advantage, while also undergoing security analysis and verification against smoothing attacks to confirm the security. © 2025 IEEE. All rights reserved,

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

A Unified Framework for Exploratory Learning-Aided Community Detection Under Topological Uncertainty

引用

IEEE Transactions on Network Science and Engineering 2025年

作者： Hou, Yu Tran, Cong Li, Ming Shin, Won-Yong Yonsei University School of Mathematics and Computing Computational Science and Engineering Seoul03722 Korea Republic of Posts and Telecommunications Institute of Technology Faculty of Information Technology Hanoi100000 Viet Nam Zhejiang Institute of Optoelectronics Jinhua321004 China Zhejiang Normal University Zhejiang Key Laboratory of Intelligent Education Technology and Application Jinhua321004 China Graduate School of Artificial Intelligence Pohang37673 Korea Republic of

In social networks, the discovery of community structures has received considerable attention as a fundamental problem in various network analysis tasks. However, due to privacy concerns or access restrictions, the network structure is often uncertain, thereby rendering established community detection approaches ineffective without costly network topology acquisition. To tackle this challenge, we present META-CODE, a unified framework for detecting overlapping communities via exploratory learning aided by easy-to-collect node metadata when networks are topologically unknown (or only partially known). Specifically, META-CODE consists of three iterative steps in addition to the initial network inference step: 1) node-level community-affiliation embeddings based on graph neural networks (GNNs) trained by our new reconstruction loss, 2) network exploration via community-affiliation-based node queries, and 3) network inference using an edge connectivity-based Siamese neural network model from the explored network. Through extensive experiments on three real-world datasets including two large networks, we demonstrate: (a) the superiority of META-CODE over benchmark community detection methods, achieving remarkable gains up to 65.55% on the Facebook dataset over the best competitor among our selected competitive methods in terms of normalized mutual information (NMI), (b) the impact of each module in META-CODE, (c) the effectiveness of node queries in META-CODE based on empirical evaluations and theoretical findings, and (d) the convergence of the inferred network. © 2013 IEEE.

关键词： Structured Query Language

来源：评论

学校读者我要写书评

暂无评论

ISGAN: Unsupervised Domain Adaptation With Improved Symmetric GAN for Cross-Modality Multi-Organ Segmentation

引用

IEEE Journal of Biomedical and Health Informatics 2024年第6期29卷 3874-3885页

作者： Jiapeng Li Yifan Zhang Lisheng Xu Yudong Yao Lin Qi College of Medicine and Biological Information Engineering Northeastern University Shenyang China Engineering Research Center of Medical Imaging and Intelligent Analysis Ministry of Education Shenyang China Key Laboratory of Medical Image Computing Ministry of Education Northeastern University Shenyang China Department of Electrical and Computer Engineering Stevens Institute of Technology Hoboken NJ USA

The differences between cross-modality medical images are significant, so several studies are working on unsupervised domain adaptation (UDA) segmentation, which aims to adapt a segmentation model trained on a labeled source domain to an unlabeled target domain. The conventional UDA segmentation strategy aims to integrate image generation and segmentation. However, conventional image generation modules only consider information from a single domain (source or target), resulting in visual inconsistencies. The image generation module may also lack anatomical constraints, leading to incorrect pseudo-label generation. To address these issues, we propose an improved symmetric generative adversarial network (ISGAN). Unlike conventional approaches that perform domain adaptation only in the source or target domain, ISGAN adopts a symmetric architecture using two-path domain adaptation to reduce the visual difference. In addition, ISGAN adopts a bidirectional training strategy to optimize the image generation and segmentation modules. The bidirectional training strategy introduces the anatomical constraints into the image generation module, thereby reducing the generation of incorrect pseudo labels. Finally, we validate ISGAN on two cross-modality datasets (the MMWHS cardiac dataset and Abdomen dataset). ISGAN delivers promising segmentation and generalization performance compared with state-of-the-art UDA methods.

关键词： Image segmentation Training Biomedical imaging Image synthesis Magnetic resonance imaging Computed tomography Feature extraction Generative adversarial networks Generators Diffusion models

来源：评论

学校读者我要写书评

暂无评论

S2DA-Net: Spatial and spectral-learning double-branch aggregation network for liver tumor segmentation in CT images

引用

Computers in Biology and Medicine 2024年 174卷 108400-108400页

作者： Liu, Huaxiang Yang, Jie Jiang, Chao He, Sailing Fu, Youyao Zhang, Shiqing Hu, Xudong Fang, Jiangxiong Ji, Wenbin Department Radiology of Taizhou Hospital Zhejiang University Zhejiang Taizhou318000 China Institute of Intelligent Information Processing Taizhou University Zhejiang Taizhou318000 China Key Laboratory of Evidence-based Radiology of Taizhou Zhejiang Taizhou317000 China School of Geophysics and Measurement and Control Technology East China University of Technology Nanchang330013 China

Accurate liver tumor segmentation is crucial for aiding radiologists in hepatocellular carcinoma evaluation and surgical planning. While convolutional neural networks (CNNs) have been successful in medical image segmentation, they face challenges in capturing long-term dependencies among pixels. On the other hand, Transformer-based models demand a high number of parameters and involve significant computational costs. To address these issues, we propose the Spatial and Spectral-learning Double-branched Aggregation Network (S2DA-Net) for liver tumor segmentation. S2DA-Net consists of a double-branched encoder and a decoder with a Group Multi-Head Cross-Attention Aggregation (GMCA) module, Two branches in the encoder consist of a Fourier Spectral-learning Multi-scale Fusion (FSMF) branch and a Multi-axis Aggregation Hadamard Attention (MAHA) branch. The FSMF branch employs a Fourier-based network to learn amplitude and phase information, capturing richer features and detailed information without introducing an excessive number of parameters. The FSMF branch utilizes a Fourier-based network to capture amplitude and phase information, enriching features without introducing excessive parameters. The MAHA branch incorporates spatial information, enhancing discriminative features while minimizing computational costs. In the decoding path, a GMCA module extracts local information and establishes long-term dependencies, improving localization capabilities by amalgamating features from diverse branches. Experimental results on the public LiTS2017 liver tumor datasets show that the proposed segmentation model achieves significant improvements compared to the state-of-the-art methods, obtaining dice per case (DPC) 69.4 % and global dice (DG) 80.0 % for liver tumor segmentation on the LiTS2017 dataset. Meanwhile, the pre-trained model based on the LiTS2017 datasets obtain, DPC 73.4 % and an DG 82.2 % on the 3DIRCADb dataset. © 2024

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

A modified iterative algorithm for solving split equality problems

引用

UPB Scientific Bulletin, Series A: Applied Mathematics and Physics 2021年第3期83卷 45-54页

作者： Fu, Yuanmin Zhu, Li-Jun Wei, Haicheng School of Mathematics and Information Science North Minzu University Yinchuan750021 China The Key Laboratory of Intelligent Information and Big Data Processing of NingXia Province North Minzu University Yinchuan750021 China Health Big Data Research Institute of North Minzu University Yinchuan750021 China Advanced Intelligent Perception Control Technology Innovative Team of NingXia North Minzu University Yinchuan750021 China

In this paper, we investigate the split equality problems in Hilbert spaces. We propose an iterative algorithm with self-adaptive step-size for solving split equality prob-lems. Convergent analysis of the suggested algorithm is proved under some suitable conditions. © 2021, Politechnica University of Bucharest. All rights reserved.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

BMDP:Blockchain-Based Multi-Cloud Storage Data Provenance

BMDP:Blockchain-Based Multi-Cloud Storage Data Provenance

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Feiyu Wang Jian-Tao Zhou Xu Guo College of Computer Science Inner Mongolia University Hohhot Inner Mongolia China Inner Mongolia Engineering Laboratory for Cloud Computing and Service Software Engineering Research Center of Ecological Big Data Ministry of Education National & Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian Inner Mongolia Key Laboratory of Social Computing and Data Processing Inner Mongolia Engineering Laboratory for Big Data Analysis Technology China

In a multi-cloud storage system, provenance data records all operations and ownership during its lifecycle, which is critical for data security and audibility. However, recording provenance data also poses some challenging security and storage issues. In this paper, we present a secure and efficient multi-cloud storage data source scheme, BMDP. We use blockchain technology to ensure the secure storage of provenance data and design a smart contract to utilize the provenance data to ensure the proper operation of the multi-cloud storage system. Finally, we analyze the scheme’s safety and do simulation experiments to show that the scheme has practicality.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：