Influence maximization (IM) is fundamental to social network applications. It aims to find multiple seed nodes with an enormous impact cascade to maximize these nodes’ spread of influence in social networks. Traditional methods for solving influence maximization of the social network, such as the distance method, greedy method, and PageRank method, may suffer from issues of low calculation accuracy and high computational cost. In this paper, we propose a new bacterial foraging optimization algorithm to solve the IM problem based on the complete-three-layer-influence (CTLI) evaluation model. In this algorithm, a novel grid-based reproduction strategy and a direction-adjustment-based chemotaxis strategy are devised to enhance the algorithm’s searchability. Finally, we conduct comprehensive experiments on four social network cases to verify the effectiveness of the proposed algorithm. The experimental results show that our proposed algorithm effectively solves the social network’s influence maximization.
Small object detection remains a challenge in computer vision due to low pixel occupancy, feature scarcity, and susceptibility to background interference. Conventional single-backbone networks often struggle to balance deep semantic extraction with the preservation of shallow details. Deep down-sampling can lead to the loss of edge and texture information, while late-stage fusion may fail to recover these details effectively. To address these limitations, this paper proposes a Cross-Stage Fusion Network with a Dual Backbone (CSF-Net). Our network employs an asymmetric design: a shallow backbone maintains a higher resolution to preserve fine-grained details, while a deep backbone extracts contextual semantics. These two streams interact via progressive cross-stage connections, facilitating the early fusion of small object information. Experiments on the Micro RGB UAV dataset indicate that CSF-Net improves the mAP of the YOLOV8 baseline from 62.8% to 67.0%, validating the effectiveness of the proposed architecture in enhancing detection performance for small targets.
In the big data environment, MapReduce could be adopted to improve the efficiency of iterative algorithm on massive data through running the iterative algorithm on larger PC-cluster. However, it is inefficient if the entire data has to be re-iterated when new data is introduced. In this paper, the incremental iterative computing model (I2M) based on the incremental data and original iterative results is proposed. Then, the MapReduce and I2M based descendant query, PageRank, and K-means, are enumerated. Finally, incremental iterative computing framework (I2F) is implemented by extending HaLoop to support incremental iterative computing. A series of test cases are designed to evaluate I2F on functionality, performance, and cost of incremental iteration. The incremental iterative model proposed in this paper can adapt many iterative algorithms, and promotes the application and optimization of iterative algorithm in the big data environment.