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 deals with defining Burr-XII, and how to obtain its p.d.f., and CDF, since this distribution is one of failure distribution which is compound distribution from two failure models which are Gamma model and weibull model. Some equipment may have many important parts and the probability distributions representing which may be of different types, so found that Burr by its different compound formulas is the best model to be studied, and estimated its parameter to compute the mean time to failure rate. Here Burr-XII rather than other models is consider because it is used to model a wide variety of phenomena including crop prices, household income, option market price distributions, risk and travel time. It has two shape-parameters (α, r) and one scale parameter (λ) which is considered known. So, this paper defines the p.d.f. and CDF and derives its Moments formula about origin, and also derive the Moments estimators of two shapes parameters (α, r) in addition to maximum likelihood estimators as well as percentile estimators, the scale parameter (λ) is not estimated (as it is considered known). The comparison between three methods is done through simulation procedure taking different sample size (n=30, 60, 90) and different sets of initial values for (α, r, λ).It is observed that the moment estimators are the best estimator with percentage (46%) ,(42%) respectively compared with other estimators.

Sequence covering array (SCA) generation is an active research area in recent years. Unlike the sequence-less covering arrays (CA), the order of sequence varies in the test case generation process. This paper reviews the state-of-the-art of the SCA strategies, earlier works reported that finding a minimal size of a test suite is considered as an NP-Hard problem. In addition, most of the existing strategies for SCA generation have a high order of complexity due to the generation of all combinatorial interactions by adopting one-test-at-a-time fashion. Reducing the complexity by adopting one-parameter- at-a-time for SCA generation is a challenging process. In addition, this reduction facilitates the supporting for a higher strength of coverage. Motivated by such challenge, this paper proposes a novel SCA strategy called Dynamic Event Order (DEO), in which the test case generation is done using one-parameter-at-a-time fashion. The details of the DEO are presented with a step-by-step example to demonstrate the behavior and show the correctness of the proposed strategy. In addition, this paper makes a comparison with existing computational strategies. The practical results demonstrate that the proposed DEO strategy outperforms the existing strategies in term of minimal test size in most cases. Moreover, the significance of the DEO increases as the number of sequences increases and/ or the strength of coverage increases. Furthermore, the proposed DEO strategy succeeds to generate SCAs up to t=7. Finally, the DEO strategy succeeds to find new upper bounds for SCA. In fact, the proposed strategy can act as a research vehicle for variants future implementation.

In this paper, we have investigated some of the most recent energy efficient routing protocols for wireless body area networks. This technology has seen advancements in recent times where wireless sensors are injected in the human body to sense and measure body parameters like temperature, heartbeat and glucose level. These tiny wireless sensors gather body data information and send it over a wireless network to the base station. The data measurements are examined by the doctor or physician and the suitable cure is suggested. The whole communication is done through routing protocols in a network environment. Routing protocol consumes energy while helping non-stop communication in a wireless environment. Because of the very tiny size, energy consumption matters a lot. We have focused on the protocols, which provide energy efficiency and improve network lifetime, through put and minimal path loss. We will be discussing some of the most recent energy efficient routing protocols in this paper; later their comparison with an appropriate table is presented. In addition, recent challenges, possible application and perspectives are discussed.

Eye Detection is used in many applications like pattern recognition, biometric, surveillance system and many other systems. In this paper, a new method is presented to detect and extract the overall shape of one eye from image depending on two principles Helmholtz & Gestalt. According to the principle of perception by Helmholz, any observed geometric shape is perceptually "meaningful" if its repetition number is very small in image with random distribution. To achieve this goal, Gestalt Principle states that humans see things either through grouping its similar elements or recognize patterns. In general, according to Gestalt Principle, humans see things through general description of these things. This paper utilizes these two principles to recognize and extract eye part from image. Java programming language and OpenCV library for image processing are used for this purpose. Good results are obtained from this proposed method, where 88.89% was obtained as a detection rate taking into account that the average execution time is about 0.23 in seconds.

One of the concerns of adopting an e-voting systems in the pooling place of any critical elections is the possibility of compromising the voting machine by a malicious piece of code, which could change the votes cast systematically. To address this issue, different techniques have been proposed such as the use of vote verification techniques and the anonymous ballot techniques, e.g., Code Voting. Verifiability may help to detect such attack, while the Code Voting assists to reduce the possibility of attack occurrence. In this paper, a new code voting technique is proposed, implemented and tested, with the aid of an open source voting. The anonymous ballot improved accordingly the paper audit trail used in this machine. The developed system, which we called CVOTING, further demonstrated the efficacy of the Code Voting technique against systematic vote change attacks and provides some features to make it easily configurable for different elections and elections in countries with right-to-left and up-to-down languages.

The aim of this article is to introduce a new definition of domination number in graphs called hn-domination number denoted by . This paper presents some properties which show the concepts of connected and independent hn-domination. Furthermore, some bounds of these parameters are determined, specifically, the impact on hn-domination parameter is studied thoroughly in this paper when a graph is modified by deleting or adding a vertex or deleting an edge.

One of the concerns of adopting an e-voting systems in the pooling place of any critical elections is the possibility of compromising the voting machine by a malicious piece of code, which could change the votes cast systematically. To address this issue, different techniques have been proposed such as the use of vote verification techniques and the anonymous ballot techniques, e.g., Code Voting. Verifiability may help to detect such attack, while the Code Voting assists to reduce the possibility of attack occurrence. In this paper, a new code voting technique is proposed, implemented and tested, with the aid of an open source voting. The anonymous ballot improved accordingly the paper audit trail used in this machine. The developed system, which we called CVOTING, further demonstrated the efficacy of the Code Voting technique against systematic vote change attacks and provides some features to make it easily configurable for different elections and elections in countries with right-to-left and up-to-down languages.

In this paper, some relations between the flows and the Enveloping Semi-group were studied. It allows to associate some properties on the topological compactification to any pointed flows. These relations enable us to study a number of the properties of the principles of flows corresponding with using algebric properties. Also in this paper proofs to some theorems of these relations are given.

Throughout this paper R represents commutative ring with identity and M is a unitary left R-module. The purpose of this paper is to investigate some new results (up to our knowledge) on the concept of weak essential submodules which introduced by Muna A. Ahmed, where a submodule N of an R-module M is called weak essential, if N ? P ? (0) for each nonzero semiprime submodule P of M. In this paper we rewrite this definition in another formula. Some new definitions are introduced and various properties of weak essential submodules are considered.

In this paper we find the exact solution of Burger's equation after reducing it to Bernoulli equation. We compare this solution with that given by Kaya where he used Adomian decomposition method, the solution given by chakrone where he used the Variation iteration method (VIM)and the solution given by Eq(5)in the paper of M. Javidi. We notice that our solution is better than their solutions.

This paper interest to estimation the unknown parameters for generalized Rayleigh distribution model based on censored samples of singly type one . In this paper the probability density function for generalized Rayleigh is defined with its properties . The maximum likelihood estimator method is used to derive the point estimation for all unknown parameters based on iterative method , as Newton – Raphson method , then derive confidence interval estimation which based on Fisher information matrix . Finally , testing whether the current model ( GRD ) fits to a set of real data , then compute the survival function and hazard function for this real data.

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.

Social Networking has dominated the whole world by providing a platform of information dissemination. Usually people share information without knowing its truthfulness. Nowadays Social Networks are used for gaining influence in many fields like in elections, advertisements etc. It is not surprising that social media has become a weapon for manipulating sentiments by spreading disinformation. Propaganda is one of the systematic and deliberate attempts used for influencing people for the political, religious gains. In this research paper, efforts were made to classify Propagandist text from Non-Propagandist text using supervised machine learning algorithms. Data was collected from the news sources from July 2018-August 2018. After annotating the text, feature engineering is performed using techniques like term frequency/inverse document frequency (TF/IDF) and Bag of words (BOW). The relevant features are supplied to support vector machine (SVM) and Multinomial Naïve Bayesian (MNB) classifiers. The fine tuning of SVM is being done by taking kernel Linear, Poly and RBF. SVM showed better results than MNB by having precision of 70%, recall of 76.5%, F1 Score of 69.5% and overall Accuracy of 69.2%.

Our goal in the present paper is to recall the concept of general fuzzy normed space and its basic properties in order to define the adjoint operator of a general fuzzy bounded operator from a general fuzzy normed space V into another general fuzzy normed space U. After that basic properties of the adjoint operator were proved then the definition of fuzzy reflexive general fuzzy normed space was introduced in order to prove that every finite dimensional general fuzzy normed space is fuzzy reflexive.

This paper introduces the Multistep Modified Reduced Differential Transform Method (MMRDTM). It is applied to approximate the solution for Nonlinear Schrodinger Equations (NLSEs) of power law nonlinearity. The proposed method has some advantages. An analytical approximation can be generated in a fast converging series by applying the proposed approach. On top of that, the number of computed terms is also significantly reduced. Compared to the RDTM, the nonlinear term in this method is replaced by related Adomian polynomials prior to the implementation of a multistep approach. As a consequence, only a smaller number of NLSE computed terms are required in the attained approximation. Moreover, the approximation also converges rapidly over a wide time frame. Two examples are provided for showing the ability and advantages of the proposed method to approximate the solution of the power law nonlinearity of NLSEs. For pictorial representation, graphical inputs are included to represent the solution and show the precision as well as the validity of the MMRDTM.

In multivariate survival analysis, estimating the multivariate distribution functions and then measuring the association between survival times are of great interest. Copula functions, such as Archimedean Copulas, are commonly used to estimate the unknown bivariate distributions based on known marginal functions. In this paper the feasibility of using the idea of local dependence to identify the most efficient copula model, which is used to construct a bivariate Weibull distribution for bivariate Survival times, among some Archimedean copulas is explored. Furthermore, to evaluate the efficiency of the proposed procedure, a simulation study is implemented. It is shown that this approach is useful for practical situations and applicable for real datasets. Moreover, when the proposed procedure implemented on Diabetic Retinopathy Study (DRS) data, it is found that treated eyes have greater chance for non-blindness compared to untreated eyes.

This paper generalizes and improves the results of Margenstren, by proving that the number of -practical numbers which is defined by has a lower bound in terms of . This bound is more sharper than Mangenstern bound when Further general results are given for the existence of -practical numbers, by proving that the interval contains a -practical for all

Suicidal ideation is one of the most severe mental health issues faced by people all over the world. There are various risk factors involved that can lead to suicide. The most common & critical risk factors among them are depression, anxiety, social isolation and hopelessness. Early detection of these risk factors can help in preventing or reducing the number of suicides. Online social networking platforms like Twitter, Redditt and Facebook are becoming a new way for the people to express themselves freely without worrying about social stigma. This paper presents a methodology and experimentation using social media as a tool to analyse the suicidal ideation in a better way, thus helping in preventing the chances of being the victim of this unfortunate mental disorder. The data is collected from Twitter, one of the popular Social Networking Sites (SNS). The Tweets are then pre-processed and annotated manually. Finally, various machine learning and ensemble methods are used to automatically distinguish Suicidal and Non-Suicidal tweets. This experimental study will help the researchers to know and understand how SNS are used by the people to express their distress related feelings and emotions. The study further confirmed that it is possible to analyse and differentiate these tweets using human coding and then replicate the accuracy by machine classification. However, the power of prediction for detecting genuine suicidality is not confirmed yet, and this study does not directly communicate and intervene the people having suicidal behaviour.

Multiple linear regressions are concerned with studying and analyzing the relationship between the dependent variable and a set of explanatory variables. From this relationship the values of variables are predicted. In this paper the multiple linear regression model and three covariates were studied in the presence of the problem of auto-correlation of errors when the random error distributed the distribution of exponential. Three methods were compared (general least squares, M robust, and Laplace robust method). We have employed the simulation studies and calculated the statistical standard mean squares error with sample sizes (15, 30, 60, 100). Further we applied the best method on the real experiment data representing the varieties of cigarettes according to the US Federal Trade Commission.

In this paper, the homotopy perturbation method (HPM) is presented for treating a linear system of second-kind mixed Volterra-Fredholm integral equations. The method is based on constructing the series whose summation is the solution of the considered system. Convergence of constructed series is discussed and its proof is given; also, the error estimation is obtained. Algorithm is suggested and applied on several examples and the results are computed by using MATLAB (R2015a). To show the accuracy of the results and the effectiveness of the method, the approximate solutions of some examples are compared with the exact solution by computing the absolute errors.

The development of the internet of things (IoT) and the internet of robotics (IoR) are becoming more and more involved with our daily lives. It serves a variety of tasks some of them are essential to us. The main objective of SRR is to develop a surveillance system for detecting suspicious and targeted places for users without any loss of human life. This paper shows the design and implementation of a robotic surveillance platform for real-time monitoring with the help of image processing, which can explorer places of difficult access or high risk. The robotic live streaming is via two cameras, the first one is fixed straight on the road and the second one is dynamic with tilt-pan ability. All cameras have image processing capabilities to analyze, detect and track objects plus few other graphical functions. The components mentioned above built on top of the four-wheel vehicle system with high torque to provide mobility on rough terrain. This work is based on Raspberry Pi and can be controlled over Wi-Fi locally or publicly over the internet. The results show making a high potential, relatively low price robot with lots of features and functions that can perform multiple tasks simultaneously, all are crucial to surveillance and monitoring problems, controlled by a user from far distances and for a long time.

In this paper, the Normality set will be investigated. Then, the study highlights some concepts properties and important results. In addition, it will prove that every operator with normality set has non trivial invariant subspace of .

The purpose of this paper is to find the best multiplier approximation of unbounded functions in –space by using some discrete linear positive operators. Also we will estimate the degree of the best multiplier approximation in term of modulus of continuity and the averaged modulus.

In this paper, new method have been investigated using evolving algorithms (EA's) to cryptanalysis one of the nonlinear stream cipher cryptosystems which depends on the Linear Feedback Shift Register (LFSR) unit by using cipher text-only attack. Genetic Algorithm (GA) and Ant Colony Optimization (ACO) which are used for attacking one of the nonlinear cryptosystems called "shrinking generator" using different lengths of cipher text and different lengths of combined LFSRs. GA and ACO proved their good performance in finding the initial values of the combined LFSRs. This work can be considered as a warning for a stream cipher designer to avoid the weak points, which may be found in the stream cipher, and may be explored by the cryptanalysts. This work can find the optimal solution for text with minimum lengths of 20 characters and 100 iteration were very enough to find the real initial values of key stream.

In this paper, magnesium oxide nanoparticles (MgO NPS) have been prepared and characterized and its concentration effect has been studied on polymers surface (MgO NPS). The results showed that the degradation of poly methyl methacrylate increased when using such metal oxide. The results also showed that the metal oxide increased the degradation of poly methyl methacrylate. X-ray diffraction, scanning electron microscopy, atomic force microscopy were used to study the morphological characteristics and size of nano MgO particles analysis. Films were prepared by mixing the different masses of MgO NPS (0.025, 0.05, 0.1, 0.2 and 0.4) % with a polymer solution ratio (W/V) 7 %. Photo- degradation rate was monitored irradiation’s time by measuring the incident frequency of the index value of the hydroxyl coefficient of growth (IOH) at fixed film thickness and constant concentration. Spectrophotometry (IR, and UV. Visible) techniques were used to determine the change in the intensity of the spectrum bundles.

This paper investigates the effect of magnetohydrodynamic (MHD) of an incompressible generalized burgers’ fluid including a gradient constant pressure and an exponentially accelerate plate where no slip hypothesis between the burgers’ fluid and an exponential plate is no longer valid. The constitutive relationship can establish of the fluid model process by fractional calculus, by using Laplace and Finite Fourier sine transforms. We obtain a solution for shear stress and velocity distribution. Furthermore, 3D figures are drawn to exhibit the effect of magneto hydrodynamic and different parameters for the velocity distribution.

Sentiment analysis refers to the task of identifying polarity of positive and negative for particular text that yield an opinion. Arabic language has been expanded dramatically in the last decade especially with the emergence of social websites (e.g. Twitter, Facebook, etc.). Several studies addressed sentiment analysis for Arabic language using various techniques. The most efficient techniques according to the literature were the machine learning due to their capabilities to build a training model. Yet, there is still issues facing the Arabic sentiment analysis using machine learning techniques. Such issues are related to employing robust features that have the ability to discriminate the polarity of sentiments. This paper proposes a hybrid method of linguistic and statistical features along with classification methods for Arabic sentiment analysis. Linguistic features contains stemming and POS tagging, while statistical contains the TF-IDF. A benchmark dataset of Arabic tweets have been used in the experiments. In addition, three classifiers have been utilized including SVM, KNN and ME. Results showed that SVM has outperformed the other classifiers by obtaining an f-score of 72.15%. This indicates the usefulness of using SVM with the proposed hybrid features.

In this paper new methods were presented based on technique of differences which is the difference- based modified jackknifed generalized ridge regression estimator(DMJGR) and difference-based generalized jackknifed ridge regression estimator(DGJR), in estimating the parameters of linear part of the partially linear model. As for the nonlinear part represented by the nonparametric function, it was estimated using Nadaraya Watson smoother. The partially linear model was compared using these proposed methods with other estimators based on differencing technique through the MSE comparison criterion in simulation study.

Let M is a Г-ring. In this paper the concept of orthogonal symmetric higher bi-derivations on semiprime Г-ring is presented and studied and the relations of two symmetric higher bi-derivations on Г-ring are introduced.

In this paper, we have extracted Silica from rice husk ash (RHA) by sodium hydroxide to produce sodium silicate. 3-(chloropropyl)triethoxysilane (CPTES) functionalized with sodium silicate via a sol-gel method in one pot synthesis to prepare RHACCl. Chloro group in compound RHACCl replacement in iodo group to prepere RHACI. The FT-IR clearly showed absorption band of C-I at 580 cm-1. Functionalized silica RHACI has high surface area (410 m2/g) and average pore diameter (3.8 nm) within mesoporous range. X-ray diffraction pattern showed that functionalized silica RHACI has amorphous phase .Thermogravemitric analysis (TGA) showed two decomposition stages and SEM morphology of RHACI showed that the particles have irregular shape. Atomic force microscope (AFM) technique was proved that the RHACI has a nanostructure The XPS spectra of I 3d for all the studied surfaces are presented in the peak located at 618.5 eV binding energy was associated with C–I bond.

Iraq has the second largest proven oil reserves in the world. According to oil experts, it is expected that the Iraq's reserves to rise to 200+ billion barrels of high-grade crude. Oil is a strategic commodity for producing and exporting countries in general, and Iraq in particular, as demonstrated by the international experience that oil is an important means to achieve economic growth, an important tool in the overall economic, social and political development. It is also an important source of hard currency for any national economy and a means to connect the local economy and the global economy. In this paper we focus our attention on selecting the best regression model that explain the effect of human capital represented by different levels of human cadres on the development of the Iraqi oil industry by employing the data of a time series consisting of 21years period. Two popular classical procedures were applied to select such model, specifically, all possible regression procedure and the stepwise regression procedures. The statistical program SPSS was employed to perform the required calculations.

Cadmium sulphide CdS films with 200 nm have been prepared by thermal evaporation technique on glass substrate at substrate room temperature under vacuum of 10-5mbar.In this paper, the effect of Dielectric Barrier Discharge plasma on the optical properties of the CdS film. The prepared films were exposed to different time intervals (0, 3, 5, 8) min. For every sample, the Absorption A, absorption coefficient α , energy gap Eg ,extinction coefficient K and dielectric constant ε were studied. It is found that the energy gap were decreased with exposure time, and absorption , Absorption coefficient, refractive index, extinction coefficient, dielectric constant increased with time of exposure to the plasma. Our study considers the first investigation of the effect of cold atmospheric plasma on the optical properties of CdS film.

In this paper, for the first time we introduce a new four-parameter model called the Gumbel- Pareto distribution by using the T-X method. We obtain some of its mathematical properties. Some structural properties of the new distribution are studied. The method of maximum likelihood is used for estimating the model parameters. Numerical illustration and an application to a real data set are given to show the flexibility and potentiality of the new model.

In this paper the centralizing and commuting concerning skew left -derivations and skew left -derivations associated with antiautomorphism on prime and semiprime rings were studied and the commutativity of Lie ideal under certain conditions were proved.

Human Interactive Proofs (HIPs) are automatic inverse Turing tests, which are intended to differentiate between people and malicious computer programs. The mission of making good HIP system is a challenging issue, since the resultant HIP must be secure against attacks and in the same time it must be practical for humans. Text-based HIPs is one of the most popular HIPs types. It exploits the capability of humans to recite text images more than Optical Character Recognition (OCR), but the current text-based HIPs are not well-matched with rapid development of computer vision techniques, since they are either vey simply passed or very hard to resolve, thus this motivate that continuous efforts are required to improve the development of HIPs base text. In this paper, a new proposed scheme is designed for animated text-based HIP; this scheme exploits the gap between the usual perception of human and the ability of computer to mimic this perception and to achieve more secured and more human usable HIP. This scheme could prevent attacks since it's hard for the machine to distinguish characters with animation environment displayed by digital video, but it's certainly still easy and practical to be used by humans because humans are attuned to perceiving motion easily. The proposed scheme has been tested by many Optical Character Recognition applications, and it overtakes all these tests successfully and it achieves a high usability rate of 95%.

Metaheuristics under the swarm intelligence (SI) class have proven to be efficient and have become popular methods for solving different optimization problems. Based on the usage of memory, metaheuristics can be classified into algorithms with memory and without memory (memory-less). The absence of memory in some metaheuristics will lead to the loss of the information gained in previous iterations. The metaheuristics tend to divert from promising areas of solutions search spaces which will lead to non-optimal solutions. This paper aims to review memory usage and its effect on the performance of the main SI-based metaheuristics. Investigation has been performed on SI metaheuristics, memory usage and memory-less metaheuristics, memory characteristics and memory in SI-based metaheuristics. The latest information and references have been further analyzed to extract key information and mapped into respective subsections. A total of 50 references related to memory usage studies from 2003 to 2018 have been investigated and show that the usage of memory is extremely necessary to increase effectiveness of metaheuristics by taking the advantages from their previous successful experiences. Therefore, in advanced metaheuristics, memory is considered as one of the fundamental elements of an efficient metaheuristic. Issues in memory usage have also been highlighted. The results of this review are beneficial to the researchers in developing efficient metaheuristics, by taking into consideration the usage of memory.