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

International Conference on Networking and Network Applications (NaNA)

作者： Hong Xia Jing Xu Qingyi Dong Hui Jia Yanping Chen Xi’an Key Laboratory of Big Data and Intelligent Computing Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing School of Computer Science and Technology Xi’an University of Posts and Telecommunications Xi’an Shaanxi China

ISBN: (数字)9798350376777

ISBN: (纸本)9798350376784

In the Mobile Edge computing (MEC) environment, the prediction efficiency is low when user recommendation is based on Quality of Service (QoS) data due to network environment and other factors. Traditional methods use Collaborative Filtering (CF) or tensor decomposition methods to mine the relationship between historical QoS data for prediction, but there are problems with prediction accuracy and efficiency. Given this, this paper proposes an efficient QoS data prediction method (CTT) combining tensor kernel paradigm-tensor decomposition. The method first introduces the tensor kernel norm to approximate the tensor rank function to better capture the spatio-temporal correlation of real QoS data; Second, tensor decomposition is combined to address inefficiencies. Experimental results on the public QoS dataset WS-Dream show that the method significantly improves the runtime while guaranteeing prediction accuracy and applies to scenarios with different data missing densities.

关键词： Tensors Accuracy Runtime Multi-access edge computing Computational modeling Quality of service Predictive models

来源：评论

学校读者我要写书评

暂无评论

HairDiffusion: Vivid Multi-Colored Hair Editing via Latent Diffusion 38

HairDiffusion: Vivid Multi-Colored Hair Editing via Latent D...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Zeng, Yu Zhang, Yang Liu, Jiachen Shen, Linlin Deng, Kaijun He, Weizhao Wang, Jinbao Computer Vision Institute School of Computer Science & Software Engineering Shenzhen University China Shenzhen Institute of Artificial Intelligence and Robotics for Society China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Guangdong Provincial Key Laboratory of Intelligent Information Processing China

Hair editing is a critical image synthesis task that aims to edit hair color and hairstyle using text descriptions or reference images, while preserving irrelevant attributes (e.g., identity, background, cloth). Many existing methods are based on StyleGAN to address this task. However, due to the limited spatial distribution of StyleGAN, it struggles with multiple hair color editing and facial preservation. Considering the advancements in diffusion models, we utilize Latent Diffusion Models (LDMs) for hairstyle editing. Our approach introduces Multi-stage Hairstyle Blend (MHB), effectively separating control of hair color and hairstyle in diffusion latent space. Additionally, we train a warping module to align the hair color with the target region. To further enhance multi-color hairstyle editing, we fine-tuned a CLIP model using a multi-color hairstyle dataset. Our method not only tackles the complexity of multi-color hairstyles but also addresses the challenge of preserving original colors during diffusion editing. Extensive experiments showcase the superiority of our method in editing multi-color hairstyles while preserving facial attributes given textual descriptions and reference images. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Task Prioritization in Multiagent Environments: A Novel Approach Using Nash Q-Learning

引用

IEEE Transactions on Consumer Electronics 2025年

作者： Li, Kexin Hu, Yu Wang, Jielei Li, Lin Zhang, Shuyuan Luo, Guangchun Laboratory of Intelligent Collaborative Computing University of Electronic Science and Technology of China China Trusted Cloud Computing and Big Data Key Laboratory of Sichuan Province Chengdu611731 China College of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu611731 China

—With the rapid proliferation of smartphones and various terminal devices, edge computing has gained increasing importance in overcoming computational limitations and enhancing service quality through task offloading. However, most existing approaches handle tasks on a first-come, first-served basis, neglecting task prioritization, which is critical in real-world scenarios where tasks have different levels of urgency and resource requirements. This paper addresses the challenge of effective task prioritization in multi-agent task offloading by proposing a Nash Q-learning-based strategy. Our methodology involves optimizing task allocation decisions using Nash Q-learning to integrate Nash equilibrium principles, thereby enhancing adaptability and dynamic decision-making capabilities within a multi-agent environment. The proposed algorithm is evaluated through extensive simulations, comparing total delay, resource utilization, and task success rates across various task offloading strategies. The results demonstrate that our Nash Q-learning approach outperforms conventional techniques by dramatically lowering overall latency, optimizing resource allocation, and maintaining high task success rates. This work demonstrates the efficacy of Nash Q-learning for dynamically setting priorities for tasks in multi-agent edge computing environments, providing a robust framework for effective resource management and collaborative task completion. And also highlight the potential of Nash Q-learning in advancing intelligent task management in edge computing, suggesting its applicability in real-world, resource-constrained environments. © 2025 IEEE. All rights reserved,

关键词： Computation offloading

来源：评论

学校读者我要写书评

暂无评论

Few-Shot Class-Incremental Semantic Segmentation via Pseudo-Labeling and Knowledge Distillation 4

Few-Shot Class-Incremental Semantic Segmentation via Pseudo-...

引用

4th International Conference on Information science, Parallel and Distributed Systems, ISPDS 2023

作者： Jiang, Chengjia Wang, Tao Li, Sien Wang, Jinyang Wang, Shirui Antoniou, Antonios Minjiang University Fujian Provincial Key Laboratory of Information Processing and Intelligent Control Fuzhou China Fujian Education Institutions Wuyi University The Key Laboratory of Cognitive Computing and Intelligent Information Processing Wuyishan China College of Computer and Data Science Fuzhou University Fuzhou China European University Cyprus Department of Computer Science and Engineering Nicosia Cyprus

ISBN: (纸本)9798350337181

We address the problem of learning new classes for semantic segmentation models from few examples, which is challenging because of the following two reasons. Firstly, it is difficult to learn from limited novel data to capture the underlying class distribution. Secondly, it is challenging to retain knowledge for existing classes and to avoid catastrophic forgetting. For learning from limited data, we propose a pseudo-labeling strategy to augment the few-shot training annotations in order to learn novel classes more effectively. Given only one or a few images labeled with the novel classes and a much larger set of unlabeled images, we transfer the knowledge from labeled images to unlabeled images with a coarse-to-fine pseudo-labeling approach in two steps. Specifically, we first match each labeled image to its nearest neighbors in the unlabeled image set at the scene level, in order to obtain images with a similar scene layout. This is followed by obtaining pseudo-labels within this neighborhood by applying classifiers learned on the few-shot annotations. In addition, we use knowledge distillation on both labeled and unlabeled data to retain knowledge on existing classes. We integrate the above steps into a single convolutional neural network with a unified learning objective. Extensive experiments on the Cityscapes and KITTI datasets validate the efficacy of the proposed approach in the self-driving domain. Code is available from https://***/ChasonJiang/FSCILSS. © 2023 IEEE.

关键词： Distillation

来源：评论

学校读者我要写书评

暂无评论

GLSNet: A Global Guided Local Feature Stepwise Aggregation Network for polyp segmentation

引用

Biomedical Signal Processing and Control 2024年 87卷

作者： Pan, Xiaoying Ma, Chenyang Mu, Yaya Bi, Manrong Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi‘an710121 China Xi'an Key Laboratory of Big Data and Intelligent Computing Xi‘an710121 China School of Computer Science & Technology Xi'an University of Post & Telecommunications Xi‘an710121 China

Accurate polyp segmentation is of great significance for the prevention and diagnosis of early colon cancer. Transformer-based image segmentation models have been proposed for polyp segmentation with good results, however, these methods do not sufficiently consider the negative impact of background noise in different levels of features, resulting in the loss of local details. To alleviate this problem, we propose a GLSNet (A Global Guided Local Feature Stepwise Aggregation Network for polyp segmentation) network, including a spatial feature enhancement (SFE) module, a globally guided local feature enhancement (GLFE) module, and a feature stepwise aggregation (FSA) module. SFE can enhance the spatial feature representation of polyps to better capture the polyp information in the features. GLFE uses high-level features to filter noise in low-level features to capture polyp information hidden in shallow features;FSA fuses the semantic and positional information of polyps across scales to obtain the final segmentation results. Qualitative and quantitative experiments were conducted on 7 benchmark datasets, and the experimental results demonstrated that GLSNet outperforms other existing methods and has stronger generalization performance. In particular, we achieved a mean Dice of 92.9% on the large-scale Kvasir dataset, and mean Dice of 81.3% and 81.6% on CVC-ColonDB and ETIS, respectively, which are significantly higher than those of the competing methods. © 2023

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Accumulative Time Based Ranking Method to Reputation Evaluation in Information Networks

引用

Journal of Computer science & Technology 2022年第4期37卷 960-974页

作者： Hao Liao Qi-Xin Liu Ze-Cheng Huang Ke-Zhong Lu Chi Ho Yeung Yi-Cheng Zhang National Engineering Laboratory on Big Data System Computing Technology College of Computer Science and SoftwareEngineeringShenzhen UniversityShenzhen 518060China Guangdong Province Key Laboratory of Popular High Performance Computers Shenzhen UniversityShenzhen 518060China Guangdong Province Engineering Center of China-Made High Performance Data Computing System College of ComputerScience and Software EngineeringShenzhen UniversityShenzhen 518060China Institute of Big Data Intelligent Management and Decision Shenzhen UniversityShenzhen 518060China Department of Science and Environmental Studies The Education University of Hong KongHong Kong 999077China Department of Physics University of FribourgFribourg 1700Switzerland

Due to over-abundant information on the Web, information filtering becomes a key task for online users to obtain relevant suggestions and how to extract the most related item is always a key topic for researchers in various fields. In this paper, we adopt tools used to analyze complex networks to evaluate user reputation and item quality. In our proposed Accumulative Time Based Ranking (ATR) algorithm, we take into account the growth record of the network to identify the evolution of the reputation of users and the quality of items, by incorporating two behavior weighting factors which can capture the hidden facts on reputation and quality dynamics for each user and item respectively. Our proposed ATR algorithm mainly combines the iterative approach to rank user reputation and item quality with temporal dependence compared with other reputation evaluation methods. We show that our algorithm outperforms other benchmark ranking algorithms in terms of precision and robustness on empirical datasets from various online retailers and the citation datasets among research publications. Therefore, our proposed method has the capability to effectively evaluate user reputation and item quality.

关键词： temporal network behavior dynamics reputation evaluation ranking algorithm

来源：评论

学校读者我要写书评

暂无评论

Using Rough Sets to Improve the High-dimensional data Anomaly Detection Method Based on Extended Isolation Forest 26

Using Rough Sets to Improve the High-dimensional Data Anomal...

引用

26th International Conference on Computer Supported Cooperative Work in Design, CSCWD 2023

作者： Liu, Hanlin Zhou, Jiantao Li, Hua Inner Mongolia University College of Computer Science Hohhot China Natl. Loc. Jt. Eng. Research Center of Intelligent Information Processing Technology for Mongolian Engineering Research Center of Ecological Big Data Ministry of Education Inner Mongolia Engineering Laboratory for Cloud Computing and Service Software Inner Mongolia Key Laboratory of Social Computing and Data Processing Inner Mongolia Key Laboratory of Discipline Inspection and Supervision Big Data Inner Mongolia Engineering Laboratory for Big Data Analysis Technology Hohhot China

ISBN: (纸本)9798350331684

Anomaly detection refers to the identification of data objects that deviate from the general data distribution. One of the important challenges in anomaly detection is handling high-dimensional data, especially when it contains a large number of redundant attributes. Although traditional Isolation Forest (iForest) and Extended Isolation Forest (EIF) have performed well in anomaly detection, the detection accuracy is still extremely influenced by redundant attributes. In this paper, we propose a two-tier architecture named RS-EIF, to alleviate the negative impact of redundant attributes. Specifically, the RS-EIF combines the rough set theory and EIF algorithm and provides an effective basis for the EIF-based anomaly detection method by removing redundant attributes with rough set theory. Experimental results show that the RS-EIF algorithm performs better than the iForest and EIF algorithms in terms of anomaly detection rate, and the results of the combination of rough set theory and EIF are more prominent compared to the other combination methods. © 2023 IEEE.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

Contrastive Learning for Robust Android Malware Familial Classification

引用

IEEE Transactions on Dependable and Secure computing 2022年 1-14页

作者： Wu, Yueming Dou, Shihan Zou, Deqing Yang, Wei Qiang, Weizhong Jin, Hai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China Shanghai Key Laboratory of Intelligent Information Processing School of Computer Science Fudan University Shanghai China University of Texas at Dallas Dallas USA 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

Due to its open-source nature, Android operating system has been the main target of attackers to exploit. Malware creators always perform different code obfuscations on their apps to hide malicious activities. Features extracted from these obfuscated samples through program analysis contain many useless and disguised features, which leads to many false negatives. To address the issue, in this paper, we demonstrate that obfuscation-resilient malware family analysis can be achieved through contrastive learning. The key insight behind our analysis is that contrastive learning can be used to reduce the difference introduced by obfuscation while amplifying the difference between malware and other types of malware. Based on the proposed analysis, we design a system that can achieve robust and interpretable classification of Android malware. To achieve robust classification, we perform contrastive learning on malware samples to learn an encoder that can automatically extract robust features from malware samples. To achieve interpretable classification, we transform the function call graph of a sample into an image by centrality analysis. Then the corresponding heatmaps can be obtained by visualization techniques. These heatmaps can help users understand why the malware is classified as this family. We implement IFDroid and perform extensive evaluations on two datasets. Experimental results show that IFDroid is superior to state-of-the-art Android malware familial classification systems. Moreover, IFDroid is capable of maintaining a 98.4% F1 on classifying 69,421 obfuscated malware samples. IEEE

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Text Matching application for integration between industry and education 14

Text Matching application for integration between industry a...

引用

14th International Conference on Measuring Technology and Mechatronics Automation, ICMTMA 2022

作者： Luo, Yuxuan Li, Xiaoge School of Computer Science and Technology Xi'an University of Posts and Telecommunications Shaanxi China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Shaanxi Xi'an710121 China Xi'an Key Laboratory of Big Data and Intelligent Computing Shaanxi Xi'an710121 China

ISBN: (纸本)9781665499781

A new talent training mode of collaboration between industry and education was proposed, which aims to reduce the gaps of talent definition between enterprise demand and college education. We formulates scenario as a text matching task of similarity between courses details and job position information, developed a ERNIE+DPCNN based model for the task. The model has been benchmarked on LCQMC dataset, the results show that it achieves the art-of state performance of Acc 0.8809, Recall 0.8745, and FX score 0.8739, We conducted many experiments about the text similarity calculation between domains of industry and educations. The experiment results show our approach has much potential to optimize the curriculum system while applying in this field. © 2022 IEEE

关键词： Industries Training Mechatronics Automation Collaboration Benchmark testing Task analysis

来源：评论

学校读者我要写书评

暂无评论

Review on application progress of federated learning model and security hazard protection

引用

Digital Communications and Networks 2023年第1期9卷 146-158页

作者： Aimin Yang Zezhong Ma Chunying Zhang Yang Han Zhibin Hu Wei Zhang Xiangdong Huang Yafeng Wu Hebei Engineering Research Center for the Intelligentization of Iron Ore Optimization and Ironmaking Raw Materials Preparation Processes North China University of Science and TechnologyTangshanHebeiChina Hebei Key Laboratory of Data Science and Application North China University of Science and TechnologyTangshanHebeiChina The Key Laboratory of Engineering Computing in Tangshan City North China University of Science and TechnologyTangshanHebeiChina Tangshan Intelligent Industry and Image Processing Technology Innovation Center North China University of Science and TechnologyTangshanHebeiChina College of Science North China University of Science and TechnologyTangshanHebeiChina College of Artificial Intelligence North China University of Science and TechnologyTangshanHebeiChina

Federated learning is a new type of distributed learning framework that allows multiple participants to share training results without revealing their data *** data privacy becomes more important,it becomes difficult to collect data from multiple data owners to make machine learning predictions due to the lack of data *** is forced to be stored independently between companies,creating“data silos”.With the goal of safeguarding data privacy and security,the federated learning framework greatly expands the amount of training data,effectively improving the shortcomings of traditional machine learning and deep learning,and bringing AI algorithms closer to our *** the context of the current international data security issues,federated learning is developing rapidly and has gradually moved from the theoretical to the applied *** paper first introduces the federated learning framework,analyzes its advantages,reviews the results of federated learning applications in industries such as communication and healthcare,then analyzes the pitfalls of federated learning and discusses the security issues that should be considered in applications,and finally looks into the future of federated learning and the application layer.

关键词： data silos Machine learning Federated learning Privacy protection Learning framework

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：