Now showing items 1-6 of 6

    • Set Function Optimization 

      Wu, Weili; Zhang, Z.; Du, Dingzhu (Operations Research Society of China, 2018-12-17)
      This article is an introduction to recent development of optimization theory on set functions, the nonsubmodular optimization, which contains two interesting results, DS (difference of submodular) functions decomposition ...
    • Maximisation of the Number of β-View Covered Targets in Visual Sensor Networks 

      Guo, L.; Li, D.; Wang, Y.; Zhang, Z.; Tong, Guangmo; Wu, Weili; Du, Dingzhu (Inderscience Enterprises Ltd., 2019-03-24)
      In some applications using visual sensor networks (VSNs), the facing directions of targets are bounded. Therefore existing full-view coverage (all the facing directions of a target constitutes a disk) is not necessary. We ...
    • Quality of Barrier Cover with Wireless Sensors 

      Wu, Weili; Zhang, Zhao; Gao, Chuangen; Du, Hai; Wang, Hua; Du, Dingzhu (Inderscience Enterprises Ltd, 2019-04-01)
      A set of wireless sensors is called a barrier cover if they can monitor the boundary of an area so that an intruder cannot enter the area without being found by any sensor. The quality of a barrier cover is the shortest ...
    • Marginal Gains to Maximize Content Spread in Social Networks 

      Yang, W.; Ma, J.; Li, Y.; Yan, R.; Yuan, Jing; Wu, Weili; Li, D. (Institute of Electrical and Electronics Engineers Inc., 2019-05-06)
      The growing importance of social network for sharing and spreading various contents is leading to the changes in the way of information diffusion. To what extent can social content be diffused highly depends on the size ...
    • Viral Marketing of Online Game by DS Decomposition In Social Networks 

      Gao, C.; Du, H.; Wu, Weili; Wang, H.
      In social networks, the spread of influence has been studied extensively, but most efforts in existing literature are made on the product used by a single person. This paper attempts to address the product which is used ...
    • A Random Algorithm for Profit Maximization in Online Social Networks 

      Chen, T.; Liu, B.; Liu, W.; Fang, Q.; Yuan, Jing; Wu, Weili
      Given a social network G and a positive integer k, the influence maximization problem seeks for k nodes in G that can influence the largest number of nodes. This problem has found important applications, and a large amount ...