This paper proposes a new strategy to enhance the performance and accuracy of the Spiral dynamic algorithm (SDA) for use in solving real-world problems by hybridizing the SDA with the Bacterial Foraging optimization algorithm (BFA). The dynamic step size of SDA makes it a useful exploitation approach. However, it has limited exploration throughout the diversification phase, which results in getting trapped at local optima. The optimal initialization position for the SDA algorithm has been determined with the help of the chemotactic strategy of the BFA optimization algorithm, which has been utilized to improve the exploration approach of the SDA. The proposed Hybrid Adaptive Spiral Dynamic Bacterial Foraging (HASDBF)

In this paper, a new class of nonconvex sets and functions called strongly -convex sets and strongly -convex functions are introduced. This class is considered as a natural extension of strongly -convex sets and functions introduced in the literature. Some basic and differentiability properties related to strongly -convex functions are discussed. As an application to optimization problems, some optimality properties of constrained optimization problems are proved. In these optimization problems, either the objective function or the inequality constraints functions are strongly -convex. 

The added value of internal audit greatly contributes to adding value to the institution, but most departments of economic units in Iraq neglected the role of internal audit and the added value that can be achieved by those institutions, since the term added value of internal audit is a relatively vague term from the premise that what cannot be measured is difficult Determine it, and perhaps descriptive standards for it is the extent of compliance with international auditing standards (IIA).

The research aims to study the procedures and results of auditing to verify that they have given an added value to the audit with a positive impact, develop its aspects and research, identify deficiencies for the audi

This research aims at calculating the optimum cutting condition for various types of machining methods, assisted by computers, (the computer program in this research is designed to solve linear programs; the program is written in v. basic language). The program obtains the results automatically, this occur through entering the preliminary information about the work piece and the operating condition, the program makes the calculation actually by solving a group of experimental relations, depending on the type of machining method (turning, milling, drilling). The program was transferred to package and group of windows to facilitate the use; it will automatically print the initial input and optimal solution, and thus reduce the effort and t