Science, technology and many other fields are use clustering algorithm widely for many applications, this paper presents a new hybrid algorithm called KDBSCAN that work on improving k-mean algorithm and solve two of its
problems, the first problem is number of cluster, when it`s must be entered by user, this problem solved by using DBSCAN algorithm for estimating number of cluster, and the second problem is randomly initial centroid problem that has been dealt with by choosing the centroid in steady method and removing randomly choosing for a better results, this work used DUC 2002 dataset to obtain the results of KDBSCAN algorithm, it`s work in many application fields such as electronics libraries,

Steganography is an important class of security which is widely used in computer and network security nowadays. In this research, a new proposed algorithm was introduced with a new concept of dealing with steganography as an algorithmic secret key technique similar to stream cipher cryptographic system. The proposed algorithm is a secret key system suggested to be used in communications for messages transmission steganography

This paper aims to find new analytical closed-forms to the  solutions of the nonhomogeneous functional differential equations of the n^th order with finite and constants delays and various initial delay conditions in terms of elementary functions using Laplace transform method. As well as, the definition of dynamical systems for ordinary differential equations is used to introduce the definition of dynamical systems for delay differential equations which contain multiple delays with a discussion of their dynamical properties: The exponential stability and strong stability

     In the complex field, special functions are closely related to geometric holomorphic functions. Koebe function is a notable contribution to the study of the geometric function theory (GFT), which is a univalent function. This sequel introduces a new class that includes a more general Koebe function which is holomorphic in a complex domain. The purpose of this work is to present a new operator correlated with GFT. A new generalized Koebe operator is proposed in terms of the convolution principle. This Koebe operator refers to the generality of a prominent differential operator, namely the Ruscheweyh operator. Theoretical investigations in this effort lead to a number of implementations in the subordination function theory. The ti

            In this paper, several conditions are put in order to compose the sequence of partial sums ,  and  of the fractional operators of analytic univalent functions ,  and   of bounded turning which are bounded turning too.

In this paper, we present an approximate analytical and numerical solutions for the differential equations with multiple delay using the extend differential transform method (DTM). This method is used to solve many linear and non linear problems.

The derivation of 5^th order diagonal implicit type Runge Kutta methods (DITRKM5) for solving 3^rd special order ordinary differential equations (ODEs) is introduced in the present study. The DITRKM5 techniques are the name of the approach. This approach has three equivalent non-zero diagonal elements. To investigate the current study, a variety of tests for five various initial value problems (IVPs) with different step sizes h were implemented. Then, a comparison was made with the methods indicated in the other literature of the implicit RK techniques. The numerical techniques are elucidated as the qualification regarding the efficiency and number of function evaluations compared with another literature of the implic

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]).

In this paper, the series solution is applied to solve third order fuzzy differential equations with a fuzzy initial value. The proposed method applies Taylor expansion in solving the system and the approximate solution of the problem which is calculated in the form of a rapid convergent series; some definitions and theorems are reviewed as a basis in solving fuzzy differential equations. An example is applied to illustrate the proposed technical accuracy. Also, a comparison between the obtained results is made, in addition to the application of the crisp solution, when the-level equals one.

         In the present paper, the authors introduce and investigates two new subclasses and,  of the class k-fold bi-univalent functions in the open unit disk. The initial coefficients for all of the functions that belong to them were determined, as well as the coefficients for functions that belong to a field determining these coefficients requires a complicated process. The bounds for the initial coefficients and are contained among the remaining results in our analysis are obtained. In addition, some specific special improver results for the related classes are provided.