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

Method and Practice of Trusted Embedded Computing and Data Transmission Protection Architecture Based on Android

Chinese Journal of Electronics 2024年第3期33卷 623-634页

作者： Yichuan WANG Wen GAO Xinhong HEI Yanning DU School of Computer Science and Engineering Xi'an University of Technology Shaanxi Key Laboratory for Network Computing and Security Technology

In recent years,the rapid development of Internet technology has constantly enriched people's daily life and gradually changed from the traditional computer terminal to the mobile *** with it comes the security problems brought by the mobile *** for Android system,due to its open source nature,malicious applications continue to emerge,which greatly threatens the data security of ***,this paper proposes a method of trusted embedded static measurement and data transmission protection architecture based on Android to reduce the risk of data leakage in the process of terminal storage and *** conducted detailed data and feasibility analysis of the proposed method from the aspects of time consumption,storage overhead and *** experimental results show that this method can detect Android system layer attacks such as self-booting of the malicious module and improve the security of data encryption and transmission process *** with the native system,the additional performance overhead is small.

关键词： TrustZone Static measurement Data leakage Android

来源：评论

学校读者我要写书评

暂无评论

A New Encrypted Traffic Identification Model Based on VAE-LSTM-DRN

引用

computers, Materials & Continua 2024年第1期78卷 569-588页

作者： Haizhen Wang Jinying Yan Na Jia College of Computer and Control Engineering Qiqihar UniversityQiqihar161006China Heilongjiang Key Laboratory of Big Data Network Security Detection and Analysis Qiqihar UniversityQiqiharChina

Encrypted traffic identification pertains to the precise acquisition and categorization of data from traffic datasets containing imbalanced and obscured *** extraction of encrypted traffic attributes and their subsequent identification presents a formidable *** existing models have predominantly relied on direct extraction of encrypted traffic data from imbalanced datasets,with the dataset’s imbalance significantly affecting the model’s *** the present study,a new model,referred to as UD-VLD(Unbalanced Dataset-VAE-LSTM-DRN),was proposed to address above *** proposed model is an encrypted traffic identification model for handling unbalanced *** encoder of the variational autoencoder(VAE)is combined with the decoder and Long-short term Memory(LSTM)in UD-VLD model to realize the data enhancement processing of the original unbalanced *** enhanced data is processed by transforming the deep residual network(DRN)to address neural network gradient-related ***,the data is classified and *** UD-VLD model integrates the related techniques of deep learning into the encrypted traffic recognition technique,thereby solving the processing problem for unbalanced *** UD-VLD model was tested using the publicly available Tor dataset and VPN *** UD-VLD model is evaluated against other comparative models in terms of accuracy,loss rate,precision,recall,F1-score,total time,and ROC *** results reveal that the UD-VLD model exhibits better performance in both binary and multi classification,being higher than other encrypted traffic recognition models that exist for unbalanced ***,the evaluation performance indicates that the UD-VLD model effectivelymitigates the impact of unbalanced data on traffic *** can serve as a novel solution for encrypted traffic identification.

关键词： Data enhancement LSTM deep residual network VAE

来源：评论

学校读者我要写书评

暂无评论

A DDoS Identification Method for Unbalanced Data CVWGG

引用

computers, Materials & Continua 2024年第12期81卷 3825-3851页

作者： Haizhen Wang Na Jia Yang He Pan Tan College of Computer and Control Engineering Qiqihar UniversityQiqihar161006China Heilongjiang Key Laboratory of Big Data Network Security Detection and Analysis Qiqihar UniversityQiqihar161006China

As the popularity and dependence on the Internet increase,DDoS(distributed denial of service)attacks seriously threaten network *** accurately distinguishing between different types of DDoS attacks,targeted defense strategies can be formulated,significantly improving network protection *** attacks usually manifest as an abnormal increase in network traffic,and their diverse types of attacks,along with a severe data imbalance,make it difficult for traditional classification methods to effectively identify a small number of attack *** solve this problem,this paper proposes a DDoS recognition method CVWGG(Conditional Variational Autoencoder-Wasserstein Generative Adversarial network-gradient penalty-Gated Recurrent Unit)for unbalanced data,which generates less noisy data and high data quality compared with existing *** mainly includes unbalanced data processing for CVWG,feature extraction,and *** uses the CVAE(Conditional Variational Autoencoder)to improve the WGAN(Wasserstein Generative Adversarial network)and introduces a GP(gradient penalty)term to design the loss function to generate balanced data,which enhances the learning ability and stability of the ***,the GRU(Gated Recurrent Units)are used to capture the temporal features and patterns of the ***,the logsoftmax function is used to differentiate DDoS attack *** PyCharm and Python 3.10 for programming and evaluating performance with metrics such as accuracy and precision,the results show that the method achieved accuracy rates of 96.0%and 97.3%on two datasets,***,comparison and ablation experiment results demonstrate that CVWGG effectively mitigates the imbalance between DDoS attack categories,significantly improves the classification accuracy of different types of attacks and provides a valuable reference for network security defense.

关键词： Conditional variational autoencoder generating adversarial networks DDoS attack

来源：评论

学校读者我要写书评

暂无评论

Recommendation System Based on Perceptron and Graph Convolution network

引用

computers, Materials & Continua 2024年第6期79卷 3939-3954页

作者： Zuozheng Lian Yongchao Yin Haizhen Wang College of Computer and Control Engineering Qiqihar UniversityQiqihar161006China Heilongjiang Key Laboratory of Big Data Network Security Detection and Analysis Qiqihar UniversityQiqihar161006China

The relationship between users and items,which cannot be recovered by traditional techniques,can be extracted by the recommendation algorithm based on the graph convolution *** current simple linear combination of these algorithms may not be sufficient to extract the complex structure of user interaction *** paper presents a new approach to address such issues,utilizing the graph convolution network to extract association *** proposed approach mainly includes three modules:Embedding layer,forward propagation layer,and score prediction *** embedding layer models users and items according to their interaction information and generates initial feature vectors as input for the forward propagation *** forward propagation layer designs two parallel graph convolution networks with self-connections,which extract higher-order association relevance from users and items separately by multi-layer graph ***,the forward propagation layer integrates the attention factor to assign different weights among the hop neighbors of the graph convolution network fusion,capturing more comprehensive association relevance between users and items as input for the score prediction *** score prediction layer introduces MLP(multi-layer perceptron)to conduct non-linear feature interaction between users and items,***,the prediction score of users to items is *** recall rate and normalized discounted cumulative gain were used as evaluation *** proposed approach effectively integrates higher-order information in user entries,and experimental analysis demonstrates its superiority over the existing algorithms.

关键词： Recommendation system graph convolution network attention mechanism multi-layer perceptron

来源：评论

学校读者我要写书评

暂无评论

Online Queue-Aware Service Migration and Resource Allocation in Mobile Edge Computing

引用

IEEE Transactions on Vehicular Technology 2025年第5期74卷 8063-8078页

作者： Du, An Jia, Jie Chen, Jian Wang, Xingwei Huang, Ming Northeastern University School of Computer Science and Engineering Engineering Research Center of Security Technology of Complex Network System Key Laboratory of Intelligent Computing in Medical Image Ministry of Education Shenyang110819 China Northeastern University School of Computer Science and Engineering Shenyang110819 China

Mobile edge computing (MEC) integrated with network Functions Virtualization (NFV) helps run a wide range of services implemented by Virtual network Functions (VNFs) deployed at MEC networks. This emerging paradigm offers flexible edge resource management for Internet Service Providers (ISPs) and improves service satisfaction of diverse applications. However, a critical challenge lies in processing extremely unpredictable and bursty traffic flow, especially in event-trigger sensing tasks. In this paper, we study queue-aware service migration and resource allocation in an MEC network, where different devices with different arrival patterns request different network services. To this end, we first formulate a novel long-term operation cost minimization problem subject to the stability of multiple queues by adopting a simultaneous migration scheme and determining resource allocation dynamically. To address the problem efficiently, we propose an online control framework to make decisions without any prior system information. We first adopt the Lyapunov optimization technique to decompose the long-term optimization problem into multi-per-slot subproblems. Then, we adopt a decoupled optimization algorithm based on the coordinate descent method and augmented Lagrangian method to solve the offline mixed integer non-linear programming (MINLP) subproblems. Extensive results reveal that the proposed online optimization framework can efficiently balance queue stability and cost consumption. © 1967-2012 IEEE.

关键词： Mobile edge computing

来源：评论

学校读者我要写书评

暂无评论

Multi-class Bitcoin mixing service identification based on graph classification

引用

Digital Communications and networks 2024年第6期10卷 1881-1893页

作者： Xiaoyan Hu Meiqun Gui Guang Cheng Ruidong Li Hua Wu School of Cyber Science&Engineering Southeast UniversityNanjing 211189China Purple Mountain Laboratories for Network and Communication Security Nanjing 211111China Jiangsu Provincial Engineering Research Center of Security for Ubiquitous Network Nanjing 211189China Key Laboratory of Computer Network and Information Integration Southeast UniversityMinistry of EducationChina Research Base of International Cyberspace Governance Southeast UniversityNanjing 211189China Institute of Science and Engineering Kanazawa UniversityKakumaKanazawa920-1192Japan

Due to its anonymity and decentralization,Bitcoin has long been a haven for various illegal *** generally legalize illicit funds by Bitcoin mixing ***,it is critical to investigate the mixing services in cryptocurrency anti-money *** studies treat different mixing services as a class of suspicious Bitcoin ***,they are limited by relying on expert experience or needing to deal with large-scale *** far,multi-class mixing service identification has not been explored *** is challenging since mixing services share a similar procedure,presenting no sharp ***,mixing service identification facilitates the healthy development of Bitcoin,supports financial forensics for cryptocurrency regulation and legislation,and provides technical means for fine-grained blockchain *** paper aims to achieve multi-class Bitcoin Mixing Service Identification with a Graph Classification(BMSI-GC)***,BMSI-GC constructs 2-hop ego networks(2-egonets)of mixing services based on their historical ***,it applies graph2vec,a graph classification model mainly used to calculate the similarity between graphs,to automatically extract address features from the constructed ***,it trains a multilayer perceptron classifier to perform classification based on the extracted ***-GC is flexible without handling the full-size network and handcrafting address ***,the differences in transaction patterns of mixing services reflected in the 2-egonets provide adequate information for *** experimental study demonstrates that BMSI-GC performs excellently in multi-class Bitcoin mixing service identification,achieving an average identification F1-score of 95.08%.

关键词： Bitcoin Anti-money laundering Mixing service Ego network Graph classification

来源：评论

学校读者我要写书评

暂无评论

Endogenous security of FQn networks: Adaptive System-Level Fault Self-Diagnosis

引用

IEEE Transactions on Reliability 2024年第3期73卷 1659-1668页

作者： Lin, Yuhang Lin, Limei Huang, Yanze Xu, Li Hsieh, Sun-Yuan Fujian Normal University College of Computer and Cyber Security Fujian Provincial Key Laboratory of Network Security and Cryptology Fuzhou350117 China Fujian University of Technology School of Computer Science and Mathematics Fuzhou350118 China National Cheng Kung University Department of Computer Science and Information Engineering Tainan701 Taiwan

Endogenous security has the ability to discover, eliminate, and solve internal security problems and hidden dangers within the network, and is a superior technology to ensure future network security. The t/k-diagnosis strategy, as a strong and adaptive self-diagnosis strategy, is an important part for ensuring endogenous security. Moreover, the folded hypercube (FQn) as a data transmission network (e.g., optical network) topology offers new potential for the construction of large-scale, high data throughput, and low-latency systems, such as computing network, human-cyber-physical systems, and smart grid. However, there are few studies on endogenous security based on FQn networks. Therefore, this article designs an adaptive system-level fault self-diagnosis strategy, namely Fast t/k-Diagnosis Under Maeng-Malek Model (Ftk-DIAG-MM*) to diagnosis the faulty vertices in FQn network under the Maeng-Malek model (MM∗ mod). Then, we provide a proof of the algorithm correctness theoretically by the fault tolerance of FQn network. It is derived by theoretical derivation that the t/k-diagnosability inherent to the FQn network is (n+1)(k+1)-k(k+3)/2. The simulation experiments demonstrate that the designed Ftk-DIAG-MM∗ strategy can correctly diagnose all vertices within the range allowed by the diagnosability, and still has a great performance when it exceeds the range allowed by the diagnosability. It greatly enhances the fault diagnosis capability of FQn network in the circumstance of misdiagnosing a few vertices, which provides an important theoretical basis for the reliability and endogenous security of FQn networks. © 1963-2012 IEEE.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

Probabilistic Reliability via Subsystem Structures of Arrangement Graph networks

引用

IEEE Transactions on Reliability 2024年第1期73卷 279-289页

作者： Huang, Yanze Lin, Limei Xu, Li Hsieh, Sun-Yuan Fujian University of Technology Fujian Provincial Key Laboratory of Big Data Mining and Applications School of Computer Science and Mathematics Fuzhou350118 China Fujian Normal University College of Computer and Cyber Security Key Laboratory of Network Security and Cryptology Fuzhou350117 China National Cheng Kung University Department of Computer Science and Information Engineering Tainan701 Taiwan

With the rapid growth of the number of processors in a multiprocessor system, faulty processors occur in it with a probability that rises quickly. The probability of a subsystem with an appropriate size being fault-free in a definite time interval is a significant and practical measure of the reliability for a multiprocessor system, which characterizes the functionality of a multiprocessor system well. Motivated by the study of subgraph reliability, as well as the attractive structure and fault tolerance properties of (n, k)-arrangement graph A n, k, we focus on the subgraph reliability for A n, k under the probabilistic fault model in this article. First, we investigate intersections of no more than four subgraphs in A n, k, and classify all the intersecting modes. Second, we focus on the probability P(q, A n, k n-1, k-1) with which at least one (n-1, k-1)-subarrangement graph is fault-free in A n, k, when given a uniform probability q with which a single vertex is fault-free, and we establish the P(q, A n, kn-1, k-1) by adopting the principle of inclusion-exclusion under the probabilistic fault model. Finally, we study the probabilistic fault model involving a nonuniform probability with which a single vertex is fault-free, and we prove that the P(q, A n, kn-1, k-1) under both models is very close to the asymptotic value by both theoretical arguments and experimental results. © 1963-2012 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Textual Data De-Privatization Scheme Based on Generative Adversarial networks 24th

Textual Data De-Privatization Scheme Based on Generative Adv...

引用

24th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2024

作者： Du, Yanning Xu, Jinnan Zhang, Yaling Wang, Yichuan Wang, Zhoukai School of Computer Science and Engineering Xi’an University of Technology Xi’an China Shaanxi Key Laboratory for Network Computing and Security Technology Xi’an China

ISBN: (纸本)9789819615506

In many fields, such as healthcare, finance, and scientific research, data sharing and collaboration are critical to achieving better outcomes. However, the sharing of personal data often involves privacy risks, so privacy-preserving techniques are needed to ensure data security and privacy. The superior performance and flexibility of generative models in data representation have led to significant progress in the development of data privacy. This paper proposes a textual data de-privatization scheme based on generative adversarial networks that well combines generative adversarial networks with privacy protection. The generated de-privacy data retains the statistical properties of the original data and effectively removes sensitive information. Moreover, feature sorting and reshaping modules are introduced to enable the generator to better capture the relationships between features, thus improving the quality of synthetic data. In this paper, the utility of synthetic data is evaluated from three aspects, including similarity assessment, privacy assessment, and model utility assessment. Experimental results show that this method achieves a good trade-off in terms of textual data privacy protection and data quality maintenance. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Aggregation-based dual heterogeneous task allocation in spatial crowdsourcing

引用

Frontiers of computer Science 2024年第6期18卷 215-227页

作者： Xiaochuan LIN Kaimin WEI Zhetao LI Jinpeng CHEN Tingrui PEI College of Information Science and Technology&Cyberspace Security Jinan UniversityGuangzhou 510632China National&Local Joint Engineering Research Center of Network Security Detection and Protection Technology Guangzhou 510632China Guangdong Provincial Key Laboratory of Data Security and Privacy Protection Guangzhou 510632China School of Computer Science Beijing University of Posts and TelecommunicationsBeijing 100876China

Spatial crowdsourcing(SC)is a popular data collection paradigm for numerous *** the increment of tasks and workers in SC,heterogeneity becomes an unavoidable difficulty in task *** researches only focus on the single-heterogeneous task ***,a variety of heterogeneous objects coexist in real-world SC *** dramatically expands the space for searching the optimal task allocation solution,affecting the quality and efficiency of data *** this paper,an aggregation-based dual heterogeneous task allocation algorithm is put *** investigates the impact of dual heterogeneous on the task allocation problem and seeks to maximize the quality of task completion and minimize the average travel *** problem is first proved to be ***,a task aggregation method based on locations and requirements is built to reduce task ***,a time-constrained shortest path planning is also developed to shorten the travel distance in a *** that,two evolutionary task allocation schemes are ***,extensive experiments are conducted based on real-world datasets in various *** with baseline algorithms,our proposed schemes enhance the quality of task completion by up to 25% and utilize 34% less average travel distance.

关键词： task allocation aggregation shortest path dual heterogeneous spatial crowdsourcing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：