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.

Throughout this paper R represents a commutative ring with identity and all R-modules M are unitary left R-modules. In this work we introduce the notion of S-maximal submodules as a generalization of the class of maximal submodules, where a proper submodule N of an R-module M is called S-maximal, if whenever W is a semi essential submodule of M with N ⊊ W ⊆ M, implies that W = M. Various properties of an S-maximal submodule are considered, and we investigate some relationships between S-maximal submodules and some others related concepts such as almost maximal submodules and semimaximal submodules. Also, we study the behavior of S-maximal submodules in the class of multiplication modules. Farther more we give S-Jacobson radical of rings

The Pulse Coupled Oscillator (PCO) has attracted substantial attention and widely used in wireless sensor networks (WSNs), where it utilizes firefly synchronization to attract mating partners, similar to artificial occurrences that mimic natural phenomena. However, the PCO model might not be applicable for simultaneous transmission and data reception because of energy constraints. Thus, an energy-efficient pulse coupled oscillator (EEPCO) has been proposed, which employs the self-organizing method by combining biologically and non-biologically inspired network systems and has proven to reduce the transmission delay and energy consumption of sensor nodes. However, the EEPCO method has only been experimented in attack-free networks without

Resumen

    Sotileza , localismo santandrino de sutileza , es la parte más fina del aparejo de pescar donde va el anzuelo. Es la obra maestro de José María de Pereda.Su ambiente , el Santander viejo, anterior al año 50,evocado emocionadamente - emociόn romántica contenida en los trazos sobrios y firmes de un naturalism psicolόgico y paisajista,el Santander que el autor confiesa poseer en el fondo de su corazόn,«y tenerlo esculpido en la memoria de tal suerte que ,a ojos cerrados,me atrevería a trazarle con todo su perímetro y sus calles, y el color de sus piedras, y el número, y los nombres, y hasta las caras de sus habitantes».Dentro de la grandeza primaria de las criaturas de Pere

The aim of this paper is to introduce and study the notion type of fibrewise topological spaces, namely fibrewise fuzzy j-topological spaces, Also, we introduce the concepts of fibrewise j-closed fuzzy topological spaces, fibrewise j-open fuzzy topological spaces, fibrewise locally sliceable fuzzy j-topological spaces and fibrewise locally sectionable fuzzy j-topological spaces. Furthermore, we state and prove several Theorems concerning these concepts, where j = {δ, θ, α, p, s, b, β}.

Abstract Throughout this paper R represents commutative ring with identity and M is a unitary left R-module, the purpose of this paper is to study a new concept, (up to our knowledge), named St-closed submodules. It is stronger than the concept of closed submodules, where a submodule N of an R-module M is called St-closed (briefly N ≤Stc M) in M, if it has no proper semi-essential extensions in M, i.e if there exists a submodule K of M such that N is a semi-essential submodule of K then N = K. An ideal I of R is called St-closed if I is an St-closed R-submodule. Various properties of St-closed submodules are considered.

In this paper, an algorithm for binary codebook design has been used in vector quantization technique, which is used to improve the acceptability of the absolute moment block truncation coding (AMBTC) method. Vector quantization (VQ) method is used to compress the bitmap (the output proposed from the first method (AMBTC)). In this paper, the binary codebook can be engender for many images depending on randomly chosen to the code vectors from a set of binary images vectors, and this codebook is then used to compress all bitmaps of these images. The chosen of the bitmap of image in order to compress it by using this codebook based on the criterion of the average bitmap replacement error (ABPRE). This paper is suitable to reduce bit rates

We examine the integrability in terms of Painlevè analysis for several models of higher order nonlinear solitary wave equations which were recently derived by Christou. Our results point out that these equations do not possess Painlevè property and fail the Painlevè test for some special values of the coefficients; and that indicates a non-integrability criteria of the equations by means of the Painlevè integrability.

Many of the key stream generators which are used in practice are LFSR-based in the sense that they produce the key stream according to a rule y = C(L(x)), where L(x) denotes an internal linear bit stream, produced by small number of parallel linear feedback shift registers (LFSRs), and C denotes some nonlinear compression function. In this paper we combine between the output sequences from the linear feedback shift registers with the sequences out from non linear key generator to get the final very strong key sequence