The concept of fully pseudo stable Banach Algebra-module (Banach A-module) which is the generalization of fully stable Banach A-module has been introduced. In this paper we study some properties of fully stable Banach A-module and another characterization of fully pseudo stable Banach A-module has been given.

Scheduling Timetables for courses in the big departments in the universities is a very hard problem and is often be solved by many previous works although results are partially optimal. This work implements the principle of an evolutionary algorithm by using genetic theories to solve the timetabling problem to get a random and full optimal timetable with the ability to generate a multi-solution timetable for each stage in the collage. The major idea is to generate course timetables automatically while discovering the area of constraints to get an optimal and flexible schedule with no redundancy through the change of a viable course timetable. The main contribution in this work is indicated by increasing the flexibility of generating opti

New types of modules named Fully Small Dual Stable Modules and Principally Small Dual Stable are studied and investigated. Both concepts are generalizations of Fully Dual Stable Modules and Principally Dual Stable Modules respectively. Our new concepts coincide when the module is Small Quasi-Projective, and by considering other kind of conditions. Characterizations and relations of these concepts and the concept of Small Duo Modules are investigated, where every fully small dual stable R-module M is small duo and the same for principally small dual stable.

In this study the most stable isobar for some isobaric families (light and  intermediate ) nuclei with mass number (A) equals to (15-30) & (101- 115) have been determined. This determination of stable nuclide can help to determine the suitable nuclide, which can be used in different fields.

Most stable isobar can be determined by two means. First: plot mass parabolas (plotting the binding energy (B.E) as a function of the atomic number (Z)) for these isobaric families, in this method most stable isobars represent the lowest point in mass parabola (the nuclide with the highest value of binding energy).

Second: calculated the atomic number for most stable isobar (Z_A) value.

Our results show that

Fading channel modeling is generally defined as the variation of the attenuation of a signal with various variables. Time, geographical position, and radio frequency which is included. Fading is often modeled as a random process. Thus, a fading channel is a communication channel that experiences fading. In this paper, the proposed system presents a new design and simulate a wireless channel using Rayleigh channels. Rayleigh channels using two approaches (flat and frequency-selective fading channels) in order to calculate some path space loss efforts and analysis the performance of different wireless fading channel modeling. The results show that the bite error rate (BER) performance is dramatically improved in the value of signal to

One of the most important methodologies in operations research (OR) is the linear programming problem (LPP). Many real-world problems can be turned into linear programming models (LPM), making this model an essential tool for today's financial, hotel, and industrial applications, among others. Fuzzy linear programming (FLP) issues are important in fuzzy modeling because they can express uncertainty in the real world. There are several ways to tackle fuzzy linear programming problems now available. An efficient method for FLP has been proposed in this research to find the best answer. This method is simple in structure and is based on crisp linear programming. To solve the fuzzy linear programming problem (FLPP), a new ranking function (R

Nowad ays, with the development of internet communication that provides many facilities to the user leads in turn to growing unauthorized access. As a result, intrusion detection system (IDS) becomes necessary to provide a high level of security for huge amount of information transferred in the network to protect them from threats. One of the main challenges for IDS is the high dimensionality of the feature space and how the relevant features to distinguish the normal network traffic from attack network are selected. In this paper, multi-objective evolutionary algorithm with decomposition (MOEA/D) and MOEA/D with the injection of a proposed local search operator are adopted to solve the Multi-objective optimization (MOO) followed by Naï