The main purpose of this paper is to show that zero symmetric prime near-rings, satisfying certain identities on n-derivations, are commutative rings.

      This paper offers a monthly prediction method for planning production, inventory, workforce, sales and prices until N years. Each monthly decision will depend on last month, decisions and take in consideration the future forecasted demand. The manager can run the program in any month within a year. This method is executed by computer programming technique to maximize profits.

     The purpose of this paper is to study a new class of fuzzy covering dimension functions, called fuzzy

     In this paper, we introduce new definitions of the - spaces  namely the    - spaces  Here,  and  are natural numbers that are not necessarily equal, such that . The space  refers to the n-dimensional Euclidean space,  refers to the quaternions set and  refers to the N-dimensional quaternionic space. Furthermore, we establish and prove some properties of their elements. These elements are quaternion-valued N-vector functions defined on , and the  spaces  have never been introduced in this way before.

Discriminant between groups is one of the common procedures because of its ability to analyze many practical phenomena, and there are several methods can be used for this purpose, such as linear and quadratic discriminant functions. recently, neural networks is used as a tool to distinguish between groups.

In this paper the simulation is used to compare neural networks and classical method for classify observations to group that is belong to, in case of some variables that don’t follow the normal distribution. we use the proportion of number of misclassification observations to the all observations as a criterion of comparison.  

 This paper adapted the neural network for the estimating of the direction of arrival (DOA). It uses an unsupervised adaptive neural network with GHA algorithm to extract the principal components that in turn, are used by Capon method to estimate the DOA, where by the PCA neural network we take signal subspace only and use it in Capon (i.e. we will ignore the noise subspace, and take the signal subspace only).

This paper presents a proposed neural network algorithm to solve the shortest path problem (SPP) for communication routing. The solution extends the traditional recurrent Hopfield architecture introducing the optimal routing for any request by choosing single and multi link path node-to-node traffic to minimize the loss. This suggested neural network algorithm implemented by using 20-nodes network example. The result shows that a clear convergence can be achieved by 95% valid convergence (about 361 optimal routes from 380-pairs). Additionally computation performance is also mentioned at the expense of slightly worse results.

In this essay, we utilize m - space to specify m_X-N-connected, m_X-N-hyper connected and m_X-N-locally connected spaces and some functions by exploiting the intelligible m_X-N-open set. Some instances and outcomes have been granted to boost our tasks.

 With the spread use of internet, especially the web of social media, an unusual quantity of information is found that includes a number of study fields such as psychology, entertainment, sociology, business, news, politics, and other cultural fields of nations. Data mining methodologies that deal with social media allows producing enjoyable scene on the human behaviour and interaction. This paper demonstrates the application and precision of sentiment analysis using traditional feedforward and two of recurrent neural networks (gated recurrent unit (GRU) and long short term memory (LSTM)) to find the differences between them. In order to test the system’s performance, a set of tests is applied on two public datasets. The firs

      In this work, we introduced and studied  a new kind of soft mapping  on soft topological spaces with an ideal, which we called  soft strongly generalized mapping with respect an ideal I, we studied the concepts like SSIg-continuous, Contra-SSIg-continuous, SSIg-open, SSIg-closed and SSIg-irresolute mapping  and  the relations between these kinds of mappings and the composition of two mappings of the same type of two different types, with proofs or counter examples