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

Ambiguity learning and data correlation in multi-cross modal cyber-physical systems for detecting fake information

Cyber-Physical Systems 2025年

作者： Byeon, Haewon AlMahadin, Ghayth Bsoul, Qusay Quraishi, Aadam Soni, Mukesh Khan, Shahi Raza Shabaz, Mohammad Department of AI and Software Inje University Gimhae Korea Republic of Data Science Department College of Information Technology Mutah University Mutah Jordan Department of Cybersecurity College of Computer Sciences and Informatics Amman Arab University Amman Jordan M.D. Research Intervention Treatment Institute HoustonTX United States Dr. D. Y. Patil School of Science & Technology Dr. D. Y. Patil Vidyapeeth Pune Pune India MJMC Centre for Media and Mass Communication Jamia Hamdard Delhi India Model Institute of Engineering and Technology Jammu India

This paper proposes an improved cyber-physical false information detection model based on cross-modal ambiguous learning. This work introduced the IC2 LFD model with an emphasis on ‘text-image’ ambiguity, focusing on the main goal of intelligent multi-cross modal data fake information identification. The experiment revealed that the significance of text and images differs in intelligent multi-cross modal data fake information detection. The effectiveness of the model is verified on the twitter dataset, showing a 6% accuracy improvement compared to the baseline model and a 1.6% performance improvement over detection methods without dynamic weight allocation. © 2025 Informa UK Limited, trading as Taylor & Francis Group.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

Attention-Weighted Federated Deep Reinforcement Learning for Device-to-Device Assisted Heterogeneous Collaborative Edge Caching

Attention-Weighted Federated Deep Reinforcement Learning for...

引用

作者： Wang, Xiaofei Li, Ruibin Wang, Chenyang Li, Xiuhua Taleb, Tarik Leung, Victor C. M. College of Intelligence and Computing Tianjin University Tianjin China Ministry of Education China Department of Communications and Networking School of Electrical Engineering Aalto University Espoo Finland College of Computer Science and Software Engineering Shenzhen University Shenzhen China School of Big Data and Software Engineering Chongqing University Chongqing401331 China Department of Information Technology and Electrical Engineering Oulu University Oulu90570 Finland Department of Computer and Information Security Sejong University Seoul05006 Korea Republic of Department of Electrical and Computer Engineering The University of British Columbia VancouverBCV6T 1Z4 Canada

In order to meet the growing demands for multimedia service access and release the pressure of the core network, edge caching and device-to-device (D2D) communication have been regarded as two promising techniques in next generation mobile networks and beyond. However, most existing related studies lack consideration of effective cooperation and adaptability to the dynamic network environments. In this article, based on the flexible trilateral cooperation among user equipment, edge base stations and a cloud server, we propose a D2D-assisted heterogeneous collaborative edge caching framework by jointly optimizing the node selection and cache replacement in mobile networks. We formulate the joint optimization problem as a Markov decision process, and use a deep Q-learning network to solve the long-term mixed integer linear programming problem. We further design an attention-weighted federated deep reinforcement learning (AWFDRL) model that uses federated learning to improve the training efficiency of the Q-learning network by considering the limited computing and storage capacity, and incorporates an attention mechanism to optimize the aggregation weights to avoid the imbalance of local model quality. We prove the convergence of the corresponding algorithm, and present simulation results to show the effectiveness of the proposed AWFDRL framework in reducing average delay of content access, improving hit rate and offloading traffic. © 1983-2012 IEEE.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Applying hybrid clustering in pulsar candidate sifting with multi-modality for FAST survey

arXiv

引用

arXiv 2023年

作者： You, Zi-Yi Pan, Yun-Rong Ma, Zhi Zhang, Li Xiao, Shuo Zhang, Dan-Dan Dang, Shi-Jun Zhao, Ru-Shuang Wang, Pei Dong, Ai-Jun Jiang, Jia-Tao Leng, Ji-Bing Li, Wei-An Li, Si-Yao School of Physics and Electronic Science Guizhou Normal University Guiyang550025 China College of Big Data and Information Engineering Guizhou University Guiyang550025 China CAS Key Laboratory of FAST National Astronomical Observatories Chinese Academy of Sciences Beijing100101 China Guizhou Provincial Key Laboratory of Radio Astronomy and Data Processing Guizhou Normal University Guiyang550025 China School of Big data and Computer Science Guizhou Normal University Guiyang550025 China Guizhou Software Engineering Research Center Guiyang550000 China Key Laboratory of Information and Computing Guizhou Province Guizhou Normal University Guiyang550001 China

Pulsar search is always the basis of pulsar navigation, gravitational wave detection and other research topics. Currently, the volume of pulsar candidates collected by Five-hundred-meter Aperture Spherical radio Telescope (FAST) shows an explosive growth rate that has brought challenges for its pulsar candidate filtering System. Particularly, the multi-view heterogeneous data and class imbalance between true pulsars and non-pulsar candidates have negative effects on traditional single-modal supervised classification methods. In this study, a multi-modal and semi-supervised learning based pulsar candidate sifting algorithm is presented, which adopts a hybrid ensemble clustering scheme of density-based and partition-based methods combined with a feature-level fusion strategy for input data and a data partition strategy for parallelization. Experiments on both HTRU (The High Time Resolution Universe Survey) 2 and FAST actual observation data demonstrate that the proposed algorithm could excellently identify the pulsars: On HTRU2, the precision and recall rates of its parallel mode reach 0.981 and 0.988. On FAST data, those of its parallel mode reach 0.891 and 0.961, meanwhile, the running time also significantly decrease with the increment of parallel nodes within limits. So, we can get the conclusion that our algorithm could be a feasible idea for large scale pulsar candidate sifting of FAST drift scan observation. Copyright © 2023, The Authors. All rights reserved.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Birth Mode Prediction Using Bagging Ensemble Classifier: A Case Study of Bangladesh

Birth Mode Prediction Using Bagging Ensemble Classifier: A C...

引用

Information and Communication Technology for Sustainable Development (ICICT4SD), International Conference on

作者： Md. Sakib Bin Alam Muhammed J. A. Patwary Maruf Hassan Asian University for Women Bangladesh Big Data Institute College of Computer Science and Software Engineering Shenzhen University China International Islamic University Chittagong Bangladesh

ISBN: (数字)9781665414609

ISBN: (纸本)9781665447522

Maternal mortality and childbirth complications are major delivery issues in most developing countries, especially in rural areas. The proper identification of risks associated with the delivery of an expecting woman at an earlier stage can substantially reduce the mortality rate. A few studies have been conducted on using Machine Learning (ML) techniques for predicting birth mode i.e. caesarean section or normal delivery. The most commonly used methods are Decision Tree (DT), K-Nearest Neighbour (KNN), Naive Bayes (NB) and Support Vector Machine (SVM). In this study we have implemented Bagging Ensemble Classifiers based on these traditional machine learning algorithms, which is a novel approach in the area of birth mode prediction. This paper examines the performance of four ML algorithms, with bagging ensemble classifiers (DT-Bagging, KNN-Bagging, NB-Bagging, SVM-Bagging). The result shows that bagging ensemble models outperformed the traditional models in this domain. Besides, we have identified the association between important factors and caesarean section. This study may later be used to create a decision support system by extracting knowledge from the hidden patterns in data to reduce the rate of caesarean delivery in Bangladesh.

关键词： Support vector machines Machine learning algorithms Prediction algorithms Proposals Medical diagnosis Sustainable development Bagging

来源：评论

学校读者我要写书评

暂无评论

Efficient Shapley Value-based Non-Uniform Pruning of Large Language Models

arXiv

引用

arXiv 2025年

作者： Sun, Chuan Yu, Han Cui, Lizhen Li, Xiaoxiao College of Computing and Data Science Nanyang Technological University Singapore School of Software Shandong University China Department of Electrical and Computer Engineering The University of British Columbia Canada

Pruning large language models (LLMs) is a promising solution for reducing model sizes and computational complexity while preserving performance. Traditional layer-wise pruning methods often adopt a uniform sparsity approach across all layers, which leads to suboptimal performance due to the varying significance of individual transformer layers within the model not being accounted for. To this end, we propose the Shapley Value-based Non-Uniform Pruning (SV-NUP) method for LLMs. This approach quantifies the contribution of each transformer layer to the overall model performance, enabling the assignment of tailored pruning budgets to different layers to retain critical parameters. To further improve efficiency, we design the Sliding Window-based Shapley Value approximation method. It substantially reduces computational overhead compared to exact SV calculation methods. Extensive experiments on various LLMs including LLaMA-v1, LLaMA-v2 and OPT demonstrate the effectiveness of the proposed approach. The results reveal that non-uniform pruning significantly enhances the performance of pruned models. Notably, SV-NUP achieves a reduction in perplexity (PPL) of 18.01% and 19.55% on LLaMA-7B and LLaMA-13B, respectively, compared to SparseGPT at 70% sparsity. © 2025, CC BY.

关键词：

来源：评论

学校读者我要写书评

暂无评论

DVS: Deep Visibility Series and its Application in Construction Cost Index Forecasting

arXiv

引用

arXiv 2021年

作者： Zhan, Tianxiang He, Yuanpeng Li, Hanwen Xiao, Fuyuan College of Computer and Information Science College of Software Southwest University Chongqing400715 China School of Big Data and Software Engineering Chongqing University Chongqing401331 China National Eng. Lab. for Integrated Aero-Space-Ground-Ocean Big Data Application Technology China

Time series forecasting is a hot spot in recent years. Visibility Graph (VG) algorithm is used for time series forecasting in previous research, but the forecasting effect is not as good as deep learning prediction methods such as methods based on Artificial Neural Network (ANN), Convolutional Neural Network (CNN) and Long Short-Term Memory Network (LSTM). The visibility graph generated from specific time series contains abundant network information, but the previous forecasting method did not effectively use the network information to forecast, resulting in relatively large prediction errors. To optimize the forecasting method based on VG, this article proposes the Deep Visibility Series (DVS) module through the bionic design of VG and the expansion of the past research. By applying the bionic design of biological vision to VG, DVS has obtained superior forecasting accuracy. At the same time, this paper applies the DVS forecasting method to the construction cost index forecast, which has practical significance. Copyright © 2021, The Authors. All rights reserved.

关键词： Visibility

来源：评论

学校读者我要写书评

暂无评论

Robust Self-Expression Learning with Adaptive Noise Perception

SSRN

引用

SSRN 2023年

作者： Wang, Yangbo Zhou, Jie Lu, Jianglin Wan, Jun Gao, Can Lin, Qingshui College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China SZU Branch Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen518060 China SMILE Lab Department of ECE College of Engineering Northeastern University Boston02115 United States School of Information and Safety Engineering Zhongnan University of Economics and Law Wuhan430073 China Basic Teaching Department Liaoning Technical University Huludao125105 China

Self-expression learning methods often obtain a coefficient matrix to measure the similarity between pairs of samples. However, directly using the raw data to represent each sample under the self-expression framework may not be ideal, as noise points are inevitably involved in the process of representing clean samples. To address this issue, this work proposes a novel self-expression model called robust Self-Expression learning with adaptive Noise Perception (SENP). SENP decomposes each sample into a clean part and a noisy part, and samples with large self-expression losses can be recognized as the noise points. A reliable coefficient matrix can then be learned by using only the clean points to reconstruct the clean part of each sample. By simultaneously detecting the noisy part of each sample and noise points, and adaptively mitigating their negative impacts, the representative ability of the generated coefficient matrix is improved. Moreover, inspired by the solution of non-negative matrix factorization (NMF), an effective algorithm is formed to optimize SENP. Extensive experiments on well-known benchmark datasets demonstrate the superiority of SENP compared to several state-of-the-art methods. © 2023, The Authors. All rights reserved.

关键词： Non-negative matrix factorization

来源：评论

学校读者我要写书评

暂无评论

Novel Truncated-rank Graph-structured and Tree-guided Sparse Linear Mixed Models for Variable Selection on Genome-wide Association Studies

Novel Truncated-rank Graph-structured and Tree-guided Sparse...

引用

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Liu, Xiang Liu, Xueling Diao, Jing Zheng, Mengyao Li, Jihe Xie, Yongyi Lai, Kang Geng, Xiao Song, Yijun Jiang, Linshan National University of Singapore School of Computing Singapore National University Health System Group Technology Office Singapore Peking University School Hospital of Stomatology National Center for Stomatology National Clinical Research Center for Oral Diseases Department of Preventive Dentistry China Harvard University Harvard T.H. Chan School of Public Health United States Peking University School of Software and Microelectronics China Tongji University Shanghai Skin Disease Hospital Institute of Dermatology School of Medicine China Nanyang Technological University School of Mechanical & Aerospace Engineering Singapore Peking University Third Hospital Engineering Research Center of Bone and Joint Precision Medicine Ministry of Education Orthopaedic Department China Zhejiang University of Finance & Economics Dongfang College China National University of Singapore Institute of Data Science Singapore

ISBN: (纸本)9798350386226

Variable selection for genome-wide association studies is a key focus for bioinformatics researchers in high-performance computing. The rapid growth of biological and biomedical data demands has led to high-dimensional, heterogeneous datasets characterized by non-i.i.d. properties and numerous response variables, often resulting in false negatives or positives in recovered results. Traditional methods, when nalively applied, yield suboptimal performance due to confounding factors. To account for the complex interdependencies in heterogeneous data and enhance the practical outcomes of genome-wide association studies, we introduce two methods, TGsLMM and TTsLMM, which balance effects between response and explanatory variables for subpopulation inference. Our unified framework performs sparse variable selection using graph-structured or tree-guided structures in a low-rank linear mixed model. Additionally, we extend our approach to high-dimensional datasets and adaptively select the covariance structure for genomic data. Extensive experiments on synthetic and three real-world datasets emphasize the robustness and effectiveness of our proposed methods, achieving the highest ROC area compared to baselines and superior results for future potential. © 2024 IEEE.

关键词： Confounding factors genome-wide association study mixed model variable selection

来源：评论

学校读者我要写书评

暂无评论

Joint computation offloading and service caching in Vehicular Edge Computing via a dynamic coevolutionary multiobjective optimization algorithm

引用

Expert Systems with Applications 2025年 284卷

作者： Qiu, Qijie Ye, Yulong Li, Lingjie Xiao, Zhijiao Lin, Qiuzhen Ming, Zhong College of Computer Science and Software Engineering Shenzhen University Shenzhen China School of Computer Science University of Birmingham Birmingham United Kingdom College of Big Data and Internet Shenzhen Technology University Shenzhen China Shenzhen China

With the development of autonomous driving technologies, Vehicular Edge Computing (VEC) has become a powerful computing paradigm that improves vehicle performance and edge resource efficiency by introducing Computation Offloading and Service Caching (CO-SC). However, due to the mobility and dynamics of vehicular networks, the problem of jointly optimizing CO-SC under dynamic VEC systems is extremely challenging, as CO-SC decisions must be adjusted in real-time based on the current location and state of the vehicular network. To alleviate this problem, in this paper, we first formulate the joint CO-SC problem as a dynamic multi-objective optimization problem with the objective of simultaneously minimizing delay, energy consumption, and load balance. Then, this paper proposes a dynamic coevolutionary multi-objective optimization algorithm (DCMOA) to search for optimal CO-SC decisions under dynamic VEC systems. Specifically, we design a multi-population coevolutionary approach following the idea of divide-and-conquer to simplify the complexity of target problem, and then utilize knowledge transfer between subpopulations to coevolve each subpopulation. Besides, we devise an effective dynamic feedback mechanism to achieve timely feedback on environmental changes. Extensive simulations on real-world datasets of telecom base stations and cab trajectories in Shanghai, China show that our proposed method outperforms several state-of-the-art peer methods. © 2025 Elsevier Ltd

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

How to respond to emerging threats of cyberspace security via social engineering? A novel paradigm to solve cyberspace security issues

TechRxiv

引用

TechRxiv 2022年

作者： Lin, Hao Wang, Chun-Dong Gao, Hao-Yu School of Computer Science and Engineering Tianjin University of Technology Tianjin China Tianjin Key Laboratory of Intelligence Computing Novel Software Technology Ministry of Education Tianjin China Engineering Research Center of Learning-Based Intelligent System Ministry of Education Tianjin China College of Data Science and Application Inner Mongolia University of Technology Hohhot China

Cybersecurity researchers always ignore the "people" behind the issues when dealing with cyberspace security issues. The human and technological aspects of cyberspace security must be simultaneously addressed to enable a secure cyber environment. Social engineering is a discipline whose research object is people, and the combination of social engineering and cyberspace security can provide new solution ideas for lots of cyberspace security issues. This paper attempts to answer the question —— "How to solve cyberspace security issues via social engineering?" We briefly review existing frameworks for social engineering attacks and propose a novel, recursive, and iterative framework for social engineering attacks in cyberspace. The existing research achievements of combination of social engineering and cyberspace security were reviewed in the order of cyber personality, hacker psychology, human flesh search, and social engineering defense. To answer this question, we summarized four "guidelines" for using social engineering. Finally, we look ahead, give our thoughts, and discuss answers of the question and future research. It is aimed at getting more researchers of cyberspace security and social science to pay attention to this field. © 2022, CC BY.

关键词： Cybersecurity

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：