In this article, we aim to define a universal set consisting of the subscripts of the fuzzy differential equation (5) except the two elements and , subsets of that universal set are defined according to certain conditions. Then, we use the constructed universal set with its subsets for suggesting an analytical method which facilitates solving fuzzy initial value problems of any order by using the strongly generalized H-differentiability. Also, valid sets with graphs for solutions of fuzzy initial value problems of higher orders are found.
In this paper, the effect size measures was discussed, which are useful in many estimation processes for direct effect and its relation with indirect and total effects. In addition, an algorithm to calculate the suggested measure of effect size was suggested that represent the ratio of direct effect to the effect of the estimated parameter using the Regression equation of the dependent variable on the mediator variable without using the independent variable in the model. Where this an algorithm clear the possibility to use this regression equation in Mediation Analysis, where usually used the Mediator and independent variable together when the dependent variable regresses on them. Also this an algorithm to show how effect of the
... Show MoreThis research introduce a study with application on Principal Component Regression obtained from some of the explainatory variables to limitate Multicollinearity problem among these variables and gain staibilty in their estimations more than those which yield from Ordinary Least Squares. But the cost that we pay in the other hand losing a little power of the estimation of the predictive regression function in explaining the essential variations. A suggested numerical formula has been proposed and applied by the researchers as optimal solution, and vererifing the its efficiency by a program written by the researchers themselves for this porpuse through some creterions: Cumulative Percentage Variance, Coefficient of Determination, Variance
... Show MoreLinear discriminant analysis and logistic regression are the most widely used in multivariate statistical methods for analysis of data with categorical outcome variables .Both of them are appropriate for the development of linear classification models .linear discriminant analysis has been that the data of explanatory variables must be distributed multivariate normal distribution. While logistic regression no assumptions on the distribution of the explanatory data. Hence ,It is assumed that logistic regression is the more flexible and more robust method in case of violations of these assumptions.
In this paper we have been focus for the comparison between three forms for classification data belongs
... Show MoreThe aim of this book is to present a method for solving high order ordinary differential equations with two point boundary condition of the different kind, we propose semi-analytic technique using two-point osculatory interpolation to construct polynomial solution. The original problem is concerned using two-points osculatory interpolation with the fit equal numbers of derivatives at the end points of an interval [0 , 1] . Also, we discussion the existence and uniqueness of solutions and many examples are presented to demonstrate the applicability, accuracy and efficiency of the methods by compared with conventional method .i.e. VIDM , Septic B-Spline , , NIM , HPM, Haar wavelets on one hand and to confirm the order convergence on the other
... Show MoreA new algorithm is proposed to compress speech signals using wavelet transform and linear predictive coding. Signal compression based on the concept of selecting a small number of approximation coefficients after they are compressed by the wavelet decomposition (Haar and db4) at a suitable chosen level and ignored details coefficients, and then approximation coefficients are windowed by a rectangular window and fed to the linear predictor. Levinson Durbin algorithm is used to compute LP coefficients, reflection coefficients and predictor error. The compress files contain LP coefficients and previous sample. These files are very small in size compared to the size of the original signals. Compression ratio is calculated from the size of th
... Show MoreThe objective of an Optimal Power Flow (OPF) algorithm is to find steady state operation point which minimizes generation cost, loss etc. while maintaining an acceptable system performance in terms of limits on generators real and reactive powers, line flow limits etc. The OPF solution includes an objective function. A common objective function concerns the active power generation cost. A Linear programming method is proposed to solve the OPF problem. The Linear Programming (LP) approach transforms the nonlinear optimization problem into an iterative algorithm that in each iteration solves a linear optimization problem resulting from linearization both the objective function and constrains. A computer program, written in MATLAB environme
... Show MoreThe sustainable competitive advantage for organizations is one of the requirements for value creation, which centered on the possession of scarce resources that achieve maximum flows to invest in intellectual capital, if what has been interest in them, measured and employed the way properly and style, so I figured the need for new technologies to enable organizations to measure the intellectual and physical assets and to assess its performance accordingly, so it sheds search light on the measurement of the added value of existing knowledge using the standard value-added factor is the intellectual (value added intellectual coefficient) (VAIC) and to develop a set of assumptions about the extent of the difference between the sample
... Show MoreIn this paper, we will introduce the concept of interval value fuzzy n-fold KU-ideal in KU-algebras, which is a generalization of interval value fuzzy KU-ideal of KU-algebras and we will obtain few properties that is similar to the properties of interval value fuzzy KU-ideal in KU-algebras, see [8]. Also, we construct some algorithms for folding theory applied to KU-ideals in KU-algebras.