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

作者： Li, Dan Zhao, Lichao Cheng, Qingfeng Lu, Ning Shi, Wenbo School of Computer Science and Engineering Northeastern University Shenyang China State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China School of Computer Science and Technology Xidian University Xi'an China School of Computer and Communication Engineering Northeastern University at Qinhuangdao Qinhuangdao China

The number of malware has exploded due to the openness of the Android platform, and the endless stream of malware poses a threat to the privacy, tariffs, and device of mobile phone users. A novel Android mobile malware detection system is proposed, which employs an optimized deep convolutional neural network to learn from opcode sequences. The optimized convolutional neural network is trained multiple times by the raw opcode sequences extracted from the decompiled Android file, so that the feature information can be effectively learned and the malicious program can be detected more accurately. More critically, the k-max pooling method with better results is adopted in the pooling operation phase, which improves the detection effect of the proposed method. The experimental results show that the detection system achieved the accuracy of 99%, which is 2%-11% higher than the accuracy of the machine learning detection algorithms when using the same data set. It also ensures that the indicators, such as F1-score, recall, and precision, are maintained above 97%. Based on the detection system, a multi–data set comparison experiment is carried out. The introduced k-max pooling is deeply studied, and the effect of k of k-max pooling on the overall detection effect is observed. © 2019 John Wiley & Sons, Ltd.

关键词： Android malware

来源：评论

学校读者我要写书评

暂无评论

City-level geolocation algorithm of network entities based on landmark clustering

City-level geolocation algorithm of network entities based o...

引用

International Conference on advanced Communication Technology (ICACT)

作者： Guang Zhu Xiangyang Luo Fenlin Liu Fan Zhao State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou Science and Technology Institute Zhengzhou China

For the existing network entity geolocation algorithms based on the delay measurement are usually suffer from the inflation and jitter of the network delay, a new algorithm of city-level geolocation based on landmark clustering is proposed in this paper. According to the feature of the delays tend to be similar among the neighboring network entities generally, city-level network entities geolocation algorithm based on landmark clustering is given. In the proposed algorithm, the city-level landmarks are divided into several clusters based on the "delay similarity" principle to filters out the high-reliability landmarks for improving the precision of city-level geolocation algorithm, the minimal relative delay between cluster and target is calculated based on the minimal relative delay, and the region of this cluster is taken as the estimation of target's location. The rationality of the delay clustering, feasibility of the proposed algorithm, and experimental results show that the proposed algorithm reduces effectively the delay influence on the IP geolocation algorithms, and the geolocation accuracy is higher than the classic GeoPing algorithm.

关键词： Delays Geology Clustering algorithms IP networks Cities and towns Estimation Reliability

来源：评论

学校读者我要写书评

暂无评论

A Method of Multiple Encryption and Sectional Encryption Protocol Reverse engineering

A Method of Multiple Encryption and Sectional Encryption Pro...

引用

International Conference on Computational Intelligence and Security

作者： Wei Lin Jinlong Fei Yuefei Zhu Xiaolong Shi State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou Henan P.R. China

ISBN: (纸本)9781479974351

Research on unknown network protocol reverse engineering is of great significance in many network security applications. Currently most of methods are limited in analyzing plain-text protocols, and a few of method can partly analyze the encryption protocol which is powerless for multiple encryption protocol or sectional encryption protocol. This paper proposes a method of encrypted protocol reverse engineering based on dynamic taint analysis. The method uses Pin to record executed instructions, and then conducts off-line analysis of the data dependencies to build two taint propagation graphs on instruction and function level, then recover the decryption process. The decrypted plaintext can be located due to the decryption process feature. And then, the format of protocol can be parsed. Experiments show that the method can accurately locate the decrypted protocol data of the multiple encryption and sectional encryption protocol, and restore the original format.

关键词： Protocols Encryption Flow graphs Memory management Reverse engineering

来源：评论

学校读者我要写书评

暂无评论

A Cross-Platform Instant Messaging User Association Method Based on Spatio-temporal Trajectory 8th

A Cross-Platform Instant Messaging User Association Method B...

引用

8th International Conference on Artificial Intelligence and Security , ICAIS 2022

作者： Zhou, Pei Luo, Xiangyang Du, Shaoyong Li, Lingling Yang, Yang Liu, Fenlin School of Cyber Science and Engineering Zhengzhou University Zhengzhou450000 China State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou450000 China State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China School of Intelligent Engineering Zhengzhou University of Aeronautics Zhengzhou450000 China School of Computing and Information Systems Singapore Management University Singapore188065 Singapore

ISBN: (纸本)9783031067600

The current research on cross-platform instant messaging user association is mainly divided into two categories: based on user attributes and based on user behavior. Methods based on user attributes mainly identify users through multiple attributes such as user name and multi-platform user information association based on cell phone number, but user association is not possible when multi-platform user information is inconsistent and users do not grant their address book permissions. Methods based on user behavior mainly calculate the similarity between user trajectories features such as geographic location frequency and co-occurrence, but this method lacks the user’s information, which leads to the inability to fully excavate the sequential features of the trajectory and affects the accuracy of trajectory matching. In order to solve this problem, this paper proposes a cross-platform instant messaging user association algorithm based on temporal trajectories (CPTrajst). We firstly place probes in the area where the target may appear so as to obtain user information, gets user trajectory, then processes the trajectory and performs two trajectory matches, finally associate users of different platforms whose trajectories match, thus increasing the accuracy and reliability of cross-platform instant messaging user association. We conducts specific experiments for users of WeChat and Momo, the most commonly used instant messengers in China. The results show that we can achieve reliable association for these two types of instant messaging users and the user association accuracy can reach 99.5%, which is better than the existing user association algorithms based on trajectory matching. © 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Trajectories

来源：评论

学校读者我要写书评

暂无评论

IP city-level geolocation based on the PoP-level network topology analysis

IP city-level geolocation based on the PoP-level network top...

引用

International Conference on Information Communication and Management (ICICM)

作者： Siqi Liu Fenlin Liu Fan Zhao Lixiang Chai Xiangyang Luo State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou Science and Technology Institute Zhengzhou China

ISBN: (纸本)9781509034963

In view of that the reliability of existing typical IP city-level geolocation approaches are limited to the delay measurement accuracy, IP targets reachability and other factors, this paper proposed an IP city-level geolocation approach based on the PoP-level (Point of Presence) network analysis. First, the “low-high-low” distribution characteristics of the one-hop-delay among network nodes in different cities are revealed. The network connections in the IP targets' cities are obtained by partitioning the probe paths based on one-hop-delay. Secondly, the PoP-level network in these cities are analyzed by extracting closely connected network nodes, and PoP city-level location are determined by landmarks contained. Finally, the core routers in these PoPs are selected as the city core routers and used to achieve IP targets city-level geolocation. The experimental results on 4980 IP targets in Henan province of China show that: the average accuracy of the proposed approach is 97.2%, which is much higher than that of the existing typical city-level geolocation approaches based on IP databases or delay measurement. At the same time, some of the IP targets which are not reachable can also achieve a reliable city-level geolocation by this approach.

关键词： IP networks Geology Probes Urban areas Delays Network topology Databases

来源：评论

学校读者我要写书评

暂无评论

An Algorithm of City-Level Landmark Mining Based on Internet Forum

An Algorithm of City-Level Landmark Mining Based on Internet...

引用

International Conference on Network-Based Information Systems (NBIS)

作者： Guang Zhu Xiangyang Luo Fenlin Liu Jingning Chen State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou Science and Technology Institute Zhengzhou China

Density and accuracy of network entity landmarks are an important foundation of IP geolocation. For the existing problems of the limited quantity and low reliability of landmarks mined by current landmark mining methods, an algorithm of city-level landmark mining based on Internet forum is proposed in this paper. Firstly, the basic principle of Web-Based landmark mining methods and their existing flaws are analyzed, and then according to existing a huge amount of individual IP addresses in the Internet forums, a technical framework of network entity landmark mining based on the Internet forum is given, Next, the Internet forum selection strategy, IP addresses extraction, IP addresses screening and other major processing steps are described respectively for two major parts of the framework, including landmark extraction algorithm and landmark evaluation algorithm. The classic GeoTrack, a network entity geolocation algorithm, is improved and used for evaluating the candidate landmarks. Finally, the feasibility of our framework and algorithm are studied from 2 aspects: forum selection strategy, and Forum-Based landmark mining algorithm. Experimental results based on 27 Internet forums of 3 types forums in 3 cities show that compared with the classic Web-Based landmark mining methods, the proposed algorithm can not only mine huge amounts of city-level landmarks, but also improve the city-level network entity geolocation accuracy obviously.

关键词： IP networks Geology Web servers Reliability Data mining HTML

来源：评论

学校读者我要写书评

暂无评论

An Embedded FPGA Operating System Optimized for Vision computing (Abstract Only) 15

An Embedded FPGA Operating System Optimized for Vision Compu...

引用

Proceedings of the 2015 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays

作者： Zhilei Chai Jin Yu Zhibin Wang Jie Zhang Haojie Zhou Jiangnan University Wuxi China State Key Laboratory of Mathematical Engineering and Advanced Computing Wuxi China

ISBN: (纸本)9781450333153

Although FPGA's power and performance advantages were recognized widely, designing applications on FPGA-based systems is traditionally a task undertaken by hardware experts. It is significant to allow application-level programmers with less system-level but more algorithm knowledge to realize their applications conveniently on FPGAs. In this paper, an embedded FPGA operating system is proposed to facilitate application-level programmers to use FPGAs. Firstly, it builds specific I/Os and optimizes bus interconnection among I/Os, DDR memory, user IPs etc within the FPGA for vision computing. Secondly, it manages resources of the FPGA such as I/Os, DDR memory, communication etc, frees users from low-level details. Thirdly, it schedules tasks (IPs) executed on the FPGA dynamically in runtime, which makes the FPGA multiplexed when necessary. After porting the FPGA operating system to different FPGA platforms and implementing vision algorithms based on that, it shows the FPGA operating system is able to simplify algorithm development on FPGA platforms and improve portability of user applications. Furthermore, implementation results of several popular vision algorithms show the FPGA operating system is efficient and effective for vision computing. Finally, experimental results shows that for multiple algorithms requiring more FPGA resources, runtime task scheduling of multiple IPs is more efficient than a fixed IP when the SoC of FPGA is considered.

关键词： vision computing operating systems portability of applications application programmers fpgas

来源：评论

学校读者我要写书评

暂无评论

The optimization of IF-conversion in whole function vectorization

引用

Research Journal of Applied Sciences, engineering and Technology 2014年第1期8卷 64-68页

作者： Pang, Jianmin Yue, Feng Shan, Zheng Dai, Chao Jin, Jiuzhen State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou 450001 China

In order to get better performance, lots of optimization methods are used in code transformation. When migrating SPMD to multi-core platform, vectorization is one key optimization to improve performance. Control flow is the main challenge for vectorization and IF-conversion is usually used to transform control flow into data flow. In most researches, after IF-conversion both the two branch vector codes have to be executed even the predications in scalar lane for one branch are all false. This study proposes code bypass technology to improve this situation in whole function vectorization of SSA from. The region of consecutive instructions guarded by the same predicate is first identified. Then detecting operation is added to identify if predications in scalar lane are all false and a jump operation followed to bypass the consecutive instructions region. For loop structure, we add loop mask to indicate which lane is not alive in loop which could help to treat iteration in loop. The experiment shows our method could improve performance by 6.8%. © Maxwell Scientific Organization, 2014.

关键词： Branch IF-conversion Loop Optimization Vectorization

来源：评论

学校读者我要写书评

暂无评论

A Selection Strategy for Network Security Defense Based on a Time Game Model

A Selection Strategy for Network Security Defense Based on a...

引用

Digital Society and Intelligent Systems (DSInS), International Conference on

作者： Pengyu Sun Hengwei Zhang Junqiang Ma Chenwei Li Yan Mi Jindong Wang State Key Laboratory of Mathematical Engineering and Advanced Computing Key Laboratory of Information Security of Henan Provincial Zhengzhou China

ISBN: (纸本)9781665406314

Current network assessment models often ignore the impact of attack-defense timing on network security, making it difficult to characterize the dynamic game of attack-defense effectively. To effectively manage the network security risks and reduce potential losses, in this article, we propose a selection strategy for network defense based on a time game model. By analyzing the attack-defense status by analogy with the SIR infectious disease model, construction of an optimal defense strategy model based on time game, and calculation of the Nash equilibrium of the the attacker and the defender under different strategies, we can determine an optimal defense strategy. With the Matlab simulation, this strategy is verified to be effective.

关键词： Analytical models Heuristic algorithms Games Network security Numerical simulation Nash equilibrium Real-time systems

来源：评论

学校读者我要写书评

暂无评论

A framework of adaptive steganography resisting JPEG compression and detection

A framework of adaptive steganography resisting JPEG compres...

引用

作者： Zhang, Yi Luo, Xiangyang Yang, Chunfang Ye, Dengpan Liu, Fenlin State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou450001 China Zhengzhou Science and Technology Institute Zhengzhou450001 China Key Laboratory of Science and Technology on Information Assurance Beijing100072 China School of Computer Wuhan University Wuhan43000 China

Current typical adaptive steganography algorithms take the detection resistant capability into account adequately but usually cannot extract the embedded secret messages correctly when stego images suffer from compression attack. In order to solve this problem, a framework of adaptive steganography resisting JPEG compression and detection is proposed. Utilizing the relationship between Discrete Cosine Transformation (DCT) coefficients, the domain of messages embedding is determined;for the maximum of the JPEG compression resistant ability, the modifying magnitude of different DCT coefficients caused by messages embedding can be determined;in order to ensure the completely correct extraction of embedded messages after JPEG compression, error correct codes are used to encode the messages to be embedded;on the basis of the current distortion functions, the distortion value of DCT coefficients corresponding to the modifying magnitude in the embedding domain can be calculated;to improve the detection resistant ability of the stego images and realize the minimum distortion embedding, syndrome-trellis codes are used to embed the encoded messages into the DCT coefficients that have a smaller distortion value. Based on the proposed framework, an adaptive steganography algorithm resisting JPEG compression and detection is designed, which utilizes the relationship between coefficients in a DCT block and the means of that in three adjacent DCT blocks. The experimental results that demonstrate the proposed algorithm not only has a good JPEG compression resistant ability but also has a strong detection resistant performance. Comparing with current J-UNIWARD steganography under quality factor 85 of JPEG compression, the extraction error rates without pre-compression decrease from about 50% to nearly 0, while the stego images remain a good detection resistant ability comparing with a typical robust watermarking algorithm, which shows the validity of the proposed framework. Copyrigh

关键词： Steganography

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：