Discrete Racah polynomials (DRPs) are considered essential for several applications such as approximation theory, quantum physics, and digital signal processing. However, the computation of high-order DRPs presents significant numerical and computational challenges. Even though the recent advancements in algorithms have improved numerical stability, the inherently sequential nature of these algorithms continues to be a bottleneck for large-scale implementations. This paper proposes a new multithreading-based algorithm for computing the DRP coefficients. The proposed algorithm is designed to accelerate the computation of high-order DRPs by considering the advantages of the independence of different tasks and the ability to process multiple coefficients simultaneously. The algorithm introduces distinct multithreading strategies for both zero-valued and non-zero-valued parameters, which include the zero-parameter balanced algorithm (ZPBA), the zero-parameter unbalanced algorithm (ZPUA), and the valued-parameter algorithm (VPA). The experimental results show that the proposed multithreading algorithms noticeably reduce computation time when compared to the state-of-the-art baseline algorithm. Notably, both ZPBA and VPA exhibit exceptional scalability across modern multicore architectures, delivering speedup factors exceeding 10× for large polynomial sizes. This work effectively bridges the gap between mathematical theory and high-performance computing, making the generation of large-scale DRP matrices computationally viable for advanced engineering applications.
Early diagnosis and clinical decision-making depend on accurate brain tumor classification using magnetic resonance imaging (MRI). However, traditional deep learning methods usually rely on centralized medical data, which raises privacy concerns and limits the use of distributed clinical data. This research proposes a privacy-preserving federated learning framework for MRI image-based binary brain tumor classification using a decentralized ResNet-18 architecture that enables collaborative training without sharing raw patient data. To reflect realistic clinical conditions, the framework integrates heterogeneous multi-source datasets in different image formats (PNG and JPG) and evaluates performance under both IID and non-IID settings
... Show MoreGeographic Information Systems (GIS) are obtaining a significant role in handling strategic applications in which data are organized as records of multiple layers in a database. Furthermore, GIS provide multi-functions like data collection, analysis, and presentation. Geographic information systems have assured their competence in diverse fields of study via handling various problems for numerous applications. However, handling a large volume of data in the GIS remains an important issue. The biggest obstacle is designing a spatial decision-making framework focused on GIS that manages a broad range of specific data to achieve the right performance. It is very useful to support decision-makers by providing GIS-based decision support syste
... Show MoreTarget tracking is a significant application of wireless sensor networks (WSNs) in which deployment of self-organizing and energy efficient algorithms is required. The tracking accuracy increases as more sensor nodes are activated around the target but more energy is consumed. Thus, in this study, we focus on limiting the number of sensors by forming an ad-hoc network that operates autonomously. This will reduce the energy consumption and prolong the sensor network lifetime. In this paper, we propose a fully distributed algorithm, an Endocrine inspired Sensor Activation Mechanism for multi target-tracking (ESAM) which reflecting the properties of real life sensor activation system based on the information circulating principle in the endocr
... Show MoreThe main focus of this research is to examine the Travelling Salesman Problem (TSP) and the methods used to solve this problem where this problem is considered as one of the combinatorial optimization problems which met wide publicity and attention from the researches for to it's simple formulation and important applications and engagement to the rest of combinatorial problems , which is based on finding the optimal path through known number of cities where the salesman visits each city only once before returning to the city of departure n this research , the benefits of( FMOLP) algorithm is employed as one of the best methods to solve the (TSP) problem and the application of the algorithm in conjun
... Show MoreDigital image manipulation has become increasingly prevalent due to the widespread availability of sophisticated image editing tools. In copy-move forgery, a portion of an image is copied and pasted into another area within the same image. The proposed methodology begins with extracting the image's Local Binary Pattern (LBP) algorithm features. Two main statistical functions, Stander Deviation (STD) and Angler Second Moment (ASM), are computed for each LBP feature, capturing additional statistical information about the local textures. Next, a multi-level LBP feature selection is applied to select the most relevant features. This process involves performing LBP computation at multiple scales or levels, capturing textures at different
... Show MoreMagnetic levitation (Maglev) systems are employed in a wide range of applications and are therefore of significant practical importance, which has led to growing research interest. This paper presents the design of a terminal synergetic control (TSC) and feedback linearization-based proportional-integral-derivative plus second-order derivative (FL-PIDD2) controller for the Maglev system. For developing the control law of both controllers, the mathematical model of the Maglev system is converted into a canonical system where the expression of the nonlinearity is displayed in the last differential dynamic equation of the system. The determination of the TSC and FL-PIDD2 gains for achieving the desired dynamic response is carried out using the
... Show MoreThis paper develops a fuzzy multi-objective model for solving aggregate production planning problems that contain multiple products and multiple periods in uncertain environments. We seek to minimize total production cost and total labor cost. We adopted a new method that utilizes a Zimmermans approach to determine the tolerance and aspiration levels. The actual performance of an industrial company was used to prove the feasibility of the proposed model. The proposed model shows that the method is useful, generalizable, and can be applied to APP problems with other parameters.