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.
This study tests the effect of a large number of independent variables that control the growth of the total productivity, which amounted to 112 variables, gathered from what is mentioned in the specialized theoretical and applied literature. The data for these variables were taken from global reports of sound international organizations and reliable databases covering the period 1991-2016. The data of the dependent variable, the growth of the total factor productivity, were taken from the database of the world development indicators. The study covered 61 countries for which data were available. The study included three regression models to explain
... Show MoreThe modern steer-by-wire (SBW) systems represent a revolutionary departure from traditional automotive designs, replacing mechanical linkages with electronic control mechanisms. However, the integration of such cutting-edge technologies is not without its challenges, and one critical aspect that demands thorough consideration is the presence of nonlinear dynamics and communication network time delays. Therefore, to handle the tracking error caused by the challenge of time delays and to overcome the parameter uncertainties and external perturbations, a robust fast finite-time composite controller (FFTCC) is proposed for improving the performance and safety of the SBW systems in the present article. By lumping the uncertainties, parameter var
... Show MoreTransient drop in the heart beat or transient heart block (AVB) may be consider the main cause of syncope or presyncope inpatients with bifascicular block and syncope According to the Guidelines for cardiac pacing pacemaker consider part of treatment. Aims of our study were to evaluate whether there is role for EPS in patients BFB and to evaluate the symptoms after pacing. 42 patients were enrolled in this study, with mean age value (63.4± 12.2years), suffer from interventricular conductive defect and syncope; patients underwent EPS on admission time, and pacemaker implantation accordingly and programmed follow up for the device in the last four years. Our patients were 25 (59.5%) male and 17 (40.5%)female, all of them with syncope o
... Show MoreAn Optimal Algorithm for HTML Page Building Process
Regression testing being expensive, requires optimization notion. Typically, the optimization of test cases results in selecting a reduced set or subset of test cases or prioritizing the test cases to detect potential faults at an earlier phase. Many former studies revealed the heuristic-dependent mechanism to attain optimality while reducing or prioritizing test cases. Nevertheless, those studies were deprived of systematic procedures to manage tied test cases issue. Moreover, evolutionary algorithms such as the genetic process often help in depleting test cases, together with a concurrent decrease in computational runtime. However, when examining the fault detection capacity along with other parameters, is required, the method falls sh
... Show MoreThis paper proposes a novel meta-heuristic optimization algorithm called the fine-tuning meta-heuristic algorithm (FTMA) for solving global optimization problems. In this algorithm, the solutions are fine-tuned using the fundamental steps in meta-heuristic optimization, namely, exploration, exploitation, and randomization, in such a way that if one step improves the solution, then it is unnecessary to execute the remaining steps. The performance of the proposed FTMA has been compared with that of five other optimization algorithms over ten benchmark test functions. Nine of them are well-known and already exist in the literature, while the tenth one is proposed by the authors and introduced in this article. One test trial was shown t
... Show MoreThe data communication has been growing in present day. Therefore, the data encryption became very essential in secured data transmission and storage and protecting data contents from intruder and unauthorized persons. In this paper, a fast technique for text encryption depending on genetic algorithm is presented. The encryption approach is achieved by the genetic operators Crossover and mutation. The encryption proposal technique based on dividing the plain text characters into pairs, and applying the crossover operation between them, followed by the mutation operation to get the encrypted text. The experimental results show that the proposal provides an important improvement in encryption rate with comparatively high-speed Process
... Show MoreKrawtchouk polynomials (KPs) and their moments are promising techniques for applications of information theory, coding theory, and signal processing. This is due to the special capabilities of KPs in feature extraction and classification processes. The main challenge in existing KPs recurrence algorithms is that of numerical errors, which occur during the computation of the coefficients in large polynomial sizes, particularly when the KP parameter (p) values deviate away from 0.5 to 0 and 1. To this end, this paper proposes a new recurrence relation in order to compute the coefficients of KPs in high orders. In particular, this paper discusses the development of a new algorithm and presents a new mathematical model for computing the
... Show More