After Zadeh introduced the concept of z-number scientists in various fields have shown keen interest in applying this concept in various applications. In applications of z-numbers, to compare two z-numbers, a ranking procedure is essential.  While a few ranking functions have been already proposed in the literature there is a need to evolve some more good ranking functions.  In this paper, a novel ranking function for z-numbers is proposed- "the Momentum Ranking Function"(MRF). Also, game theoretic problems where the payoff matrix elements are z-numbers are considered and the application of the momentum ranking function in such problems is demonstrated.

Dans la langue française, une forme d'auxiliarité, composée de deux éléments cohérents l'auxiliant et l'auxilié, fournit, en effet, à la phrase une diversité significative et structurale. L'auxiliarité, renvoie à l'unification de deux éléments grammaticaux afin de localiser l'énoncé sur l'axe du temps, d'aspect ou de mode. É. Benveniste définit l'auxiliarité en : « Il s'agit d'une forme linguistique unitaire qui se réalise, à travers des paradigmes entiers, en  deux éléments, dont chacun assume une partie des fonctions grammaticales, et qui sont à la fois liés et autonomes, distincts et complémentaires »[1]. Ces deux éléments d'auxiliarité possèden

Let R be a commutative ring with identity 1 ¹ 0, and let M be a unitary left module over R. A submodule N of an R-module M is called essential, if whenever N ⋂ L = (0), then L = (0) for every submodule L of M. In this case, we write N ≤e M. An R-module M is called extending, if every submodule of M is an essential in a direct summand of M. A submodule N of an R-module M is called semi-essential (denoted by N ≤sem M), if N ∩ P ≠ (0) for each nonzero prime submodule P of M. The main purpose of this work is to determine and study two new concepts (up to our knowledge) which are St-closed submodules and semi-extending modules. St-closed submodules is contained properly in the class of closed submodules, where a submodule N of

In this work the concept of semi-generalized regular topological space was introduced and studied via semi generalized open sets. Many properties and results was investigated and studied, also it was shown that the quotient space of semi-generalized regular topological space is not, in general semi-generalizedspace.

Recently, a new secure steganography algorithm has been proposed, namely, the secure Block Permutation Image Steganography (BPIS) algorithm. The new algorithm consists of five main steps, these are: convert the secret message to a binary sequence, divide the binary sequence into blocks, permute each block using a key-based randomly generated permutation, concatenate the permuted blocks forming a permuted binary sequence, and then utilize a plane-based Least-Significant-Bit (LSB) approach to embed the permuted binary sequence into BMP image file format. The performance of algorithm was given a preliminary evaluation through estimating the PSNR (Peak Signal-to-Noise Ratio) of the stego image for limited number of experiments comprised hiding

Traditionally, path selection within routing is formulated as a shortest path optimization problem. The objective function for optimization could be any one variety of parameters such as number of hops, delay, cost...etc. The problem of least cost delay constraint routing is studied in this paper since delay constraint is very common requirement of many multimedia applications and cost minimization captures the need to
distribute the network. So an iterative algorithm is proposed in this paper to solve this problem. It is appeared from the results of applying this algorithm that it gave the optimal path (optimal solution) from among multiple feasible paths (feasible solutions).