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

arXiv 2024年

作者： Tian, Chunwei Zheng, Menghua Li, Bo Zhang, Yanning Zhang, Shichao Zhang, David School of Software Northwestern Polytechnical University Xi’an710129 China National Engineering Laboratory for Integrated Aero-Space-Ground-Ocean Big Data Application Technology Xi’an710129 China School of Electronics and Information Northwestern Polytechnical University Xi’an710129 China School of Computer Science Northwestern Polytechnical University National Engineering Laboratory for Integrated AeroSpace-Ground-Ocean Big Data Application Technology Xi’an710129 China Guangxi Key Lab of Multisource Information Mining & Security College of Computer Science & Engineering Guangxi Normal University Guilin541004 China Shenzhen518172 China Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen518172 China

Popular methods usually use a degradation model in a supervised way to learn a watermark removal model. However, it is true that reference images are difficult to obtain in the real world, as well as collected images by cameras suffer from noise. To overcome these drawbacks, we propose a perceptive self-supervised learning network for noisy image watermark removal (PSLNet) in this paper. PSLNet depends on a parallel network to remove noise and watermarks. The upper network uses task decomposition ideas to remove noise and watermarks in sequence. The lower network utilizes the degradation model idea to simultaneously remove noise and watermarks. Specifically, mentioned paired watermark images are obtained in a self-supervised way, and paired noisy images (i.e., noisy and reference images) are obtained in a supervised way. To enhance the clarity of obtained images, interacting two sub-networks and fusing obtained clean images are used to improve the effects of image watermark removal in terms of structural information and pixel enhancement. Taking into texture information account, a mixed loss uses obtained images and features to achieve a robust model of noisy image watermark removal. Comprehensive experiments show that our proposed method is very effective in comparison with popular convolutional neural networks (CNNs) for noisy image watermark removal. Codes can be obtained at https://***/hellloxiaotian/PSLNet. Copyright © 2024, The Authors. All rights reserved.

关键词： Image denoising

来源：评论

学校读者我要写书评

暂无评论

Downstream-agnostic Adversarial Examples

arXiv

引用

arXiv 2023年

作者： Zhou, Ziqi Hu, Shengshan Zhao, Ruizhi Wang, Qian Zhang, Leo Yu Hou, Junhui Jin, Hai School of Cyber Science and Engineering Huazhong University of Science and Technology China School of Computer Science and Technology Huazhong University of Science and Technology China School of Cyber Science and Engineering Wuhan University China School of Information and Communication Technology Griffith University Australia Department of Computer Science City University of Hong Kong Hong Kong National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security China Hubei Engineering Research Center on Big Data Security China Cluster and Grid Computing Lab

Self-supervised learning usually uses a large amount of unlabeled data to pre-train an encoder which can be used as a general-purpose feature extractor, such that downstream users only need to perform fine-tuning operations to enjoy the benefit of "large model". Despite this promising prospect, the security of pre-trained encoder has not been thoroughly investigated yet, especially when the pre-trained encoder is publicly available for commercial use. In this paper, we propose AdvEncoder, the first framework for generating downstream-agnostic universal adversarial examples based on the pre-trained encoder. AdvEncoder aims to construct a universal adversarial perturbation or patch for a set of natural images that can fool all the downstream tasks inheriting the victim pre-trained encoder. Unlike traditional adversarial example works, the pre-trained encoder only outputs feature vectors rather than classification labels. Therefore, we first exploit the high frequency component information of the image to guide the generation of adversarial examples. Then we design a generative attack framework to construct adversarial perturbations/patches by learning the distribution of the attack surrogate dataset to improve their attack success rates and transferability. Our results show that an attacker can successfully attack downstream tasks without knowing either the pre-training dataset or the downstream dataset. We also tailor four defenses for pre-trained encoders, the results of which further prove the attack ability of AdvEncoder. Our codes are available at: https://github. com/CGCL-codes/AdvEncoder. Copyright © 2023, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Structured probabilistic end-to-end learning from crowds 29

Structured probabilistic end-to-end learning from crowds

引用

29th International Joint Conference on Artificial Intelligence, IJCAI 2020

作者： Chen, Zhijun Wang, Huimin Sun, Hailong Chen, Pengpeng Han, Tao Liu, Xudong Yang, Jie SKLSDE Lab School of Computer Science and Engineering Beihang University China Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University China Web Information Systems Delft University of Technology Netherlands

ISBN: (纸本)9780999241165

End-to-end learning from crowds has recently been introduced as an EM-free approach to training deep neural networks directly from noisy crowdsourced annotations. It models the relationship between true labels and annotations with a specific type of neural layer, termed as the crowd layer, which can be trained using pure backpropagation. Parameters of the crowd layer, however, can hardly be interpreted as annotator reliability, as compared with the more principled probabilistic approach. The lack of probabilistic interpretation further prevents extensions of the approach to account for important factors of annotation processes, e.g., instance difficulty. This paper presents SpeeLFC, a structured probabilistic model that incorporates the constraints of probability axioms for parameters of the crowd layer, which allows to explicitly model annotator reliability while benefiting from the end-to-end training of neural networks. Moreover, we propose SpeeLFC-D, which further takes into account instance difficulty. Extensive validation on real-world datasets shows that our methods improve the state-of-the-art. © 2020 Inst. Sci. inf., Univ. Defence in Belgrade. All rights reserved.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

A Comprehensive Survey on Tiny Machine Learning for Human Behavior Analysis

引用

IEEE Internet of Things Journal 2025年

作者： Lamaakal, Ismail Essahraui, Siham Maleh, Yassine Makkaoui, Khalid El Ouahbi, Ibrahim Bouami, Mouncef Filali El-Latif, Ahmed A. Abd Almousa, May Peng, Jialiang Sultan Moulay Slimane University Laboratory LaSTI ENSAK Khouribga Morocco Prince Sultan University EIAS Data Science Lab College of Computer and Information Sciences Center of Excellence in Quantum and Intelligent Computing Riyadh11586 Saudi Arabia Menoufia University Faculty of Science Department of Mathematics and Computer Science Shebin El-Koom32511 Egypt Princess Nourah Bint Abdulrahman University College of Computer and Information Sciences Information Technology Department Riyadh Saudi Arabia Heilongjiang University School of Data Science and Technology Harbin150080 China Nanyang Technological University School of Computer Science and Engineering Nanyang Avenue Singapore639798 Singapore

The integration of Tiny Machine Learning (TinyML) with Human Behavior Analysis (HBA) represents a significant advancement in the field of Artificial Intelligence (AI), enabling real-time, efficient, and privacy-preserving analysis on resource-constrained devices. This paper provides the first comprehensive survey exploring this integration, presenting a detailed overview of TinyML, including its definitions, key concepts and advantages. The survey proposes a systematic taxonomy of TinyML applications in HBA, categorizing state-of-the-art implementations based on their use cases and specific methodologies. Furthermore, the challenges and limitations of integrating TinyML in HBA are thoroughly discussed, including technical constraints, data quality issues, and ethical considerations. Finally, future research directions and open issues are outlined, emphasizing the potential advancements and emerging trends in this field. This survey serves as a foundational resource, guiding researchers and practitioners in harnessing the capabilities of TinyML to advance HBA. © 2014 IEEE.

关键词： Embedded systems

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

KADEL: Knowledge-Aware Denoising Learning for Commit Message Generation

arXiv

引用

arXiv 2024年

作者： Tao, Wei Zhou, Yucheng Wang, Yanlin Zhang, Hongyu Wang, Haofen Zhang, Wenqiang Shanghai Engineering Research Center of AI and Robotics Academy for Engineering and Technology Fudan University Shanghai China State Key Laboratory of Internet of Things for Smart City Department of Computer and Information Science University of Macau China School of Software Engineering Sun Yat-sen University Guangdong Zhuhai519082 China School of Big Data and Software Engineering Chongqing University Chongqing China College of Design and Innovation Tongji University Shanghai China Engineering Research Center of AI and Robotics Ministry of Education Academy for Engineering and Technology Shanghai Key Lab of Intelligent Information Processing School of Computer Science Fudan University 220 Handan Road Shanghai200433 China

Commit messages are natural language descriptions of code changes, which are important for software evolution such as code understanding and maintenance. However, previous methods are trained on the entire dataset without considering the fact that a portion of commit messages adhere to good practice (i.e., good-practice commits), while the rest do not. On the basis of our empirical study, we discover that training on good-practice commits significantly contributes to the commit message generation. Motivated by this finding, we propose a novel knowledge-aware denoising learning method called KADEL. Considering that good-practice commits constitute only a small proportion of the dataset, we align the remaining training samples with these good-practice commits. To achieve this, we propose a model that learns the commit knowledge by training on good-practice commits. This knowledge model enables supplementing more information for training samples that do not conform to good practice. However, since the supplementary information may contain noise or prediction errors, we propose a dynamic denoising training method. This method composes a distribution-aware confidence function and a dynamic distribution list, which enhances the effectiveness of the training process. Experimental results on the whole MCMD dataset demonstrate that our method overall achieves state-of-the-art performance compared with previous methods. © 2024, CC BY.

关键词： Sampling

来源：评论

学校读者我要写书评

暂无评论

Mean-field games among teams

arXiv

引用

arXiv 2023年

作者： Subramanian, Jayakumar Kumar, Akshat Mahajan, Aditya Media and Data Science Research Lab Digital Experience Cloud Adobe Inc. Uttar Pradesh Noida India School of Computing and Information Systems The Singapore Management University Singapore Department of Electrical and Computer Engineering McGill University Montreal Canada

In this paper, we present a model of a game among teams. Each team consists of a homogeneous population of agents. Agents within a team are cooperative while the teams compete with other teams. The dynamics and the costs are coupled through the empirical distribution (or the mean field) of the state of agents in each team. This mean-field is assumed to be observed by all agents. Agents have asymmetric information (also called a non-classical information structure). We propose a mean-field based refinement of the Team-Nash equilibrium of the game, which we call mean-field Markov perfect equilibrium (MF-MPE). We identify a dynamic programming decomposition to characterize MF-MPE. We then consider the case where each team has a large number of players and present a mean-field approximation which approximates the game among large-population teams as a game among infinite-population teams. We show that MF-MPE of the game among teams of infinite population is easier to compute and is an Ε-approximate MF-MPE of the game among teams of finite population. Copyright © 2023, The Authors. All rights reserved.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

CLAPSep: Leveraging Contrastive Pre-trained Model for Multi-Modal Query-Conditioned Target Sound Extraction

arXiv

引用

arXiv 2024年

作者： Ma, Hao Peng, Zhiyuan Li, Xu Shao, Mingjie Wu, Xixin Liu, Ju School of Information Science and Engineering Shandong University Qingdao China Department of Computer Science North Carolina State University NC United States ARC Lab Tencent PCG China Stanley Ho Big Data Decision Analytics Research Centre The Chinese University of Hong Kong Hong Kong

Universal sound separation (USS) aims to extract arbitrary types of sounds from real-world recordings. This can be achieved by language-queried target sound extraction (TSE), which typically consists of two components: a query network that converts user queries into conditional embeddings, and a separation network that extracts the target sound accordingly. Existing methods commonly train models from scratch. As a consequence, substantial data and computational resources are required to make the randomly initialized model comprehend sound events and perform separation accordingly. In this paper, we propose to integrate pre-trained models into TSE models to address the above issue. To be specific, we tailor and adapt the powerful contrastive language-audio pre-trained model (CLAP) for USS, denoted as CLAPSep. CLAPSep also accepts flexible user inputs, taking both positive and negative user prompts of uni- and/or multi-modalities for target sound extraction. These key features of CLAPSep can not only enhance the extraction performance but also improve the versatility of its application. We provide extensive experiments on 5 diverse datasets to demonstrate the superior performance and zero- and few-shot generalizability of our proposed CLAPSep with fast training convergence, surpassing previous methods by a significant margin. Full codes and some audio examples are released for reproduction and evaluation1 © 2024, CC BY.

关键词： Query languages

来源：评论

学校读者我要写书评

暂无评论

Spatial-Temporal Analysis of Collective Emotional Resonance in China During Global Health Crisis 25

Spatial-Temporal Analysis of Collective Emotional Resonance ...

引用

34th ACM web Conference, WWW 2025

作者： Zhang, Limiao Qi, Xinyang Ma, Haiping Gao, Jie Zhang, Xingyi Hu, Yanqing Jin, Yaochu Information Materials and Intelligent Sensing Laboratory of Anhui Province Anhui University Hefei China Institutes of Physical Science and Information Technology Anhui University Hefei China School of Innovation and Entrepreneurship Shandong University Qingdao China School of Computer Science and Technology Anhui University Hefei China Department of Statistics and Data Science College of Science Southern University of Science and Technology Shenzhen China Trustworthy and General AI Lab School of Engineering Westlake University Hangzhou China

ISBN: (纸本)9798400712746

The 21st century has already witnessed so many outbreaks with pandemic potential, including SARS (2002), H1N1 (2009), MERS (2012), Ebola (2014), Zika virus (2015), and the COVID-19 pandemic (2019). Using 60 million geotagged Sina Weibo tweets covering over 20 million active accounts, we investigate the collective emotional dynamics on social media in the most recent global pandemic, i.e., COVID-19. This research features two highlights: (1) It focuses on the Chinese population located in the initial epicenter of the pandemic. (2) It examines the initial year after the pandemic outbreak, a critical period where emotions were most intense due to the uncertainty and rapid developments related to the crisis. Using cross-disciplinary methods, we reveal a positive connection between online emotional resonance and geographic proximity, demonstrating a direct mapping between virtual network distances and physical spatial embedding. We propose a percolation-based index to measure the nationwide emotional resonance level with which we illustrate the significant economic impact of the global health issue. Finally, we identify a leader-follower pattern in emotional resonance fluctuations based on time-lag emotion correlations, revealing that less active regions play a crucial role in leading and responding to emotional changes. In the face of long COVID and emerging global health crises, our analysis elucidates how collective emotional resonance evolves, providing potential directions for online opinion interventions during global shocks. © 2025 Copyright held by the owner/author(s).

关键词： Economic and social effects

来源：评论

学校读者我要写书评

暂无评论

Sequence-Aware Online Container Scheduling with Reinforcement Learning in Parked Vehicle Edge Computing

引用

IEEE Transactions on Vehicular Technology 2025年

作者： Wu, Jianqiu Guo, Jianxiong Tang, Zhiqing Luo, Chuanwen Wang, Tian Jia, Weijia Beijing Normal-Hong Kong Baptist University Guangdong Key Lab of AI and Multi-Modal Data Processing Department of Computer Science Zhuhai519087 China Beijing Normal University Advanced Institute of Natural Sciences Zhuhai519087 China Beijing Normal-Hong Kong Baptist University Guangdong Key Lab of AI and Multi-Modal Data Processing Zhuhai519087 China Beijing Forestry University School of Information Science and Technology Beijing100083 China Engineering Research Center for Forestry-Oriented Intelligent Information Processing of National Forestry and Grassland Administration Beijing100083 China

Intelligent vehicles, often parked for long periods, are ideally suited to serve as computational nodes to expand the Mobile Edge Computing (MEC) infrastructure, with containerization significantly enhancing the system's load balancing, self-healing, resource isolation, and security. However, fluctuations in task demand and frequent container image downloads during peak hours create high loads on containerized nodes, as multiple mobile devices offload tasks simultaneously, leading to significant processing delays. Many existing studies make the simplified assumption of predefined patterns of task arrivals, which overlooks this issue and makes suboptimal decisions. In this paper, we consider a Parked Vehicles (PVs)-extended MEC scenario, where multiple devices request services on PVs functioning as edge servers, all controlled by a central base station. Task arrivals follow observed patterns based on long-term trends, such as peak and off-peak periods, resembling realistic arrival patterns rather than predefined ones. To optimize task offloading by identifying these patterns, we propose the Sequence-Aware Task Scheduling (SATS) algorithm, which is a policy gradient-based deep reinforcement learning approach that integrates Transformer and LSTM architectures to capture patterns in time-series task arrivals and relationships between nodes in a collaborative and containerized environment, thereby enhancing the efficiency of online task scheduling. The primary objective of SATS is to optimize the task offloading policy and minimize delay and energy consumption for all devices and PVs. Extensive numerical comparisons against baselines demonstrate the effectiveness and advantages of our algorithm. © 1967-2012 IEEE.

关键词： Mobile edge computing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：