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

Information Fusion 2025年 123卷

作者： Yang, Zhi Lin, Chuan Qin, Yongbin Huang, Ruizhang Chen, Yanping Qin, Jiwei State Key Laboratory of Public Big Data Guizhou University Guiyang Guizhou550025 China Text Computing & Cognitive Intelligence Engineering Research Center of National Education Ministry College of Computer Science and Technology Guizhou University Guiyang Guizhou550025 China College of Information Science and Engineering Xinjiang University Xinjiang Uygur Autonomous Region Urumqi830046 China

Graph contrastive learning (GCL) enhances recommendation accuracy by leveraging self-supervised features to refine node representations from large-scale unlabeled data. Traditional GCL-based recommendation models typically construct contrastive views via graph augmentation (e.g., stochastic node/edge dropout) or embedding-space perturbation, aiming to maximize representation consistency. However, these methods struggle to effectively model and interpret user preferences and consumption intents, limiting explainability and recommendation performance. To address these challenges, we propose JGC-IAGCL (Joint Graph Convolution and Intent-Aware Graph Contrastive Learning), an explainable recommendation framework. JGC-IAGCL integrates joint graph convolution to capture implicit user preferences and employs intent-aware graph contrastive learning to extract explicit user intents from user–item interactions. By fusing these features, our method generates evenly distributed, intent-propensity-aware user/item representations. Theoretical analysis shows that JGC-IAGCL mitigates popularity bias while enhancing the exposure of long-tail items. Extensive experiments on four highly sparse public datasets validate its effectiveness, demonstrating superior recommendation accuracy and improved interpretability. © 2025

关键词： Self-supervised learning

A discriminative semantic ranker for question retrieval

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Cai, Yinqiong Fan, Yixing Guo, Jiafeng Zhang, Ruqing Lan, Yanyan Cheng, Xueqi University of Chinese Academy of Sciences Beijing China CAS Key Lab of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing China Institute for AI Industry Research Tsinghua University Beijing China

Similar question retrieval is a core task in community-based question answering (CQA) services. To balance the effectiveness and efficiency, the question retrieval system is typically implemented as multi-stage rankers: The first-stage ranker aims to recall potentially relevant questions from a large repository, and the latter stages attempt to re-rank the retrieved results. Most existing works on question retrieval mainly focused on the re-ranking stages, leaving the first-stage ranker to some traditional term-based methods. However, term-based methods often suffer from the vocabulary mismatch problem, especially on short texts, which may block the re-rankers from relevant questions at the very beginning. An alternative is to employ embedding-based methods for the first-stage ranker, which compress texts into dense vectors to enhance the semantic matching. However, these methods often lose the discriminative power as term-based methods, thus introduce noise during retrieval and hurt the recall performance. In this work, we aim to tackle the dilemma of the first-stage ranker, and propose a discriminative semantic ranker, namely DenseTrans, for high-recall retrieval. Specifically, DenseTrans is a densely connected Transformer, which learns semantic embeddings for texts based on Transformer layers. Meanwhile, DenseTrans promotes low-level features through dense connections to keep the discriminative power of the learned representations. DenseTrans is inspired by DenseNet in computer vision (CV), but poses a new way to use the dense connectivity which is totally different from its original design purpose. Experimental results over two question retrieval benchmark datasets show that our model can obtain significant gain on recall against strong term-based methods as well as state-of-the-art embedding-based methods. © 2021, CC BY-NC-ND.

关键词： Semantics

Generalized Face Forgery Detection via Adaptive Learning for Pre-trained Vision Transformer

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Luo, Anwei Cai, Rizhao Kong, Chenqi Ju, Yakun Kang, Xiangui Huang, Jiwu Kot, Alex C. The School of Information Technology Jiangxi University of Finance and Economics Nanchang330013 China The School of Computer Science and Engineering Sun Yat-Sen University Guangzhou510006 China Lab. School of Electrical and Electronic Engineering Nanyang Technology University Singapore The Guangdong Key Laboratory of Intelligent Information Processing National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China The China-Singapore International Joint Research Institute Singapore

With the rapid progress of generative models, the current challenge in face forgery detection is how to effectively detect realistic manipulated faces from different unseen domains. Though previous studies show that pre-trained Vision Transformer (ViT) based models can achieve some promising results after fully fine-tuning on the Deepfake dataset, their generalization performances are still unsatisfactory. One possible reason is that fully fine-tuned ViT-based models may disrupt the pre-trained features [1], [2] and overfit to some data-specific patterns [3]. To alleviate this issue, we present a Forgery-aware Adaptive Vision Transformer (FA-ViT) under the adaptive learning paradigm, where the parameters in the pre-trained ViT are kept fixed while the designed adaptive modules are optimized to capture forgery features. Specifically, a global adaptive module is designed to model long-range interactions among input tokens, which takes advantage of self-attention mechanism to mine global forgery clues. To further explore essential local forgery clues, a local adaptive module is proposed to expose local inconsistencies by enhancing the local contextual association. In addition, we introduce a fine-grained adaptive learning module that emphasizes the common compact representation of genuine faces through relationship learning in fine-grained pairs, driving these proposed adaptive modules to be aware of fine-grained forgery-aware information. Extensive experiments demonstrate that our FA-ViT achieves state-of-the-arts results in the cross-dataset evaluation, and enhances the robustness against unseen perturbations. Particularly, FA-ViT achieves 93.83% and 78.32% AUC scores on Celeb-DF and DFDC datasets in the cross-dataset evaluation. The code and trained model have been released at: https://***/LoveSiameseCat/FAViT. Copyright © 2023, The Authors. All rights reserved.

关键词： Contrastive Learning

Harmonized-Multinational qEEG norms (HarMNqEEG)

学校读者我要写书评

暂无评论

NEUROIMAGE 2022年 256卷 119190-119190页

作者： Li, Min Wang, Ying Lopez-Naranjo, Carlos Hu, Shiang Reyes, Ronaldo Cesar Garcia Paz-Linares, Deirel Areces-Gonzalez, Ariosky Hamid, Aini Ismafairus Abd Evans, Alan C. Savostyanov, Alexander N. Calzada-Reyes, Ana Villringer, Arno Tobon-Quintero, Carlos A. Garcia-Agustin, Daysi Yao, Dezhong Dong, Li Aubert-Vazquez, Eduardo Reza, Faruque Razzaq, Fuleah Abdul Omar, Hazim Abdullah, Jafri Malin Galler, Janina R. Ochoa-Gomez, John F. Prichep, Leslie S. Galan-Garcia, Lidice Morales-Chacon, Lilia Valdes-Sosa, Mitchell J. Trondle, Marius Zulkifly, Mohd Faizal Mohd Rahman, Muhammad Riddha Bin Abdul Milakhina, Natalya S. Langer, Nicolas Rudych, Pavel Koenig, Thomas Virues-Alba, Trinidad A. Lei, Xu Bringas-Vega, Maria L. Bosch-Bayard, Jorge F. Valdes-Sosa, Pedro Antonio [a]The Clinical Hospital of Chengdu Brain Science Institute MOE Key Lab for Neuroinformation School of Life Science and Technology University of Electronic Science and Technology of China Chengdu China [b]Cuban Center for Neurocience La Habana Cuba [c]McGill Centre for Integrative Neuroscience Ludmer Centre for Neuroinformatics and Mental Health Montreal Neurological Institute Canada [d]Department of Neurosciences School of Medical Sciences Universiti Sains Malaysia Universiti Sains Malaysia Health Campus Kota Bharu Kelantan 16150 Malaysia [e]Brain and Behaviour Cluster School of Medical Sciences Universiti Sains Malaysia Health Campus Kota Bharu Kelantan 16150 Malaysia [f]Hospital Universiti Sains Malaysia Universiti Sains Malaysia Health Campus Kota Bharu Kelantan 16150 Malaysia [g]Humanitarian Institute Novosibirsk State University Novosibirsk 630090 Russia [h]Laboratory of Psychophysiology of Individual Differences Federal State Budgetary Scientific Institution Scientific Research Institute of Neurosciences and Medicine Novosibirsk 630117 Russia [i]Laboratory of Psychological Genetics at the Institute of Cytology and Genetics Siberian Branch of the Russian Academy of Sciences Novosibirsk 630090 Russia [j]University of Pinar del Río “Hermanos Saiz Montes de Oca” Pinar del Río Cuba [k]Department of Neurology Max Planck Institute for Human Cognitive and Brain Sciences Leipzig Germany [l]Department of Cognitive Neurology University Hospital Leipzig Leipzig Germany [m]Center for Stroke Research Charité-Universitätsmedizin Berlin Berlin Germany [n]Grupo Neuropsicología y Conducta - GRUNECO Faculty of Medicine Universidad de Antioquia Colombia [o]Research Department Institución Prestadora de Servicios de Salud IPS Universitaria Colombia [p]The Cuban center aging longevity and health Havana Cuba [q]Research Unit of NeuroInformation Chinese Academy of Medical Sciences Chengdu 2019RU035 China [r]School of Electrical Engineering Zhengzhou University Zhengzhou 4500

This paper extends frequency domain quantitative electroencephalography (qEEG) methods pursuing higher sensitivity to detect Brain Developmental Disorders. Prior qEEG work lacked integration of cross-spectral information omitting important functional connectivity descriptors. Lack of geographical diversity precluded accounting for site-specific variance, increasing qEEG nuisance variance. We ameliorate these weaknesses. (i) Create lifespan Riemannian multinational qEEG norms for cross-spectral tensors. These norms result from the HarMNqEEG project fostered by the Global Brain Consortium. We calculate the norms with data from 9 countries, 12 devices, and 14 studies, including 1564 subjects. Instead of raw data, only anonymized metadata and EEG cross spectral tensors were shared. After visual and automatic quality control, developmental equations for the mean and standard deviation of qEEG traditional and Riemannian DPs were calculated using additive mixed-effects models. We demonstrate qEEG "batch effects " and provide methods to calculate harmonized z-scores. (ii) We also show that harmonized Riemannian norms produce z-scores with increased diagnostic accuracy predicting brain dysfunction produced by malnutrition in the first year of life and detecting COVID induced brain dysfunction. (iii) We offer open code and data to calculate different individual z-scores from the HarMNqEEG dataset. These results contribute to developing bias-free, low-cost neuroimaging technologies applicable in various health settings.

关键词： Quantitative EEG EEG cross-spectrum Riemannian geometry Batch effects Z-score Harmonization Malnutrition Covid induced brain dysfunction Developmental Brain Chart

Awareness requirement and performance management for adaptive systems: a survey

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Rashid, Tarik A. Hassan, Bryar A. Alsadoon, Abeer Qader, Shko Vimal, S. Chhabra, Amit Yaseen, Zaher Mundher Computer Science and Engineering Department School of Science and Engineering University of Kurdistan Hewler Kurdistan Region Erbil Iraq Department of Information Technology Kurdistan Institution for Strategic Studies and Scientifc Research KRI Sulaymaniyah46001 Iraq School of Computing and Mathematics Charles Sturt University Sydney Australia School of Computing Engineering and Mathematics Western Sydney University Sydney City Campus Sydney Australia Sydney Australia Information Technology Department Kent Institute Australia Sydney Australia Department of Information Technology University College of Goizha Kurdistan Region Sulaimani Iraq Data Analytics Lab Department of Artifcial Intelligence and Data Science Ramco Institute of Technology North Venganallur Village Virudhunagar District Tamilnadu Rajapalayam626 117 India Department of Computer Engineering and Technology Guru Nanak Dev University Amritsar India Civil and Environmental Engineering Department King Fahd University of Petroleum & Minerals Dhahran31621 Saudi Arabia Department of Computer Science College of Science Charmo University KRI Chamchamal46023 Iraq Department of Information Technology Computer Science Institute Sulaimani Polytechnic University KRI Sulaymaniyah46001 Iraq

Self-adaptive software can assess and modify its behavior when the assessment indicates that the program is not performing as intended or when improved functionality or performance is available. Since the mid-1960s, the subject of system adaptivity has been extensively researched, and during the last decade, many application areas and technologies involving self-adaptation have gained prominence. All of these efforts have in common the introduction of self-adaptability through software. Thus, it is essential to investigate systematic software engineering methods to create self-adaptive systems that may be used across different domains. The primary objective of this research is to summarize current advances in awareness requirements for adaptive strategies based on an examination of state-of-the-art methods described in the literature. This paper presents a review of self-adaptive systems in the context of requirement awareness and summarizes the most common methodologies applied. At first glance, it gives a review of the previous surveys and works about self-adaptive systems. Afterward, it classifies the current self-adaptive systems based on six criteria. Then, it presents and evaluates the most common self-adaptive approaches. Lastly, an evaluation among the self-adaptive models is conducted based on four concepts (requirements description, monitoring, relationship, dependency/impact, and tools). © 2023, CC BY-NC-ND.

关键词： Adaptive systems

Fine-grained Scheduling in FPGA-Based Convolutional Neural Networks

学校读者我要写书评

暂无评论

Fine-grained Scheduling in FPGA-Based Convolutional Neural N...

IEEE International Conference on Cloud computing and Big data Analysis (ICCCBDA)

作者： Wei Zhang Xiaofei Liao Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

ISBN: (数字)9781728160245

ISBN: (纸本)9781728160252

FPGA has been considered as a promising solution to accelerate Convolutional Neural Networks (CNNs) for its excellent performance in energy efficiency and programmability. However, prior designs are usually designed for inference only as designers can map pre-trained models to the hardware in a very efficient way. However, those approaches may not be suitable for training CNN models. In this paper, we propose FConv, in which the CPU and FPGA work together in a fine-grained manner. The FPGA accelerator in FConv uses one Winograd-based convolver, which reduces the design complexity and improves performance. We apply double-buffer for output routine to effectively overlap computation and data transfer. We also integrate multiple PEs to improve data parallelism. We propose our analytical model for prediction and use it as a guide in task scheduling. We find the upper limit of performance under the current design based on the analytical model. We evaluate our design on VGG-16 and Densnet-40 on ImageNet and CIFAR-10. We achieve 262.43 GOP/s on the VGG-16 model, which is 2.13× of the performance compared to FFT-based implementation on the same platform. We also achieve at most 4×+ performance improvement compared MKL with 20 threads running on 10 core Intel processors.

关键词： Field programmable gate arrays Computational modeling Training Convolution Acceleration Bandwidth Task analysis

µVulDeePecker: A deep learning-based system for multiclass vulnerability detection

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Zou, Deqing Wang, Sujuan Xu, Shouhuai Li, Zhen Jin, Hai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab Big Data Security Engineering Research Center School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan430074 China Shenzhen Huazhong University of Science and Technology Research Institute Shenzhen518057 China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab Big Data Security Engineering Research Center School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China Department of Computer Science University of Texas at San Antonio San AntonioTX78249 United States

Fine-grained software vulnerability detection is an important and challenging problem. Ideally, a detection system (or detector) not only should be able to detect whether or not a program contains vulnerabilities, but also should be able to pinpoint the type of a vulnerability in question. Existing vulnerability detection methods based on deep learning can detect the presence of vulnerabilities (i.e., addressing the binary classification or detection problem), but cannot pinpoint types of vulnerabilities (i.e., incapable of addressing multiclass classification). In this paper, we propose the first deep learning-based system for multiclass vulnerability detection, dubbed µVulDeePecker. The key insight underlying µVulDeePecker is the concept of code attention, which can capture information that can help pinpoint types of vulnerabilities, even when the samples are small. For this purpose, we create a dataset from scratch and use it to evaluate the effectiveness of µVulDeePecker. Experimental results show that µVulDeePecker is effective for multiclass vulnerability detection and that accommodating control-dependence (other than data-dependence) can lead to higher detection capabilities. Copyright © 2020, The Authors. All rights reserved.

关键词： Deep learning

Context modeling in 3D human pose estimation: A unified perspective

学校读者我要写书评

暂无评论

arXiv 2021年

作者： Ma, Xiaoxuan Su, Jiajun Wang, Chunyu Ci, Hai Wang, Yizhou Dept. of Computer Science Center on Frontiers of Computing Studies Peking University China Center for Data Science Adv. Inst. of Info. Tech. Peking University China Beijing Film Academy China Microsoft Research Asia Deepwise AI Lab

Estimating 3D human pose from a single image suffers from severe ambiguity since multiple 3D joint configurations may have the same 2D projection. The state-of-the-art methods often rely on context modeling methods such as pictorial structure model (PSM) or graph neural network (GNN) to reduce ambiguity. However, there is no study that rigorously compares them side by side. So we first present a general formula for context modeling in which both PSM and GNN are its special cases. By comparing the two methods, we found that the end-to-end training scheme in GNN and the limb length constraints in PSM are two complementary factors to improve results. To combine their advantages, we propose ContextPose based on attention mechanism that allows enforcing soft limb length constraints in a deep network. The approach effectively reduces the chance of getting absurd 3D pose estimates with incorrect limb lengths and achieves state-of-the-art results on two benchmark datasets. More importantly, the introduction of limb length constraints into deep networks enables the approach to achieve much better generalization performance. Copyright © 2021, The Authors. All rights reserved.

关键词： Graph neural networks

Optimal Margin Distribution Machine with Sparsity Inducing Penalty

学校读者我要写书评

暂无评论

Optimal Margin Distribution Machine with Sparsity Inducing P...

International Conference on Big data and Smart computing (BIGCOMP)

作者： Teng Zhang Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

ISBN: (数字)9781728160344

ISBN: (纸本)9781728160351

Recently a promising research direction of statistical learning has been advocated, i.e., the optimal margin distribution learning, with the central idea of optimizing the margin distribution. As the most representative approach of this new learning paradigm, the optimal margin distribution machine (ODM) considers maximizing the margin mean and minimizing the margin variance simultaneously. The standard ODM exploits the ℓ_2-norm penalty, which gives rise to a dense decision boundary. However, in some situations, the model with parsimonious representation is more preferred, due to the redundant noisy features or limited computing resources. In this paper, we propose the sparse optimal margin distribution machine (Sparse ODM), which aims to achieve better generalization performance with moderate model size. For optimization, we extends an efficient coordinate descent method to solve the final problem since the variables are decoupled. In each iteration, we propose a modified Newton method to solve the one-variable sub-problem. Experimental results on both synthetic and real data sets show the superiority of the proposed method.

关键词： Standards Newton method Noise measurement Optimization Support vector machines Computational modeling Training

The DUDFTO Attack: Towards Down-to-UP Timeout Probing and Dynamically Flow Table Overflowing in SDN

学校读者我要写书评

暂无评论

IEEE Transactions on Network and Service Management 2025年

作者： Li, Jiasong Cui, Yunhe Chen, Yi Shen, Guowei Guo, Chun Qian, Qing Guizhou University State Key Laboratory of Public Big Data Engineering Research Center of Text Computing and Cognitive Intelligence Ministry of Education College of Computer Science and Technology Guizhou Provincial Characteristic Key Laboratory of Software Engineering and Information Security Guiyang550000 China Guizhou University of Finance and Economics School of Information Guiyang550000 China

As a new network structure, the decoupling of the control plane and forwarding plane makes Software-Defined Networking (SDN) widely used in large-scale network scenarios. However, the decoupling network architecture also brings new vulnerabilities. The flow table overflow attack is an attack strategy that can overwhelm SDN switches. Nevertheless, the existing flow table overflow attacks may fail in probing timeouts and match fields of flow entries, due to link failure, measurement of the round-trip time (RTT) of different packets, interference of hard-timeout and idle-timeout. Meanwhile, the stealthiness of the existing attacks may also reduce, as these attacks use fixed attack rate. To improve the timeout probing accuracy and the stealthiness of attack, a new flow table overflow attack strategy, DUDFTO, is proposed to accurately probe timeout settings and match fields, then stealthily overflow SDN flow tables. Firstly, it probes the match fields by measuring the one-sided transmission delay of the packets. After that, DUDFTO designs a down-to-up feedback-based timeout probing algorithm to eliminate the issues caused by high RTT, link failure, interference between hard-timeout and idle-timeout. Then, DUDFTO designs a dynamic attack packets sending algorithm to improve its stealthiness. Finally, DUDFTO probes the flow table state to stop sending new attack packets. The evaluation results demonstrate that DUDFTO outperforms the existing attacks in terms of match fields probing ability, timeout probing relative error, number of packet_in and flow_mod messages generated by the attack, rate distribution of packet_in and flow_mod messages generated during the attack, and number of detected attack packets. © 2004-2012 IEEE.

关键词： flow table overflow attack information probing SDN switchs