This paper generalizes and improves the results of Margenstren, by proving that the number of -practical numbers  which is defined by   has a lower bound in terms of . This bound is more sharper than Mangenstern bound when  Further general results are given for the existence of -practical numbers, by proving that the interval contains a -practical for all

   In this paper, we introduce a new type of functions in bitopological spaces, namely, (1,2)*-proper functions. Also, we study the basic properties and characterizations of these functions . One of the most important of equivalent definitions to the (1,2)*-proper functions is given by using (1,2)*-cluster points of filters . Moreover we define and study (1,2)*-perfect functions and (1,2)*-compact functions in bitopological spaces and we study the relation between (1,2)*-proper functions and each of (1,2)*-closed functions , (1,2)*-perfect functions and (1,2)*-compact functions and we give an example when the converse may not be true .
 

A new human-based heuristic optimization method, named the Snooker-Based Optimization Algorithm (SBOA), is introduced in this study. The inspiration for this method is drawn from the traits of sales elites—those qualities every salesperson aspires to possess. Typically, salespersons strive to enhance their skills through autonomous learning or by seeking guidance from others. Furthermore, they engage in regular communication with customers to gain approval for their products or services. Building upon this concept, SBOA aims to find the optimal solution within a given search space, traversing all positions to obtain all possible values. To assesses the feasibility and effectiveness of SBOA in comparison to other algorithms, we conducte

Discriminant between groups is one of the common procedures because of its ability to analyze many practical phenomena, and there are several methods can be used for this purpose, such as linear and quadratic discriminant functions. recently, neural networks is used as a tool to distinguish between groups.

In this paper the simulation is used to compare neural networks and classical method for classify observations to group that is belong to, in case of some variables that don’t follow the normal distribution. we use the proportion of number of misclassification observations to the all observations as a criterion of comparison.  

The concept of the order sum graph associated with a finite group based on the order of the group and order of group elements is introduced. Some of the properties and characteristics such as size, chromatic number, domination number, diameter, circumference, independence number, clique number, vertex connectivity, spectra, and Laplacian spectra of the order sum graph are determined. Characterizations of the order sum graph to be complete, perfect, etc. are also obtained.

This study had succeeded in producing a new graphical representation of James abacus called nested chain abacus. Nested chain abacus provides a unique mathematical expression to encode each tile (image) using a partition theory where each form or shape of tile will be associated with exactly one partition.Furthermore, an algorithm of nested chain abacus movement will be constructed, which can be applied in tiling theory.

This research which is entitled (Devine Beauty), aims at studying the philosophical and literary extensive visions of Andalusian poets in search of pleasure in the beauty of divine self and its impact on the formation of a philosophical frame of mind. It also attempts to investigate the aesthetic aspects that highlight the prestige and greatness and majesty of that absolute beauty.
The most important conclusion of the reach is the Bany Ahmar poets use the beauty of women and the pleasure of wine as cods to reach divine beauty and get the happiness desired with the reflection of absolute beauty in a clear philosophy and thinking of the kingdom of God Almighty.

In recent years, due to the economic benefits and technical advances of cloud
computing, huge amounts of data have been outsourced in the cloud. To protect the
privacy of their sensitive data, data owners have to encrypt their data prior
outsourcing it to the untrusted cloud servers. To facilitate searching over encrypted
data, several approaches have been provided. However, the majority of these
approaches handle Boolean search but not ranked search; a widely accepted
technique in the current information retrieval (IR) systems to retrieve only the top–k
relevant files. In this paper, propose a distributed secure ranked search scheme over
the encrypted cloud servers. Such scheme allows for the authorized user to

Testing is a vital phase in software development, and having the right amount of test data is an important aspect in speeding up the process. As a result of the integrationist optimization challenge, extensive testing may not always be practicable. There is also a shortage of resources, expenses, and schedules that impede the testing process. One way to explain combinational testing (CT) is as a basic strategy for creating new test cases. CT has been discussed by several scholars while establishing alternative tactics depending on the interactions between parameters. Thus, an investigation into current CT methods was started in order to better understand their capabilities and limitations. In this study, 97 publications were evalua