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

arXiv 2022年

作者： Wang, Tianyi Liao, Xin Chow, Kam Pui Lin, Xiaodong Wang, Yinglong Department of Computer Science The University of Hong Kong Hong Kong College of Computer Science and Electronic Engineering Hunan University China School of Computer Science University of Guelph Canada Key Laboratory of Computing Power Network and Information Security Ministry of Education Qilu University of Technology Shandong Academy of Sciences China

The mushroomed Deepfake synthetic materials circulated on the internet have raised a profound social impact on politicians, celebrities, and individuals worldwide. In this survey, we provide a thorough review of the existing Deepfake detection studies from the reliability perspective. We identify three reliability-oriented research challenges in the current Deepfake detection domain: transferability, interpretability, and robustness. Moreover, while solutions have been frequently addressed regarding the three challenges, the general reliability of a detection model has been barely considered, leading to the lack of reliable evidence in real-life usages and even for prosecutions on Deepfake-related cases in court. We, therefore, introduce a model reliability study metric using statistical random sampling knowledge and the publicly available benchmark datasets to review the reliability of the existing detection models on arbitrary Deepfake candidate suspects. Case studies are further executed to justify the real-life Deepfake cases including different groups of victims with the help of the reliably qualified detection models as reviewed in this survey. Reviews and experiments on the existing approaches provide informative discussions and future research directions for Deepfake detection. Copyright © 2022, The Authors. All rights reserved.

关键词： Data reliability

来源：评论

学校读者我要写书评

暂无评论

ER-ERT:A Method of Ensemble Representation Learning of Encrypted RAT Traffic

ER-ERT:A Method of Ensemble Representation Learning of Encry...

引用

IFIP networking Conference

作者： Yijing Zhang Hui Xue Jianjun Lin Xiaoyu Liu Weilin Gai Xiaodu Yang Anqi Wang Yinliang Yue Bo Sun Institute of Information Engineering Chinese Academy of Sciences School of Cyber Security University of Chinese Academy of Sciences Institute of Software Chinese Academy of Sciences School of computer science and technology University of Chinese Academy of Sciences Coordination Center of China National Computer Network Emergency Response Technical Team Liaoning University of Technology Zhongguancun Laboratory Beijing P.R.China

Remote Access Trojan (RAT) is one of the major threats to today's network environment. It is a class of malware frequently used by hacking collectives to monitor victims' actions and steal personal information in targeted computers. Traditional machine learning algorithms have been widely used to detect malicious encrypted RAT traffic. Traditional machine learning algorithms rely deeply on expert experience, and it is difficult for current traffic classification models to design effective handcraft features. Deep learning methods have been introduced in recent years to generate representations from raw network traffic data automatically. Previous deep learning-based malicious traffic detection methods generate representations from flow sequences or packet payload bytes. None of these methods simultaneously learn embeddings from flow sequence and packet payload bytes. Thus, we propose a novel ensemble model to draw fine-grained and multi-angle traffic representations for RAT traffic. The model extract (1) temporal features with convolution neural network (CNN) and the Reproducing Kernel Hilbert Space (RKHS) embedding method to model network flow sequence, (2) spatial features with autoencoder and bidirectional gated recurrent unit (Bi-GRU) network to model packet payload bytes, and (3) some stage-based attributes to enhance the identification ability of RAT traffic behaviors. According to the experimental result, our approach achieves better performance than previous works with a precision rate of 97.0% and a recall rate of 96.5%.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

On the ADEP and DOR Analysis of RIS-aided URLLC Systems with Partial CSI in Smart Factory

On the ADEP and DOR Analysis of RIS-aided URLLC Systems with...

引用

2021 IEEE Globecom Workshops, GC Wkshps 2021

作者： Bao, Tingnan Wang, Haiming Yang, Hong-Chuan Wang, Wen-Jing Hasna, Mazen O. Lenovo Research + Institute of Computing Technology Chinese Academy of Sciences Beijing China Lenovo Reseach Lenovo Group Limited Beijing China University of Victoria Department of Electrical and Computer Engineering Victoria Canada Shaanxi Key Laboratory of Information Communication Network and Security XUPT Xi'an China Qatar University Department of Electrical Engineering Doha Qatar

ISBN: (纸本)9781665423908

Factory automation applications impose stringent quality of service (QoS) over ultra-reliable and low-latency communication (URLLC) system. However, the existing wireless systems cannot meet the requirement for these mission-critical industrial internet-of-things (IIoT) applications. In this paper, we consider the reconfigurable intelligent surface (RIS)-aided URLLC systems in the smart factory. To facilitate the performance analysis of the practical situation, the presence of phase error at RIS is discussed. We analyze and derive approximate closed-form expression of average decoding error probability (ADEP) and the closed-form expression of performance limits de-lay outage rate (DOR) under our proposed scenario, respectively. Through analytical results and associated numerical examples, we demonstrate the effect of the number of reflecting elements at the RIS, channel blocklength and packet size in achieving high reliability and low latency. Therefore, the deployment of RIS can offer an attractive solution to enhance the reliability over URLLC systems in the smart factory. © 2021 IEEE.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

MACCoM: A multiple attention and convolutional cross-mixer framework for detailed 2D biomedical image segmentation

引用

computers in Biology and Medicine 2024年 179卷 108847-108847页

作者： Ejiyi, Chukwuebuka Joseph Qin, Zhen Ejiyi, Makuachukwu Bennedith Ukwuoma, Chiagoziem Ejiyi, Thomas Ugochukwu Muoka, Gladys Wavinya Gyarteng, Emmanuel S.A. Bamisile, Olusola O. Network and Data Security Key Laboratory of Sichuan Province University of Electronic Science and Technology of China Sichuan Chengdu China Pharmacy Department University of Nigeria Nsukka Enugu State Nsukka Nigeria Department of Pure and Industrial Chemistry University of Nigeria Nsukka Enugu State Nsukka Nigeria School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu China Sichuan Industrial Internet Intelligent Monitoring and Application Engineering Research Center Chengdu University of Technology Chengdu China

The UNet architecture, which is widely used for biomedical image segmentation, has limitations like blurred feature maps and over- or under-segmented regions. To overcome these limitations, we propose a novel network architecture called MACCoM (Multiple Attention and Convolutional Cross-Mixer) – an end-to-end depthwise encoder-decoder fully convolutional network designed for binary and multi-class biomedical image segmentation built upon deeperUNet. We proposed a multi-scope attention module (MSAM) that allows the model to attend to diverse scale features, preserving fine details and high-level semantic information thus useful at the encoder-decoder connection. As the depth increases, our proposed spatial multi-head attention (SMA) is added to facilitate inter-layer communication and information exchange, enabling the network to effectively capture long-range dependencies and global context. MACCoM is also equipped with a convolutional cross-mixer we proposed to enhance the feature extraction capability of the model. By incorporating these modules, we effectively combine semantically similar features and reduce artifacts during the early stages of training. Experimental results on 4 biomedical datasets crafted from 3 datasets of varying modalities consistently demonstrate that MACCoM outperforms or matches state-of-the-art baselines in the segmentation tasks. With Breast Ultrasound Image (BUSI), MACCoM recorded 99.06 % Jaccard, 77.58 % Dice, and 93.92 % Accuracy, while recording 99.50 %, 98.44 %, and 99.29 % respectively for Jaccard, Dice, and Accuracy on the Chest X-ray (CXR) images used. The Jaccard, Dice, and Accuracy for the High-Resolution Fundus (HRF) images are 95.77 %, 74.35 %, and 95.95 % respectively. The findings here highlight MACCoM's effectiveness in improving segmentation performance and its valuable potential in image analysis. © 2024 Elsevier Ltd

关键词： Mixers (machinery)

来源：评论

学校读者我要写书评

暂无评论

Auction Theory and Game Theory Based Pricing of Edge Computing Resources: A Survey

引用

IEEE Internet of Things Journal 2025年

作者： Yu, Jiguo Liu, Shun Zou, Yifei Wang, Guijuan Hu, Chunqiang University of Electronic Science and Technology of China School of Information and Software Engineering Chengdu610054 China Qilu University of Technology Big Data Institute Jinan250353 China Qufu Normal University School of Computer Science Shandong Rizhao China Shandong University School of Computer Science and Technology Shandong Qingdao266237 China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan250353 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan250353 China Chongqing University School of Big Data and Software Engineering Chongqing400044 China

The proliferation of Internet of Things (IoT) devices and edge computing applications has heightened the demand for efficient resource allocation and pricing mechanisms. Effective pricing strategies play a crucial role in optimizing resource utilization, reducing latency, and ensuring fair resource distribution among users. Both auction theory and game theory have emerged as fundamental economic frameworks for designing pricing mechanisms in edge computing. This paper presents a comprehensive survey of pricing strategies that leverage both auction and game theory, systematically categorizing existing research based on auction mechanisms and game-theoretic models. Unlike previous surveys that focus solely on auction-based pricing, this work integrates game-theoretic perspectives, providing a holistic analysis of strategic interactions in edge computing resource allocation. Furthermore, we discuss key challenges, emerging trends, and future research directions aimed at enhancing efficiency, fairness, and privacy protection in cloud-edge collaborative computing environments. © 2014 IEEE.

关键词： Mobile edge computing

来源：评论

学校读者我要写书评

暂无评论

AsyncSC: An Asynchronous Sidechain for Multi-Domain Data Exchange in Internet of Things

arXiv

引用

arXiv 2024年

作者： Yang, Lingxiao Dong, Xuewen Wan, Zhiguo Gao, Sheng Tong, Wei Lu, Di Shen, Yulong Du, Xiaojiang The School of Computer Science and Technology Xidian University The Engineering Research Center of Blockchain Technology Application and Evaluation Ministry of Education China The Shaanxi Key Laboratory of Blockchain and Secure Computing Xi'An710071 China The Zhejiang Lab Hangzhou311121 China The School of Information Central University of Finance and Economics Beijing100081 China The School of Information Science and Engineering Zhejiang Sci-Tech University Hangzhou310018 China The School of Computer Science and Technology Xidian University China The Shaanxi Key Laboratory of Network and System Security Xi'An710071 China The School of Engineering and Science Stevens Institute of Technology Hoboken07030 United States

Sidechain techniques improve blockchain scalability and interoperability, providing decentralized exchange and cross-chain collaboration solutions for Internet of Things (IoT) data across various domains. However, current state-of-the-art (SOTA) schemes for IoT multi-domain data exchange are constrained by the need for synchronous networks, hindering efficient cross-chain interactions in discontinuous networks and leading to suboptimal data exchange. In this paper, we propose AsyncSC, a novel asynchronous sidechain construction. It employs a committee to provide Cross-Blockchain as a Service (C-BaaS) for data exchange in multi-domain IoT. To fulfill the need for asynchronous and efficient data exchange, we combine the ideas of aggregate signatures and verifiable delay functions to devise a novel cryptographic primitive called delayed aggregate signature (DAS), which constructs asynchronous cross-chain proofs (ACPs) that ensure the security of cross-chain interactions. To ensure the consistency of asynchronous transactions, we propose a multilevel buffered transaction pool that guarantees the transaction sequencing. We analyze and prove the security of AsyncSC, simulate an asynchronous communication environment, and conduct a comprehensive evaluation. The results show that AsyncSC outperforms SOTA schemes, improving throughput by an average of 1.21 to 3.96 times, reducing transaction latency by 59.76% to 83.61%, and maintaining comparable resource overhead. Copyright © 2024, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An Auto-Parallel Method for Deep Learning Models Based on Genetic Algorithm

An Auto-Parallel Method for Deep Learning Models Based on Ge...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Yan Zeng ChengChuang Huang YiJie Ni ChunBao Zhou JiLin Zhang Jue Wang MingYao Zhou MeiTing Xue YunQuan Zhang School of Computer Science and Technology Hangzhou Dianzi University Hangzhou China Key Laboratory for Modeling and Simulation of Complex Systems Ministry of Education Hangzhou China Data Security Governance Zhejiang Engineering Research Center Hangzhou China School of ITMO Joint Institute Hangzhou Dianzi University Hangzhou China Institute of Computer Network Information Center of the Chinese Academy of Sciences Beijing China HuaWei State Key Laboratory of Computer Architecture Institute of Computing Technology of the Chinese Academy of Sciences Beijing China

As the size of datasets and neural network models increases, automatic parallelization methods for models have become a research hotspot in recent years. The existing auto-parallel methods based on machine learning or graph algorithms still have issues with search efficiency and applicability. This paper proposes an automatic parallel method based on a dual-population genetic algorithm, TGA, which transforms model partitioning and placement into an integer linear programming problem and constructs a cost model to evaluate the solution. The solution space is built using the neural network’s dataflow graph and device cluster’s topology, and the dual-population genetic algorithm is used to search for the optimal model parallel strategy. Experiments with various models show that the proposed method can improve single-step execution time by up to 42% compared to the Baechi method and up to 37.7% compared to the Hierarchical method.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Mind the Gap: Towards Generalizable Autonomous Penetration Testing via Domain Randomization and Meta-Reinforcement Learning

arXiv

引用

arXiv 2024年

作者： Zhou, Shicheng Liu, Jingju Lu, Yuliang Yang, Jiahai Zhang, Yue Chen, Jie College of Electronic Engineering National University of Defense Technology Hefei230037 China Key Laboratory of Cyberspace Security Situation Awareness and Evaluation Anhui Province Hefei230037 China Institute for Network Sciences and Cyberspace The Beijing National Research Center for Information Science and Technology Tsinghua University Beijing10084 China College of Computer Science and Technology National University of Defense Technology Changsha410073 China

With increasing numbers of vulnerabilities exposed on the internet, autonomous penetration testing (pentesting) has emerged as a promising research area. Reinforcement learning (RL) is a natural fit for studying this topic. However, two key challenges limit the applicability of RL-based autonomous pentesting in real-world scenarios: (a) training environment dilemma – training agents in simulated environments is sample-efficient while ensuring their realism remains challenging;(b) poor generalization ability – agents’ policies often perform poorly when transferred to unseen scenarios, with even slight changes potentially causing significant generalization gap. To this end, we propose GAP, a generalizable autonomous pentesting framework that aims to realizes efficient policy training in realistic environments and train generalizable agents capable of drawing inferences about other cases from one instance. GAP introduces a Real-to-Simto-Real pipeline that (a) enables end-to-end policy learning in unknown real environments while constructing realistic simulations;(b) improves agents’ generalization ability by leveraging domain randomization and meta-RL learning. Specially, we are among the first to apply domain randomization in autonomous pentesting and propose a large language model-powered domain randomization method for synthetic environment generation. We further apply meta-RL to improve agents’ generalization ability in unseen environments by leveraging synthetic environments. The combination of two methods effectively bridges the generalization gap and improves agents’ policy adaptation performance. Experiments are conducted on various vulnerable virtual machines, with results showing that GAP can enable policy learning in various realistic environments, achieve zero-shot policy transfer in similar environments, and realize rapid policy adaptation in dissimilar environments. The source code is available at https://***/Joe-zsc/GAP. Copyright © 2024, The Auth

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Revocable Registered Attribute-Based Encryption With User Deregistration

引用

IEEE Internet of Things Journal 2025年

作者： Li, Jiguo Chen, Shaobo Lu, Yang Ning, Jianting Shen, Jian Zhang, Yichen Fujian Normal University College of Computer and Cyber Security Fuzhou350117 China Fuzhou350117 China Fujian Provincial Key Laboratory of Network Security and Cryptology Fuzhou350117 China Nanjing Normal University School of Computer and Electronic Information Nanjing210023 China Fujian Provincial Key Laboratory of Network Security and Cryptology College of Computer and Cyber Security Fuzhou350117 China Zhejiang Sci-Tech University School of Information Science and Engineering Hangzhou310018 China

Many businesses are putting their sensitive data in the cloud with the fast growth of cloud computing and storage. To ensure user privacy, it is necessary to keep encrypted data only in the cloud. Attribute-based encryption (ABE) is a popular mean in cloud storage scenarios. ABE is not only faced with key escrow problem but also suffers from user revocation issue when he or she is no longer authorized to access to encrypted data. In order to address these two issues, we propose a revocable registered attribute-based encryption scheme, which not only avoids key escrow problem but also supports precise revocation of a user’s access to a file as well as permanent deregistration of a user from the system. Furthermore, we prove the semantic security of the scheme and conduct a performance experiment to show the efficiency. © 2014 IEEE.

关键词： Sensitive data

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：