Wu, Weili
Permanent URI for this collectionhttps://hdl.handle.net/10735.1/7069
Weili Wu Is a Professor of Computer Science. Her research interests include:
- Big Data Management and Analysis
- Social Networks
- Database Systems
- Wireless Sensor Networks
- Data Mining
- Spatial Data Mining
- Parallel and Distributed Systems
- Algorithm Design and Analysis
- Bioinformatics
Browse
Browsing Wu, Weili by Author "Du, Dingzhu"
Now showing 1 - 3 of 3
- Results Per Page
- Sort Options
Item Maximisation of the Number of β-View Covered Targets in Visual Sensor Networks(Inderscience Enterprises Ltd., 2019-03-24) Guo, L.; Li, D.; Wang, Y.; Zhang, Z.; Tong, Guangmo; Wu, Weili; Du, Dingzhu; 56851698 (Wu, W); 288884264 (Du, D); Tong, Guangmo; Wu, Weili; Du, DingzhuIn 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 propose a novel model called β-view coverage model through which only necessary facing directions of a target are effectively viewed. This model uses much fewer cameras than those used by full-view coverage model. Based on β-view coverage model, a new problem called β-view covered target maximisation (BVCTM) problem is proposed to maximise the number of β-view covered targets given some fixed and freely rotatable camera sensors. We prove its NP-hardness and transform it into an Integer Linear Programming problem equivalently. Besides, a (1 - e - 1 )-factor approximate algorithm and a camera-utility based greedy algorithm are given for this problem. Finally, we conduct many experiments and investigate the influence of many parameters on these two algorithms. © 2019 Inderscience Enterprises Ltd.Item Quality of Barrier Cover with Wireless Sensors(Inderscience Enterprises Ltd, 2019-04-01) Wu, Weili; Zhang, Zhao; Gao, Chuangen; Du, Hai; Wang, Hua; Du, Dingzhu; Wu, Weili; Du, DingzhuA 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 length of path along which an intruder can enter the area from outside. We study four problems, in this paper, related to the quality of the barrier cover and give their computational complexity and algorithmic solutions.Item Set Function Optimization(Operations Research Society of China, 2018-12-17) Wu, Weili; Zhang, Z.; Du, Dingzhu; Wu, Weili; Du, DingzhuThis 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 and sandwich theorem, together with iterated sandwich method and data-dependent approximation. Some potential research problems will be mentioned. © 2018, The Author(s).