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

14th EAI International Conference on Mobile Multimedia Communications, Mobimedia 2021

作者： Xing, Xiaogang Chen, Yuling Li, Tao Xin, Yang Sun, Hongwei State Key Laboratory of Public Big Data College of Computer Science and Technology Guizhou University Guiyang550025 China School of Cyberspace Security Beijing University of Posts and Telecommunications Beijing100876 China National Engineering Laboratory for Disaster Backup Recovery Beijing100876 China Blockchain Laboratory of Agricultural Vegetables Weifang University of Science and Technology WeiFang262700 China

ISBN: (纸本)9783030898137

Blockchain technology has the characteristics of decentralization and tamper resistance, which can store data safely and reduce the cost of trust effectively. However, the existing blockchain system has weak performance in data management, and only supports traversal queries with transaction hashes as keywords. The query method based on the account transaction trace chain (ATTC) improves the query efficiency of historical transactions of the account. However, the efficiency of querying accounts with longer transaction chains has not been effectively improved. Given the inefficiency and single method of the ATTC index in the query, we propose a subchain-based account transaction chain (SCATC) index structure. First, the account transaction chain is divided into subchains, and the last block of each subchain is connected by a hash pointer. The block-by-block query mode in ATTC is converted to the subchain-by-subchain query mode, which shortens the query path;then, the query algorithm is given for the SCATC index structure. Simulation analysis shows that the SCATC index structure significantly improves query efficiency. © 2021, ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

On the Effectiveness of Function-Level Vulnerability Detectors for Inter-Procedural Vulnerabilities

On the Effectiveness of Function-Level Vulnerability Detecto...

引用

International Conference on Software Engineering (ICSE)

作者： Zhen Li Ning Wang Deqing Zou Yating Li Ruqian Zhang Shouhuai Xu Chao Zhang Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security Cluster and Grid Computing Lab School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China Jin YinHu Laboratory Wuhan China Department of Computer Science University of Colorado Colorado Springs Colorado Springs Colorado USA Institute for Network Sciences and Cyberspace Tsinghua University Beijing China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

ISBN: (数字)9798400702174

ISBN: (纸本)9798350382143

Software vulnerabilities are a major cyber threat and it is important to detect them. One important approach to detecting vulnerabilities is to use deep learning while treating a program function as a whole, known as function-level vulnerability detectors. However, the limitation of this approach is not understood. In this paper, we investigate its limitation in detecting one class of vulnerabilities known as inter-procedural vulnerabilities, where the to-be-patched statements and the vulnerability-triggering statements belong to different functions. For this purpose, we create the first Inter -Procedural Vulnerability dataset (InterPVD) based on C/C++ open-source software, and we propose a tool dubbed VulTrigger for identifying vulnerability-triggering statements across functions. Experimental results show that VulTrigger can effectively identify vulnerability-triggering statements and inter-procedural vulnerabilities. Our findings include: (i) inter-procedural vulnerabilities are prevalent with an average of 2.8 inter-procedural layers; and (ii) function-level vulner-ability detectors are much less effective in detecting to-be-patched functions of inter-procedural vulnerabilities than detecting their counterparts of intra-procedural vulnerabilities.

关键词： Deep learning Detectors Open source software Software engineering

来源：评论

学校读者我要写书评

暂无评论

On the Effectiveness of Function-Level Vulnerability Detectors for Inter-Procedural Vulnerabilities

arXiv

引用

arXiv 2024年

作者： Li, Zhen Wang, Ning Zou, Deqing Li, Yating Zhang, Ruqian Xu, Shouhuai Zhang, Chao Jin, Hai School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China Department of Computer Science University of Colorado Colorado Springs Colorado SpringsCO United States Institute for Network Sciences and Cyberspace Tsinghua University Beijing China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security Cluster and Grid Computing Lab China JinYinHu Laboratory Wuhan China

Software vulnerabilities are a major cyber threat and it is important to detect them. One important approach to detecting vulnerabilities is to use deep learning while treating a program function as a whole, known as function-level vulnerability detectors. However, the limitation of this approach is not understood. In this paper, we investigate its limitation in detecting one class of vulnerabilities known as inter-procedural vulnerabilities, where the to-be-patched statements and the vulnerability-triggering statements belong to different functions. For this purpose, we create the first Inter-Procedural Vulnerability dataset (InterPVD) based on C/C++ open-source software, and we propose a tool dubbed VulTrigger for identifying vulnerability-triggering statements across functions. Experimental results show that VulTrigger can effectively identify vulnerability-triggering statements and inter-procedural vulnerabilities. Our findings include: (i) inter-procedural vulnerabilities are prevalent with an average of 2.8 inter-procedural layers;and (ii) function-level vulnerability detectors are much less effective in detecting to-be-patched functions of inter-procedural vulnerabilities than detecting their counterparts of intra-procedural vulnerabilities. Copyright © 2024, The Authors. All rights reserved.

关键词： Open source software

来源：评论

学校读者我要写书评

暂无评论

Secure personal data sharing for simultaneous, parallel or sequential processing service: Autonomously and controllably

引用

Future Generation Computer Systems 2025年 173卷

作者： Lyu, Qiuyun Zhou, Yilong Ren, Yizhi Zhou, Lingfei Wu, Zekai Zhao, Chengyao Zhang, Jilin Ma, Duohe School of Cyberspace Hangzhou Dianzi University Zhejiang Hangzhou310018 China Zhejiang Provincial Key Laboratory of Data Storage Transmission and Application Technology Zhejiang Hangzhou310018 China Pinghu Digital Technology Innovation Institute Co. Ltd Hangzhou Dianzi University Zhejiang Jiaxing314299 China Zhejiang Provincial Key Laboratory of Sensitive Data Security Protection and Confidentiality Governance Zhejiang Hangzhou310018 China Zhejiang Big Data Development Center Zhejiang Hangzhou310018 China Zhejiang Data Bureau Zhejiang Hangzhou310018 China Institute of Information Engineering of Chinese Academy of Sciences Beijing100084 China

Personal data, as an important category of data elements of a trusted data circulation, needs to be shared to others in "one-to-one" mode or "one-to-many" mode with simultaneously, parallelly or sequentially to meet all kinds of complex business scenarios. Actually, today's application asks more personalized content and more often than ever before, it increasingly highlights the need for data owners to have privacy rights such as the right to be informed and the right to erasure. However, existing personal data sharing schemes mainly deal with "one-to-one" mode and some of them have made breakthroughs in "one-to-many" mode, they still do not support complex scenarios such as simultaneously operating, parallelly executing or sequentially processing in a data privacy protection way. Therefore, this paper first encapsulates personal data into data capsules and designs three types of access tasks based on the requirements of complex scenarios to achieve secure collaborative sharing, secure multi-copies sharing, and secure ordered sharing. Specifically, the scheme embeds fine-grained authorization mechanisms within the data capsules and combines them with access task tokens that support autonomous control, achieving personal data sharing autonomy, including selective sharing, informed consent authorization, and permission revocation. Finally, the security of the proposed scheme is proven through formal and informal security proofs. The results of performance analysis show that the proposed scheme has better computational and storage efficiency while supporting the data sharing needs of complex scenarios. © 2025 Elsevier B.V.

关键词： data Sharing

来源：评论

学校读者我要写书评

暂无评论

Semantic and Emotional Dual Channel for Emotion Recognition in Conversation

引用

IEEE Transactions on Affective Computing 2025年

作者： Yang, Zhenyu Zhang, Zhibo Cheng, Yuhu Zhang, Tong Wang, Xuesong Jinan250353 China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Jinan250353 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Industrial Network and Information System Security Jinan250353 China China University of Mining and Technology Engineering Research Center of Intelligent Control for Underground Space Ministry of Education Xuzhou Key Laboratory of Artificial Intelligence and Big Data School of Information and Control Engineering Xuzhou221116 China South China University of Technology Guangdong Provincial Key Laboratory of Computational Intelligence and Cyberspace Information School of Computer Science and Engineering Guangzhou510006 China Pazhou Lab Guangzhou510335 China Engineering Research Center Ministry of Education on Health Intelligent Perception and Paralleled Digital-Human Guangzhou China

Emotion recognition in conversation (ERC) aims at accurately identifying emotional states expressed in conversational content. Existing ERC methods, although relying on semantic understanding, often encounter challenges when confronted with incomplete or misleading semantic information. In addition, when dealing with the interaction between emotional and semantic information, existing methods are often difficult to effectively distinguish the complex relationship between the two, which affects the accuracy of emotion recognition. To address the problems of semantic misdirection and emotional cross-talk encountered by traditional models when confronted with complex conversational data, we propose a semantic and emotional dual channel (SEDC) strategy for emotion recognition in conversations to process emotional and semantic information independently. Under this strategy, emotion information provides an auxiliary recognition function when the semantics are unclear or lacking, enhancing the accuracy of the model. Our model consists of two modules: the emotion processing module accurately captures the emotional features of each utterance through contrastive learning, and then constructs a dialogue emotion propagation map to simulate the emotional information conveyed in the dialogue;the semantic processing module combines an external knowledge base to enhance the semantic expression of the dialogue through knowledge enhancement strategies. This divide-and-conquer approach allows us to more deeply analyze the emotional and semantic dimensions of complex dialogues. Experimental results on the IEMOCAP, EmoryNLP, MELD, and DailyDialog datasets show that our approach significantly outperforms existing techniques and effectively improves the accuracy of dialogue emotion recognition. Our code is available at https://***/r/SEDC-FCF1. © 2010-2012 IEEE.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Cloud-assisted Road Condition Monitoring with Privacy Protection in VANETs

Cloud-assisted Road Condition Monitoring with Privacy Protec...

引用

International Conference on Mobile Ad-hoc and Sensor Networks, MSN

作者： Lemei Da Yujue Wang Yong Ding Bo Qin Xiaochun Zhou Hai Liang Huiyong Wang Guangxi Key Laboratory of Cryptography and Information Security School of Computer Science and Information Security Guilin University of Electronic Technology Guilin China Pengcheng Laboratory Cyberspace Security Research Center Shenzhen China Key Laboratory of Data Engineering and Knowledge Engineering Ministry of Education School of Information Renmin University of China Beijing China Shenzhen Olym Information Security Technology Co. Ltd. Shenzhen China School of Mathematics and Computing Science Guilin University of Electronic Technology Guilin China

Vehicular ad hoc network (VANET) is one of the fastest developing technologies in intelligent transportation systems (ITS), which has made great contributions to improving traffic congestion and reducing traffic accidents. As it is deployed in an open environment, security and privacy are threatened to a certain extent. Moreover, there are huge data exchanges in high traffic areas, which require VANET system to improve computing efficiency while ensuring communication security. To solve the above issues, this paper proposes a cloud-assisted road condition monitoring (RCM) system. The trusted authority (TA) monitors the road conditions with the help of the cloud server. The vehicle collects the road condition information of the road section managed by the roadside unit (RU), and only the vehicles authorized by the administrative roadside unit can successfully upload the road condition reports to the cloud server. The cloud server divides the road condition reports into different equivalence classes, in this way to report the emergency to the TA when the reported quantity exceeds the threshold. security analysis showed that the proposed RCM system can effectively protect the security and privacy of road condition reports in VANETs.

关键词： Condition monitoring Privacy data privacy Roads Vehicular ad hoc networks Forgery Sensors

来源：评论

学校读者我要写书评

暂无评论

Which DGA family does a malicious domain name belong to 5

Which DGA family does a malicious domain name belong to

引用

5th IEEE International Conference on data Science in cyberspace, DSC 2020

作者： Zhang, Yunyi Wu, Yuelong Jin, Shuyuan Yat-sen University School of Data and Computer Science Sun Guangzhou China Cyberspace Security Research Center Peng Cheng Laboratory Shenzhen China GuangDong Key Laboratory of Information Security Technology Sun Yat-set University Guangzhou China

ISBN: (纸本)9781728195582

The Domain Generation Algorithm (DGA) is a technology that generates a large amount of domains in a short time, commonly applied to malware by malicious attackers to circumvent the security mechanisms, such as domain blacklist. Besides discovering DGA domains, identifying DGA families also is significant for detecting and analyzing malware, which provides security professionals with the perspective of comprehensive analysis. In this paper, we investigate 22 different DGA families and propose an effective approach to portray and classify DGA families, which utilizes the strong host association and family portrait to identify different DGA families among massive DGA domains. The approach mitigates the hurdle caused by the nearly 100 times data difference among different families, implementing DGA family clustering. The experimental results show that the proposed approach identifies all of the DGA families accurately in the network that contains six families. © 2020 IEEE.

关键词： Malware

来源：评论

学校读者我要写书评

暂无评论

Mixed Attention Densely Residual Network for Single Image Super-Resolution

引用

Computer Systems Science & Engineering 2021年第10期39卷 133-146页

作者： Jingjun Zhou Jing Liu Jingbing Li Mengxing Huang Jieren Cheng Yen-Wei Chen Yingying Xu Saqib Ali Nawaz School of Information and Communication Engineering Hainan UniversityHaikou570228China State Key Laboratory of Marine Resource Utilization in the South China Sea Hainan UniversityHaikou570228China Research Center for Healthcare Data Science Zhejiang LabHangzhou311121China School of Computer Science and Cyberspace Security Hainan UniversityHaikou570228China Graduate School of Information Science and Engineering Ritsumeikan University5258577Japan College of Computer Science and Technology Zhejiang UniversityHangzhou311100China

Recent applications of convolutional neural networks(CNNs)in single image super-resolution(SISR)have achieved unprecedented ***,existing CNN-based SISR network structure design consider mostly only channel or spatial information,and cannot make full use of both channel and spatial information to improve SISR performance *** present work addresses this problem by proposing a mixed attention densely residual network architecture that can make full and simultaneous use of both channel and spatial ***,we propose a residual in dense network structure composed of dense connections between multiple dense residual groups to form a very deep *** structure allows each dense residual group to apply a local residual skip connection and enables the cascading of multiple residual blocks to reuse previous features.A mixed attention module is inserted into each dense residual group,to enable the algorithm to fuse channel attention with laplacian spatial attention effectively,and thereby more adaptively focus on valuable feature *** qualitative and quantitative results of extensive experiments have demonstrate that the proposed method has a comparable performance with other stateof-the-art methods.

关键词： Channel attention Laplacian spatial attention residual in dense mixed attention

来源：评论

学校读者我要写书评

暂无评论

Traffic Engineering in Dynamic Hybrid Segment Routing Networks

引用

Computers, Materials & Continua 2021年第7期68卷 655-670页

作者： Yingya Guo Kai Huang Cheng Hu Jiangyuan Yao Siyu Zhou College of Mathematics and Computer Science Fuzhou UniversityFuzhou350000China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou UniversityFuzhou350000China Key Laboratory of Spatial Data Mining&Information Sharing Ministry of EducationFuzhou350003China School of Information Science and Technology Guangdong University of Foreign StudiesGuangzhou510006China School of Computer Science and Cyberspace Security Hainan UniversityHaiKou570228China Tandon School of Engineering New York UniversityNew York10012USA Department of Computing Hong Kong Polytechnic UniversityHong Hom999077Hong Kong

The emergence of Segment Routing(SR)provides a novel routing paradigm that uses a routing technique called source packet *** SR architecture,the paths that the packets choose to route on are indicated at the ingress *** with shortest-path-based routing in traditional distributed routing protocols,SR can realize a flexible routing by implementing an arbitrary flow splitting at the ingress *** the advantages of SR,it may be difficult to update the existing IP network to a full SR deployed network,for economical and technical *** partial of the traditional IP network to the SR network,thus forming a hybrid SR network,is a preferable *** the traffic is dynamically changing in a daily time,in this paper,we propose a Weight Adjustment algorithm WASAR to optimize routing in a dynamic hybrid SR *** algorithm can be divided into three steps:firstly,representative Traffic Matrices(TMs)and the expected TM are obtained from the historical TMs through ultrascalable spectral clustering ***,given the network topology,the initial network weight setting and the expected TM,we can realize the link weight optimization and SR node deployment optimization through a Deep Reinforcement Learning(DRL)***,we optimize the flow splitting ratios of SR nodes in a centralized online manner under dynamic traffic demands,in order to improve the network *** the evaluation,we exploit historical TMs to test the performance of the obtained routing configuration in *** extensive experimental results validate that our proposed WASAR algorithm has superior performance in reducing Maximum Link Utilization(MLU)under the dynamic traffic.

关键词： Traffic engineering routing optimization segment routing deep reinforcement learning ultra-scalable spectral clustering

来源：评论

学校读者我要写书评

暂无评论

FedAG:A Federated Learning Method Based on data Importance Weighted Aggregation

FedAG:A Federated Learning Method Based on Data Importance W...

引用

IEEE International Conference on Communications in China (ICCC)

作者： Mengchu Xu Yan Zeng Meiting Xue Ji-Lin Zhang Jian Wan Mingyao Zhou Yilin Wen Yukun Shi School of Computer Science and Technology Hangzhou Dianzi University Hangzhou China Key Laboratory of Complex Systems Modeling and Simulation Ministry of Education Hangzhou China Zhejiang Engineering Research Center of Data Security Governance Hangzhou China School of Cyberspace Hangzhou Dianzi University Hangzhou China Huawei Enterprise Communication Technology Co Hangzhou China

Federated learning is a distributed machine learning approach that trains models with multiple clients and data locally. However, the existing methods ignore the differences between local models caused by the data heterogeneity, and give a high aggregation weight for the low-quality local model, which leads to low accuracy of the global model. For this problem, we propose a federated learning method based on data importance weighted aggregation, FedAG. It constructs an evaluation model of data importance based on the data distribution skewness, data volume, and data quality of clients, and aggregates local models with different weights computed by the evaluation model of data importance into a global model. We make experiments on five datasets including EMNIST, MNIST, and CIFAR-10. The results show that the accuracy of FedAG is respectively improved by 6.5%, 1.8%, 1.3% and 2.1%, compared with FedAvg, FedProx, FedVar, and Scaffold algorithms.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：