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

Proceedings of the 2019 the 9th International Conference on Communication and network Security

作者： Xiaoling Gao Yanhua Liu Yanbin Qiu Huajun Liu College of Mathematics and Computer Science Fuzhou University Fuzhou Fujian China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou Fujian China

ISBN: (纸本)9781450376624

In a given system network, an important prerequisite for security risk control is how to accurately calculate the impact of different host assets in the topology on the spread of attack risk. In this regard, we propose a comprehensive asset importance assessment model for critical asset protection. First, the importance of local static assets in the topology was evaluated using three methods: degree centrality, mediation centrality, and closeness centrality. At the same time, PageRank was used to assess the importance of local dynamic assets for asset level changes. By combining the above two methods, and using K-CORE to evaluate the core position of the host in the network topology as the global weight indicator of the importance of assets. The comprehensive evaluation results of the importance of topology-oriented assets was finally obtained, and the validity of the model was verified through the experiment of the simulation ER random network.

关键词： Centrality PageRank Asset importance key asset protection K-CORE

来源：评论

学校读者我要写书评

暂无评论

A method of off-line signature verification for digital forensics

A method of off-line signature verification for digital fore...

引用

International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)

作者： Weiwei Pan Guolong Chen College of Mathematics and Computer Science Fuzhou University Fuzhou Fujian China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou Fujian China

Signature verification is an important part of digital forensics. In order to solve the shortcomings of manual identification in technical accuracy and subjectivity, this paper proposed an off-line signature identification method based on Support Vector Machine (SVM). A powerful feature set is collected by extracting grid features and global features of a signature picture. The method is applied for identifying different writing systems and the highest correct probability of identification arrives at 100%. The results indicated that the method is workable and can be an effectively technical support for digital forensics.

关键词： Feature extraction Support vector machines Training Kernel Digital forensics Forgery

来源：评论

学校读者我要写书评

暂无评论

network Traffic Prediction with Attention-based Spatial-Temporal Graph network

Network Traffic Prediction with Attention-based Spatial-Temp...

引用

IEEE Workshop on High Performance Switching and Routing

作者： Yufei Peng Yingya Guo Run Hao Junda Lin Department of Computer and Data Science Fuzhou University Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University

network traffic prediction plays a significant role in network management. Previous network traffic prediction methods mainly focus on the temporal relationship between network traffic, and used time series models to predict network traffic, ignoring the spatial information contained in traffic data. Therefore, the prediction accuracy is limited, especially in long-term prediction. To improve the prediction accuracy of the dynamic network traffic in the long term, we propose an Attention-based Spatial-Temporal Graph network (ASTGN) model for network traffic prediction to better capture both the temporal and spatial relations between the network traffic. Specifically, in ASTGN, we exploit an encoder-decoder architecture, where the encoder encodes the input network traffic and the decoder outputs the predicted network traffic sequences, integrating the temporal and spatial information of the network traffic data through the Spatio-Temporal Embedding module. The experimental results demonstrate the superiority of our proposed method ASTGN in long-term prediction.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Attack Intent Analysis Method Based on Attack Path Graph 2019

Attack Intent Analysis Method Based on Attack Path Graph

引用

Proceedings of the 2019 the 9th International Conference on Communication and network Security

作者： Biqiong Chen Yanhua Liu Shijin Li Xiaoling Gao College of Mathematics and Computer Science Fuzhou University Fuzhou Fujian China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou Fujian China

ISBN: (纸本)9781450376624

With the rapid development of network technology, network security problems are gradually increasing, and the network attack situation is very severe. In a complex attack scenario, timely detection of potential attack behaviors and timely identification and pre-judgment of attack intentions are important components of security risks. However, the attack behavior in the network presents complexity, multi-step and uncertainty, which brings new technical challenges to attack intent analysis. Aiming at the problem that the attack intention of multi-step complex attack is difficult to identify, this paper proposes an attack intention analysis method based on attack path graph. Firstly, aiming at the multi-step complex attack behavior analysis problem, the key asset assessment technology is used to find out the key assets in the network system, and the hypothetical attack intention is generated according to the security protection requirements of the network system. Then, it is difficult to manually construct the attack path map in the large-scale network, and the automatic generation of the attack path map is realized. Finally, a method of network attack intent identification is proposed and a calculation method of attack intent probability is designed, which improves the efficiency and accuracy of attack intent recognition.

关键词： Vulnerability key Asset Vulnerability Exploitation Attack Intention Attack Path Graph

来源：评论

学校读者我要写书评

暂无评论

A multimedia SoC performance evaluation method based on memory access model

A multimedia SoC performance evaluation method based on memo...

引用

2010 3rd International Congress on Image and Signal processing, CISP 2010

作者： Zhou, Li Sun, Tao Wei, Sufen Guo, Qi School of Information Science and Engineering Shandong University Jinan Shandong China Shandong Provincial Key Laboratory of Network Based Intelligent Computing University of Jinan Jinan Shandong China Information Engineering College Jimei University Xiamen Fujian China

ISBN: (纸本)9781424465149

More and more complex application cases bring much heavy bandwidth loading problem to SoC architecture. To design a high performance SoC system which supports large amount and high speed data processing capability, an efficient, systematic, and quick performance evaluation of SoC architecture becomes the base requirement for chip success. A novel performance evaluation method based on memory access model is presented in this paper. It can give out accurate and confident estimation result to aid both system level and module level design. It can be used to establish SoC architecture, find the performance bottleneck at the very beginning design step of chip architecture determination, and give out comparing result among different architecture definition. Both design effort and design iteration cycles could be saved. ©2010 IEEE.

关键词： System-on-chip

来源：评论

学校读者我要写书评

暂无评论

Computation Offloading Algorithm Based on Deep Reinforcement Learning and Multi-Task Dependency for Edge computing 25th

Computation Offloading Algorithm Based on Deep Reinforcemen...

引用

25th International Computer Symposium on New Trends in Computer Technologies and Applications, ICS 2022

作者： Lin, Tengxiang Lin, Cheng-Kuan Chen, Zhen Cheng, Hongju College of Computer and Data Science Fuzhou University Fuzhou350108 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China Department of Computer Science National Yang Ming Chiao Tung University Hsinchu300 Taiwan

ISBN: (纸本)9789811995811

Edge computing is an emerging promising computing paradigm that brings computation and storage resources to the network edge, significantly reducing service latency. In this paper, we aim to divide the task into several sub-tasks through its inherent interrelation, guided by the idea of high concurrency for synchronization, and then offload sub-tasks to other edge servers so that they can be processed to minimize the cost. Furthermore, we propose a DRL-based Multi-Task Dependency Offloading Algorithm (MTDOA) to solve challenges caused by dependencies between sub-tasks and dynamic working scenes. Firstly, we model the Markov decision process as the task offloading decision. Then, we use the graph attention network to extract the dependency information of different tasks and combine Long Short-term Memory (LSTM) with Deep Q network (DQN) to deal with time-dependent problems. Finally, simulation experiments demonstrate that the proposed algorithm boasts good convergence ability and is superior to several other baseline algorithms, proving this algorithm’s effectiveness and reliability. © 2022, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Depth map optimization based on adaptive chrominance image segmentation

Depth map optimization based on adaptive chrominance image s...

引用

IEEE International Conference on Communication Software and networks

作者： Zhou, Li Sun, Tao Lv, Zhong Wei, Sufen School of Information Science and Engineering Shandong University Jinan Shandong China Shandong Provincial Key Laboratory of Network Based Intelligent Computing University of Jinan Jinan Shandong China Information Engineering College Jimei University Xiamen Fujian China

ISBN: (纸本)9781612844855

The development of Free Viewpoint Video (FVV) technique is the most promising multimedia processing fields in recent years. Depth map prediction is the key method in FVV. There are many methods to estimate depth map. Among them, combined temporal and interview prediction method is the most practical which can save much data processing bandwidth, without additional hardware resources and computation time consumption. But block estimation based depth map has much block effect and prediction noises, especially at the object boundary and large continuous areas. This paper presents an adaptive chrominance image segmentation method to process the depth map prediction noises getting by combined temporal and interview prediction method. Experiment results show that this method can enhance the depth map quality efficiently with less calculation complexity, and is practical for hardware circuit realization and high performance real time processing. © 2011 IEEE.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Variable projection algorithms with sparse constraint for separable nonlinear models

引用

Control Theory and Technology 2024年第1期22卷 135-146页

作者： Hui-Lang Xu Guang-Yong Chen Si-Qing Cheng Min Gan Jing Chen College of Computer and Data Science Fuzhou UniversityFuzhou350116FujianChina Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou UniversityFuzhou350116FujianChina Key Laboratory of Intelligent Metro of Universities in Fujian Fuzhou UniversityFuzhou350116FujianChina Engineering Research Center of Big Data Intelligence Ministry of EducationFuzhou UniversityFuzhou350116FujianChina School of Science Jiangnan UniversityWuxi214122JiangsuChina

Separable nonlinear models are widely used in various fields such as time series analysis, system modeling, and machine learning, due to their flexible structures and ability to capture nonlinear behavior of data. However, identifying the parameters of these models is challenging, especially when sparse models with better interpretability are desired by practitioners. Previous theoretical and practical studies have shown that variable projection (VP) is an efficient method for identifying separable nonlinear models, but these are based on \(L_2\) penalty of model parameters, which cannot be directly extended to deal with sparse constraint. Based on the exploration of the structural characteristics of separable models, this paper proposes gradient-based and trust-region-based variable projection algorithms, which mainly solve two key problems: how to eliminate linear parameters under sparse constraint;and how to deal with the coupling relationship between linear and nonlinear parameters in the model. Finally, numerical experiments on synthetic data and real time series data are conducted to verify the effectiveness of the proposed algorithms.

关键词： Variable projection(VP) Non-smooth constraint Separable nonlinear models

来源：评论

学校读者我要写书评

暂无评论

Scale‐wise interaction fusion and knowledge distillation network for aerial scene recognition

引用

CAAI Transactions on Intelligence Technology 2023年第4期8卷 1178-1190页

作者： Hailong Ning Tao Lei Mengyuan An Hao Sun Zhanxuan Hu Asoke K.Nandi School of Computer Science and Technology Xi'an University of Posts and TelecommunicationsShaanxi Key Laboratory of Network Data Analysis and Intelligent ProcessingXi'anChina Xi'an Key Laboratory of Big Data and Intelligent Computing Xi'anChina School of Electronic Information and Artificial Intelligence Shaanxi University of Science and TechnologyXi'anChina School of Computer Central China Normal UniversityWuhanChina Department of Electronic and Electrical Engineering Brunel University LondonLondonUK Xi'an Jiaotong University Xi'anChina

Aerial scene recognition(ASR)has attracted great attention due to its increasingly essential *** of the ASR methods adopt the multi‐scale architecture because both global and local features play great roles in ***,the existing multi‐scale methods neglect the effective interactions among different scales and various spatial locations when fusing global and local features,leading to a limited ability to deal with challenges of large‐scale variation and complex background in aerial scene *** addition,existing methods may suffer from poor generalisations due to millions of to‐belearnt parameters and inconsistent predictions between global and local *** tackle these problems,this study proposes a scale‐wise interaction fusion and knowledge distillation(SIF‐KD)network for learning robust and discriminative features with scaleinvariance and background‐independent *** main highlights of this study include two *** the one hand,a global‐local features collaborative learning scheme is devised for extracting scale‐invariance features so as to tackle the large‐scale variation problem in aerial scene ***,a plug‐and‐play multi‐scale context attention fusion module is proposed for collaboratively fusing the context information between global and local *** the other hand,a scale‐wise knowledge distillation scheme is proposed to produce more consistent predictions by distilling the predictive distribution between different scales during *** experimental results show the proposed SIF‐KD network achieves the best overall accuracy with 99.68%,98.74%and 95.47%on the UCM,AID and NWPU‐RESISC45 datasets,respectively,compared with state of the arts.

关键词： deep learning image analysis image classification information fusion

来源：评论

学校读者我要写书评

暂无评论

Heterophilic Graph Representation Learning Based on Multi-Order information Extraction and High and Low Pass Filters 10

Heterophilic Graph Representation Learning Based on Multi-Or...

引用

10th IEEE Smart World Congress, SWC 2024

作者： Wu, Ling Li, Xinyu Yang, Yingjie Guo, Kun Zhang, Qishan Fuzhou University College of Computer and Data Science Fuzhou China Fujian Key Laboratory of Network Computing and Intelligent Information Processing China De Montfort University School of Computer Science and Informatics Leicester United Kingdom Shanghai International Studies University College of Economics and Humanities Shanghai China

ISBN: (纸本)9798331520861

Real-world networks can be divided into homophilic and heterophilic graphs. Significantly, many nodes tend to be heterophilic in a homophilic graph. Graph representation learning in heterophilic graphs has attracted considerable significance in recent years as it breaks the homophily assumption and achieves higher-quality graph embeddings. However, existing heterophilic graph representation learning methods often mix attribute and topological information, neglecting the mutual exclusion between attribute information and topological information. Furthermore, algorithms in heterogeneous graphs usually rely on specific matrix structures to capture high-order information, which may restrict the applicability of these methods. To tackle these issues, this paper proposes a GNN-based strategy for Heterophilic graph Representation Learning based on Multi-order information extraction and High and Low pass filters (HRLMHL). First, we designed two relatively independent modules to learn attribute information and topological information, respectively, to address the issue of mismatch. Second, we built a multi-order information extraction module to extract multi-order similarity features, thereby achieving the learning of high-order graph information. Experiments on real datasets show that the node classification accuracy is superior to that of the state-of-the-art methods on most datasets. © 2024 IEEE.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：