There are two (non-equivalent) generalizations of Von Neuman regular rings to modules; one in the sense of Zelmanowize which is elementwise generalization, and the other in the sense of Fieldhowse. In this work, we introduced and studied the approximately regular modules, as well as many properties and characterizations are considered, also we study the relation between them by using approximately pointwise-projective modules.
The goal beyond this Research is to review methods that used to estimate Logistic distribution parameters. An exact estimators method which is the Moment method, compared with other approximate estimators obtained essentially from White approach such as: OLS, Ridge, and Adjusted Ridge as a suggested one to be applied with this distribution. The Results of all those methods are based on Simulation experiment, with different models and variety of sample sizes. The comparison had been made with respect to two criteria: Mean Square Error (MSE) and Mean Absolute Percentage Error (MAPE).
Let Q be a left Module over a ring with identity ℝ. In this paper, we introduced the concept of T-small Quasi-Dedekind Modules as follows, An R-module Q is T-small quasi-Dedekind Module if,
Let R be a commutative ring with identity, and W be a unital (left) R-module. In this paper we introduce and study the concept of a quasi-small prime modules as generalization of small prime modules.
In this paper, an approximate solution of nonlinear two points boundary variational problem is presented. Boubaker polynomials have been utilized to reduce these problems into quadratic programming problem. The convergence of this polynomial has been verified; also different numerical examples were given to show the applicability and validity of this method.
There is a great deal of systems dealing with image processing that are being used and developed on a daily basis. Those systems need the deployment of some basic operations such as detecting the Regions of Interest and matching those regions, in addition to the description of their properties. Those operations play a significant role in decision making which is necessary for the next operations depending on the assigned task. In order to accomplish those tasks, various algorithms have been introduced throughout years. One of the most popular algorithms is the Scale Invariant Feature Transform (SIFT). The efficiency of this algorithm is its performance in the process of detection and property description, and that is due to the fact that
... Show MoreInvestigation regarding queue length dynamics have been explored using various kinds of models including ordinary differential equations (ODEs). ODEs possess the advantageous property of having a continuous-time representation of queue length dynamics, thus its adoption in this article in modelling various scenarios as system of first-order ODEs. Specifically, a multi-server queue is considered and a numerical approach for solving first-order ODEs using MATLAB is adopted to obtain approximate solutions of the resultant models. The results display the dynamics of the queue length in each scenario, thus showing the usefulness of ODEs in analysing the behaviour of queues using system of ODEs.