Many classic visual monocular SLAM systems have been developed over the past decades, however, most of them will fail when dynamic scenarios dominate. DM-SLAM is proposed for handling dynamic objects in environments based on ORB-SLAM. The article mainly concentrates on two aspects. Firstly, DLRSAC is proposed to extract static features from the dynamic scene based on awareness of nature difference between motion and static, which is integrated into initialization of DM-SLAM. Secondly, we design candidate map points selection mechanism based on neighborhood mutual exclusion to balance the accuracy of tracking camera pose and system robustness in motion scenes. Finally, we conduct experiments in the public dataset and compare DM-SLAM with ORB-SLAM. The experiments verify the superiority of the DM-SLAM.

Nowadays, we use social networks such as Twitter, Facebook, WeChat and Weibo as means to communicate with each other and get to know others. Gradually social networks has become indispensable in our everyday life, and we cannot absolutely imagine what the daily life would be like without social networks. Through social networks, we can access friends' opinions and behaviors easily and are influenced by them in turn. Thus, an effective algorithm to find the top-K influential nodes (the problem of influence maximization) in the social network is critical for various downstream tasks such as viral marketing, anticipating natural hazards, reducing gang violence, public opinion supervision etc. Solving the problem of influence maximization in real-world propagation scenarios often involves estimating influence strength (influence probability between two nodes), which cannot directly observed. To estimate influence strength, conventional approaches propose various humanly-devised rules to extract features of user interactions, the effectiveness of which heavily depends on domain expert knowledge. Besides, they are often applicable for special scenarios or specific diffusion models. Consequently, they are difficult to be generalized into different scenarios, diffusion models and even domains. Inspired by the powerful ability of neural networks in the field of representation learning, we design a deep hierarchical network embedding model HGE to map nodes (with attributes) into latent space automatically. In general, HGE takes an attributed social network as the input for learning latent network representation of each node, incorporating hierarchical community structure, node attributes and general network structure into a unified deep generative framework. Then, with the leaned latent representation of each node, we propose a HGE-GA algorithm to predict influence strength and compute the top-K influential nodes through a greedy-based maximization algorithm. Extensive experiments on real-world attributed networks demonstrate the outstanding superiority of the proposed HGE model and HGE-GA algorithm compared with the state-of-the-art methods, verifying the effectiveness of the proposed model and algorithm.