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
Tue Sep 01 2009
Journal Name
Journal Of Economics And Administrative Sciences
The problem of elevating the status of values in scienceStudy in economic thought and macro analysis
...Show More Authors

ان من اهم القضايا التي تثيرها المعرفة البشرية في تجلياتها، وتعبيراتها المفاهيمية، تكمن في مدى تأصلها وانتمائها الى البنى والتشكيلات الموضوعية (في مستوياتها التاريخية) التي تسعى لتفسيرها وادراكها ومضاهاتها. فالينبوع الذي يغرف منه الفكر مادته هو الكيان الاجتماعي المتموضع خارج الوعي والايدولوجيا.

ان قدرة الوعي على ادراك الواقع الموضوعي بخصائصه العامة يشكل الشرط  الضروري لاكتساب الوعي ل

... Show More
View Publication Preview PDF
Crossref
Publication Date
Fri Jan 01 2010
Journal Name
Iraqi Journal Of Science
RETRIEVING DOCUMENT WITH COMPACT GENETIC ALGORITHM(CGA)
...Show More Authors

Preview PDF
Publication Date
Mon Jan 01 2018
Journal Name
International Journal Of Data Mining, Modelling And Management
Association rules mining using cuckoo search algorithm
...Show More Authors

Association rules mining (ARM) is a fundamental and widely used data mining technique to achieve useful information about data. The traditional ARM algorithms are degrading computation efficiency by mining too many association rules which are not appropriate for a given user. Recent research in (ARM) is investigating the use of metaheuristic algorithms which are looking for only a subset of high-quality rules. In this paper, a modified discrete cuckoo search algorithm for association rules mining DCS-ARM is proposed for this purpose. The effectiveness of our algorithm is tested against a set of well-known transactional databases. Results indicate that the proposed algorithm outperforms the existing metaheuristic methods.

View Publication Preview PDF
Scopus (8)
Crossref (3)
Scopus Crossref
Publication Date
Tue Aug 23 2022
Journal Name
Int. J. Nonlinear Anal. Appl.
Face mask detection based on algorithm YOLOv5s
...Show More Authors

Determining the face of wearing a mask from not wearing a mask from visual data such as video and still, images have been a fascinating research topic in recent decades due to the spread of the Corona pandemic, which has changed the features of the entire world and forced people to wear a mask as a way to prevent the pandemic that has calmed the entire world, and it has played an important role. Intelligent development based on artificial intelligence and computers has a very important role in the issue of safety from the pandemic, as the Topic of face recognition and identifying people who wear the mask or not in the introduction and deep education was the most prominent in this topic. Using deep learning techniques and the YOLO (”You on

... Show More
Publication Date
Wed Jan 01 2020
Journal Name
Journal Of Southwest Jiaotong University
IMPROVED STRUCTURE OF DATA ENCRYPTION STANDARD ALGORITHM
...Show More Authors

The Internet is providing vital communications between millions of individuals. It is also more and more utilized as one of the commerce tools; thus, security is of high importance for securing communications and protecting vital information. Cryptography algorithms are essential in the field of security. Brute force attacks are the major Data Encryption Standard attacks. This is the main reason that warranted the need to use the improved structure of the Data Encryption Standard algorithm. This paper proposes a new, improved structure for Data Encryption Standard to make it secure and immune to attacks. The improved structure of Data Encryption Standard was accomplished using standard Data Encryption Standard with a new way of two key gene

... Show More
Publication Date
Sun Mar 01 2015
Journal Name
Computer Systems Science & Engineering
Parameters' fine tuning of differential evolution algorithm
...Show More Authors

Most heuristic search method's performances are dependent on parameter choices. These parameter settings govern how new candidate solutions are generated and then applied by the algorithm. They essentially play a key role in determining the quality of the solution obtained and the efficiency of the search. Their fine-tuning techniques are still an on-going research area. Differential Evolution (DE) algorithm is a very powerful optimization method and has become popular in many fields. Based on the prolonged research work on DE, it is now arguably one of the most outstanding stochastic optimization algorithms for real-parameter optimization. One reason for its popularity is its widely appreciated property of having only a small number of par

... Show More
Scopus (7)
Scopus
Publication Date
Sun Nov 01 2020
Journal Name
Iop Conference Series: Materials Science And Engineering
Developed JPEG Algorithm Applied in Image Compression
...Show More Authors
Abstract<p>JPEG is most popular image compression and encoding, this technique is widely used in many applications (images, videos and 3D animations). Meanwhile, researchers are very interested to develop this massive technique to compress images at higher compression ratios with keeping image quality as much as possible. For this reason in this paper we introduce a developed JPEG based on fast DCT and removed most of zeros and keeps their positions in a transformed block. Additionally, arithmetic coding applied rather than Huffman coding. The results showed up, the proposed developed JPEG algorithm has better image quality than traditional JPEG techniques.</p>
View Publication
Scopus (10)
Crossref (8)
Scopus Crossref
Publication Date
Tue Mar 30 2021
Journal Name
Baghdad Science Journal
Delivery Route Management based on Dijkstra Algorithm
...Show More Authors

For businesses that provide delivery services, the efficiency of the delivery process in terms of punctuality is very important. In addition to increasing customer trust, efficient route management, and selection are required to reduce vehicle fuel costs and expedite delivery. Some small and medium businesses still use conventional methods to manage delivery routes. Decisions to manage delivery schedules and routes do not use any specific methods to expedite the delivery settlement process. This process is inefficient, takes a long time, increases costs and is prone to errors. Therefore, the Dijkstra algorithm has been used to improve the delivery management process. A delivery management system was developed to help managers and drivers

... Show More
View Publication Preview PDF
Scopus (4)
Scopus Clarivate Crossref
Publication Date
Mon Jun 01 2020
Journal Name
Iop Conference Series: Materials Science And Engineering
Common Fixed Point problem for Classes of Nonlinear Maps in Hilbert Space
...Show More Authors
Abstract<p>in this article, we present a definition of k-generalized map independent of non-expansive map and give infinite families of non-expansive and k-generalized maps new iterative algorithms. Such algorithms are also studied in the Hilbert spaces as the potential to exist for asymptotic common fixed point.</p>
View Publication
Scopus (6)
Crossref (1)
Scopus Crossref
Publication Date
Sat May 01 2021
Journal Name
Journal Of Physics: Conference Series
Three Weighted Residuals Methods for Solving the Nonlinear Thin Film Flow Problem
...Show More Authors
Abstract<p>In this paper, the methods of weighted residuals: Collocation Method (CM), Least Squares Method (LSM) and Galerkin Method (GM) are used to solve the thin film flow (TFF) equation. The weighted residual methods were implemented to get an approximate solution to the TFF equation. The accuracy of the obtained results is checked by calculating the maximum error remainder functions (MER). Moreover, the outcomes were examined in comparison with the 4<sup>th</sup>-order Runge-Kutta method (RK4) and good agreements have been achieved. All the evaluations have been successfully implemented by using the computer system Mathematica®10.</p>
View Publication
Crossref (1)
Crossref