This article deals with the approximate algorithm for two dimensional multi-space fractional bioheat equations (M-SFBHE). The application of the collection method will be expanding for presenting a numerical technique for solving M-SFBHE based on “shifted Jacobi-Gauss-Labatto polynomials” (SJ-GL-Ps) in the matrix form. The Caputo formula has been utilized to approximate the fractional derivative and to demonstrate its usefulness and accuracy, the proposed methodology was applied in two examples. The numerical results revealed that the used approach is very effective and gives high accuracy and good convergence.
Most studies indicated that the values of atmospheric variables have changed from their general rates due to pollution or global warming etc. Hence, the research indicates the changes of direct solar radiation values over a whole century i.e. from 1900 to 2000 depending on registered data for four cities, namely (Mosul - Baghdad - Rutba - Basra. Moreover, attemptsto correlate the direct solar radiation with the temperature values have been recorded over that period. The results showed that there is a decreasing pattern of radiation quantities over time throughout the study period, where the value of direct radiation over the city of Baghdad 5550 w/m2 was recorded in the year 1900, but this ratio decreased cle
... Show MoreClassification of imbalanced data is an important issue. Many algorithms have been developed for classification, such as Back Propagation (BP) neural networks, decision tree, Bayesian networks etc., and have been used repeatedly in many fields. These algorithms speak of the problem of imbalanced data, where there are situations that belong to more classes than others. Imbalanced data result in poor performance and bias to a class without other classes. In this paper, we proposed three techniques based on the Over-Sampling (O.S.) technique for processing imbalanced dataset and redistributing it and converting it into balanced dataset. These techniques are (Improved Synthetic Minority Over-Sampling Technique (Improved SMOTE), Border
... Show MoreThe Field Programmable Gate Array (FPGA) approach is the most recent category, which takes the place in the implementation of most of the Digital Signal Processing (DSP) applications. It had proved the capability to handle such problems and supports all the necessary needs like scalability, speed, size, cost, and efficiency.
In this paper a new proposed circuit design is implemented for the evaluation of the coefficients of the two-dimensional Wavelet Transform (WT) and Wavelet Packet Transform (WPT) using FPGA is provided.
In this implementation the evaluations of the WT & WPT coefficients are depending upon filter tree decomposition using the 2-D discrete convolution algorithm. This implementation w
... Show MoreLED is an ultra-lightweight block cipher that is mainly used in devices with limited resources. Currently, the software and hardware structure of this cipher utilize a complex logic operation to generate a sequence of random numbers called round constant and this causes the algorithm to slow down and record low throughput. To improve the speed and throughput of the original algorithm, the Fast Lightweight Encryption Device (FLED) has been proposed in this paper. The key size of the currently existing LED algorithm is in 64-bit & 128-bit but this article focused mainly on the 64-bit key (block size=64-bit). In the proposed FLED design, complex operations have been replaced by LFSR left feedback technology to make the algorithm perform more e
... Show MoreIn this paper new methods were presented based on technique of differences which is the difference- based modified jackknifed generalized ridge regression estimator(DMJGR) and difference-based generalized jackknifed ridge regression estimator(DGJR), in estimating the parameters of linear part of the partially linear model. As for the nonlinear part represented by the nonparametric function, it was estimated using Nadaraya Watson smoother. The partially linear model was compared using these proposed methods with other estimators based on differencing technique through the MSE comparison criterion in simulation study.
In this work, we construct the projectively distinct (k, n)-arcs in PG (3, 4) over Galois field GF (4), where k 5, and we found that the complete (k, n)-arcs, where 3 n 21, moreover we prove geometrically that the maximum complete (k, n)-arc in PG (3, 4) is (85, 21)-arc. A (k, n)-arcs is a set of k points no n+ 1 of which are collinear. A (k, n)-arcs is complete if it is not contained in a (k+ 1, n)-arcs