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

DetecVFuzz: Enhancing Security in Consumer Electronic Devices Through Scalable Vulnerability Testing of Virtual Devices

引用

IEEE Transactions on Consumer Electronics 2025年

作者： Xiao, Xi Guo, Yongjian Jolfaei, Alireza Chen, Chuan Haghighi, Mohammad Sayad Wen, Sheng Lin, Yuanyi Tsinghua University Shenzhen International Graduate School Shenzhen China Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education China Peng Cheng Laboratory Guangdong Shenzhen China Flinders University College of Science and Engineering SA5042 Australia Shandong Computer Science Center Key Laboratory of Computing Power Network and Information Security Ministry of Education China Qilu University of Technology Shandong Academy of Sciences National Supercomputer Center in Jinan Jinan China Swinburne University of Technology School of Science Computing and Engineering Technologies MelbourneVIC3122 Australia

The interconnection facilitated by consumer electronics has led to the creation of a complex network of devices. Testing efficiency of such consumer electronic devices can be improved through hardware emulation. QEMU is a classical emulator for simulation and testing. Fuzzing is a promising solution to test the security of such devices, which has become pivotal in identifying device vulnerability. However, Qtest libfuzzer, the QEMU native fuzzer, requires manual writing of stub code, which makes conducting the fuzzing process difficult and yields poor performance. To address these challenges in virtual device security analysis, we propose DetecVFuzz, a novel automatic fuzzing framework based on QEMU-Qtest, aiming to find vulnerabilities in virtual PCI devices, including USB, audio, network, etc. We inject mutated inputs into nested data structures as parameters of memory-related APIs to ensure the stable operation of VM procedures. We implemented DetecVFuzz and evaluated it on different virtual devices, such as virtual memory USB stack and drivers. In preliminary evaluations on nine recent versions of the QEMU, we found 15 new memory errors in virtual devices. In general, DetecVFuzz achieves 89.37% line coverage and 78.65% branch coverage in virtual devices. We identified 26 new crashes/errors, three of which were unseen new bugs. © 1975-2011 IEEE.

关键词： Virtual addresses

来源：评论

学校读者我要写书评

暂无评论

The Security and Privacy of Mobile Edge computing: An Artificial Intelligence Perspective

arXiv

引用

arXiv 2024年

作者： Wang, Cheng Yuan, Zenghui Zhou, Pan Xu, Zichuan Li, Ruixuan Wu, Dapeng Oliver Hubei Engineering Research Center on Big Data Security Key Laboratory of Distributed System Security of Hubei Province School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan430074 China School of Software The Key Laboratory for Ubiquitous Network Service Software of Liaoning Province Dalian University of Technology Dalian116024 China Intelligent and Distributed Computing Laboratory School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China Department of Computer Science City University of Hong Kong Kowloon999077 Hong Kong

Mobile Edge computing (MEC) is a new computing paradigm that enables cloud computing and information technology (IT) services to be delivered at the network’s edge. By shifting the load of cloud computing to individual local servers, MEC helps meet the requirements of ultralow latency, localized data processing, and extends the potential of Internet of Things (IoT) for end-users. However, the crosscutting nature of MEC and the multidisciplinary components necessary for its deployment have presented additional security and privacy concerns. Fortunately, Artificial Intelligence (AI) algorithms can cope with excessively unpredictable and complex data, which offers a distinct advantage in dealing with sophisticated and developing adversaries in the security industry. Hence, in this paper we comprehensively provide a survey of security and privacy in MEC from the perspective of AI. On the one hand, we use European Telecommunications Standards Institute (ETSI) MEC reference architecture as our based framework while merging the Software Defined Network (SDN) and Network Function Virtualization (NFV) to better illustrate a serviceable platform of MEC. On the other hand, we focus on new security and privacy issues, as well as potential solutions from the viewpoints of AI. Finally, we comprehensively discuss the opportunities and challenges associated with applying AI to MEC security and privacy as possible future research directions. Copyright © 2024, The Authors. All rights reserved.

关键词： Network security

来源：评论

学校读者我要写书评

暂无评论

Semi-Supervised Clustering Framework for Fine-grained Scene Graph Generation 39

Semi-Supervised Clustering Framework for Fine-grained Scene ...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Yang, Jiarui Wang, Chuan Zhang, Jun Wu, Shuyi Jinjing, Zhao Liu, Zeming Yang, Liang Shanghai Key Lab of Intell. Info. Processing School of Computer Science Fudan University China Shanghai Collaborative Innovation Center on Intelligent Visual Computing China Institute of Information Engineering CAS China School of Computer Science and Technology Beijing JiaoTong University China Guangdong Provincial Key Lab of Intell. Info. Processing & Shenzhen Key Lab of Media Security Shenzhen University China Information Research Center of Military Science PLA Academy of Military Science China National Key Laboratory of Science and Technology on Information System Security China School of Computer Science and Engineering Beihang University China School of Artificial Intelligence Hebei University of Technology China

ISBN: (纸本)157735897X

Scene Graph Generation (SGG) aims to detect all objects and identify their pairwise relationships existing in the scene. Considering the substantial human labor costs, existing scene graph annotations are often sparse and biased, which result in confusion training with low-frequency predicates. In this work, we design a Semi-Supervised Clustering framework for Scene Graph Generation (SSC-SGG) that uses the sparse labeled data to guide the generation of effective pseudo-labels from unlabeled object pairs, thus enriching the labeled sample space, especially for low-frequency interaction samples. We approach from the perspective of clustering, reducing the problem of confirmation bias in a self-training manner. Specifically, we first enhance the model’s robustness to feature extraction via prototype-based clustering, aggregating different relationship augmented features onto the same prototype. Secondly, we design a dynamic pseudo-label assignment algorithm based on a mini-batch, which adjusts the detection sensitivity to different frequency samples from the historical assignment. Finally, we conduct joint training on the pseudo-labels and the labeled data. We conduct experiments on various SGG models and achieve substantial overall performance improvements, demonstrating the effectiveness of SSC-SGG. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Heart Disease Prediction Using Machine Learning Method

Heart Disease Prediction Using Machine Learning Method

引用

2022 International Conference on Cyber Resilience, ICCR 2022

作者： Rasheed, Mafia Khan, Muhammad Adnan Elmitwally, Nouh Sabri Issa, Ghassan F. Ghazal, Taher M. Alrababah, Hamza Mago, Beenu Agriculture University Department of Computer Science Faisalabad Pakistan Riphah School of Computing and Innovation Riphah International University Faculty of Computing Lahore54000 Pakistan Birmingham City University Faculty of Computing Engineering and the Built Environment Birmingham United Kingdom School of Information Technology Skyline University College University City Sharjah Sharjah1797 United Arab Emirates Center for Cyber Security Faculty of Information Science and Technology Selangor Bangi43600 Malaysia School of Information Technology Skyline University College Sharjah United Arab Emirates

ISBN: (纸本)9781665461221

The heart disease is also known as coronary artery disease, many hearts affecting symptoms that are very common nowadays and causes death. It is a challenging task to diagnose heart diseases without any intelligent diagnosing system. Many researchers did research on it and developed a diagnostic system to diagnose heart diseases and worked on it. The prediction of cardiovascular disease, required a brief medical history of patients, including genetic information. The world is in acute need of a system for predicting heart disease and it became crucial. Data mining and machine learning are common techniques used in the field of health care to process large and complex data. This research paper presents reasons for heart disease and a model based on Machine learning algorithms for prediction. © 2022 IEEE.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

A Novel Scene Coupling Semantic Mask Network for Remote Sensing Image Segmentation

arXiv

引用

arXiv 2025年

作者： Ma, Xiaowen Lian, Rongrong Wu, Zhenkai Guan, Renxiang Hong, Tingfeng Zhao, Mengjiao Ma, Mengting Nie, Jiangtao Du, Zhenhong Song, Siyang Zhang, Wei School of Software Technology Zhejiang University Hangzhou310027 China Noah's Ark Lab Huawei Shanghai201206 China School of Computer Science and Technology Zhejiang University Hangzhou310027 China School of Computer Science and Technology Northwestern Polytechnical University Xian710072 China School of Earth Sciences Zhejiang University Hangzhou310027 China School of Computer Science and Technology National University of Defense Technology Changsha410073 China School of Computing and Mathematical Sciences University of Leicester United Kingdom Innovation Center of Yangtze River Delta Zhejiang University Jiaxing314103 China

As a common method in the field of computer vision, spatial attention mechanism has been widely used in semantic segmentation of remote sensing images due to its outstanding long-range dependency modeling capability. However, remote sensing images are usually characterized by complex backgrounds and large intra-class variance that would degrade their analysis performance. While vanilla spatial attention mechanisms are based on dense affine operations, they tend to introduce a large amount of background contextual information and lack of consideration for intrinsic spatial correlation. To deal with such limitations, this paper proposes a novel scene-Coupling semantic mask network, which reconstructs the vanilla attention with scene coupling and local global semantic masks strategies. Specifically, scene coupling module decomposes scene information into global representations and object distributions, which are then embedded in the attention affinity processes. This Strategy effectively utilizes the intrinsic spatial correlation between features so that improve the process of attention modeling. Meanwhile, local global semantic masks module indirectly correlate pixels with the global semantic masks by using the local semantic mask as an intermediate sensory element, which reduces the background contextual interference and mitigates the effect of intra-class variance. By combining the above two strategies, we propose the model SCSM, which not only can efficiently segment various geospatial objects in complex scenarios, but also possesses inter-clean and elegant mathematical representations. Experimental results on four benchmark datasets demonstrate the the effectiveness of the above two strategies for improving the attention modeling of remote sensing images. For example, compared to the recent advanced method LOGCAN++, the proposed SCSM has 1.2%, 0.8%, 0.2%, and 1.9% improvements on the LoveDA, Vaihingen, Potsdam, and iSAID datasets, respectively. The dataset and cod

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

What Factors Affect Multi-Modal In-Context Learning? An In-Depth Exploration

arXiv

引用

arXiv 2024年

作者： Qin, Libo Chen, Qiguang Fei, Hao Chen, Zhi Li, Min Che, Wanxiang School of Computer Science and Engineering Central South University China Research Center for Social Computing and Information Retrieval China Harbin Institute of Technology China Tsinghua University China ByteDance China

Recently, rapid advancements in Multi-Modal In-Context Learning (MM-ICL) have achieved notable success, which is capable of achieving superior performance across various tasks without requiring additional parameter tuning. However, the underlying rules for the effectiveness of MM-ICL remain under-explored. To fill this gap, this work aims to investigate the research question: "What factors affect the performance of MM-ICL?" To this end, we investigate extensive experiments on the three core steps of MM-ICL including demonstration retrieval, demonstration ordering, and prompt construction using 6 vision large language models and 20 strategies. Our findings highlight (1) the necessity of a multi-modal retriever for demonstration retrieval, (2) the importance of intra-demonstration ordering over inter-demonstration ordering, and (3) the enhancement of task comprehension through introductory instructions in prompts. We hope this study can serve as a foundational guide for optimizing MM-ICL strategies in future research. © 2024, CC BY-SA.

关键词： Demonstrations

来源：评论

学校读者我要写书评

暂无评论

AFaVS: Accurate Yet Fast Version Switching for Graph Processing Systems

AFaVS: Accurate Yet Fast Version Switching for Graph Process...

引用

International Conference on Data Engineering

作者： Long Zheng Xiangyu Ye Haifeng Liu Qinggang Wang Yu Huang Chuangyi Gui Pengcheng Yao Xiaofei Liao Hai Jin Jingling Xue National Engineering Research Center for Big Data Technology and System/Services Computing Technology and System Lab/Cluster and Grid Computing Laboratory Huazhong University of Science and Technology Wuhan China Zhejiang Lab Hangzhou China School of Computer Science and Engineering UNSW Sydney Australia

Multi-version graph processing has been widely used to solve many real-world problems. The process of the multi-version graph processing typically includes: (1) a history graph version switching at a specific time and (2) graph processing on this history graph. Existing multi-version graph systems assume ideally that every request for a particular graph version at a particular time will have a corresponding snapshot available. However, in most cases, this is not true. Then existing solutions usually have to settle with an "approximating" version as a substitute, leading to unexpected results for the underlying graph algorithm and thus reducing the practicality of a multi-version graph system for many application scenarios *** this paper, we observe that only a few graph updates have a great impact on the final results. We therefore present AFaVS, a novel multi-version graph system that can improve accuracy effectively in both time- and memory-efficient manners. The cornerstone of AFaVS lies in a novel concept "value" that characterizes the importance of graph updates. AFaVS proposes differential management of updates based on their values and achieves higher accuracy while preserving processing and memory efficiency. AFaVS is also equipped with value-guided version switching and locality-aware optimizations to boost its overall efficiency. Our results on a variety of real-world datasets show that AFaVS outperforms four state-of-the-art multi-version graph systems by 74.35%~95.72% in terms of accuracy improvement and 57.03%~90.44% in terms of memory reduction while introducing less than 2.96% extra computing time. We have deployed AFaVS in a disaster recovery system on the production cluster of Alibaba, achieving 78.8%~90.1% fewer error rates than advanced systems at a comparable efficiency.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Enity Relation Extraction of Industrial Robot PHM Based on BiLSTM-CRF and Multi-head Selection 1

引用

6th International Conference on Data Mining and Big Data, DMBD 2021

作者： Lin, Songhai Xiao, Hong Liu, Shaofeng Jiang, Wenchao Xiong, Meng He, Zhongtang School of Computer Science and Technology Guangdong University of Technology Guangzhou510006 China Cloud Computing Center Chinese Academy of Sciences Dongguan Guangdong523808 China

ISBN: (数字)9789811674761

ISBN: (纸本)9789811674754

This paper extracted the entity relation from unstructured text in the industrial robot prognostics and health management (PHM) data for the construction of a knowledge graph. Traditionally, there is a disadvantage of error propagation in the pipeline method. At the same time, the industrial robot PHM corpus has a relation overlap problem, which reduces the accuracy of relations extraction. To solve this problem, we proposed a joint entity relations extraction model combining BiLSTM-CRF and multi-head selection. In this model, the encoding layer is shared by entity extraction tasks and relations extraction tasks. Moreover, BiLSTM-CRF is introduced for named entity recognition tasks, and the entity recognition information is utilized by the multi-head selection structure to solve the problem of overlapping relations. The results show that the model can effectively extract the entity relations of unstructured text in the robot PHM data, and the overall F1-score for entity relations extraction reaches 87.64. It is an increase of 2.92% and 13.5%, compared with the BiLSTM-ED-CNN model and the pipeline method using the same model. © 2021, Springer Nature Singapore Pte Ltd.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

The Odyssey Journey: Top-Tier Medical Resource Seeking for Specialized Disorder in China

arXiv

引用

arXiv 2024年

作者： Chan, Ka I. Hu, Siying Wang, Yuntao Xu, Xuhai Lu, Zhicong Shi, Yuanchun Institute Tsinghua University Beijing China Department of Computer Science City University of Hong Kong Hong Kong Key Laboratory of Pervasive Computing Ministry of Education Department of Computer Science and Technology Tsinghua University Beijing China School of Computer Science and Technology Qinghai University Xining China Google New York CityNY United States Department of Computer Science George Mason University FairfaxVA United States Department of Computer Science and Technology Beijing National Research Center for Information Science and Technology Tsinghua University Beijing China Qinghai University Xining China

It is pivotal for patients to receive accurate health information, diagnoses, and timely treatments. However, in China, the significant imbalanced doctor-to-patient ratio intensifies the information and power asymmetries in doctor-patient relationships. Health information-seeking, which enables patients to collect information from sources beyond doctors, is a potential approach to mitigate these asymmetries. While HCI research predominantly focuses on common chronic conditions, our study focuses on specialized disorders, which are often familiar to specialists but not to general practitioners and the public. With Hemifacial Spasm (HFS) as an example, we aim to understand patients’ health information and top-tier1 medical resource seeking journeys in China. Through interviews with three neurosurgeons and 12 HFS patients from rural and urban areas, and applying Actor-Network Theory, we provide empirical insights into the roles, interactions, and workflows of various actors in the health information-seeking network. We also identified five strategies patients adopted to mitigate asymmetries and access top-tier medical resources, illustrating these strategies as subnetworks within the broader health information-seeking network and outlining their advantages and challenges. Copyright © 2024, The Authors. All rights reserved.

关键词： Electronic health record

来源：评论

学校读者我要写书评

暂无评论

Multi-consensus decentralized accelerated gradient descent

The Journal of Machine Learning Research

引用

The Journal of Machine Learning Research 2023年第1期24卷 14474-14523页

作者： Haishan Ye Luo Luo Ziang Zhou Tong Zhang Center for Intelligent Decision-Making and Machine Learning School of Management Xi'an Jiaotong University Xi'an China School of Data Science Fudan University Shanghai China Department of Computing The Hong Kong Polytechnic University Hong Kong China Computer Science & Mathematics The Hong Kong University of Science and Technology Hong Kong China

This paper considers the decentralized convex optimization problem, which has a wide range of applications in large-scale machine learning, sensor networks, and control theory. We propose novel algorithms that achieve optimal computation complexity and near optimal communication complexity. Our theoretical results give affirmative answers to the open problem on whether there exists an algorithm that can achieve a communication complexity (nearly) matching the lower bound depending on the global condition number instead of the local one. Furthermore, the linear convergence of our algorithms only depends on the strong convexity of global objective and it does not require the local functions to be convex. The design of our methods relies on a novel integration of well-known techniques including Nesterov's acceleration, multi-consensus and gradient-tracking. Empirical studies show the outperformance of our methods for machine learning applications.

关键词： consensus optimization decentralized algorithm accelerated gradient descent gradient tracking composite optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：