The Sliding Mode Control (SMC) has been among powerful control techniques increasingly. Much attention is paid to both theoretical and practical aspects of disciplines due to their distinctive characteristics such as insensitivity to bounded matched uncertainties, reduction of the order of sliding equations of motion, decoupling mechanical systems design. In the current study, two-link robot performance in the Classical SMC is enhanced via Adaptive Sliding Mode Controller (ASMC) despite uncertainty, external disturbance, and coulomb friction. The key idea is abstracted as follows: switching gains are depressed to the low allowable values, resulting in decreased chattering motion and control's efforts of the two-link robo

This research deals with the relationship between television advertising and buying random cosmetics, where we find that TV ads influence on the purchasing behavior of women, has conducted research in the field on a sample of women in the University of Baghdad, was a random sample taken from 150 different women in the age and social levels educational and cultural students and employees and teachers in order to sample representative be for the research community, and designed a questionnaire for this purpose form as a tool to collect data and information search and analyzed they answered the sample surveyed using a statistical program (spss) to extract percentages And correlation coefficients and testing square Kay , The study found Of w

Breast cancer is a heterogeneous disease characterized by molecular complexity. This research utilized three genetic expression profiles—gene expression, deoxyribonucleic acid (DNA) methylation, and micro ribonucleic acid (miRNA) expression—to deepen the understanding of breast cancer biology and contribute to the development of a reliable survival rate prediction model. During the preprocessing phase, principal component analysis (PCA) was applied to reduce the dimensionality of each dataset before computing consensus features across the three omics datasets. By integrating these datasets with the consensus features, the model's ability to uncover deep connections within the data was significantly improved. The proposed multimodal deep

The 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

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