In this paper, some new types of regularity axioms, namely pairwise quasi-regular, pairwise semi-regular, pairwise pseudo regular and pairwise regular are defined and studied in both ech fuzzy soft bi-closure spaces (  bicsp’s) and their induced fuzzy soft bitopological spaces. We also study the relationships between them. We show that in all these types of axioms, the hereditary property is satisfied under closed fs bi-csubsp of . Furthermore, we define some normality axioms, namely pairwise semi-normal, pairwise pseudo normal, pairwise normal and pairwise completely normal in both  bicsp’s and their induced fuzzy soft bitopological spaces, as well as their basic properties and the relationships between them are studied.

The current research deals with the study of aesthetic relations in the field of interior design and the extent to which its mechanisms achieve sensory stimulation between the internal and external spaces, to generate a continuous visual connection that is an extension of it, achieving in turn sensory stimulation for the users of those spaces. The internal and external spaces meet the desired purpose of feeling pleasure and beauty.” The current research aims to “discover the nature of aesthetic relations between the internal and external spaces and the extent to which mechanisms can achieve sensory stimulation in residential spaces.” The first topic included the concept of aesthetic relations, sensory excitement, and perception at

     Temperature predicting is the utilization to forecast the condition of the temperature for an upcoming date for a given area. Temperature predictions are done by gathering quantitative data in regard to the current state of the atmosphere. In this study, a proposed hybrid method to predication the daily maximum and minimum air temperature of Baghdad city which combines standard backpropagation with simulated annealing (SA). Simulated Annealing Algorithm are used for weights optimization for recurrent multi-layer neural network system. Experimental tests had been implemented using the data of maximum and minimum air temperature for month of July of Baghdad city that got from local records of Iraqi Meteorological O

Machine scheduling problems (MSP) are     considered as one of the most important classes of combinatorial optimization problems. In this paper, the problem of job scheduling on a single machine is studied to minimize the multiobjective and multiobjective objective function. This objective function is: total completion time, total lead time and maximum tardiness time, respectively, which are formulated as  are formulated. In this study, a mathematical model is created to solve the research problem. This problem can be divided into several sub-problems and simple algorithms have been found to find the solutions to these sub-problems and compare them with efficient solutions. For this problem, some rules that provide efficient solutio

      In this paper, several types of space-time fractional partial differential equations has been solved by using most of special double linear integral transform ”double  Sumudu ”. Also, we are going to argue the truth of these solutions by another analytically method “invariant subspace method”. All results are illustrative numerically and graphically.

In this paper, a new technique is offered for solving three types of linear integral equations of the 2nd kind including Volterra-Fredholm integral equations (LVFIE) (as a general case), Volterra integral equations (LVIE) and Fredholm integral equations (LFIE) (as special cases). The new technique depends on approximating the solution to a polynomial of degree  and therefore reducing the problem to a linear programming problem(LPP), which will be solved to find the approximate solution of LVFIE. Moreover, quadrature methods including trapezoidal rule (TR), Simpson 1/3 rule (SR), Boole rule (BR), and Romberg integration formula (RI) are used to approximate the integrals that exist in LVFIE. Also, a comparison between those methods i

Within this research, The problem of scheduling jobs on a single machine is the subject of study to minimize the multi-criteria and multi-objective functions. The first problem, minimizing the multi-criteria, which include Total Completion Time, Total Late Work, and Maximum Earliness Time (∑𝐶𝑗, ∑𝑉𝑗, 𝐸𝑚𝑎𝑥), and the second problem, minimizing the multi-objective functions ∑𝐶𝑗 + ∑𝑉𝑗 +𝐸𝑚𝑎𝑥 are the problems at hand in this paper. In this study, a mathematical model is created to address the research problems, and some rules provide efficient (optimal) solutions to these problems. It has also been proven that each optimal solution for ∑𝐶𝑗 + ∑𝑉𝑗 + 𝐸𝑚𝑎𝑥 is an effic