Recently, evolutionary multi-tasking (EMT) has been proposed as a new evolutionary search paradigm that op-timizes multiple problems simultaneously. Due to the knowledge transfer across optimization tasks occurs along the evolutionary search process, EMT has been demonstrated to outperform the traditional single-task evolutionary search algorithms on many complex optimization problems, such as multimodal continuous optimization problems, NP-hard combinatorial optimization problems, and constrained optimization problems. Today, EMT has attracted lots of attentions, and many EMT algorithms have been proposed in the literature. The explicit EMT algorithm (EEMTA) is a recent proposed new EMT algorithm. In contrast to most of existing EMT algorithms, which employ a single population using unified space and common search operators for solving multiple problems, the EEMTA uses multiple populations which possess problem-specific solution representations and search mechanisms for different problems in evolutionary multi-tasking, which thus could lead to enhanced optimization performance. However, the original EEMTA was proposed for solving only two tasks. As knowledge transfer from inappropriate tasks may lead to negative effect on the evolutionary optimization process, additional designs of identifying task pairs for knowledge transfer is necessary in EEMTA for evolutionary multi-tasking with tasks more than two. To the best of our knowledge, there is no research effort has been conducted on this issue. Keeping this in mind, in this paper, we present a preliminary study on the task selection in EEMTA for many-task optimization. As task similarity may lose to capture the usefulness between tasks in evolutionary search, instead of using similarity measures for task selection, here we propose a credit assignment approach for selecting proper task to conduct knowledge transfer in explicit evolutionary many-tasking. The proposed approach is based on the feedbacks from the transferred solutions across tasks, which is adaptively updated along the evolutionary search. To confirm the efficacy of the proposed method, empirical studies on the many-task optimization problem, which consists of 7 commonly used optimization benchmarks, have been presented and discussed.

With the ever-increasing demand of location-based services (LBS), Wi-Fi based indoor localization has attracted increasing attentions. This paper is dedicated to addressing two critical problems: a) signal fluctuation due to unforeseeable interferences during the offline training phase; b) insufficient real-time signal measurements at certain point due to the target movement during the online localization phase. Specifically, we first give an intensive analysis on the characteristics of received signal strength indicator (RSSI) in indoor environments with respect to both time-domain and frequency-domain. Then, inspired from the advantages of Stacked Denosing Autoencoder (SDA) in terms of recognizing and stabilizing the original features, we propose a dual-band SDA (DBSDA) based model to create more distinguishable fingerprints by extracting the RSSI features at each reference point (RP). In this model, both 2.4GHz and 5GHz RSSIs are exploited to train the SDA neural network and construct the offline fingerprint database. On this basis, we propose a data generation scheme, which is designed based on the observation that environmental interferences are similar in proximate spots. So, the designed scheme can generate signal values at certain point based on its nearby RSSI measurements when there are not enough inputs for the SDA neural network. Finally, we propose a locally weighted liner regression (LWLR) based method to predict the coordinate of the target. For performance evaluation, we implement the system prototype and give comprehensive experiments in real-world environments, which demonstrate the effectiveness and robustness of the proposed solutions.