Computational Intelligence and Security

TL;DR: The qualitative and quantitative results prove the efficiency of SSA and MSSA and demonstrate the merits of the algorithms proposed in solving real-world problems with difficult and unknown search spaces.

TL;DR: The MFO algorithm is compared with other well-known nature-inspired algorithms on 29 benchmark and 7 real engineering problems and the statistical results show that this algorithm is able to provide very promising and competitive results.

TL;DR: In the proposed algorithm, a scalarization approach, termed angle-penalized distance, is adopted to balance convergence and diversity of the solutions in the high-dimensional objective space, and reference vectors are effective and cost-efficient for preference articulation, which is particularly desirable for many-objective optimization.

TL;DR: A new database of aerial images provided as a tool to benchmark automatic target recognition algorithms in unconstrained environments and gives the performance of baseline algorithms on this dataset, for different settings of these algorithms, to illustrate the difficulties of the task and provide baseline comparisons.

TL;DR: The implementation of Tate pairing is compared in the same platform with other Java program of the standard cryptosystems, i.e., RSA cryptos system and elliptic curve cryptosSystem (ECC).

TL;DR: Examining the effect of transforming a right-censored outcome into binary, continuous, and censored-aware representations on radiomics feature selection and subsequent prediction of overall survival and relapse-free survival of patients with oropharyngeal cancer found including a radiomic signature results in better prediction than using only clinical data.