Faces blurring is one of the important complex processes that is considered one of the advanced computer vision fields. The face blurring processes generally have two main steps to be done. The first step has detected the faces that appear in the frames while the second step is tracking the detected faces which based on the information extracted during the detection step. In the proposed method, an image is captured by the camera in real time, then the Viola Jones algorithm used for the purpose of detecting multiple faces in the captured image and for the purpose of reducing the time consumed to handle the entire captured image, the image background is removed and only the motion areas are processe

The purpose of this research paper is to present the second-order homogeneous complex differential equation   , where   , which is defined on the certain complex domain depends on solution behavior. In order to demonstrate  the relationship between the solution of the second-order of the complex differential equation and its coefficient of function, by studying the solution in certain cases: a meromorphic function, a coefficient of function, and if the solution is considered to be a transformation with another complex solution. In addition, the solution has been provided as a power series with some  applications.

The concept of closed quasi principally injective acts over monoids is introduced ,which signifies a generalization for the quasi principally injective as well as for the closed quasi injective acts. Characterization of this concept is intended to show the behavior of a closed quasi principally injective property. At the same time, some properties of closed quasi principally injective acts are examined in terms of their endomorphism monoid. Also, the characterization of a closed self-principally injective monoid is given in terms of its annihilator. The relationship between the following concepts is also studied; closed quasi principally injective acts over monoids, Hopfian, co Hopfian, and directly finite property. Ultimately, based on

The main goal of this paper is to make link between the subjects of projective
geometry, vector space and linear codes. The properties of codes and some examples
are shown. Furthermore, we will give some information about the geometrical
structure of the arcs. All these arcs are give rise to an error-correcting code that
corrects the maximum possible number of errors for its length.

      In this paper, we use  the definition of the action on the set of semi-group of the structure of this research .We introduce the concepts of  -system which is a triple , ,  such that  is a Hausdorff compact space called  phase space,  is a semi-group of transformations with a continuous action  of   on  . We study and proof some theoretical properties related with that system. We also introduce the concept of Enfolding semi-group ( , ,and we prove that it is a compact right topological semi-group. In addition, we study the left and right ideals in the Enfolding semi-group. By using the dynamical system, we reflect various properties concerning with its structure for the Enfolding semi-group. Furthermore, we describe

In this research, a new technique is suggested to reduce the long time required by the encoding process by using modified moment features on domain blocks. The modified moment features were used in accelerating the matching step of the Iterated Function System (IFS). The main disadvantage facing the fractal image compression (FIC) method is the over-long encoding time needed for checking all domain blocks and choosing the least error to get the best matched domain for each block of ranges. In this paper, we develop a method that can reduce the encoding time of FIC by reducing the size of the domain pool based on the moment features of domain blocks, followed by a comparison with threshold (the selected  threshold based on experience

Abstract

Pneumatic processes sequence (PPS) is used widely in industrial applications. It is common to do a predetermined PPS to achieve a specific larger task within the industrial application like the PPS achieved by the pick and place industrial robot arm. This sequence may require change depending on changing the required task and usually this requires the programmer intervention to change the sequence’ sprogram, which is costly and may take long time. In this research a PLC-based PPS control system is designed and implemented, in which the PPS is programmed by demonstration. The PPS could be changed by demonstrating the new required sequence via the user by following simple series of manual steps without h

     In this research paper, we explain the use of  the convexity and the starlikness properties of  a given function  to generate  special properties of differential subordination and superordination functions in the classes of analytic functions that have  the form   in the unit disk. We also show the significant of  these properties to derive sandwich results when the Srivastava- Attiya operator   is used.

In this paper we study necessary and sufficient conditions for a reverse- centralizer of a semiprime ring R to be orthogonal. We also prove that a reverse- centralizer T of a semiprime ring R having a commuting generalized inverse is orthogonal

The aim of this paper is to approximate multidimensional functions f∈C(R^s) by developing a new type of Feedforward neural networks (FFNS) which we called it Greedy ridge function neural networks (GRGFNNS). Also, we introduce a modification to the greedy algorithm which is used to train the greedy ridge function neural networks. An error bound are introduced in Sobolov space. Finally, a comparison was made between the three algorithms (modified greedy algorithm, Backpropagation algorithm and the result in [1]).