Through the Internet, learners can access available information on e-learning platforms to facilitate their studies or to acquire new skills. However, finding the right information for their specific needs among the numerous available choices is a tedious task due to information overload. Recommender systems are a good solution to personalize e-learning by proposing useful and relevant information adapted to each learner using a set of techniques and algorithms. Collaborative filtering (CF) is one of the techniques widely used in such systems. However, the high dimensions and sparsity of the data are major problems. Since the concept of deep learning has grown in popularity, various studies have emerged to improve this form of filtering. In this work, we used an autoencoder, which is a powerful model in data dimension reduction, feature extraction and data reconstruction, to learn and predict student preferences in an e-learning recommendation system based on collaborative filtering. Experimental results obtained using the database created by Kulkarni et al. show that this model is more accurate and outperforms models based on K-nearest neighbor (KNN), singular value decomposition (SVD), singular value decomposition plus plus (SVD++) and non-negative matrix factorization (NMF) in terms of the root-mean-square error (RMSE) and mean absolute error (MAE).

This novel research introduces a game-changing architecture design for Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) decoders in Fifth-Generation New-Radio (5G-NR) wireless communications, specifically designed to meet precise specifications and leveraging the layered Min-Sum (MS) algorithm. Our innovative approach presents a fully parallel architecture that is precisely engineered to cater to the demanding high-throughput requirements of enhanced Mobile Broadband (eMBB) applications. To ensure smooth computation in the MS algorithm, we use the Sub-Optimal Low-Latency (SOLL) technique to optimize the critical check node process. Thus, our design has the potential to greatly benefit certain Ultra-Reliable Low-Latency Communications (URLLC) scenarios. We conducted precise Bit Error Rate (BER) performance analysis on our LDPC decoder using a Hardware Description Language (HDL) Co-Simulation (MATLAB/Simulink/ModelSim) for two codeword rates (2/3 and 1/3), simulating the challenging Additive White Gaussian Noise (AWGN) channel environment.

In this study, we propose a “New Reliability Ratio Weighted Bit Flipping” (NRRWBF) algorithm for Low‐Density Parity‐Check (LDPC) codes. This algorithm improves the “Reliability Ratio Weighted Bit Flipping” (RRWBF) algorithm by modifying the reliability ratio. It surpasses the RRWBF in performance, reaching a 0.6 dB coding gain at a Binary Error Rate (BER) of 10⁻⁴ over the Additive White Gaussian Noise (AWGN) channel, and presents a significant reduction in the decoding complexity. Furthermore, we improved NRRWBF using the sum of the syndromes as a criterion to avoid the infinite loop. This will enable the decoder to attain a more efficient and effective decoding performance.

This paper suggests an efficient image encryption technique based on double permutation/diffusion process. The aim is to secure a color and gray scale images using an improved 2D logistic map. First, since chaotic properties are significantly related to cryptographic properties in permutation and diffusion, we enhanced the chaotic behavior of the two-dimensional logistic map to create a good pseudorandom number generator that is more suitable for image scrambling. Then, the traditional encryption techniques permutation and diffusion are applied on the plain image. Thus, we generate a first entire pseudo-random sequence coming from the enhanced 2D logistic map that will be used to swap the rows of the plain image and to apply a strong diffusion. Then, a second sequence will be generated to swap the columns and apply a second diffusion to reinforce the security. The results of the simulation concerning histogram, key space, correlation coefficient among neighboring pixels, entropy, NPCR and UACI show the efficiency and reliability of the suggested algorithm.

In recent years, the study of recommendation systems has become crucial, capturing the interest of scientists and academics worldwide. Music, books, movies, news, conferences, courses, and learning materials are some examples of using the recommender system. Among the various strategies employed, collaborative filtering stands out as one of the most common and effective approaches. This method identifies similar active users to make item recommendations. However, collaborative filtering has two major challenges: sparsity and gray sheep. Inspired by the remarkable success of deep learning across a multitude of application areas, we have integrated deep learning techniques into our proposed method to effectively address the aforementioned challenges. In this paper, we present a new method called Enriched_AE, focused on autoencoder, a well-regarded unsupervised deep learning technique renowned for its superior ability in data dimensionality reduction, feature extraction, and data reconstruction, with an augmented rating matrix. This matrix not only includes real users but also incorporates virtual users inferred from opposing ratings given by real users. By doing so, we aim to enhance the accuracy of predictions, thus enabling more effective recommendation generation. Through experimental analysis of the MovieLens 100K dataset, we observe that our method achieves notable reductions in both RMSE (Root Mean Squared Error) and MAE (Mean Absolute Error), underscoring its superiority over the state-of-the-art collaborative filtering models.