In this paper, several infinite families of codes over the extension of non-unital non-commutative rings are constructed utilizing general simplicial complexes. Thanks to the special structure of the defining sets, the principal parameters of these codes are characterized. Specially, when the employed simplicial complexes are generated by a single maximal element, we determine their Lee weight distributions completely. Furthermore, by considering the Gray image codes and the corresponding subfield-like codes, numerous of linear codes over Fqare also obtained, whereqis a prime power. Certain conditions are given to ensure the above linear codes are (Hermitian) self-orthogonal in the case ofq= 2; 3; 4. It is noteworthy that most of the derived codes over Fqsatisfy the Ashikhmin-Barg’s condition for minimality. Besides, we obtain two infinite families of distanceoptimal codes over Fqwith respect to the Griesmer bound. By puncturing the Gray image codes and subfield-like codes, several classes of projective codes are presented.

Properly configuring mutation strategies and their associated parameters in DE is inherently a difficult issue. In this paper, an adaptive multi-subpopulation based differential evolution has been proposed and employed for global optimization. In the proposed method, the entire population is firstly adaptively divided at each generation according to a devised population division strategy, which try to partition the population into multiple subpopulations according to the potential of individuals. Then, a suitable mutation strategy along with an appropriate parameter control scheme is introduced and assigned to each subpopulation for evolution, with the purpose of delivering a balanced evolution. The performance of proposed algorithm has been evaluated on CEC'2015 benchmark functions and compared with related methods. The results show that our method can outperform related methods to be compared.

This paper proposes an adaptive differential evolution algorithm with mutation strategy pools for global optimization. In the proposed method, the mutation strategy pool mechanism is devised to supply appropriate mutation strategy for different individuals in the population. Further, a mutation strategy, called DE/current-to-wb/l, has also been designed and employed in the mutation strategy pool. The performance of the proposed algorithm has been evaluated on CEC'2014 benchmark functions and compared with related methods. Experimental results show that the proposed algorithm has a good performance and outperforms related algorithms.

This paper proposes a competition-cooperation algorithm with bidirectional multi-population local search and local hypervolume-based strategy (CCLS) to solve multi-objective optimization problems. In the proposed method, a bidirectional multi-population local search is devised and used to speed up convergence while keeping rich population diversity. It searches along two completely opposite directions, and adopts a unique strategy to perform replacement operation. Furthermore, a local hypervolume-based strategy has been designed. It combines Pareto dominance relation with hypervolume indicator to maintain population diversity. The proposed algorithm is applied to the widely used bi-objective and tri-objective test problems, and compared with related methods. The results demonstrate that the proposed algorithm generally outperforms related methods.

STT-MRAM has been considered as one of the most promising nonvolatile memory candidates in the next-generation of computer architecture. However, the read reliability and dynamic write power concerns greatly hinder its practical application. In this paper, we propose a synergistic solution, namely pseudo-differential sensing (PDS), to jointly address these two concerns. Three techniques, including cell cluster, asymmetric sensing amplifier (ASA) and self-error-detection-correction (SEDC), are proposed to implement the PDS concept. Our experimental results show that the PDS scheme with the 3T3MTJ cell cluster can reduce the area (~21.7%) and write power (~25.6%) of the differential sensing (DS) scheme while improve the read reliability (read margin, ~35.6%) of the typical sensing (TS) scheme for a 16 Mbit cache. Furthermore, the PDS scheme with the 1T3MTJ cell cluster can outperform both the TS and DS schemes in terms of area (~40.0%, ~66.1%), read latency (~16.6%, ~32.1%), read power (~16.7%, ~37.1%), write latency (~5.4%, 16.3%) and write power (~18.6%, ~43.4%).