In this paper has been building a statistical model of the Saudi financial market using GARCH models that take into account Volatility in prices during periods of circulation, were also study the effect of the type of random error distribution of the time series on the accuracy of the statistical model, as it were studied two types of statistical distributions are normal distribution and the T distribution. and found by application of a measured data that the best model for the Saudi market is GARCH (1,1) model when the random error distributed t. student's .

Survival analysis is widely applied to data that described by the length of time until the occurrence of an event under interest such as death or other important events. The purpose of this paper is to use the dynamic methodology which provides a flexible method, especially in the analysis of discrete survival time, to estimate the effect of covariate variables through time in the survival analysis on dialysis patients with kidney failure until death occurs. Where the estimations process is completely based on the Bayes approach by using two estimation methods: the maximum A Posterior (MAP) involved with Iteratively Weighted Kalman Filter Smoothing (IWKFS) and in combination with the Expectation Maximization (EM) algorithm. While the other

Finding the shortest route in wireless mesh networks is an important aspect. Many techniques are used to solve this problem like dynamic programming, evolutionary algorithms, weighted-sum techniques, and others. In this paper, we use dynamic programming techniques to find the shortest path in wireless mesh networks due to their generality, reduction of complexity and facilitation of numerical computation, simplicity in incorporating constraints, and their onformity to the stochastic nature of some problems. The routing problem is a multi-objective optimization problem with some constraints such as path capacity and end-to-end delay. Single-constraint routing problems and solutions using Dijkstra, Bellman-Ford, and Floyd-Warshall algorith

Abstract

The study presents a mathematical model with a disaggregating approach to the problem of production planning of a fida Company; which belongs to the ministry of Industry. The study considers disaggregating the entire production into 3 productive families of (hydraulic cylinders, Aldblatt (dampers), connections hydraulics with each holds similar characteristics in terms of the installation cost, production time and stock cost. The Consequences are an ultimate use of the available production capacity as well as meeting the requirements of these families at a minimal cost using linear programming. Moreover, the study considers developing a Master production schedule that drives detailed material and production requi

Objective: To identify the effect of the cube model on visual-spatial intelligence and learning the skill of spikinging in volleyball for female students, The researchers used the experimental method by designing two equivalent groups with pre- and post-measurements. Research methodology: The main research sample of (30) female students was selected from the research community represented by second-stage students in the College of Physical Education and Sports Sciences - University of Baghdad for the academic year (2024-2025). The sample was divided equally into two control and experimental groups. The researchers conducted the sample homogenization process and the equivalence process between the two groups in the variables of visua

Autorías: Muayad Kadhim Raheem, Lina Fouad Jawad. Localización: Opción: Revista de Ciencias Humanas y Sociales. Nº. 21, 2019. Artículo de Revista en Dialnet.

Recently, detecting dynamic patterns for growing communities in social networks have attracted significant attention. The objective of dynamic community detection is to analyze and identify clusters in complex networks that change over time. Different optimization algorithms, including both single-objective and multi-objective approaches, have been employed to address the challenge of dynamic community detection. Although current evolutionary algorithms for identifying community structure can traverse extensive areas of partition space, they often become stuck in local minima. In addition, limited studies have addressed this issue by integrating local search strategies with evolutionary algorithms for community identification. This paper in