In recent years, the field of research around the congestion problem of 4G and 5G networks has grown, especially those based on artificial intelligence (AI). Although 4G with LTE is seen as a mature technology, there is a continuous improvement in the infrastructure that led to the emergence of 5G networks. As a result of the large services provided in industries, Internet of Things (IoT) applications and smart cities, which have a large amount of exchanged data, a large number of connected devices per area, and high data rates, have brought their own problems and challenges, especially the problem of congestion. In this context, artificial intelligence (AI) models can be considered as one of the main techniques that can be used to solve network congestion problems. Since AI technologies are able to extract relevant features from data and deal with huge amounts of data, the integration of communication networks with AI to solve the congestion problem appears promising, and the research requires exploration. This paper provides a review of how AI technologies can be used to solve the congestion problem in 4G and 5G networks. We examined previous studies addressing the problem of congestion in networks, such as congestion prediction, congestion control, congestion avoidance, and TCP development for congestion control. Finally, we discuss the future vision of using AI technologies in 4G and 5G networks to solve congestion problems and identify research issues that need further study.
DBN Rashid, Asian Quarterly: An International Journal of Contemporary Issue, 2018
The research specified with study the relation between the market share for the sample research banks and the amount of the achieved revenues from the investment, where the dominated belief that there potentiality enhancing the revenue on investment with the increase of the banks shares in their markets after their success in achieving rates of successive growth in their sales of sales and to a suitable achieve market coverage for their products and they have dissemination and suitable promotion activity, the market share represented the competition for the banks, and the markets pay attention to the market share as a strategic objective and to maintain them also increasi
... Show More
Designing Teaching Aids and Their Effects on Learning and Retaining Diving and Cartwheel on Floor Exercises in Women’s’ Artistic Gymnastics
The research aimed at designing teaching aids that develop and help retain diving and cartwheel for third year college of physical education and sport sciences students in women’s artistic gymnastics. In addition to that, the researchers aimed at identifying the effect of these aids on learning and retaining cartwheel and diving in floor exercises. The researchers used the experimental method. The subjects were (20) third year female students from the college of physical education and sport sciences/ university of Baghdad sections K and H. the main experiment lasted for
... Show More
In Automatic Speech Recognition (ASR) the non-linear data projection provided by a one hidden layer Multilayer Perceptron (MLP), trained to recognize phonemes, and has previous experiments to provide feature enhancement substantially increased ASR performance, especially in noise. Previous attempts to apply an analogous approach to speaker identification have not succeeded in improving performance, except by combining MLP processed features with other features. We present test results for the TIMIT database which show that the advantage of MLP preprocessing for open set speaker identification increases with the number of speakers used to train the MLP and that improved identification is obtained as this number increases beyond sixty.
... Show More
In this paper, a subspace identification method for bilinear systems is used . Wherein a " three-block " and " four-block " subspace algorithms are used. In this algorithms the input signal to the system does not have to be white . Simulation of these algorithms shows that the " four-block " gives fast convergence and the dimensions of the matrices involved are significantly smaller so that the computational complexity is lower as a comparison with " three-block " algorithm .
Steganography is the art of secret communication. Its purpose is to hide the presence of information, using, for example, images as covers. The frequency domain is well suited for embedding in image, since hiding in this frequency domain coefficients is robust to many attacks. This paper proposed hiding a secret image of size equal to quarter of the cover one. Set Partitioning in Hierarchal Trees (SPIHT) codec is used to code the secret image to achieve security. The proposed method applies Discrete Multiwavelet Transform (DMWT) for cover image. The coded bit stream of the secret image is embedded in the high frequency subbands of the transformed cover one. A scaling factors ? and ? in frequency domain control the quality of the stego
... Show More
The objective of this work is to design and implement a cryptography system that enables the sender to send message through any channel (even if this channel is insecure) and the receiver to decrypt the received message without allowing any intruder to break the system and extracting the secret information. In this work, we implement an interaction between the feedforward neural network and the stream cipher, so the secret message will be encrypted by unsupervised neural network method in addition to the first encryption process which is performed by the stream cipher method. The security of any cipher system depends on the security of the related keys (that are used by the encryption and the decryption processes) and their corresponding le
... Show More
in this paper we adopted ways for detecting edges locally classical prewitt operators and modification it are adopted to perform the edge detection and comparing then with sobel opreators the study shows that using a prewitt opreators
This paper introduces a relation between resultant and the Jacobian determinant
by generalizing Sakkalis theorem from two polynomials in two variables to the case of (n) polynomials in (n) variables. This leads us to study the results of the type: , and use this relation to attack the Jacobian problem. The last section shows our contribution to proving the conjecture.
