AIGCrank:A new adaptive algorithm for identifying a set of influential spreaders in complex networks based on gravity centrality

The influence maximization problem in complex networks asks to identify a given size of seed spreaders set to maximize the number of expected influenced nodes at the end of the spreading process.This problem finds many practical applications in numerous areas such as information dissemination,epidemic immunity,and viral marketing.However,most existing influence maximization algorithms are limited by the“rich-club”phenomenon and are thus unable to avoid the influence overlap of seed spreaders.This work proposes a novel adaptive algorithm based on a new gravity centrality and a recursive ranking strategy,named AIGCrank,to identify a set of influential seeds.Specifically,the gravity centrality jointly employs the neighborhood,network location and topological structure information of nodes to evaluate each node's potential of being selected as a seed.We also present a recursive ranking strategy for identifying seed nodes one-byone.Experimental results show that our algorithm competes very favorably with the state-of-the-art algorithms in terms of influence propagation and coverage redundancy of the seed set.

Data-driven sensor placement for efficient thermal field reconstruction

Complete temperature field estimation from limited local measurements is widely desired in many industrial and scientific applications of thermal engineering. Since the sensor configuration dominates the reconstruction performance, some progress has been made in designing sensor placement methods. But these approaches remain to be improved in terms of both accuracy and efficiency due to the lack of comprehensive schemes and efficient optimization algorithms. In this work, we develop a datadriven sensor placement framework for thermal field reconstruction. Specifically, we first tailor the low-dimensional model from the prior thermal maps to represent the high-dimensional temperature distribution states by virtue of proper orthogonal decomposition technique. Then, on such subspace, a recursive greedy algorithm with determinant maximization as the objective function is developed to optimize the sensor placement configuration. Furthermore, we find that the same sensor configuration can be yielded faster by the standard procedures of column-pivoted QR factorization, which allows concise software implementation with readily available function packages. When the sensor locations are determined, we advocate using the databased closed-form estimator to minimize the reconstruction error. Real-time thermal monitoring on the multi-core processor is employed as the case to demonstrate the effectiveness of the proposed methods for thermal field reconstruction. Extensive evaluations are conducted on simulation or experimental datasets of three processors with different architectures. The results show that our method achieves state-of-the-art reconstruction performance while possessing the lowest computational complexity when compared with the existing methods.