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

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

作者： Zhang, Chuanfu Li, Wen Chen, Jing Ge, Jing Wang, Di Li, Na Sun, Hao Geng, Yudong Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center National Supercomputer Center in Jinan Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan China

ISBN: (纸本)9798350330717

To improve the task scheduling efficiency in computing power networks, this paper proposes a global task scheduling method based on network measurement and prediction in computing power networks (GTS-MP), which selects a more suitable computing power cluster and storage platform with a higher network availability score between them to implement tasks. The experiments are conducted on a test bench of urban area networks in 12 cities. The results show that this method greatly reduces the execution time of artificial intelligence model training tasks, with a maximum reduction of 40% compared to other plans. © 2023 IEEE.

关键词： computing power network global scheduling network availability score task offloading

来源：评论

学校读者我要写书评

暂无评论

MDDMamba: A Model for Multi-Modal Depression Detection with a Memory-Saving Cross-Modal Attention Mechanism Based on Mamba

MDDMamba: A Model for Multi-Modal Depression Detection with ...

引用

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Liu, Mingzhou Wang, Zheyu Liu, Feng Nanjing University of Posts and Telecommunications School of Education Science and Technology Nanjing210023 China Nanjing University of Science and Technology ZiJin College School of Computer and Artificial Intelligence Nanjing210023 China Jiangsu Key Laboratory of Intelligent Information Processing and Communication Technology Nanjing210003 China

ISBN: (纸本)9798350386226

Depression is a severe mental health disorder that constitutes a significant global health challenge, necessitating efficient and accurate automated diagnostic tools. Traditional approaches to automated depression assessment using multi-modal data often face three significant difficulties: small sample sizes in available datasets, high computational cost, and difficulties in effectively integrating different modalities. In this paper, we first mitigate the problem of dataset quality by utilizing an estimated imputation strategy for missing values based on a known data augmentation method. Additionally, we introduce a multi-modal depression detection model named MDDMamba, designed to address the latter two challenges by integrating features from pre-trained emotion models with the memory-efficient selective state space model named Mamba. The MDDMamba model combines features from pre-trained emotion models for both text and audio, enhancing the extraction of emotional information. The core of the MDDMamba model is the CrossMamba module, which replaces the traditional Transformer's quadratic computational complexity with a linear complexity alternative, facilitating efficient multi-modal fusion. Experimental results on CMDC and EATD-Corpus datasets show that the MDDMamba model achieves better classification and regression performance and stronger generalization capabilities in depression detection. Notably, the MDDMamba model achieves an F1 score of 0.94 and a Pearson correlation coefficient of 0.86 on the CMDC dataset while maintaining lower memory cost, outperforming most advanced multi-modal depression detection methods across various experimental scenarios. © 2024 IEEE.

关键词： Data fusion

来源：评论

学校读者我要写书评

暂无评论

Graph Contrastive Learning with Learnable Graph Augmentation 48

Graph Contrastive Learning with Learnable Graph Augmentation

引用

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

作者： Pu, Xinyan Zhang, Ke Shu, Huazhong Coatrieux, Jean Louis Kong, Youyong Southeast University Ministry of Education Key Laboratory of Computer Network and Information Integration Nanjing China Southeast University Jiangsu Provincial Joint International Research Laboratory of Medical Information Processing School of Computer Science and Engineering Nanjing China Universit de Rennes 1 Ltsi Rennes France Centre de Recherche en Information BioMdicale Sino-Franais Rennes France

ISBN: (纸本)9781728163277

Graph contrastive learning has gained popularity due to its success in self-supervised graph representation learning. Augmented views in contrastive learning greatly determine the quality of the learned representations. Handcrafted data augmentations in previous work require tedious trial-and- errors per dataset, which is time-consuming and resource-intensive. Here, we propose a Graph Contrastive learning framework with Learnable graph Augmentation called GraphCLA. Specifically, learnable graph augmentation trains augmented views by minimizing the mutual information (MI) between the input graphs and their augmented graphs. This paper designs a kernel contrastive loss function based on an end-to-end differentiable graph kernel to learn augmented views. In addition, this paper utilizes a min-max optimization strategy to learn challenging augmented graphs and to learn discriminative representations adversarially. Finally, we compared GraphCLA with state-of-the-art self-supervised learning baselines and experimentally validate the effectiveness of GraphCLA. © 2023 IEEE.

关键词： Contrastive learning data augmentation graph representation learning

来源：评论

学校读者我要写书评

暂无评论

Wavelength detection of FBG temperature sensor based on deep neural networks

Wavelength detection of FBG temperature sensor based on deep...

引用

2021 International Conference on Optical Instruments and technology: Optical Sensors and Applications

作者： Cao, Zihan Zhang, Shengqi Liu, Zhengyong Wu, Yichang Yang, Chengkun Li, Zhaohui Guangdong Provincial Key Laboratory of Optoelectronic Information Processing Chips and Systems School of Electronics and Information Technology Sun Yat-Sen University Guangzhou510275 China Zhuhai519000 China

ISBN: (纸本)9781510655638

Fiber Bragg grating (FBG) sensor has been one of the main research objects in the field of optical sensing due to its advantages of compact size and capability of multiplexing and long-distance measurement. Since its central wavelength shift has a linear relationship with the measurand change, the typical demodulation method is to fit such relationship linearly or nonlinearly, and demodulate the measured parameter based on the change of Bragg wavelength. In this paper, particularly for an FBG temperature sensor, an effective sensing signal measurement method employing deep convolutional neural networks (DCNN) is proposed. This method can extract temperature automatically with a comparable and even more accurate precision. After training process of DCNN, the temperature information can be directly extracted from the experimentally obtained FBG spectra instead of tracking the peak. Since it makes full use of the spectral information rather than only the central wavelength, it overcomes the limit of traditional fitting method and can improve the measurement accuracy of FBG effectively, with an accuracy of 99.38% and mean error of 0.608. The proposed approach to demodulate the FBG sensors is experimentally verified by checking various spectra obtained at different temperatures, and superior accuracy could be achieved. It provides a cost-effective solution for multiplexing of FBG sensors, and is promising for establishing sensing networks to implement smart monitoring. © 2022 SPIE.

关键词： Demodulation

来源：评论

学校读者我要写书评

暂无评论

Data-Driven Digital Adaptive Timing Mismatch Calibration for Sub-Nyquist Wideband Sampling

引用

IEEE Transactions on Cognitive Communications and Networking 2025年

作者： Ma, Yuan Zheng, Yiling Zhang, Xingjian Liao, Bin Shenzhen University State Key Laboratory of Radio Frequency Heterogeneous Integration Guangdong Provincial Key Laboratory of Intelligent Information Processing Shenzhen518060 China Pengcheng Laboratory Shenzhen518055 China Shenzhen University College of Electronic and Information Engineering Shenzhen518060 China Harbin Institute of Technology Guangdong Provincial Key Laboratory of Aerospace Communication and Networking Technology Shenzhen518055 China Shenzhen University Guangdong Provincial Key Laboratory of Intelligent Information Processing Shenzhen518060 China State Key Laboratory of Radio Frequency Heterogeneous Integration Shenzhen518060 China Fudan University Institute of Space Internet Shanghai China

The employment of sub-Nyquist sampling enables the adaptation to the ever-increasing bandwidth demands of wireless communication systems. Multicoset sampling is a nonuniform sub-Nyquist sampling technique that can be realized by using a multi-channel architecture. Nevertheless, the performance of multicoset sampling is significantly affected by timing mismatches among sub-ADCs. Traditional analog calibration scheme mitigates timing mismatch errors by adjusting the sampling clock in the front-end, but its performance is suboptimal due to the difficulty in selecting an appropriate initial step size and the sequential calibration process. In this paper, a data-driven digital adaptive timing mismatch calibration approach is proposed that uses real-time measurement data only to calculate calibration parameters without changing hardware circuits, making it effective for tracking variations in mismatches among multiple channels. Based on the nonlinear relationship between the timing mismatches and the normalized mean squared error of the output spectrum, the proposed data-driven calibration scheme jointly computes calibration parameters among multiple channels in parallel through a series of dynamic linearization data models with a time-varying pseudo-partial derivative parameter estimation procedure, and then adaptively adjusts the sampling matrix in the reconstruction to correct unwanted distortions in the output spectrum. To further improve the calibration performance, particle swarm optimization algorithm is exploited to generate parameter vectors used in the proposed data-driven calibration scheme. Numerical analyses indicate that the proposed data-driven digital calibration scheme can eliminate timing mismatches with fewer calibration iterations and enhanced accuracy. © 2015 IEEE.

关键词： Particle swarm optimization (PSO)

来源：评论

学校读者我要写书评

暂无评论

Document-Level Event Extraction via information Interactivion Based on Event Relation and Argument Correlation 30

Document-Level Event Extraction via Information Interactivio...

引用

Joint 30th International Conference on Computational Linguistics and 14th International Conference on Language Resources and Evaluation, LREC-COLING 2024

作者： Pan, Bangze Li, Yang Wang, Suge Li, Xiaoli Li, Deyu Liao, Jian Zheng, JianXing School of Computer and Information Technology Shanxi University Taiyuan China School of Finance Shanxi University of Finance and Economics Taiyuan China Institute for Infocomm Research A*STAR Singapore Key Laboratory of Computational Intelligence and Chinese Information Processing of Ministry of Education Shanxi University Taiyuan China

ISBN: (纸本)9782493814104

Document-level Event Extraction (DEE) is a vital task in NLP as it seeks to automatically recognize and extract event information from a document. However, current approaches often overlook intricate relationships among events and subtle correlations among arguments within a document, which can significantly impact the effectiveness of event type recognition and the extraction of cross-sentence arguments in DEE task. This paper proposes a novel Correlation Association Interactive Network (CAINet), comprising two key components: event relationship graph and argument correlation graph. In particular, the event relationship graph models the relationship among various events through structural associations among event nodes and sentence nodes, to improve the accuracy of event recognition. On the other hand, the arguments correlation graph models the correlations among arguments by quantifying the strength of association among arguments, to effectively aggregate cross-sentence arguments, contributing to the overall success of DEE. Furthermore, we use the large language model to execute DEE task experiments. Experimental results show the proposed CAINet outperforms existing state-of-the-art models and large language models in terms of F1-score across two benchmark datasets. © 2024 ELRA Language Resource Association: CC BY-NC 4.0.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

Chinese Summary Generation Algorithm Based on Contrastive Attention Mechanism 4

Chinese Summary Generation Algorithm Based on Contrastive At...

引用

4th International Symposium on computer Engineering and Intelligent Communications, ISCEIC 2023

作者： Guo, Liupeng Xiao, Yannan Wen, Yayuan Wen, Peizhi Guilin University of Electronic Technology School of Computer and Information Security Guangxi Key Laboratory of Image and Graphic Intelligent Processing Guilin China Guilin University of Electronic Technology School of Computer and Information Security Guilin China Guangxi Normal University School of Electronic and Information Engineering School of Integrated Circuits Guilin China

ISBN: (纸本)9798350306323

Generative summarization based on the seq2seq model has gained widespread adoption due to the advancements and efficacy of the sequence-to-sequence framework. However, these models encounter challenges in handling out-of-vocabulary words and may produce summaries with factual inaccuracies. This paper addresses these issues by proposing a summarization generation model, MBC, which is built upon the Transformer as the baseline model. Additionally, it incorporates the BERT pre-trained model, pointer generation network, contrastive attention mechanism, and coverage loss. The model employs a pointer generation network to augment its vocabulary coverage capabilities by generating new terms. To enhance the representation of key information from the source text, a contrastive attention mechanism is employed during summary generation. In addition, by introducing coverage loss, the model can reduce repetitive content in the summary. To assess the model's performance, this paper employs ROUGE values as evaluation metrics and conducts comparative experiments with other models using the LCSTS dataset. The experimental results demonstrate that, in comparison with other models, this model is more adept at attending to salient information within the source text and generating summaries of greater accuracy. © 2023 IEEE.

关键词： BERT pre-training model contrastive attention mechanism coverage loss pointer generation network seq2seq model

来源：评论

学校读者我要写书评

暂无评论

Analysis of Schema Formation in Genetic Algorithms: A Review 16th

Analysis of Schema Formation in Genetic Algorithms: A Review

引用

16th International Conference on Genetic and Evolutionary Computing, ICGEC 2024

作者： Zhang, Tiancong Chu, Shu-Chuan Weng, Shaowei Dao, Thi-Kien Nguyen, Trong-The School of Computing and Information Science Fuzhou Institute of Technology Fuzhou350506 China Fujian Provincial Key Laboratory of Big Data Mining and Applications Fujian University of Technology Fuzhou350118 China College of Computer Science and Engineering Shandong University of Science and Technology Qing-Dao266590 China University of Information Technology Ho Chi Minh City700000 Viet Nam

ISBN: (纸本)9789819615346

Genetic algorithms (GAs) are a powerful class of optimization techniques inspired by the principles of natural selection and genetics. One of the theoretical cornerstones of GAs is schema theory, which provides a framework for understanding how building blocks of solutions, known as schemas, are propagated and combined through generations. This review paper aims to provide a comprehensive theoretical analysis of schema formation in genetic algorithms. It delves into the foundational principles of schema theory, including the schema theorem and its implications for the efficiency and behavior of GAs. The paper also explores advanced topics such as schema disruption mechanisms, the impact of multimodal and epistatic fitness landscapes, and the integration of schema theory with hybrid approaches. Additionally, practical implications and real-world applications of schema theory are discussed through case studies and best practices. By elucidating the mechanisms of schema formation and their influence on genetic algorithm performance, this review seeks to offer valuable insights and directions for future research. Ultimately, this theoretical exploration aims to bridge the gap between abstract concepts and practical application, contributing to the advancement of genetic algorithms as robust optimization tools. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Self-Paced Self-Training Based on K-Nearest Neighbors 4

Self-Paced Self-Training Based on K-Nearest Neighbors

引用

4th International Conference on Machine Learning and computer Application, ICMLCA 2023

作者： Ma, Yongzheng Sun, Zhengkai Zhang, Yintong Guan, Hongjiao Qiao, Xinxiao 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 Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (纸本)9798400709449

Self-training is a classical semi-supervised classification method, which iteratively trains labeled samples that are enhanced using unlabeled samples. However, traditional self-training selects pseudo-labeled examples without distinguishing between different classes. Furthermore, wrong pseudo-labeled samples accumulate, leading to an increase in learning bias. In this paper, we propose a self-paced self-training based on K-nearest neighbors (SPST-KNN). SPST-KNN is composed of three main components: sample difficulty calculation, sample type determination, and self-paced selection based on KNN. The types of examples, including safe, boundary, and outlying examples, are determined by KNN. According to the principle of self-paced learning, SPST-KNN preferentially selects easy pseudo-labeled examples in each sample type to be added into the labeled sample set. Experiments and ablation study on 20 real-world datasets have demonstrated the superiority and effectiveness of the proposed SPST-KNN. © 2023 ACM.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

BEVUDA++: Geometric-Aware Unsupervised Domain Adaptation for Multi-View 3D Object Detection

引用

IEEE Transactions on Circuits and Systems for Video technology 2025年第5期35卷 5109-5122页

作者： Zhang, Rongyu Liu, Jiaming Li, Xiaoqi Chi, Xiaowei Wang, Dan Du, Li Du, Yuan Zhang, Shanghang Nanjing University School of Electronic Science and Engineering Nanjing210093 China The Hong Kong Polytechnic University Department of Computing Hung Hom Hong Kong Peking University National Key Laboratory for Multimedia Information Processing School of Computer Science Beijing100871 China The Hong Kong University of Science and Technology Academy of Interdisciplinary Studies Hung Hom Hong Kong

Vision-centric Bird’s Eye View (BEV) perception holds considerable promise for autonomous driving. Recent studies have prioritized efficiency or accuracy enhancements, yet the issue of domain shift has been overlooked, leading to substantial performance degradation upon transfer. We identify major domain gaps in real-world cross-domain scenarios and initiate the first effort to address the Domain Adaptation (DA) challenge in multi-view 3D object detection for BEV perception. Given the complexity of BEV perception approaches with their multiple components, domain shift accumulation across multi-geometric spaces (e.g., 2D, 3D Voxel, BEV) poses a significant challenge for BEV domain adaptation. In this paper, we introduce an innovative geometric-aware teacher-student framework, BEVUDA++, to diminish this issue, comprising a Reliable Depth Teacher (RDT) and a Geometric Consistent Student (GCS) model. Specifically, RDT effectively blends target LiDAR with dependable depth predictions to generate depth-aware information based on uncertainty estimation, enhancing the extraction of Voxel and BEV features that are essential for understanding the target domain. To collaboratively reduce the domain shift, GCS maps features from multiple spaces into a unified geometric embedding space, thereby narrowing the gap in data distribution between the two domains. Additionally, we introduce a novel Uncertainty-guided Exponential Moving Average (UEMA) to further reduce error accumulation due to domain shifts informed by previously obtained uncertainty guidance. To demonstrate the superiority of our proposed method, we execute comprehensive experiments in four cross-domain scenarios, securing state-of-the-art performance in BEV 3D object detection tasks, e.g., 12.9% NDS and 9.5% mAP enhancement on Day-Night adaptation. © 1991-2012 IEEE.

关键词： Teaching

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：