The concept of Cech fuzzy soft bi-closure space ( ˇ Cfs bi-csp) ( ˇ U, L1, L2, S) is initiated and studied by the authors in [6]. The notion of pairwise fuzzy soft separated sets in Cfs bi-csp is defined in this study, and various features of ˇ this notion are proved. Then, we introduce and investigate the concept of connectedness in both Cfs bi-csps and its ˇ associated fuzzy soft bitopological spaces utilizing the concept of pairwise fuzzy soft separated sets. Furthermore, the concept of pairwise feebly connected is introduced, and the relationship between pairwise connected and pairwise feebly connected is discussed. Finally, we provide various instances to further explain our findings.

The idea of ech fuzzy soft bi-closure space ( bicsp) is a new one, and its basic features are defined and studied in [1]. In this paper, separation axioms, namely pairwise, , pairwise semi-(respectively, pairwise pseudo and pairwise Uryshon) - fs bicsp's are introduced and studied in both ech fuzzy soft bi-closure space and their induced fuzzy soft bitopological spaces. It is shown that hereditary property is satisfied for , with respect to ech fuzzy soft bi-closure space but for other mentioned types of separations axioms, hereditary property satisfies for closed subspaces of ech fuzzy soft bi-closure space.

Many industrial systems involve multiple criteria and objectives, and they are very complex problems in computational science, such as task scheduling. We propose bi-criteria and bi-objective scheduling problems, which are solved by two nature-inspired evolutionary algorithms, such as Simulated Annealing (SA) and Bee Algorithm (BA). This problem is characterized by scheduling a batch of tasks on multiple machines, and it is fundamental because the solution should focus on the simultaneous optimization of two conflicting objectives: the makespan minimization and the total tardiness minimization. This problem is NP-Hard, and therefore, two evolutionary methods were used to search for solutions intelligently in this huge, very complex

11-22 Description An apology may be defined as “the act of declaring one’s regret, remorse or sorrow for having insulted, failed, injured, harmed or wronged another (Internet Encyclopedia of Philosophy IEP). A definition quite interested in the function suggests that “an apology is a speech act addressed to B’s face–needs and intended to remedy an offence for which A. takes responsibility.”(Holmes, 1990: 159). Apologies are also" speech acts" that are hard to identify, define or categorize, a difficulty that arises directly out of the functions they perform (Lakoff, 2001: 201) and the forms they take. In function, they range from selfabasement for wrongdoing to the formal display of appropriate feeling. In form, they range from

This study deals with a prominent critical term - poetics - in critical studies as an area related to uncovering the laws of creative and aesthetic discourses (Preaching)، and the various functions that accompany it in literary texts. So، the study employs the pioneers' works of this theory specially the eastern theorists in making a parallel comparing study of the text book of " the Magic and Poetry” by Al-Lisan Al-Din bin Al-Khatib (776 AH). It displays the utility of the concept of poetics in the referred book pointing to the illumination of various functions that، in turn، reflected the

Abstract

The aim of this study was to identify the impact of the Knowledge Management Processes on organizational creativity in the Airlines  Companies working in Sudan. The hypotheses formulated as:, there is a positive relationship statistically significant differences between knowledge management processes (diagnosis, the acquisition, storage, distribution and application) and organizational creativity. the measurement of the variables had been adopted from previous studies. The study used a Descriptive approach and and the analytical statistical method to construct the model and SPSS Program for data analysis .Purposive sample procedure had been chosen and structured questionnaire had been developed. Out of 215 q

in this paper fourth order kutta method has been used to find the numerical solution for different types of first liner

In this paper, the author established some new integral conditions for the oscillation of all solutions of nonlinear first order neutral delay differential equations. Examples are inserted to illustrate the results.

This paper is concerned with the oscillation of all solutions of the n-th order delay differential equation . The necessary and sufficient conditions for oscillatory solutions are obtained and other conditions for nonoscillatory solution to converge to zero are established.