Search

In this paper, a new form of 2D-plane curves is produced and graphically studied. The name of my daughter "Noor" has been given to this curve; therefore, Noor term describes this curve whenever it is used in this paper. This curve is a form of these opened curves as it extends in the infinity along both sides from the origin point. The curve is designed by a circle/ ellipse which are drawing curvatures that tangent at the origin point, where its circumference is passed through the (0,2a). By sharing two vertical lined points of both the circle diameter and the major axis of the ellipse, the parametric equation is derived. In this paper, a set of various cases of Noor curve are graphically studied by two curvature cases; a circle and an ellipse, and all figures and obtained rigour measurements are checked by AutoCAD program. With its simple, symmetric form, the future predictions are tuned for the Noor's curve to be usefully engaged in important practical applications.

This paper aims to propose a hybrid approach of two powerful methods, namely the differential transform and finite difference methods, to obtain the solution of the coupled Whitham-Broer-Kaup-Like equations which arises in shallow-water wave theory. The capability of the method to such problems is verified by taking different parameters and initial conditions. The numerical simulations are depicted in 2D and 3D graphs. It is shown that the used approach returns accurate solutions for this type of problems in comparison with the analytic ones.

This paper introduces a relationship between the independence of polynomials associated with the links of the network, and the Jacobian determinant of these polynomials. Also, it presents a way to simplify a given communication network through an algorithm that splits the network into subnets and reintegrates them into a network that is a general representation or model of the studied network. This model is also represented through a combination of polynomial equations and uses Groebner bases to reach a new simplified network equivalent to the given network, which may make studying the ability to solve the problem of network coding less expensive and much easier.

Cloud Computing is a mass platform to serve high volume data from multi-devices and numerous technologies. Cloud tenants have a high demand to access their data faster without any disruptions. Therefore, cloud providers are struggling to ensure every individual data is secured and always accessible. Hence, an appropriate replication strategy capable of selecting essential data is required in cloud replication environments as the solution. This paper proposed a Crucial File Selection Strategy (CFSS) to address poor response time in a cloud replication environment. A cloud simulator called CloudSim is used to conduct the necessary experiments, and results are presented to evidence the enhancement on replication performance. The obtained analytical graphs are discussed thoroughly, and apparently, the proposed CFSS algorithm outperformed another existing algorithm with a 10.47% improvement in average response time for multiple jobs per round.

Since the introduction of the HTTP/3, research has focused on evaluating its influences on the existing adaptive streaming over HTTP (HAS). Among these research, due to irrelevant transport protocols, the cross-protocol unfairness between the HAS over HTTP/3 (HAS/3) and HAS over HTTP/2 (HAS/2) has caught considerable attention. It has been found that the HAS/3 clients tend to request higher bitrates than the HAS/2 clients because the transport QUIC obtains higher bandwidth for its HAS/3 clients than the TCP for its HAS/2 clients. As the problem originates from the transport layer, it is likely that the server-based unfairness solutions can help the clients overcome such a problem. Therefore, in this paper, an experimental study of the server-based unfairness solutions for the cross-protocol scenario of the HAS/3 and HAS/2 is conducted. The results show that, while the bitrate guidance solution fails to help the clients achieve fairness, the bandwidth allocation solution provides superior performance.

This paper is concerned with introducing an explicit expression for orthogonal Boubaker polynomial functions with some important properties. Taking advantage of the interesting properties of Boubaker polynomials, the definition of Boubaker wavelets on interval [0,1) is achieved. These basic functions are orthonormal and have compact support. Wavelets have many advantages and applications in the theoretical and applied fields, and they are applied with the orthogonal polynomials to propose a new method for treating several problems in sciences, and engineering that is wavelet method, which is computationally more attractive in the various fields. A novel property of Boubaker wavelet function derivative in terms of Boubaker wavelet themselves is also obtained. This Boubaker wavelet is utilized along with a collocation method to obtain an approximate numerical solution of singular linear type of Lane-Emden equations. Lane-Emden equations describe several important phenomena in mathematical science and astrophysics such as thermal explosions and stellar structure. It is one of the cases of singular initial value problem in the form of second order nonlinear ordinary differential equation. The suggested method converts Lane-Emden equation into a system of linear differential equations, which can be performed easily on computer. Consequently, the numerical solution concurs with the exact solution even with a small number of Boubaker wavelets used in estimation. An estimation of error bound for the present method is also proved in this work. Three examples of Lane-Emden type equations are included to demonstrate the applicability of the proposed method. The exact known solutions against the obtained approximate results are illustrated in figures for comparison

In this paper, a least squares group finite element method for solving coupled Burgers' problem in 2-D is presented. A fully discrete formulation of least squares finite element method is analyzed, the backward-Euler scheme for the time variable is considered, the discretization with respect to space variable is applied as biquadratic quadrangular elements with nine nodes for each element. The continuity, ellipticity, stability condition and error estimate of least squares group finite element method are proved. The theoretical results show that the error estimate of this method is . The numerical results are compared with the exact solution and other available literature when the convection-dominated case to illustrate the efficiency of the proposed method that are solved through implementation in MATLAB R2018a.

In this paper, double Sumudu and double Elzaki transforms methods are used to compute the numerical solutions for some types of fractional order partial differential equations with constant coefficients and explaining the efficiently of the method by illustrating some numerical examples that are computed by using Mathcad 15.and graphic in Matlab R2015a.

This work addressed the assignment problem (AP) based on fuzzy costs, where the objective, in this study, is to minimize the cost. A triangular, or trapezoidal, fuzzy numbers were assigned for each fuzzy cost. In addition, the assignment models were applied on linguistic variables which were initially converted to quantitative fuzzy data by using the Yager’sorankingi method. The paper results have showed that the quantitative date have a considerable effect when considered in fuzzy-mathematic models.

Throughout this paper, three concepts are introduced namely stable semisimple modules, stable t-semisimple modules and strongly stable t-semisimple. Many features co-related with these concepts are presented. Also many connections between these concepts are given. Moreover several relationships between these classes of modules and other co-related classes and other related concepts are introduced.

In this paper, the process for finding an approximate solution of nonlinear three-dimensional (3D) Volterra type integral operator equation (N3D-VIOE) in R3 is introduced. The modelling of the majorant function (MF) with the modified Newton method (MNM) is employed to convert N3D-VIOE to the linear 3D Volterra type integral operator equation (L3D-VIOE). The method of trapezoidal rule (TR) and collocation points are utilized to determine the approximate solution of L3D-VIOE by dealing with the linear form of the algebraic system. The existence of the approximate solution and its uniqueness are proved, and illustrative examples are provided to show the accuracy and efficiency of the model. Mathematical Subject Classification (2010): 45P05, 45G10, 47H99

The m-consecutive-k-out-of-n: F linear and circular system consists of n sequentially connected components; the components are ordered on a line or a circle; it fails if there are at least m non-overlapping runs of consecutive-k failed components. This paper proposes the reliability and failure probability functions for both linearly and circularly m-consecutive-k-out-of-n: F systems. More precisely, the failure states of the system components are separated into two collections (the working and the failure collections); where each one is defined as a collection of finite mutual disjoint classes of the system states. Illustrative example is provided.

This paper is concerned with the blow-up solutions of a system of two reaction-diffusion equations coupled in both equations and boundary conditions. In order to understand how the reaction terms and the boundary terms affect the blow-up properties, the lower and upper blow-up rate estimates are derived. Moreover, the blow-up set under some restricted assumptions is studied.

MDS code is a linear code that achieves equality in the Singleton bound, and projective MDS (PG-MDS) is MDS code with independents property of any two columns of its generator matrix. In this paper, elementary methods for modifying a PG-MDS code of dimensions 2, 3, as extending and lengthening, in order to find new incomplete PG-MDS codes have been used over . Also, two complete PG-MDS codes over of length and 28 have been found.

The aim of this paper is to present a new methodology to find the private key of RSA. A new initial value which is generated from a new equation is selected to speed up the process. In fact, after this value is found, brute force attack is chosen to discover the private key. In addition, for a proposed equation, the multiplier of Euler totient function to find both of the public key and the private key is assigned as 1. Then, it implies that an equation that estimates a new initial value is suitable for the small multiplier. The experimental results show that if all prime factors of the modulus are assigned larger than 3 and the multiplier is 1, the distance between an initial value and the private key is decreased about 66%. On the other hand, the distance is decreased less than 1% when the multiplier is larger than 66. Therefore, to avoid attacking by using the proposed method, the multiplier which is larger than 66 should be chosen. Furthermore, it is shown that if the public key equals 3, the multiplier always equals 2.