A 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

Our aim in this paper is to introduce the notation of nearly primary-2-absorbing submodule as generalization of 2-absorbing submodule where a proper submodule  of an -module  is called nearly primary-2-absorbing submodule if whenever , for , , ,  implies that either  or  or . We got many basic, properties, examples and characterizations of this concept. Furthermore, characterizations of nearly primary-2-absorbing submodules in some classes of modules were inserted. Moreover, the behavior of nearly primary-2-absorbing submodule under -epimorphism was studied.

Starting from bis (4,4'-diamino phenoxy) ethan(1), a variety of phenolicschiff bases (methylolic, etheric, epoxy) derivatives have been synthesized. All proposed structure were supported by FTIR, 1H-NMR, 13C-NMR Elemental analysis, some derivatives evaluated by thermal analysis (TGA).

        Let R be a commutative ring with  identity . In this paper  we study  the concepts of  essentially quasi-invertible submodules and essentially  quasi-Dedekind modules  as  a generalization of  quasi-invertible submodules and quasi-Dedekind  modules  . Among the results that we obtain is the following : M  is an essentially  quasi-Dedekind  module if and only if M is aK-nonsingular module,where a module M is K-nonsingular if, for each  , Kerf ≤_e M   implies   f = 0 .

Epoxy resins were modified by some thermosetting materials using unsaturated polyesters which were cured with styrene , MMA ,and MA . When unsaturated Polyester ( as thermosetting material ) was used , and cured with styrene showed better results than acrylic monomers . Thermal stability rised on modification of epoxy resins with unsaturated polyester . The new formulation had converted the epoxy resin from hard brittle material to hard and tough material .

Thermal analysis were studied using ( DSC ) and physicomechanical characteristics were measured .

This paper is focusing on reducing the time for text processing operations by taking the advantage of enumerating each string using the multi hashing methodology. Text analysis is an important subject for any system that deals with strings (sequences of characters from an alphabet) and text processing (e.g., word-processor, text editor and other text manipulation systems). Many problems have been arisen when dealing with string operations which consist of an unfixed number of characters (e.g., the execution time); this due to the overhead embedded-operations (like, symbols matching and conversion operations). The execution time largely depends on the string characteristics; especially its length (i.e., the number of characters consisting

Let R be a ring and let A be a unitary left R-module. A proper submodule H of an R-module A is called 2-absorbing , if rsa∈H, where r,s∈R,a∈A, implies that either ra∈H or sa∈H or rs∈[H:A], and a proper submodule H of an R-module A is called quasi-prime , if rsa∈H, where r,s∈R,a∈A, implies that either ra∈H or sa∈H. This led us to introduce the concept pseudo quasi-2-absorbing submodule, as a generalization of both concepts above, where a proper submodule H of an R-module A is called a pseudo quasi-2-absorbing submodule of A, if whenever rsta∈H,where r,s,t∈R,a∈A, implies that either rsa∈H+soc(A) or sta∈H+soc(A) or rta∈H+soc(A), where soc(A) is socal of an

In this paper, the problem of scheduling jobs on one machine for a variety multicriteria
are considered to minimize total completion time and maximum late work. A set of n
independent jobs has to be scheduled on a single machine that is continuously available from
time zero onwards and that can handle no more than one job at a time. Job i,(i=1,…,n)
requires processing during a given positive uninterrupted time pi, and its due date d
i.
For the bicriteria problems, some algorithms are proposed to find efficient (Pareto)
solutions for simultaneous case. Also for the multicriteria problem we proposed general
algorithms which gives efficient solutions within the efficient range

Let be an associative ring with identity and let be a unitary left -module. Let  be a non-zero submodule of .We say that  is a semi- - hollow module if for every submodule  of  such that  is a semi- - small submodule ( ). In addition, we say that  is a semi- - lifting module if for every submodule  of , there exists a direct summand  of  and  such that  

The main purpose of this work was to develop the properties of these classes of module.