Preferred Language
Articles
/
phekRI8BVTCNdQwCJWhr
A novel kite cross hexagonal search algorithm for fast block motion estimation
...Show More Authors

The performance quality and searching speed of Block Matching (BM) algorithm are affected by shapes and sizes of the search patterns used in the algorithm. In this paper, Kite Cross Hexagonal Search (KCHS) is proposed. This algorithm uses different search patterns (kite, cross, and hexagonal) to search for the best Motion Vector (MV). In first step, KCHS uses cross search pattern. In second step, it uses one of kite search patterns (up, down, left, or right depending on the first step). In subsequent steps, it uses large/small Hexagonal Search (HS) patterns. This new algorithm is compared with several known fast block matching algorithms. Comparisons are based on search points and Peak Signal to Noise Ratio (PSNR). According to results obtained in this paper, KCHS needs less search time than others algorithms and gives very acceptable performance quality.

Scopus
Preview PDF
Quick Preview PDF
Publication Date
Wed Apr 14 2021
Journal Name
Wireless Personal Communications
A Partial CSI Estimation Approach for Downlink FDD massive-MIMO System with Different Base Transceiver Station Topologies
...Show More Authors

Massive multiple-input multiple-output (massive-MIMO) is a promising technology for next generation wireless communications systems due to its capability to increase the data rate and meet the enormous ongoing data traffic explosion. However, in non-reciprocal channels, such as those encountered in frequency division duplex (FDD) systems, channel state information (CSI) estimation using downlink (DL) training sequence is to date very challenging issue, especially when the channel exhibits a shorter coherence time. In particular, the availability of sufficiently accurate CSI at the base transceiver station (BTS) allows an efficient precoding design in the DL transmission to be achieved, and thus, reliable communication systems can be obtaine

... Show More
View Publication
Scopus (6)
Crossref (6)
Scopus Clarivate Crossref
Publication Date
Sat Jan 01 2022
Journal Name
Proceedings Of International Conference On Computing And Communication Networks
Speech Age Estimation Using a Ranking Convolutional Neural Network
...Show More Authors

View Publication
Scopus (3)
Scopus Clarivate Crossref
Publication Date
Sun Oct 01 2017
Journal Name
International Journal Of Scientific & Engineering Research
Horizontal Fragmentation for Most Frequency Frequent Pattern Growth Algorithm
...Show More Authors

Abstract: Data mining is become very important at the present time, especially with the increase in the area of information it's became huge, so it was necessary to use data mining to contain them and using them, one of the data mining techniques are association rules here using the Pattern Growth method kind enhancer for the apriori. The pattern growth method depends on fp-tree structure, this paper presents modify of fp-tree algorithm called HFMFFP-Growth by divided dataset and for each part take most frequent item in fp-tree so final nodes for conditional tree less than the original fp-tree. And less memory space and time.

View Publication Preview PDF
Publication Date
Sun Jan 01 2012
Journal Name
International Journal Of Cyber-security And Digital Forensics (ijcsdf)
Genetic Algorithm Approach for Risk Reduction of Information Security
...Show More Authors

Nowadays, information systems constitute a crucial part of organizations; by losing security, these organizations will lose plenty of competitive advantages as well. The core point of information security (InfoSecu) is risk management. There are a great deal of research works and standards in security risk management (ISRM) including NIST 800-30 and ISO/IEC 27005. However, only few works of research focus on InfoSecu risk reduction, while the standards explain general principles and guidelines. They do not provide any implementation details regarding ISRM; as such reducing the InfoSecu risks in uncertain environments is painstaking. Thus, this paper applied a genetic algorithm (GA) for InfoSecu risk reduction in uncertainty. Finally, the ef

... Show More
Publication Date
Sun Dec 02 2012
Journal Name
Baghdad Science Journal
Stability of Back Propagation Training Algorithm for Neural Networks
...Show More Authors

In this paper, we derive and prove the stability bounds of the momentum coefficient µ and the learning rate ? of the back propagation updating rule in Artificial Neural Networks .The theoretical upper bound of learning rate ? is derived and its practical approximation is obtained

View Publication Preview PDF
Crossref
Publication Date
Sun Jan 14 2018
Journal Name
Journal Of Engineering
Determination Optimum Inventory Level for Material Using Genetic Algorithm
...Show More Authors

The integration of decision-making will lead to the robust of its decisions, and then determination optimum inventory level to the required materials to produce and reduce the total cost by the cooperation of purchasing department with inventory department and also with other company,s departments. Two models are suggested to determine Optimum Inventory Level (OIL), the first model (OIL-model 1) assumed that the inventory level for materials quantities equal to the required materials, while the second model (OIL-model 2) assumed that the inventory level for materials quantities more than the required materials for the next period.             &nb

... Show More
View Publication Preview PDF
Publication Date
Thu Nov 02 2023
Journal Name
Journal Of Engineering
An Improved Adaptive Spiral Dynamic Algorithm for Global Optimization
...Show More Authors

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)

... Show More
View Publication Preview PDF
Crossref
Publication Date
Tue Nov 01 2016
Journal Name
2016 International Conference On Advances In Electrical, Electronic And Systems Engineering (icaees)
Efficient routing algorithm for VANETs based on distance factor
...Show More Authors

There has been a great deal of research into the considerable challenge of managing of traffic at road junctions; its application to vehicular ad hoc network (VANET) has proved to be of great interest in the developed world. Dynamic topology is one of the vital challenges facing VANET; as a result, routing of packets to their destination successfully and efficiently is a non-simplistic undertaking. This paper presents a MDORA, an efficient and uncomplicated algorithm enabling intelligent wireless vehicular communications. MDORA is a robust routing algorithm that facilitates reliable routing through communication between vehicles. As a position-based routing technique, the MDORA algorithm, vehicles' precise locations are used to establish th

... Show More
View Publication
Scopus (8)
Crossref (6)
Scopus Crossref
Publication Date
Tue Oct 01 2013
Journal Name
2013 Ieee International Conference On Systems, Man, And Cybernetics
AWSS: An Algorithm for Measuring Arabic Word Semantic Similarity
...Show More Authors

View Publication
Scopus (24)
Crossref (12)
Scopus Clarivate Crossref
Publication Date
Sun Jan 01 2023
Journal Name
Computers, Materials & Continua
An Optimal Algorithm for Resource Allocation in D2D Communication
...Show More Authors

View Publication
Scopus (1)
Scopus Clarivate Crossref