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

26th International Conference on information and Communications security, ICICS 2024

作者： Xin, Mingfeng Wen, Hui Deng, Liting Li, Hong Li, Qiang Sun, Limin Beijing Key Laboratory of IOT Information Security Technology Institute of Information Engineering CAS Beijing China School of Cyber Security University of Chinese Academy of Sciences Beijing China School of Computer and Information Technology Beijing Jiaotong University Beijing China

ISBN: (纸本)9789819788002

The rapid growth of the Industrial Internet of Things (IIoT) has brought real-time operating system (RTOS) into focus as major targets for both security analysts and malicious adversaries. Due to the non-standard hardware and diverse software, embedded RTOS devices present unique challenges to security analysts for the accurate analysis of firmware binaries. The diversity in hardware components and tight coupling between firmware and hardware makes it hard to perform dynamic analysis, which must have the ability to execute firmware code in virtualized environments. However, emulating the large expanse of hardware peripherals makes analysts have to frequently modify the emulator for executing various firmware code in different virtualized environments, which greatly limits the ability of analysis. In this work, we explore the problem of firmware re-hosting related to the RTOS. A device driver is developed by developers so that RTOS can be run on their platform. By providing alternative implementations for device drivers, we can make minimal modifications to the firmware that is to be migrated from its original hardware environment into a virtualized one. We show that an approach is capable of offering the ability to emulate various RTOS firmware in an automated manner without modifying existing emulators. Our approach, called static binary-level driver porting, first locates device driver initialization function and identify driver types in the target firmware, then adapts pre-built drivers to the existing emulator hardware. Finally, it replaces the drivers in the firmware with ours by utilizing binary rewriting technique. We demonstrate the practicality of the proposed method on multiple hardware platforms and firmware samples for security analysis. The results show that the approach is flexible enough to emulate firmware for vulnerability assessment and exploit development. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Firmware

来源：评论

学校读者我要写书评

暂无评论

Multi-Label Open Set Recognition 38

Multi-Label Open Set Recognition

引用

38th Conference on Neural information Processing Systems, NeurIPS 2024

作者： Wang, Yi-Bo Hang, Jun-Yi Zhang, Min-Ling School of Computer Science and Engineering Southeast University Nanjing210096 China Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education China

In multi-label learning, each training instance is associated with multiple labels simultaneously. Traditional multi-label learning studies primarily focus on closed set scenario, i.e. the class label set of test data is identical to those used in training phase. Nevertheless, in numerous real-world scenarios, the environment is open and dynamic where unknown labels may emerge gradually during testing. In this paper, the problem of multi-label open set recognition (MLOSR) is investigated, which poses significant challenges in classifying and recognizing instances with unknown labels in multi-label setting. To enable open set multi-label prediction, a novel approach named SLAN is proposed by leveraging sub-labeling information enriched by structural information in the feature space. Accordingly, unknown labels are recognized by differentiating the sub-labeling information from holistic supervision. Experimental results on various datasets validate the effectiveness of the proposed approach in dealing with the MLOSR problem. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

SEAVER: Attention Reallocation for Mitigating Distractions in Language Models for Conditional Semantic Textual Similarity Measurement

SEAVER: Attention Reallocation for Mitigating Distractions i...

引用

2024 Conference on Empirical Methods in Natural Language Processing, EMNLP 2024

作者： Li, Baixuan Fan, Yunlong Gao, Zhiqiang School of Computer Science and Engineering Southeast University Nanjing211189 China Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education China

ISBN: (纸本)9798891761681

Conditional Semantic Textual Similarity (C-STS) introduces specific limiting conditions to the traditional Semantic Textual Similarity (STS) task, posing challenges for STS models. Language models employing cross-encoding demonstrate satisfactory performance in STS, yet their effectiveness significantly diminishes in C-STS. In this work, we argue that the failure is due to the fact that the redundant information in the text distracts language models from the required condition-relevant information. To alleviate this, we propose SElf-Augmentation Via SElf-Reweighting (SEAVER), which, based solely on models' internal attention and without the need for external auxiliary information, adaptively reallocates the model's attention weights by emphasizing the importance of condition-relevant tokens. On the C-STS-2023 test set, SEAVER consistently improves performance of all million-scale fine-tuning baseline models (up to around 3 points), and even surpasses performance of billion-scale few-shot prompted large language models (such as GPT-4). Our code is available at https://***/BaixuanLi/SEAVER. © 2024 Association for Computational Linguistics.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Binary Decomposition: A Problem Transformation Perspective for Open-Set Semi-Supervised Learning 41

Binary Decomposition: A Problem Transformation Perspective f...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Hang, Jun-Yi Zhang, Min-Ling School of Computer Science and Engineering Southeast University Nanjing210096 China Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education China

Semi-supervised learning (SSL) is a classical machine learning paradigm dealing with labeled and unlabeled data. However, it often suffers performance degradation in real-world open-set scenarios, where unlabeled data contains outliers from novel categories that do not appear in labeled data. Existing studies commonly tackle this challenging open-set SSL problem with detect-and-filter strategy, which attempts to purify unlabeled data by detecting and filtering outliers. In this paper, we propose a novel binary decomposition strategy, which refrains from error-prone procedure of outlier detection by directly transforming the original open-set SSL problem into a number of standard binary SSL problems. Accordingly, a concise yet effective approach named BDMatch is presented. BDMatch confronts two attendant issues brought by binary decomposition, i.e. class-imbalance and representation-compromise, with adaptive logit adjustment and label-specific feature learning respectively. Comprehensive experiments on diversified benchmarks clearly validate the superiority of BDMatch as well as the effectiveness of our binary decomposition strategy. Copyright 2024 by the author(s)

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

引用

8th International Congress on Edge Computing, EDGE 2024, Held as Part of the Services Conference Federation, SCF 2024

作者： Tian, Yun Wu, Bin Shi, Jiaoli Zhang, Caicai Xu, Du School of Computer and Big Data Science Jiujiang University Jiujiang332005 China Jiujiang Key Laboratory of Network and Information Security Jiujiang332005 China School of Modern Information Technology Zhejiang Polytechnic University of Mechanical and Electrical Engineering Hangzhou310053 China

ISBN: (纸本)9783031770685

The development of cloud computing and the widespread application of cloud services have made outsourcing services more convenient. The need for individuals and businesses to store and manipulate the graph data they generate is growing rapidly. The unreliability and insecurity of cloud servers make outsourcing graph data a great risk of information leakage. To effectively protect data security, encrypting outsourced data is a useful method. The adjacent vertex query is a very commonly used and fundamental operation, and similarity search is a widely used and powerful tool to improve the scope and functionality of queries. After outsourcing encrypted sparse graph data to cloud servers, it becomes very inconvenient to use and manipulate the data. In this work, we present a scheme to realize the adjacent vertex query supporting similarity search on sparse graph data in cloud environment (SSAQ), which also protects the security of the information. This work uses edit distance and the searchable encryption principle to construct query index, and next implement the similar adjacent vertex query on cloud server. This work provides a formal security analysis, and also gives the experimental comparison and analysis. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： information leakage

来源：评论

学校读者我要写书评

暂无评论

Policy network-Based Dual-Agent Deep Reinforcement Learning for Multi-Resource Task Offloading in Multi-Access Edge Cloud networks

引用

China Communications 2024年第4期21卷 53-73页

作者： Feng Chuan Zhang Xu Han Pengchao Ma Tianchun Gong Xiaoxue School of Communications and Information Engineering Chongqing University of Posts and TelecommunicationsChongqing 400065China Institute of Intelligent Communication and Network Security Chongqing University of Posts and TelecommunicationsChongqing 400065China Key Laboratory of Big Data Intelligent Computing Chongqing University of Posts and TelecommunicationsChongqing 400065China School of Information Engineering Guangdong University of TechnologyGuangzhou 510006China

The Multi-access Edge Cloud(MEC) networks extend cloud computing services and capabilities to the edge of the networks. By bringing computation and storage capabilities closer to end-users and connected devices, MEC networks can support a wide range of applications. MEC networks can also leverage various types of resources, including computation resources, network resources, radio resources,and location-based resources, to provide multidimensional resources for intelligent applications in 5/***, tasks generated by users often consist of multiple subtasks that require different types of resources. It is a challenging problem to offload multiresource task requests to the edge cloud aiming at maximizing benefits due to the heterogeneity of resources provided by devices. To address this issue,we mathematically model the task requests with multiple subtasks. Then, the problem of task offloading of multi-resource task requests is proved to be NP-hard. Furthermore, we propose a novel Dual-Agent Deep Reinforcement Learning algorithm with Node First and Link features(NF_L_DA_DRL) based on the policy network, to optimize the benefits generated by offloading multi-resource task requests in MEC networks. Finally, simulation results show that the proposed algorithm can effectively improve the benefit of task offloading with higher resource utilization compared with baseline algorithms.

关键词： benefit maximization deep reinforcement learning multi-access edge cloud task offloading

来源：评论

学校读者我要写书评

暂无评论

Multi-View Graph Embedding Learning for Image Co-Segmentation and Co-Localization

引用

IEEE Transactions on Circuits and Systems for Video Technology 2024年第6期34卷 4942-4956页

作者： Huang, Aiping Li, Lijian Zhang, Le Niu, Yuzhen Zhao, Tiesong Lin, Chia-Wen Fuzhou University Fujian Key Laboratory for Intelligent Processing and Wireless Transmission of Media Information College of Physics and Information Engineering Fuzhou350108 China Fuzhou University Fujian Key Laboratory of Network Computing and Intelligent Information Processing College of Computer and Data Science Fuzhou350108 China University of Electronic Science and Technology of China School of Information and Communication Engineering Chengdu611731 China Fuzhou University Fujian Key Laboratory for Intelligent Processing and Wireless Transmission of Media Information College of Physics and Information Engineering The Fujian Science and Technology Innovation Laboratory for Optoelectronic Information Fuzhou350108 China Institute of Communications Engineering National Tsing Hua University Department of Electrical Engineering Hsinchu30013 Taiwan

Image co-segmentation and co-localization exploit inter-image information to identify and extract foreground objects with a batch mode. However, they remain challenging when confronted with large object variations or complex backgrounds. This paper proposes a multi-view graph embedding (MV-Gem) learning scheme which integrates diversity, robustness and discernibility of object features to alleviate this phenomenon. To encourage the diversity, the deep co-information containing both low-layer general representations and high-layer semantic information is generated to form a multi-view feature pool for comprehensive co-object description. To enhance the robustness, a multi-view adaptive weighted learning is formulated to fuse the deep co-information for feature complementation. To ensure the discernibility, the graph embedding and sparse constraint are embedded into the fusion formulation for feature selection. The former aims to inherit important structures from multiple views, and the latter further selects important features to restrain irrelevant backgrounds. With these techniques, MV-Gem gradually recovers all co-objects through optimization iterations. Extensive experimental results on real-world datasets demonstrate that MV-Gem is capable of locating and delineating co-objects in an image group. © 1991-2012 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

An Improved Multi-objective Particle Swarm Optimization Algorithm with Reduced Initial Search Space 21st

An Improved Multi-objective Particle Swarm Optimization Algo...

引用

21st Pacific Rim International Conference on Artificial Intelligence, PRICAI 2024

作者： Zhiguang, Chu Yingchen, Fan Xiaolei, Zhang Ruyan, Zhang Xing, Zhang School of Electronics and Information Engineering Liaoning University of Technology Jinzhou121000 China Key Laboratory of Security for Network and Data in Industrial Internet of Liaoning Province Jinzhou121000 China

ISBN: (纸本)9789819601240

As data dimensions continue to increase, the challenges of data storage become more severe. While feature selection can reduce the complexity of high-dimensional data, existing methods are prone to local optima and high computational costs. To address these issues, this paper proposes a hybrid feature selection method based on MOPSO (Multi-Objective Particle Swarm Optimization). This method first uses a filter approach to narrow the search space, then employs a particle swarm algorithm to generate particles, incorporating mutation, crossover, and selection strategies during particle updates to enhance their search capabilities. Additionally, an archive set is established, utilizing grid-based and density-based methods during the update process to avoid local optima. Finally, the proposed method is compared with two single-objective optimization methods and two multi-objective optimization methods on multiple datasets. Experimental results demonstrate that the proposed method significantly reduces classification error rates and effectively reduces the number of features, providing an efficient solution for feature selection in high-dimensional data and addressing the challenges in high-dimensional data analysis. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Particle swarm optimization (PSO)

来源：评论

学校读者我要写书评

暂无评论

Wi-SFDAGR: WiFi-Based Cross-Domain Gesture Recognition via Source-Free Domain Adaptation

引用

IEEE Internet of Things Journal 2025年第13期12卷 24159-24173页

作者： Yan, Huan Zhang, Xiang Huang, Jinyang Feng, Yuanhao Li, Meng Wang, Anzhi Ou, Weihua Wang, Hongbing Liu, Zhi Guizhou Normal University School of Big Data and Computer Science Guiyang550025 China University of Science and Technology of China CAS Key Laboratory of Electromagnetic Space Information Hefei230026 China Hefei University of Technology School of Computer and Information Hefei230601 China The University of Electro-Communications Department of Computer and Network Engineering Tokyo1828585 Japan

WiFi Channel State information (CSI)-based gesture recognition offers unique advantages, including cost-effectiveness and enhanced privacy protection, and has garnered significant attention in recent years. However, existing WiFi-based gesture recognition solutions exhibit poor generalization ability when deployed in new environment, orientation, or location. Although some methods combine labeled source domain and unlabeled target domain to learn domain-independent features, factors such as data privacy protection hinder access to source data during practical environment adaptation. Consequently, we consider realistic scenario where source data is unavailable during adaptation of unlabeled test data, and instead, a trained source domain model is used. In this paper, we propose Wi-SFDAGR, a WiFi-based Source-free Domain Adaptation Gesture Recognition framework. Specifically, we treat cross-domain as an unsupervised clustering problem, aiming to ensure that features within local neighborhoods exhibit similar prediction results while those farther apart display different prediction outcomes in the feature space. We theoretically analyze the effect of enhanced prediction consistency between neighbor points extracted from gestures on generalization error. Furthermore, we employ an attraction-dispersion network to strengthen prediction consistency among closely located features in the feature space while reducing it for distantly located features. To mitigate noise introduced during nearest neighbor sample selection in the feature space (where predictions may not align with the input sample’s prediction), we progressively improve nearby sample feature aggregation by estimating uncertainty to reweight local neighborhood predictions. Finally, extensive experiments are conducted on the Widar 3.0 and XRF55 datasets and the results show our proposed framework outperforms most cross-domain methods. © 2014 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

Reversible Data Hiding With Secret Encrypted Image Sharing and Adaptive Coding

引用

IEEE Internet of Things Journal 2025年第13期12卷 23933-23945页

作者： Fang, Guangtian Wang, Feng Zhao, Chenbin Qin, Chuan Chang, Ching-Chun Chang, Chin-Chen Fujian University of Technology College of Computer Science and Mathematics Fuzhou350118 China Fujian University of Technology College of Computer Science and Mathematics Key Laboratory of Big Data Mining and Applications Fuzhou350118 China Monash University Faculty of IT Department of Software Systems and Cybersecurity VIC3800 Australia Ministry of Education School of Cyber Science and Engineering Key Laboratory of Aerospace Information Security and Trusted Computing Wuhan430072 China University of Shanghai for Science and Technology School of Optical-Electrical and Computer Engineering Shanghai200093 China Feng Chia University Information and Communication Security Research Center Taichuang 40724 Taiwan Feng Chia University Department of Information Engineering and Computer Science Taichung40724 Taiwan

To ensure the security of image information and facilitate efficient management in the cloud, the utilization of reversible data hiding in encrypted images (RDHEI) has emerged as pivotal. However, most existing RDHEI schemes suffer from lower security and limited embedding capacity. To tackle these challenges, we propose a reversible data hiding with secret encrypted image sharing and adaptive coding scheme. Specifically, in the encryption phase, we introduce an improved secret sharing (SS) encryption method based on the chinese remainder theorem for polynomials (CRTP). This method not only improves the security of encrypted images but also vacates a larger room for embedding. In the embedding phase, we introduce an adaptive coding embedding approach using XOR preservation (XORP) and huffman coding, which provides high embedding capacity. Experimental results and security analysis demonstrate that our proposed encryption method achieves optimal values in security indicators for encrypted images, such as information entropy, histograms, NPCR and UACI. The proposed embedding method is superior to some state-of-the-art schemes in terms of embedding capacity. Furthermore, in datasets BOSSBase and BOWS2, the average embedding rates of the proposed embedding approach can reach 2.1745 bpp and 2.0656 bpp, respectively. © 2025 IEEE.

关键词： Cryptography Encryption security Data mining Adaptive coding Correlation Cloud computing Polynomials Image coding Streaming media

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：