Providing stress of poetry on the syllable-, the foot-, and the phonological word- levels is one of the essential objectives of Metrical Phonology Theory. The subsumed number and types of syllables, feet, and meters are steady in poetry compared to other literary texts that is why its analysis demonstrates one of the most outstanding and debatable metrical issues. The roots of Metrical Phonology Theory are derived from prosody which studies poetic meters and versification. In Arabic, the starting point of metrical analysis is prosodic analysis which can be attributed to يديهارفلا in the second half of the eighth century (A.D.). This study aims at pinpointing the values of two metrical parameters in modern Arabic poetry. To

Providing stress of poetry on the syllable-, the foot-, and the phonological word- levels is one of the essential objectives of Metrical Phonology Theory. The subsumed number and types of syllables, feet, and meters are steady in poetry compared to other literary texts that is why its analysis demonstrates one of the most outstanding and debatable metrical issues. The roots of Metrical Phonology Theory are derived from prosody which studies poetic meters and versification. In Arabic, the starting point of metrical analysis is prosodic analysis which can be attributed to يديهارفلا in the second half of the eighth century (A.D.). This study aims at pinpointing the values of two metrical parameters in modern Arabic poetry. To

Abstract The study aimed at reviewing translation theories proposed to address problems in translation studies. To the end, translation theories and their applications were reviewed in different studies with a focus on issues such as critical discourse analysis, cultural specific items and collocation translation.

The swarm intelligence and evolutionary methods are commonly utilized by researchers in solving the difficult combinatorial and Non-Deterministic Polynomial (NP) problems. The N-Queen problem can be defined as a combinatorial problem that became intractable for the large ‘n’ values and, thereby, it is placed in the NP class of problems. In the present study, a solution is suggested for the N-Queen problem, on the basis of the Meerkat Clan Algorithm (MCA). The problem of n-Queen can be mainly defined as one of the generalized 8-Queen problem forms, for which the aim is placing 8 queens in a way that none of the queens has the ability of killing the others with the use of the standard moves of the chess queen. The Meerkat Clan environm

An Optimal Algorithm for HTML Page Building Process

Krawtchouk 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

This 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

In many video and image processing applications, the frames are partitioned into blocks, which are extracted and processed sequentially. In this paper, we propose a fast algorithm for calculation of features of overlapping image blocks. We assume the features are projections of the block on separable 2D basis functions (usually orthogonal polynomials) where we benefit from the symmetry with respect to spatial variables. The main idea is based on a construction of auxiliary matrices that virtually extends the original image and makes it possible to avoid a time-consuming computation in loops. These matrices can be pre-calculated, stored and used repeatedly since they are independent of the image itself. We validated experimentally th

A numerical algorithm for solving linear and non-linear fractional differential equations is proposed based on the Bees algorithm and Chebyshev polynomials. The proposed algorithm was applied to a set of numerical examples. Faster results are obtained compared to the wavelet methods.