Future wireless networks will require advance physical-layer techniques to meet the requirements of Internet of Everything (IoE) applications and massive communication systems. To this end, a massive MIMO (m-MIMO) system is to date considered one of the key technologies for future wireless networks. This is due to the capability of m-MIMO to bring a significant improvement in the spectral efficiency and energy efficiency. However, designing an efficient downlink (DL) training sequence for fast channel state information (CSI) estimation, i.e., with limited coherence time, in a frequency division duplex (FDD) m-MIMO system when users exhibit different correlation patterns, i.e., span distinct channel covariance matrices, is to date very challenging. Although advanced iterative algorithms have been developed to address this challenge, they exhibit slow convergence speed and thus deliver high latency and computational complexity. To overcome this challenge, we propose a computationally efficient conjugate gradient-descent (CGD) algorithm based on the Riemannian manifold in order to optimize the DL training sequence at base station (BS), while improving the convergence rate to provide a fast CSI estimation for an FDD m-MIMO system. To this end, the sum rate and the computational complexity performances of the proposed training solution are compared with the state-of-the-art iterative algorithms. The results show that the proposed training solution maximizes the achievable sum rate performance, while delivering a lower overall computational complexity owing to a faster convergence rate in comparison to the state-of-the-art iterative algorithms.
In this paper we describe several different training algorithms for feed forward neural networks(FFNN). In all of these algorithms we use the gradient of the performance function, energy function, to determine how to adjust the weights such that the performance function is minimized, where the back propagation algorithm has been used to increase the speed of training. The above algorithms have a variety of different computation and thus different type of form of search direction and storage requirements, however non of the above algorithms has a global properties which suited to all problems.
Crow Search Algorithm (CSA) can be defined as one of the new swarm intelligence algorithms that has been developed lately, simulating the behavior of a crow in a storage place and the retrieval of the additional food when required. In the theory of the optimization, a crow represents a searcher, the surrounding environment represents the search space, and the random storage of food location represents a feasible solution. Amongst all the food locations, the one where the maximum amount of the food is stored is considered as the global optimum solution, and objective function represents the food amount. Through the simulation of crows’ intelligent behavior, the CSA attempts to find the optimum solutions to a variety of the proble
... Show MoreAn optimization study was conducted to determine the optimal operating pressure for the oil and gas separation vessels in the West Qurna 1 oil field. The ASPEN HYSYS software was employed as an effective tool to analyze the optimal pressure for the second and third-stage separators while maintaining a constant operating pressure for the first stage. The analysis involved 10 cases for each separation stage, revealing that the operating pressure of 3.0 Kg/cm2 and 0.7 Kg/cm2 for the second and third stages, respectively, yielded the optimum oil recovery to the flow tank. These pressure set points were selected based on serval factors including API gravity, oil formation volume factor, and gas-oil ratio from the flow tank. To impro
... Show MoreSupport Vector Machines (SVMs) are supervised learning models used to examine data sets in order to classify or predict dependent variables. SVM is typically used for classification by determining the best hyperplane between two classes. However, working with huge datasets can lead to a number of problems, including time-consuming and inefficient solutions. This research updates the SVM by employing a stochastic gradient descent method. The new approach, the extended stochastic gradient descent SVM (ESGD-SVM), was tested on two simulation datasets. The proposed method was compared with other classification approaches such as logistic regression, naive model, K Nearest Neighbors and Random Forest. The results show that the ESGD-SVM has a
... Show MoreABCTRACT
Care research examining the relationship between the variables of search presidents (employee training and organizational commitment) to determine the effect of the training of employees in organizations in achieving organizational commitment of employees towards their organizations and by the fact that training is one of the most important activities adopted by the administration and by which can benefit realized for workers and for the organization .ttjsd problem Search lack of training considered as a factor of the important factors in the development of staff skills and development work in many Iraqi companies, including vegetable oils company (where to look), which in turn raises the relevance and commitment
... Show MoreAbstract
The study aims to build a training program based on the Connectivism Theory to develop e-learning competencies for Islamic education teachers in the Governorate of Dhofar, as well as to identify its effectiveness. The study sample consisted of (30) Islamic education teachers to implement the training program, they were randomly selected. The study used the descriptive approach to determine the electronic competencies and build the training program, and the quasi-experimental approach to determine the effectiveness of the program. The study tools were the cognitive achievement test and the observation card, which were applied before and after. The study found that the effectiveness of the training program
... Show MoreIn this paper, the Adomian decomposition method (ADM) is successfully applied to find the approximate solutions for the system of fuzzy Fredholm integral equations (SFFIEs) and we also study the convergence of the technique. A consistent way to reduce the size of the computation is given to reach the exact solution. One of the best methods adopted to determine the behavior of the approximate solutions. Finally, the problems that have been addressed confirm the validity of the method applied in this research using a comparison by combining numerical methods such as the Trapezoidal rule and Simpson rule with ADM.