Nowadays, the mobile communication networks have become a consistent part of our everyday life by transforming huge amount of data through communicating devices, that leads to new challenges. According to the Cisco Networking Index, more than 29.3 billion networked devices will be connected to the network during the year 2023. It is obvious that the existing infrastructures in current networks will not be able to support all the generated data due to the bandwidth limits, processing and transmission overhead. To cope with these issues, future mobile communication networks must achieve high requirements to reduce the amount of transferred data, decrease latency and computation costs. One of the essential challenging tasks in this subject area is the optimal self-organized service placement. In this paper a heuristic-based algorithm for service placement in future networks was presented. This algorithm achieves the ideal placement of services replicas by monitoring the load within the server and its neighborhood, choosing the node that contributes with the highest received load, and finally replicating or migrating the service to it based on specific criteria, so that the distance of requests coming from clients becomes as small as possible because of placing services within nearby locations. It was proved that our proposed algorithm achieves an improved performance by meeting the services within a shorter time, a smaller bandwidth, and thus a lower communication cost. It was compared with the traditional client-server approach and the random placement algorithm. Experimental results showed that the heuristic algorithm outperforms other approaches and meets the optimal performance with different network sizes and varying load scenarios.
Authors in this work design efficient neural networks, which are based on the modified Levenberg - Marquardt (LM) training algorithms to solve non-linear fourth - order three -dimensional partial differential equations in the two kinds in the periodic and in the non-periodic - Periodic. Software reliability growth models are essential tools for monitoring and evaluating the evolution of software reliability. Software defect detection events that occur during testing and operation are often treated as counting processes in many current models. However, when working with large software systems, the error detection process should be viewed as a random process with a continuous state space, since the number of faults found during testin
... Show MoreThis research aims to analyze the intellectual and civilizational regression that afflicted Iraqi and Arab society due to political and religious tyranny and internal conflicts, which was reflected in the deterioration of human rights values and the absence of equality and justice in dealing with the other religiously, which affected the reluctance of members of religious groups to interact with their national societies and then migrate to Outside, which contributed to a double loss, in terms of the loss of these societies by productive and effective national competencies, and in terms of distorting the image of Islam. The research stressed that the first treatments of this phenomenon are the consolidation of the values of citize
... Show MoreIn digital images, protecting sensitive visual information against unauthorized access is considered a critical issue; robust encryption methods are the best solution to preserve such information. This paper introduces a model designed to enhance the performance of the Tiny Encryption Algorithm (TEA) in encrypting images. Two approaches have been suggested for the image cipher process as a preprocessing step before applying the Tiny Encryption Algorithm (TEA). The step mentioned earlier aims to de-correlate and weaken adjacent pixel values as a preparation process before the encryption process. The first approach suggests an Affine transformation for image encryption at two layers, utilizing two different key sets for each layer. Th
... Show MoreText based-image clustering (TBIC) is an insufficient approach for clustering related web images. It is a challenging task to abstract the visual features of images with the support of textual information in a database. In content-based image clustering (CBIC), image data are clustered on the foundation of specific features like texture, colors, boundaries, shapes. In this paper, an effective CBIC) technique is presented, which uses texture and statistical features of the images. The statistical features or moments of colors (mean, skewness, standard deviation, kurtosis, and variance) are extracted from the images. These features are collected in a one dimension array, and then genetic algorithm (GA) is applied for image clustering.
... Show MoreOne of the most difficult issues in the history of communication technology is the transmission of secure images. On the internet, photos are used and shared by millions of individuals for both private and business reasons. Utilizing encryption methods to change the original image into an unintelligible or scrambled version is one way to achieve safe image transfer over the network. Cryptographic approaches based on chaotic logistic theory provide several new and promising options for developing secure Image encryption methods. The main aim of this paper is to build a secure system for encrypting gray and color images. The proposed system consists of two stages, the first stage is the encryption process, in which the keys are genera
... Show MoreIn the past two decades, maritime transport traffic has increased, especially in the case of container flow. The BAP (Berth Allocation Problem) (BAP) is a main problem to optimize the port terminals. The current manuscript explains the DBAP problems in a typical arrangement that varies from the conventional separate design station, where each berth can simultaneously accommodate several ships when their entire length is less or equal to length. Be a pier, serve. This problem was then solved by crossing the Red Colobuses Monkey Optimization (RCM) with the Genetic Algorithm (GA). In conclusion, the comparison and the computational experiments are approached to demonstrate the effectiveness of the proposed method contrasted with other
... Show MoreBackground: This in vitro study compares a self-etch primer (SEP) to an etch-and-rinse (EaR) for bonding sapphire brackets by evaluation of the enamel etch-pattern, shear bond strength, amount of remnant adhesive and enamel surface damage following thermal and fatigue cyclic loading. Material and Methods: Ceramic (sapphire) brackets were bonded to 80 extracted human premolars using two enamel etching protocols: conventional EaR using 37% phosphoric acid (PA) gel (control), and a SEP (Transbond Plus). Each group was subdivided into two subgroups (n=20 teeth) according to the time of bracket debonding: after 24 h water storage or following 5000 thermo-cycles plus 5000 cycles fatigue loading, to determine the shear bond strength (SBS), adhesiv
... Show MoreThe research aims to identify the future teachers' attitudes toward cloud computing in the Kingdom of Saudi Arabia from their point of view. The research adopted the descriptive approach, and a questionnaire was applied to a random sample of (370) male and female teachers in governmental and private general education schools in the Al-Jouf region, Saudi Arabia. The results of the research concluded that the reality of future teachers' attitudes towards cloud computing in the Kingdom of Saudi Arabia from their point of view is very high and that most areas of using computing are in the field of assessment, then teaching, and activities. The challenges of future teachers' attitudes toward cloud computing are recorded at a high level, parti
... Show More