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

WCM-WTrA: A Cross-Project Defect Prediction Method Based on Feature Selection and Distance-Weight Transfer Learning

Chinese Journal of Electronics 2022年第2期31卷 354-366页

作者： LEI Tianwei XUE Jingfeng WANG Yong NIU Zequn SHI Zhiwei ZHANG Yu School of Computer Science and Technology Beijing Institute of Technology China Information Technology Security Evaluation Center School of Electrical and Information Engineering Beijing University of Civil Engineering and Architecture

Cross-project defect prediction is a hot topic in the field of defect prediction. How to reduce the difference between projects and make the model have better accuracy is the core problem. This paper starts from two perspectives: feature selection and distance-weight instance transfer. We reduce the differences between projects from the perspective of feature engineering and introduce the transfer learning technology to construct a cross-project defect prediction model WCM-WTrA and multi-source model Multi-WCM-WTrA. We have tested on AEEEM and ReLink datasets, and the results show that our method has an average improvement of 23%compared with TCA+ algorithm on AEEEM datasets,and an average improvement of 5% on ReLink datasets.

关键词： feature engineering cross-project defect prediction software defect prediction project management feature selection learning (artificial intelligence) software maintenance WCM-WTrA distance-weight transfer learning software quality distance-weight instance transfer multisource model MultiWCM-WTrA

来源：评论

学校读者我要写书评

暂无评论

A Reinforcement Learning Approach for Routing in Marine Communication Network of Fishing Vessels

引用

SN computer science 2025年第1期6卷 1-12页

作者： Surendran, Simi Montresor, Alberto Vinodini Ramesh, Maneesha Department of Computer Science and Engineering Amrita School of Computing Amrita Vishwa Vidyapeetham Amritapuri Kollam India Department of Information Engineering and Computer Science University of Trento Trento Italy Amrita Center for Wireless Networks & Applications (AmritaWNA) Amrita School of Engineering Amrita Vishwa Vidyapeetham Amritapuri Kollam India

The lack of affordable communication facilities to the shore remains a fundamental problem for fishermen engaged in deep-sea fishing. The Offshore Communication Network (OCN) is a wireless network of fishing vessels, whose goal is to provide Internet over the ocean. However, the dynamic nature of OCNs characterized by extreme weather, the difficulty of deploying additional infrastructure, wave-induced vessel movements, and high mobility causes significant challenges for traditional routing protocols. This paper proposes OCN-AR, a Q-learning-based adaptive routing strategy for ocean networks. The quality of the learning process relies on the reward function, which has been carefully designed to incorporate the most important features, including real-time forecasts of connectivity quality, path probability, link availability duration, and distance to the destination. The routing performance is evaluated through extensive simulations conducted under diverse conditions, including varying mobility scenarios, transmission rates, vessel rocking intensities, and node densities, and is compared against traditional protocols. The results demonstrate that OCN-AR significantly outperforms existing routing approaches, making it a reliable solution for maritime communication. © The Author(s), under exclusive licence to Springer Nature Singapore Pte Ltd. 2025.

关键词： Fishing vessel network Marine communication network Reinforcement learning Routing protocol

来源：评论

学校读者我要写书评

暂无评论

Leveraging UAV-RIS Reflects to Improve the Security Performance of Wireless Network Systems

IEEE Networking Letters

引用

IEEE Networking Letters 2023年第2期5卷 81-85页

作者： Sun, Jianwei Zhang, Heng Wang, Xin Yang, Ming Zhang, Jian Li, Hongran Gong, Chenglong Jiangsu Ocean University School of Electronic Engineering Lianyungang222000 China Jiangsu Ocean University School of Computer Engineering Lianyungang222000 China Shandong Provincial Key Laboratory of Computer Networks Shandong Computer Science Center Jinan250014 China

In this letter, a novel application method of reconfigurable intelligent surfaces (RIS) is proposed, which installs a RIS on an unmanned aerial vehicle (UAV) rather than fixed to buildings. When the location information of the eavesdropper is unknown, the UAV's rapid deployment and RIS's ability to change the transmission channel are utilized to dynamically optimize the UAV's flight trajectory and RIS's phase shift. The trajectory of the UAV and phase shift of the RIS are optimized to avoid the risk of potential eavesdropping and improve the average downlink secrecy rate of the system. This letter utilizes Q-learning and Deep Q-network (DQN) algorithms to solve the problem. Experiments show that RIS can reduce the flight distance of the UAV on the premise of ensuring security. The scenarios where the two algorithms are applicable are analyzed, and the DQN algorithm is more suitable for the scenarios of large state and action spaces. Also, the experimental results imply that the RIS-assisted UAV improves the average downlink secrecy rate and system security. © 2019 IEEE.

关键词： Signal to noise ratio

来源：评论

学校读者我要写书评

暂无评论

A survey on dynamic graph processing on GPUs: concepts, terminologies and systems

引用

Frontiers of computer science 2024年第4期18卷 1-23页

作者： Hongru GAO Xiaofei LIAO Zhiyuan SHAO Kexin LI Jiajie CHEN 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 TechnologyHuazhong University of Science and TechnologyWuhan 430074China Zhejiang Lab Hangzhou 311121China

Graphs that are used to model real-world entities with vertices and relationships among entities with edges,have proven to be a powerful tool for describing real-world problems in *** most real-world scenarios,entities and their relationships are subject to constant *** that record such changes are called dynamic *** recent years,the widespread application scenarios of dynamic graphs have stimulated extensive research on dynamic graph processing systems that continuously ingest graph updates and produce up-to-date graph analytics *** the scale of dynamic graphs becomes larger,higher performance requirements are demanded to dynamic graph processing *** the massive parallel processing power and high memory bandwidth,GPUs become mainstream vehicles to accelerate dynamic graph processing ***-based dynamic graph processing systems mainly address two challenges:maintaining the graph data when updates occur(i.e.,graph updating)and producing analytics results in time(i.e.,graph computing).In this paper,we survey GPU-based dynamic graph processing systems and review their methods on addressing both graph updating and graph *** comprehensively discuss existing dynamic graph processing systems on GPUs,we first introduce the terminologies of dynamic graph processing and then develop a taxonomy to describe the methods employed for graph updating and graph *** addition,we discuss the challenges and future research directions of dynamic graph processing on GPUs.

关键词： dynamic graphs graph processing graph algorithms GPUs

来源：评论

学校读者我要写书评

暂无评论

Intelligent Production Industrial Internet Platform Based on Multi-Scale Collaborative Analysis

Intelligent Production Industrial Internet Platform Based on...

引用

2024 International Conference on Electronics and Devices, Computational science, ICEDCS 2024

作者： Zhang, Qian Liu, Yijun Huang, Xiaowei Chongqing University of Science and Technology Engineering Research Center Waste Oil Recovery Technology and Equipment Ministry of Education Chongqing Technology and Business University School of Computer Science and Engineering School of Artificial Intelligence Chongqing China Chongqing University of Science and Technology School of Computer Science and Engineering School of Artificial Intelligence Chongqing China

ISBN: (纸本)9798331527624

This platform leverages digital twin technology, focusing on intelligent production as the research subject, aiming to achieve intelligent comprehensive evaluation and supervision of the pork production process. Through digital twin modeling, a three-level performance evaluation model is constructed, encompassing model mapping, behavior mapping, and state mapping, to comprehensively reflect pork production capacity. To address imbalances in the production process, the system introduces an intelligent supervision module, utilizing elastic time windows and dynamic flow matching methods to enhance the robustness of the monitoring system. The entire system includes a big data platform based on 5G transmission technology, an intelligent pig farming model, and a digital twin-based intelligent pork production model, forming a multi-scale collaborative intelligent analysis platform that provides scientific support for improving pork production efficiency. © 2024 IEEE.

关键词： Smart manufacturing

来源：评论

学校读者我要写书评

暂无评论

Diverse Co-saliency Feature Learning for Text-Based Person Retrieval

引用

IEEE Transactions on Information Forensics and Security 2025年 20卷 5465-5477页

作者： You, Shuai Chen, Cuiqun Feng, Yujian Liu, Hai Ji, Yimu Ye, Mang Nanjing University of Posts and Telecommunications (NJUPT) School of Internet of Things Nanjing China Anhui University School of Computer Science and Technology Hefei China South China Normal University school of computer Guangdong China NJUPT School of Computer Science Nanjing China Wuhan University National Engineering Research Center for Multimedia Software Hubei Key Laboratory of Multimedia and Network Communication Engineering Institute of Artificial Intelligence School of Computer Science Wuhan 430072 China

Text-based Person Retrieval (TPR) plays a pivotal role in video surveillance systems for safeguarding public safety. As a fine-grained retrieval task, TPR faces the significant challenge of precisely capturing highly discriminative features across image and text modalities. Existing methods primarily focus on establishing modality-shared feature spaces to bridge cross-modal discrepancies. However, these methods are prone to disturbances from irrelevant information, such as background noises in the visual modality, and often over-emphasize specific local regions while neglecting the capture of diverse discriminative modal features, thereby limiting the robustness of cross-modal matching. In this paper, we introduce a novel framework, termed the Diverse Co-saliency Feature Learning Network (DCFL), which mines the co-saliency information between image and text modalities and enhances the diversity of cross-modal discriminative features while mitigating the interference of noise. Specifically, to construct cross-modal co-saliency features, we devise the Intra-modal Saliency Feature Learning (ISFL) and Cross-modal Saliency Feature Matching (CSFM) modules. ISFL employs a weighted mask mechanism to guide the model in reducing the impact of noise information in both modalities. Complementing ISFL, CSFM establishes consistent relationships between saliency features across modalities, leveraging text descriptions to align pedestrian-relevant visual regions. Furthermore, we propose the Diverse Co-saliency Feature Mining (DCFM) to bolster the diversity of discriminative co-saliency features across both image and text modalities. This module integrates a diversity regularization term, enabling the extraction of varied visual cues and capturing comprehensive features of the target individual. Extensive benchmark experiments demonstrate a substantial superiority of our approach over the state-of-the-art methods. The code will be released publicly. © 2005-2012 IEEE.

关键词： Co-saliency features modeling Diverse Co-saliency features Mining Text-based person retrieval

来源：评论

学校读者我要写书评

暂无评论

Reversible Data Hiding in Shared Images Based on Syndrome Decoding and Homomorphism

引用

IEEE Transactions on Cloud Computing 2023年第3期11卷 3085-3098页

作者： Xiong, Lizhi Han, Xiao Yang, Ching-Nung Zhang, Xinpeng Nanjing University of Information Science and Technology School of Computer Science Jiangsu Nanjing210044 China Nanjing University of Information Science and Technology Engineering Research Center of Digital Forensics Ministry of Education CICAEET Jiangsu Nanjing210044 China National Dong Hwa University Department of Computer Science & Information Engineering Hualien974 Taiwan Fudan University School of Computer Science Shanghai200433 China

Reversible Data Hiding in Encrypted Images (RDHEI) has drawn increasing concern in multimedia cloud computing scenarios. It embeds secret message into the encrypted carrier while preserving the confidentiality of the image. However, most RDHEI schemes have only one hider and one image carrier which are not efficient for the distributed system with multiple participants. Moreover, if the stego-image is lost, the cover image and the embedded data cannot be restored. To solve above issues, this paper proposes Reversible Data Hiding in Shared Images based on syndrome decoding and homomorphism (RDHSI). In RDHSI, the cover image and secret data are distributed using secret sharing. Multiple data hiders embed shared data into the shared images based on the Syndrome Decoding of Hamming codes and the additive homomorphism of the polynomial. On the receiver side, the lossless cover image and secret data are obtained. The reversibility and privacy preserving of the cover image, the complete extraction of secret data, and the fault-tolerance of the proposed schemes are achieved. The experimental results show that PSNR of the marked image is above 54 dB at the embedding rate of 0.43 bpp. In order to improve the payload of secret data, the Modified RDHSI is further proposed. Generally, the proposed schemes are secure, effective and fault-tolerant. © 2013 IEEE.

关键词： Data privacy

来源：评论

学校读者我要写书评

暂无评论

Preference detection of the humanoid robot face based on EEG and eye movement

引用

Neural Computing and Applications 2024年第19期36卷 11603-11621页

作者： Wang, Pengchao Mu, Wei Zhan, Gege Wang, Aiping Song, Zuoting Fang, Tao Zhang, Xueze Wang, Junkongshuai Niu, Lan Bin, Jianxiong Zhang, Lihua Jia, Jie Kang, Xiaoyang Laboratory for Neural Interface and Brain Computer Interface Engineering Research Center of AI and Robotics Ministry of Education Shanghai Engineering Research Center of AI and Robotics MOE Frontiers Center for Brain Science State Key Laboratory of Medical Neurobiology Institute of AI and Robotics Academy for Engineering and Technology Fudan University Shanghai200433 China Ji Hua Laboratory Guangdong Province Foshan528200 China Department of Rehabilitation Medicine Huashan Hospital Fudan University Shanghai200040 China Yiwu Research Institute of Fudan University Zhejiang Yiwu322000 China Research Center for Intelligent Sensing Zhejiang Lab Hangzhou311121 China

The face of a humanoid robot can affect the user experience, and the detection of face preference is particularly important. Preference detection belongs to a branch of emotion recognition that has received much attention from researchers. Most of the previous preference detection studies have been conducted based on a single modality. In this paper, we detect face preferences of humanoid robots based on electroencephalogram (EEG) signals and eye movement signals for single modality, canonical correlation analysis fusion modality, and bimodal deep autoencoder (BDAE) fusion modality, respectively. We validated the theory of frontal asymmetry by analyzing the preference patterns of EEG and found that participants had higher alpha wave energy for preference faces. In addition, hidden preferences extracted by EEG signals were better classified than preferences from participants' subjective feedback, and also, the classification performance of eye movement data was improved. Finally, experimental results showed that BDAE multimodal fusion using frontal alpha and beta power spectral densities and eye movement information as features performed best, with the highest average accuracy of 83.13% for the SVM and 71.09% for the KNN. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2024.

关键词： Electroencephalography

来源：评论

学校读者我要写书评

暂无评论

Vision-Based Categorical Object Pose Estimation and Manipulation 16th

Vision-Based Categorical Object Pose Estimation and Manipul...

引用

16th International Conference on Intelligent robotics and Applications, ICIRA 2023

作者： Meng, Qiwei Liao, Jianfeng Jun, Shao Xu, Nuo Xu, Zeming Sun, Yinan Sun, Yao Zhu, Shiqiang Gu, Jason Song, Wei Center for Intelligent Robotics Zhejiang Lab Hangzhou China Zhejiang Engineering Research Center for Intelligent Robotics Hangzhou China School of Mechanical Engineering Zhejiang University Hangzhou China Department of Electrical and Computer Engineering Dalhousie University Halifax Canada

ISBN: (纸本)9789819964826

Object manipulation and environment interaction are of great significance for intelligent robots, especially service robots working under unstructured household and office scenarios. This paper proposes a novel approach for categorical unseen object grasping and manipulation. Different from recently popular end-to-end reinforcement learning methods, we develop models for geometric primitive abstraction of target objects, and accordingly estimate their pose as well as generate task-orientated grasp points. Such design emphasizes visual perception in guiding robotic manipulation, thereby enhancing model interpretability and reliability during implementation. In addition, we also conduct object grasping experiments both under simulation and real-world settings, which further verify the effectiveness and superiority of our method. © 2023, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Intelligent robots

来源：评论

学校读者我要写书评

暂无评论

A Scalable Algorithm for Fair Influence Maximization with Unbiased Estimator

引用

IEEE Transactions on Knowledge and Data engineering 2025年第7期37卷 3881-3895页

作者： Rui, Xiaobin Wang, Zhixiao Peng, Hao Chen, Wei Yu, Philip S. China University of Mining and Technology School of Computer Science Jiangsu Xuzhou221116 China Mine Digitization Engineering Research Center of the Ministry of Education Jiangsu Xuzhou221116 China Beihang University School of Cyber Science and Technology Beijing100191 China Theory Center of Microsoft Research Asia Beijing100080 China University of Illinois at Chicago Department of Computer Science ChicagoIL60607 United States

This paper studies the fair influence maximization problem with efficient algorithms. In particular, given a graph G, a community structure C consisting of disjoint communities, and a budget k, the problem asks to select a seed set S (||S|| = k) that maximizes the influence spread while narrowing the influence gap between different communities. This problem derives from some significant social scenarios, such as health interventions (e.g. suicide/HIV prevention) where individuals from racial minorities or LGBTQ communities may be disproportionately excluded from the benefits of the intervention. To depict the concept of fairness in the context of influence maximization, researchers have proposed various notions of fairness, where the welfare fairness notion that better balances fairness level and influence spread has shown promising effectiveness. However, the lack of efficient algorithms for optimizing the objective function under welfare fairness restricts its application to networks of only a few hundred nodes. In this paper, we modify the objective function of welfare fairness to maximize the exponentially weighted sum and the logarithmically weighted sum over all communities' influenced fractions (utility). To achieve efficient algorithms with theoretical guarantees, we first introduce two unbiased estimators: one for the fractional power of the arithmetic mean and the other for the logarithm of the arithmetic mean. Then, by adapting the Reverse Influence Sampling (RIS) approach, we convert the optimization problem to a weighted maximum coverage problem. We also analyze the number of reverse reachable sets needed to approximate the fair influence at a high probability. Finally, we present an efficient algorithm that guarantees 1 - 1/e - ϵ (positive objective function) or 1 + 1/e + ϵ (negative objective function) approximation for any small ϵ > 0. Experiments demonstrate that our proposed algorithm could efficiently handle large-scale networks with good performa

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：