Preferred Language
Articles
/
excl7I0BVTCNdQwCMSnL
Minimizing Costs of Transportation Problems Using the Genetic Algorithm
...Show More Authors

Scopus Crossref
View Publication
Publication Date
Thu Oct 26 2017
Journal Name
International Journal Of Pure And Applied Mathematics
ON CONVEX FUNCTIONS, $E$-CONVEX FUNCTIONS AND THEIR GENERALIZATIONS: APPLICATIONS TO NON-LINEAR OPTIMIZATION PROBLEMS
...Show More Authors

Contents IJPAM: Volume 116, No. 3 (2017)

View Publication
Publication Date
Wed Aug 01 2018
Journal Name
Journal Of Economics And Administrative Sciences
Proposed Measure for Effect Size in Mediation Analysis with Solution to Some Mediation Process Problems
...Show More Authors

In this paper, the effect size measures was discussed, which are useful in many estimation processes for direct effect and its relation with indirect and total effects. In addition, an algorithm to calculate the suggested measure of effect size was suggested that represent the ratio of direct effect to the effect of the estimated parameter using the Regression equation of the dependent variable on the mediator variable without using the independent variable in the model. Where this an algorithm clear the possibility to use this regression equation in Mediation Analysis, where usually used the Mediator and independent variable together when the dependent variable regresses on them. Also this an algorithm to show how effect of the

... Show More
View Publication Preview PDF
Crossref
Publication Date
Sat May 01 2021
Journal Name
Journal Of Physics: Conference Series
On semi strongly (E, F)-convex functions and semi strongly (E, F)-convex optimization problems
...Show More Authors
Abstract<p>In this paper, a new class of non-convex functions called semi strongly (<italic>E, F</italic>)-convex functions are presented. This class represents a natural extension of semi strongly <italic>E</italic>-convex functions shown in the literature. Different properties of this class of functions are discussed. Optimality properties of constrained optimization problems in which the objective function or the inequality constraints functions are semi strongly (<italic>E, F</italic>)-convex are proved for this class.</p>
View Publication
Scopus (3)
Crossref (1)
Scopus Crossref
Publication Date
Fri Jan 01 2016
Journal Name
Journal Of Engineering
Enhanced Chain-Cluster Based Mixed Routing Algorithm for Wireless Sensor Networks
...Show More Authors

Energy efficiency is a significant aspect in designing robust routing protocols for wireless sensor networks (WSNs). A reliable routing protocol has to be energy efficient and adaptive to the network size. To achieve high energy conservation and data aggregation, there are two major techniques, clusters and chains. In clustering technique, sensor networks are often divided into non-overlapping subsets called clusters. In chain technique, sensor nodes will be connected with the closest two neighbors, starting with the farthest node from the base station till the closest node to the base station. Each technique has its own advantages and disadvantages which motivate some researchers to come up with a hybrid routing algorit

... Show More
View Publication Preview PDF
Publication Date
Tue Jan 01 2019
Journal Name
Ieee Access
Speech Enhancement Algorithm Based on Super-Gaussian Modeling and Orthogonal Polynomials
...Show More Authors

View Publication
Scopus (44)
Crossref (43)
Scopus Clarivate Crossref
Publication Date
Sun Dec 01 2019
Journal Name
Applied Soft Computing
A new evolutionary multi-objective community mining algorithm for signed networks
...Show More Authors

View Publication
Scopus (8)
Crossref (5)
Scopus Clarivate Crossref
Publication Date
Sat Dec 01 2018
Journal Name
Al-khwarizmi Engineering Journal
Applying A* Path Planning Algorithm Based on Modified C-Space Analysis
...Show More Authors

In this paper, a modified derivation has been introduced to analyze the construction of C-space. The profit from using C-space is to make the process of path planning more safety and easer. After getting the C-space construction and map for two-link planar robot arm, which include all the possible situations of collision between robot parts and obstacle(s), the A* algorithm, which is usually used to find a heuristic path on Cartesian W-space, has been used to find a heuristic path on C-space map. Several modifications are needed to apply the methodology for a manipulator with degrees of freedom more than two. The results of C-space map, which are derived by the modified analysis, prove the accuracy of the overall C-space mapping and cons

... Show More
View Publication Preview PDF
Crossref (4)
Crossref
Publication Date
Wed May 10 2023
Journal Name
Journal Of Engineering
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).

View Publication Preview PDF
Crossref (1)
Crossref
Publication Date
Sun Apr 01 2018
Journal Name
2018 9th International Conference On Information And Communication Systems (icics)
An intersection-based segment aware algorithm for geographic routing in VANETs
...Show More Authors

In networking communication systems like vehicular ad hoc networks, the high vehicular mobility leads to rapid shifts in vehicle densities, incoherence in inter-vehicle communications, and challenges for routing algorithms. It is necessary that the routing algorithm avoids transmitting the pockets via segments where the network density is low and the scale of network disconnections is high as this could lead to packet loss, interruptions and increased communication overhead in route recovery. Hence, attention needs to be paid to both segment status and traffic. The aim of this paper is to present an intersection-based segment aware algorithm for geographic routing in vehicular ad hoc networks. This algorithm makes available the best route f

... Show More
View Publication
Scopus (4)
Crossref (4)
Scopus Crossref
Publication Date
Wed Sep 30 2020
Journal Name
Journal Of Accounting And Financial Studies ( Jafs )
Adoption of the IFRS11 Financial Reporting Standard for Oil Service Contracts Costs and its Reflection on Measurement and Disclosure for National Oil Companies: بحث تطبيق في شركة نفط ميسان (ش . ع)
...Show More Authors

The research seeks to clarify the problems related to the aspects of the financial and accounting process resulting from entering into contractual arrangements with a period of more than 20 years, among which is the research problem represented by the lack of clarity of the foundations and procedures for the recognition of oil costs and additional costs borne by foreign invested companies, which led to a weakening of their credibility and reflection. Negatively "on the measurement and accounting disclosure of financial reports prepared by oil companies, and the research aims to lay down sound procedures for measuring and classifying oil costs and additional costs paid to foreign companies, and recognizing and recording them in th

... Show More
View Publication Preview PDF