Preferred Language
Articles
/
joe-2056
A Proposal Algorithm to Solve Delay Constraint Least Cost Optimization Problem
...Show More Authors

Traditionally, path selection within routing is formulated as a shortest path optimization problem. The objective function for optimization could be any one variety of parameters such as number of hops, delay, cost...etc. The problem of least cost delay constraint routing is studied in this paper since delay constraint is very common requirement of many multimedia applications and cost minimization captures the need to
distribute the network. So an iterative algorithm is proposed in this paper to solve this problem. It is appeared from the results of applying this algorithm that it gave the optimal path (optimal solution) from among multiple feasible paths (feasible solutions).

Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Sun Dec 20 2020
Journal Name
Journal Of Accounting And Financial Studies ( Jafs )
Form a proposal to audit the mutual operations with related parties program in accordance with international standards: Proposal pattern
...Show More Authors

The relationships between the related parties constitute a normal feature of trading and business processes. Entities may perform parts of their activities through subsidiary entities, joint ventures and associate entities. In these cases, the entity has the ability to influence the financial and operating policies of the investee through control, joint control or significant influence,  So could affect established knowledge of transactions and balances outstanding, including commitments, and relationships with related to the evaluation of its operations by users of financial statements, including the risks and opportunities facing the entity assess the parties. So research has gained importance of the importance of the availability

... Show More
View Publication Preview PDF
Publication Date
Wed Oct 28 2015
Journal Name
Journal Of Mathematics And System Science
Simulating Particle Swarm Optimization Algorithm to Estimate Likelihood Function of ARMA(1, 1) Model
...Show More Authors

Crossref
Publication Date
Sun Oct 18 2015
Journal Name
International Journal Of Pure And Applied Mathematics
A MODIFIED FUZZY MULTI-OBJECTIVE LINEAR PROGRAMMING TO SOLVE AGGREGATE PRODUCTION PLANNING
...Show More Authors

This paper develops a fuzzy multi-objective model for solving aggregate production planning problems that contain multiple products and multiple periods in uncertain environments. We seek to minimize total production cost and total labor cost. We adopted a new method that utilizes a Zimmermans approach to determine the tolerance and aspiration levels. The actual performance of an industrial company was used to prove the feasibility of the proposed model. The proposed model shows that the method is useful, generalizable, and can be applied to APP problems with other parameters.

View Publication Preview PDF
Scopus (9)
Crossref (1)
Scopus Crossref
Publication Date
Mon Oct 01 2018
Journal Name
Journal Of Economics And Administrative Sciences
Nurse Scheduling Problem Using Hybrid Simulated Annealing Algorithm
...Show More Authors

Nurse scheduling problem is one of combinatorial optimization problems and it is one of NP-Hard problems which is difficult to be solved as optimal solution. In this paper, we had created an proposed algorithm which it is hybrid simulated annealing algorithm to solve nurse scheduling problem, developed the simulated annealing algorithm and Genetic algorithm. We can note that the proposed algorithm (Hybrid simulated Annealing Algorithm(GS-h)) is the best method among other methods which it is used in this paper because it satisfied minimum average of the total cost and maximum number of Solved , Best and Optimal problems. So we can note that the ratios of the optimal solution are 77% for the proposed algorithm(GS-h), 28.75% for Si

... Show More
View Publication Preview PDF
Crossref
Publication Date
Sun Jun 01 2014
Journal Name
Baghdad Science Journal
Using Bernoulli Equation to Solve Burger's Equation
...Show More Authors

In this paper we find the exact solution of Burger's equation after reducing it to Bernoulli equation. We compare this solution with that given by Kaya where he used Adomian decomposition method, the solution given by chakrone where he used the Variation iteration method (VIM)and the solution given by Eq(5)in the paper of M. Javidi. We notice that our solution is better than their solutions.

View Publication Preview PDF
Crossref
Publication Date
Sat Dec 31 2022
Journal Name
International Journal Of Intelligent Engineering And Systems
Using Three-Dimensional Logistic Equations and Glowworm Swarm Optimization Algorithm to Generate S-Box
...Show More Authors

View Publication
Scopus (2)
Scopus Crossref
Publication Date
Mon Feb 28 2022
Journal Name
Journal Of Educational And Psychological Researches
A Suggested Proposal to Activate Educational Supervision Based on Professional Learning Societies
...Show More Authors

Professional learning societies (PLS) are a systematic method for improving teaching and learning performance through designing and building professional learning societies. This leads to overcoming a culture of isolation and fragmenting the work of educational supervisors. Many studies show that constructing and developing strong professional learning societies - focused on improving education, curriculum and evaluation will lead to increased cooperation and participation of educational supervisors and teachers, as well as increases the application of effective educational practices in the classroom.

The roles of the educational supervisor to ensure the best and optimal implementation and activation of professional learning soci

... Show More
View Publication Preview PDF
Publication Date
Tue Jun 01 2021
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
A New Approach of Morgan-Voyce Polynomial to Solve Three Point Boundary Value Problems
...Show More Authors

In this paper, a new procedure is introduced to estimate the solution for the three-point boundary value problem which is instituted on the use of Morgan-Voyce polynomial. In the beginning, Morgan-Voyce polynomial along with their important properties is introduced. Next, this polynomial with aid of the collocation method utilized to modify the differential equation with boundary conditions to the algebraic system. Finally, the examples approve the validity and accuracy of the proposed method.

View Publication Preview PDF
Crossref (2)
Crossref
Publication Date
Wed Sep 01 2021
Journal Name
Baghdad Science Journal
Optimum Median Filter Based on Crow Optimization Algorithm
...Show More Authors

          A novel median filter based on crow optimization algorithms (OMF) is suggested to reduce the random salt and pepper noise and improve the quality of the RGB-colored and gray images. The fundamental idea of the approach is that first, the crow optimization algorithm detects noise pixels, and that replacing them with an optimum median value depending on a criterion of maximization fitness function. Finally, the standard measure peak signal-to-noise ratio (PSNR), Structural Similarity, absolute square error and mean square error have been used to test the performance of suggested filters (original and improved median filter) used to removed noise from images. It achieves the simulation based on MATLAB R2019b and the resul

... Show More
View Publication Preview PDF
Scopus (7)
Crossref (2)
Scopus Clarivate Crossref
Publication Date
Fri Apr 01 2022
Journal Name
Baghdad Science Journal
An Evolutionary Algorithm for Solving Academic Courses Timetable Scheduling Problem
...Show More Authors

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

... Show More
View Publication Preview PDF
Scopus (12)
Crossref (7)
Scopus Clarivate Crossref