It is well-known that the existence of outliers in the data will adversely affect the efficiency of estimation and results of the current study. In this paper four methods will be studied to detect outliers for the multiple linear regression model in two cases :  first, in real data; and secondly,  after adding the outliers to data and the attempt to detect it. The study is conducted for samples with different sizes, and uses three measures for  comparing between these methods . These three measures are : the mask, dumping and standard error of the estimate.

This research is concerned with the study of (the aesthetic of constructive relations in linear composition) with what distinguished Arabic calligraphy through the style and artistic method in its construction, and the specifications it carries that enabled it to pay attention to building formations to achieve in its total linear ranges aesthetic values and relationships. Through the research, the models and the exploratory study that he obtained, the researcher was able to raise the research problem in the first chapter according to the following question: What is the aesthetic of constructive relations in linear formation?
The importance of the research in achieving the aesthetics of the formations, which is a wide field according t

Investigation regarding queue length dynamics have been explored using various kinds of models including ordinary differential equations (ODEs). ODEs possess the advantageous property of having a continuous-time representation of queue length dynamics, thus its adoption in this article in modelling various scenarios as system of first-order ODEs. Specifically, a multi-server queue is considered and a numerical approach for solving first-order ODEs using MATLAB is adopted to obtain approximate solutions of the resultant models. The results display the dynamics of the queue length in each scenario, thus showing the usefulness of ODEs in analysing the behaviour of queues using system of ODEs.

Among the available chaotic modulation schemes, differential chaos shift keying (DSCK) offers the perfect noise performance. The power consumption of DCSK is high since it sends chaotic signal in both of 1 and 0 transmission, so it does not represent the optimal choice for some applications like indoor wireless sensing where power consumption is a critical issue. In this paper a novel noncoherent chaotic communication scheme called differential chaos on-off keying (DCOOK) is proposed as a solution of this problem. With the proposed scheme, the DCOOK signal have a structure similar to chaos on-off keying (COOK) scheme with improved performance in noisy and multipath channels by introducing the concept of differential coherency used in DCS

Recalcitrant adventitious root (AR) development is a major hurdle in propagating commercially important woody plants. Although significant progress has been made to identify genes involved in subsequent steps of AR development, the molecular basis of differences in apparent recalcitrance to form AR between easy-to-root and difficult-to-root genotypes remains unknown. To address this, we generated cambium tissue-specific transcriptomic data from stem cuttings of hybrid aspen, T89 (difficult-to-root) and hybrid poplar OP42 (easy-to-root), and used transgenic approaches to verify the role of several transcription factors in the control of adventitious rooting. Increased peroxidase activity was positively correlated with better rooting. We foun

In this paper, a discretization of a three-dimensional fractional-order prey-predator model has been investigated with Holling type III functional response. All its fixed points are determined; also, their local stability is investigated. We extend the discretized system to an optimal control problem to get the optimal harvesting amount. For this, the discrete-time Pontryagin’s maximum principle is used. Finally, numerical simulation results are given to confirm the theoretical outputs as well as to solve the optimality problem.

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