Precision is one of the main elements that control the quality of a geodetic network, which defines as the measure of the network efficiency in propagation of random errors. This research aims to solve ZOD and FOD problems for a geodetic network using Rosenbrock Method to optimize the geodetic networks by using MATLAB programming language, to find the optimal design of geodetic network with high precision. ZOD problem was applied to a case study network consists of 19 points and 58 designed distances with a priori deviation equal to 5mm, to determine the best points in the network to consider as control points. The results showed that P55 and P73 having the minimum ellipse of error and considered as control points. FOD problem was applie

Orthogonal polynomials and their moments serve as pivotal elements across various fields. Discrete Krawtchouk polynomials (DKraPs) are considered a versatile family of orthogonal polynomials and are widely used in different fields such as probability theory, signal processing, digital communications, and image processing. Various recurrence algorithms have been proposed so far to address the challenge of numerical instability for large values of orders and signal sizes. The computation of DKraP coefficients was typically computed using sequential algorithms, which are computationally extensive for large order values and polynomial sizes. To this end, this paper introduces a computationally efficient solution that utilizes the parall

A new Differential Evolution (ARDE) algorithm is introduced that automatically adapt a repository of DE strategies and parameters adaptation schemes of the mutation factor and the crossover rate to avoid the problems of stagnation and make DE responds to a wide range of function characteristics at different stages of the evolution. ARDE algorithm makes use of JADE strategy and the MDE_pBX parameters adaptive schemes as frameworks. Then a new adaptive procedure called adaptive repository (AR) has been developed to select the appropriate combinations of the JADE strategies and the parameter control schemes of the MDE_pBX to generate the next population based on their fitness values. Experimental results have been presented to confirm the reli

هناك دائما حاجة إلى طريقة فعالة لتوليد حل عددي أكثر دقة للمعادلات التكاملية ذات النواة المفردة أو المفردة الضعيفة لأن الطرق العددية لها محدودة. في هذه الدراسة ، تم حل المعادلات التكاملية ذات النواة المفردة أو المفردة الضعيفة باستخدام طريقة متعددة حدود برنولي. الهدف الرئيسي من هذه الدراسة هو ايجاد حل تقريبي لمثل هذه المشاكل في شكل متعددة الحدود في سلسلة من الخطوات المباشرة. أيضا ، تم افتراض أن مقام النواة

Objectives. The current study aimed to predict the combined mesiodistal crown widths of maxillary and mandibular canines and premolars from the combined mesiodistal crown widths of maxillary and mandibular incisors and first molars. Materials and Methods. This retrospective study utilized 120 dental models from Iraqi Arab young adult subjects with normal dental relationships. The mesiodistal crown widths of all teeth (except the second molars) were measured at the level of contact points using digital electronic calipers. The relation between the sum mesiodistal crown widths of the maxillary and mandibular incisors and first molars and the combined mesiodistal crown widths of the maxillary and mandibular canines and premolars was as

<abstract><p>Many variations of the algebraic Riccati equation (ARE) have been used to study nonlinear system stability in the control domain in great detail. Taking the quaternion nonsymmetric ARE (QNARE) as a generalized version of ARE, the time-varying QNARE (TQNARE) is introduced. This brings us to the main objective of this work: finding the TQNARE solution. The zeroing neural network (ZNN) technique, which has demonstrated a high degree of effectiveness in handling time-varying problems, is used to do this. Specifically, the TQNARE can be solved using the high order ZNN (HZNN) design, which is a member of the family of ZNN models that correlate to hyperpower iterative techniques. As a result, a novel

The aim of this paper is to construct cyclic subgroups of the projective general linear group over  from the companion matrix, and then form caps of various degrees in . Geometric properties of these caps as secant distributions and index distributions are given and determined if they are complete. Also, partitioned of  into disjoint lines is discussed.