The advertisement is important in maximizing the resources of journalistic institutions. It helps them to perform their duties and also establishes their independence. However, this type of communication has often overlapped with other types of communication, including media and publicity.

Those in charge of the press bear responsibility in this regard, as some of them harness the advertisement for personal purposes; or detrimental to media content. Many communication authorities have drawn attention to the danger of confusing the concepts and levels of the three activities and have moved towards establishing rules to reduce overlap between them.

The aim of this research is to try to disengage the concept of advertising,

The data communication has been growing in present day. Therefore, the data encryption became very essential in secured data transmission and storage and protecting data contents from intruder and unauthorized persons. In this paper, a fast technique for text encryption depending on genetic algorithm is presented. The encryption approach is achieved by the genetic operators Crossover and mutation. The encryption proposal technique based on dividing the plain text characters into pairs, and applying the crossover operation between them, followed by the mutation operation to get the encrypted text. The experimental results show that the proposal provides an important improvement in encryption rate with comparatively high-speed Process

Krawtchouk polynomials (KPs) and their moments are promising techniques for applications of information theory, coding theory, and signal processing. This is due to the special capabilities of KPs in feature extraction and classification processes. The main challenge in existing KPs recurrence algorithms is that of numerical errors, which occur during the computation of the coefficients in large polynomial sizes, particularly when the KP parameter (p) values deviate away from 0.5 to 0 and 1. To this end, this paper proposes a new recurrence relation in order to compute the coefficients of KPs in high orders. In particular, this paper discusses the development of a new algorithm and presents a new mathematical model for computing the

Regression testing being expensive, requires optimization notion. Typically, the optimization of test cases results in selecting a reduced set or subset of test cases or prioritizing the test cases to detect potential faults at an earlier phase. Many former studies revealed the heuristic-dependent mechanism to attain optimality while reducing or prioritizing test cases. Nevertheless, those studies were deprived of systematic procedures to manage tied test cases issue. Moreover, evolutionary algorithms such as the genetic process often help in depleting test cases, together with a concurrent decrease in computational runtime. However, when examining the fault detection capacity along with other parameters, is required, the method falls sh

An Optimal Algorithm for HTML Page Building Process

In this research a new system identification algorithm is presented for obtaining an optimal set of mathematical models for system with perturbed coefficients, then this algorithm is applied practically by an “On Line System Identification Circuit”, based on real time speed response data of a permanent magnet DC motor. Such set of mathematical models represents the physical plant against all variation which may exist in its parameters, and forms a strong mathematical foundation for stability and performance analysis in control theory problems.

This paper proposes a novel meta-heuristic optimization algorithm called the fine-tuning meta-heuristic algorithm (FTMA) for solving global optimization problems. In this algorithm, the solutions are fine-tuned using the fundamental steps in meta-heuristic optimization, namely, exploration, exploitation, and randomization, in such a way that if one step improves the solution, then it is unnecessary to execute the remaining steps. The performance of the proposed FTMA has been compared with that of five other optimization algorithms over ten benchmark test functions. Nine of them are well-known and already exist in the literature, while the tenth one is proposed by the authors and introduced in this article. One test trial was shown t

A system was used to detect injuries in plant leaves by combining machine learning and the principles of image processing. A small agricultural robot was implemented for fine spraying by identifying infected leaves using image processing technology with four different forward speeds (35, 46, 63 and 80 cm/s). The results revealed that increasing the speed of the agricultural robot led to a decrease in the mount of supplements spraying and a detection percentage of infected plants. They also revealed a decrease in the percentage of supplements spraying by 46.89, 52.94, 63.07 and 76% with different forward speeds compared to the traditional method.

A field experiment was carried out at University of Baghdad, College of Agricultural Engineering Sciences during fall season of 2020 and spring season of 2021. This study was aimed evaluate the effect of the organic fertilizer and boron foliar on the yield of potatoes for processing. The factorial experiment (5*4) within RCBD and three replicates. The organic fertilizer as palm peat at four levels (0, 12, 24 and 36 ton. ha-1) in addition to the chemical fertilizer recommendation treatment. Boron at four Concentrations 0, 100, 150 and 200 mg. L-1 . The results revealed significant different among application of organic fertilizer at the level of 24 ton. ha-1 and the foliar application of boron at a concentration of 100 mg. L-1 in the

LED is an ultra-lightweight block cipher that is mainly used in devices with limited resources. Currently, the software and hardware structure of this cipher utilize a complex logic operation to generate a sequence of random numbers called round constant and this causes the algorithm to slow down and record low throughput. To improve the speed and throughput of the original algorithm, the Fast Lightweight Encryption Device (FLED) has been proposed in this paper. The key size of the currently existing LED algorithm is in 64-bit & 128-bit but this article focused mainly on the 64-bit key (block size=64-bit). In the proposed FLED design, complex operations have been replaced by LFSR left feedback technology to make the algorithm perform more e