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

2023 CAA Symposium on Fault Detection, Supervision and Safety for Technical Processes, SAFEPROCESS 2023

作者： Li, Qiuting Wang, Xiuqing Du, Wenxia Hebei Normal University College of Computer and Cyber Security Shijiazhuang050024 China Hebei Provincial Key Laboratory of Network & Information Security Shijiazhuang China Hebei Provincial Engineering Research Center for Supply Chain Big Data Analytics & Data Security Shijiazhuang China Hebei Normal University College of China Combustion Engineering Shijiazhuang050024 China

ISBN: (纸本)9798350337754

In the era of big data, high-performance rolling bearing fault diagnostic methods are of great significance to ensure manufacturing smoothly and avoid mass economic losses. A rolling bearing fault diagnostic CAR-SNN model based on Convolutional Block Attention Module (CBAM), Residual network (ResNet), and Spiking Neural networks (SNNs) is proposed based on deep learning (DL). The CAR-SNN model combines CBAM, ResNet, and SNNs to extract critical features while avoiding gradient vanishing or explosion phenomena. The ability of the CAR-SNN model to process spatio-temporal information is improved by using SNNs that incorporate spatio-temporal information simultaneously. The proposed model is used for the rolling bearing fault diagnosis, which datasets are from the experimental platforms of CWRU and Jiangnan University, with the highest diagnostic accuracy 99.995% and 99.18%, respectively. The experimental results validate the effectiveness and stability of the proposed model. The results of comparison experiments show that the CAR-SNN model has better fault diagnostic accuracy and stability than that of the CAR model and other comparison methods. The proposed data-driven rolling bearing fault diagnostic method based on the CAR-SNN model is easy to be implemented, and meeting the needs of high fault diagnostic accuracy in practical applications, and provides valuable input for fault diagnosis of rolling bearings. © 2023 IEEE.

关键词： Failure analysis

来源：评论

学校读者我要写书评

暂无评论

On the MDS Condition of Generalized Expanded-Blaum-Roth Codes 18

On the MDS Condition of Generalized Expanded-Blaum-Roth Code...

引用

18th International Symposium on Problems of Redundancy in information and Control Systems, REDUNDANCY 2023

作者： Hou, Hanxu Song, Linqi Dongguan University of Technology Dongguan Key Lab of Artificial Information Network School of Electrical Engineering & Intelligentization China City University of Hong Kong Department of Computer Science Hong Kong

ISBN: (纸本)9798350381528

Generalized Expanded-Blaum-Roth (GEBR) codes [You et al. 2020] are designed for large-scale distributed storage systems that have larger recoverability for single-symbol failures, multi-column failures and multi-row failures, compared with locally recoverable codes (LRC). GEBR codes encode an α × k information array into a pτ ×(k + r) array such that lines of slope i with 0 ≤ i ≤ r -1 have even parity and each column contains pτ-α local parity symbols, where p is an odd prime and k +r ≤ pτ. Necessary and sufficient conditions for GEBR codes to be (n, k) recoverable (i.e., any k out of n = k+r columns can retrieve all information symbols) are given in [Hou et al. 2023] for α = (p -1)τ. However, the (n, k) recoverable condition of GEBR codes is unknown when α © 2023 IEEE.

关键词： Multiprocessing systems

来源：评论

学校读者我要写书评

暂无评论

Research on long and short-term social recommendation based on convolutional and gated recurrent units 29

Research on long and short-term social recommendation based ...

引用

29th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2023

作者： Jia, Zihe Xue, Peng Dai, Zhiqiang Gao, Qian Zhang, Xiaomeng Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan250014 China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Jinan250353 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan250014 China

ISBN: (纸本)9798350330717

The development of the Internet has made people more closely related and has put forward higher requirements for recommendation models. Most recommendation models are studied only for the long-term interests of users. In this paper, the interaction time between the user and the item is introduced as auxiliary information in the model construction. Interaction time is used to determine users' long-term preferences and short-term preferences. In this paper, temporal features are extracted by building a convolutional gated recurrent unit with attention neural network (CNN-GRU-Attention). Firstly, for the problem of accurate feature extraction, CNN are constructed to extract higher-level and more abstract features of themselves and transform high-dimensional data into low-dimensional data;secondly, for the problem of social temporality, GRU are used to not only extract temporal information, but also effectively reduce gradient dispersion, making model convergence and training easier;finally, Graph Attention networks are used to aggregate the social relationship information of users and items respectively, which constitute the final feature representation of users and items respectively. In particular, a modified cosine similarity is used to reduce the error caused by data insensitivity when constructing the social information of the item. In this study, simulation experiments are conducted on two publicly available datasets (Epinions and Ciao), and the experimental results show that the proposed recommended model performs better than other social recommendation models, improving the evaluation metrics of MAE and RMSE by 1.06%-1.33% and 1.19%-1.37%, respectively. The effectiveness of the model innovation is proved. © 2023 IEEE.

关键词： convolutional gated recurrent unit graph attention networks neighborhood recommendation systems social networks

来源：评论

学校读者我要写书评

暂无评论

DCCT-Net: A network Combined Dynamic CNN and Transformer for Image Compressive Sensing

DCCT-Net: A Network Combined Dynamic CNN and Transformer for...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Lijuan Xu Haixiao Mei Fenghua Tong Dawei Zhao Fuqiang Yu Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Recent end-to-end image compressive sensing networks primarily use Convolutional Neural networks (CNNs) and Transformers, each with distinct limitations: CNNs struggle with global feature capture, while Transformers lack local feature extraction. We propose a novel network, DCCT-Net, which combines Dynamic CNN (DCNN) and Transformer. This integration leverages DCNN’s local feature strengths and the Transformer’s global representation capabilities, resulting in superior image reconstruction quality. To further enhance the network’s performance, we propose a Feature Dynamic Augment Module (FDAM), which dynamically extracts features based on the saliency of segmented image regions, thereby amplifying the CNN’s local feature expression. Additionally, we design a Weighted Fusion Module (WFM), which optimizes the combination of local and global features extracted by the DCNN and Transformer, respectively. Extensive experiments demonstrate that our proposed DCCT-Net significantly outperforms most existing state-of-the-art methods in the field.

关键词： Image segmentation Image coding Signal processing Transformers Feature extraction Sensors Convolutional neural networks Speech processing Compressed sensing Image reconstruction

来源：评论

学校读者我要写书评

暂无评论

information spreading in mobile social networks: Identifying the influential nodes using FPSO algorithm 10

Information spreading in mobile social networks: Identifying...

引用

10th International Conference on information Technology: IoT and Smart City, ICIT 2022

作者： Zhang, Xinxin Xu, Li Xu, Zhenyu Sun, Hung-Min Lee, Chia-Wei College of Computer and Cyber Security Fujian Provincial Key Laboratory of Network Security and Cryptology Fujian Normal University Fuzhou China The Department of Computer Science National Tsing Hua University Hsinchu Taiwan Department of Computer Science and Information Engineering National Taitung University Taiwan

ISBN: (纸本)9781450397438

The most influential nodes are capable of generating maximum influence and widest information spread to their connected nodes in mobile social networks. Hence identifying high influential users plays an important role in monitoring network public opinion. However, influence maximization is an open and challenging issue, and existing works only focus on online social networks but fail to characterize the user social relations and social behavior. In this paper, firstly, we present a novel method based on location and preference relationships to calculate the social influence of users, and the initial nodes are identified by community partition. Secondly, according to the stochastic information spreading process in MSNs, we propose the Fluctuate Particle Swarm Optimization (FPSO)-algorithm to solve the problem of changing communication relationship between users at the optimization stage. Finally, we use extensive experiments on the real datasets to prove the effectiveness of the proposed FPSO-algorithm. The experimental evaluation shows that in the real networks, our proposal achieves better performance than other related methods. © 2022 ACM.

关键词： Social networking (online)

来源：评论

学校读者我要写书评

暂无评论

Triple-Fault-Tolerant Binary MDS Array Codes with Lower Encoding Complexity 18

Triple-Fault-Tolerant Binary MDS Array Codes with Lower Enco...

引用

18th International Symposium on Problems of Redundancy in information and Control Systems, REDUNDANCY 2023

ISBN: (纸本)9798350381528

In this paper, we present a new construction of maximal distance separable (MDS) array codes with three parity columns. We present an efficient encoding algorithm for our new codes and show that our new codes have lower encoding complexity than all the existing MDS codes under the same parameters. The essential reasons of obtaining lower encoding complexity for our codes are of two-folds: (i) our codes are well-designed in a cyclic polynomial ring with only cyclic shifts and XORs being involved in the operations;(ii) our codes are designed based on the efficient schedule algorithm that can minimize the number of operations in the coding procedure. Moreover, our codes can support much more parameters compared with the existing MDS array codes, such as the EVENODD codes and STAR codes. We also present an efficient decoding method for the proposed codes. © 2023 IEEE.

关键词： Encoding (symbols)

来源：评论

学校读者我要写书评

暂无评论

Source-free Domain Adaptation with Multiple Alignment for Efficient Image Retrieval

Source-free Domain Adaptation with Multiple Alignment for Ef...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Jinghui Ni Hui Cui Lihai Zhao Fengling Li Xiaohui Han Lijuan Xu Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science Quan Cheng Laboratory Shandong Open University University of Technology Sydney

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Domain adaptation techniques help models generalize to target domains by addressing domain discrepancies between the source and target domain data distributions. These techniques are particularly valuable for cross-domain hashing retrieval, as they reduce training costs while maintaining high retrieval efficiency. However, existing unsupervised domain adaptative hashing methods often require access to both source and target domain data, which may raise privacy concerns regarding source domain data. To address these concerns, restricting access to source domain data is crucial, but this restriction also makes the alignment process between domains more challenging. In this paper, we propose a Source-free Domain Adaptive Hashing with Multiple Alignment (SFDAH-MA) approach for image retrieval. SFDAH-MA integrates model structure alignment, class moment alignment, and semantic relationship alignment to maximize inter-domain knowledge transfer. This comprehensive alignment strategy not only enhances retrieval performance across domains but also minimizes reliance on source domain data, thereby supporting data privacy protection. Extensive experiments show that SFDAH-MA achieves state-of-the-art performance in source-free settings and achieves comparable results to existing unsupervised domain adaptive hashing methods under conventional settings. The source codes of our method are available at: https://***/Nikphyc/SFDAH-MA.

关键词： Training Data privacy Adaptation models Source coding Semantics Image retrieval Signal processing Protection Speech processing Knowledge transfer

来源：评论

学校读者我要写书评

暂无评论

A novel clinical artificial intelligence model for disease detection via retinal imaging

引用

The Innovation 2024年第2期5卷 11-12页

作者： Yidian Fu Liang Ma Sheng Wan Shengfang Ge Zhi Yang Department of Ophthalmology Ninth People’s HospitalShanghai JiaoTong University School of MedicineShanghai 200011China Shanghai Key Laboratory of Orbital Diseases and Ocular Oncology Shanghai 200011China PCA Lab Key Lab of Intelligent Perception and Systems for High-Dimensional Information of Ministry of EducationNanjing 210000China Jiangsu Key Lab of Image and Video Understanding for Social Security School of Computer Science and EngineeringNanjing University of Science and TechnologyNanjing 210000China

Artificial intelligence(AI)is an emerging field in which computerized systems are used to carry out complex tasks in place of *** AI algorithms have been developed for disease diagnosis and prediction and treatment recommendation across various clinical data types,e.g.,chest X-rays,electrocardiograms,and other radiological images.1 In ophthalmology,particularly,great progress has been made in AI systems over the past *** fundus photography(CFP)and optical coherence tomography(OCT),which are readily available in routine clinical practice,are both mainstream and useful retinal imaging modalities in *** September 2023,the 2023 Lasker-Debakey Clinical Medical Research Award was awarded to three scientists for their work on OCT for accurate retinal disease detection.

关键词： clinical routine diagnosis

来源：评论

学校读者我要写书评

暂无评论

Dynamic Social Recommendation with High-Matching Inhomogeneous Relations

Dynamic Social Recommendation with High-Matching Inhomogeneo...

引用

2023 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2023

作者： Li, Shenghan Wang, Jinyan Zeng, Huachang Li, Jun Wei, Yuecen Li, Xianxian Guangxi Normal University Key Lab of Education Blockchain and Intelligent Technology Ministry of Education Guilin China Guangxi Normal University Guangxi Key Lab of Multi-source Information Mining Security Guilin China School of Computer Science and Engineering Guangxi Normal University Guilin China School of Computer and Information Technology Anhui Vocational and Technical College Hefei China

ISBN: (纸本)9798350337020

Social recommendation utilizing social relations as auxiliary information can alleviate data sparsity issues of collaborative filtering methods. However, existing social recommendation methods usually focus on the shallow relations of user-item interactions and social networks to mine potential user preferences, which fail to provide a fine-grained consideration of the inhomogeneous influence and the changes in user interest or item attractiveness over time in high-order interactions of multiple relation types. To address these issues, we propose a novel method named Dynamic Social Recommendation with High-matching Inhomogeneous Relations (DSRHIR) to reveal the influence of inhomogeneity in dynamic interactions on social recommendation from multiple perspectives. Specifically, we first model the short-term dynamic and long-term static representations of both users with social relations and similar relations, and items with correlations. Then, we combine their dynamic and static representations during the interaction and the information from the high-order neighbors of these three relations to obtain a graph-augmented representation. Finally, the graph-augmented representation is used to modulate high-matching user interest and item attractiveness. Extensive experiments on two real-world datasets demonstrate the effectiveness of DSRHIR. © 2023 IEEE.

关键词： graph neural network inhomogeneous relations Recommender systems social networks

来源：评论

学校读者我要写书评

暂无评论

DRL-Based Time-Varying Workload Scheduling With Priority and Resource Awareness

引用

IEEE Transactions on network and Service Management 2025年第3期22卷 2838-2852页

作者： Liu, Qifeng Fan, Qilin Zhang, Xu Li, Xiuhua Wang, Kai Xiong, Qingyu Chongqing University School of Big Data and Software Engineering Chongqing400044 China Chongqing University Key Laboratory of Dependable Service Computing in Cyber Physical Society of Ministry of Education Chongqing400044 China Nanjing University School of Electronic Science and Engineering Nanjing210023 China Haihe Laboratory of Information Technology Application Innovation Tianjin300072 China Harbin Institute of Technology School of Computer Science and Technology Weihai264209 China Shandong Key Laboratory of Industrial Network Security Weihai264209 China

With the proliferation of cloud services and the continuous growth in enterprises' demand for dynamic multi-dimensional resources, the implementation of effective strategy for time-varying workload scheduling has become increasingly significant. In this paper, we propose a deep reinforcement learning (DRL)-based method for time-varying workload scheduling, aiming to allocate resources efficiently across servers in the cluster. Specifically, we integrate a classifier and queue scorer to construct a priority queue that exploits temporal resource utilization patterns across different workload classes. Then, we design parallel graph attention layers to capture the dimensional features and temporal dynamics of cloud server cluster. Moreover, we propose a DRL algorithm to generate scheduling strategies that can adapt to dynamic environments. Validation on real-world traces from Google cluster demonstrates that our method outperforms existing approaches in key metrics of cloud server cluster management. © 2004-2012 IEEE.

关键词： Cloud platforms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：