In this paper, we analyze the convergence of a finite difference method with the implicit forward time central space (FTCS) scheme for solving the three-dimensional advection-diffusion-reaction equation (ADRE). It is proved that the method is unconditionally convergent. We apply the scheme to obtain numerical solutions for the transport of pollutants in street tunnel problems with various reaction coefficients and various rates of change of concentrations of sources or sinks of pollution.

We consider a stochastic production planning problem with regime switching. There are k≥1 regimes corresponding to different economic cycles. The problem is to minimize the production costs and analyze the problem by the value function approach. Our main contribution is to show that the optimal production is characterized by an exact solution of an elliptic system of partial differential equations. A verification result is given for the determined solution.

In this paper, we present an innovative technique that improves the convergence order of iterative schemes that do not require the evaluation of Jacobian matrices. Using this procedure, we achieve a remarkable increase in the order of convergence, raising it from p to p + 3 units, which results in a remarkable improvement in the overall performance. We have conducted comprehensive numerical tests in various scenarios to validate the theoretical results, showing the efficiency and effectiveness of the new Jacobian-free schemes.

The fractional derivatives are a generalization the derivatives of integer order and find applications in studying memory processes in various scientific fields. Numerical methods are used to solve and analyze fractional models of real world problems. In this paper, we consider an approximation of the Caputo fractional derivative and its asymptotic formula, whose generating function is the polylogarithmic function. In the paper, we prove the convergence of the approximation and derive an estimate for the error and order. We consider an application of the approximation for the construction of finite difference schemes for numerical solution of the two-term ordinary fractional differential equation and the time-fractional Black-Scholes equation for option pricing. The properties of the approximation are used to prove the convergence of the methods used for numerical solution of the fractional differential equations. The theoretical results for the error and order of the methods are illustrated by the results of numerical experiments.

This article is devoted to methods of processing random processes. Of particular relevance is the task of processing broadband non-stationary random processes. The processing of random processes is usually related to the assessment of their probabilistic characteristics. Very often, a non-stationary broadband random process is represented by a single implementation in a priori uncertainty about the type of distribution function. Such random processes occur in information and measuring communication systems in which information is transmitted at a real time pace (for example, radio telemetry systems of spacecraft). The use of methods of traditional mathematical statistics, for example, maximum likelihood methods to determine probability characteristics, in this case is not possible. The article discusses a method of processing non-stationary broadband random processes based on the use of non-parametric methods of decision theory. An algorithm for dividing the observation interval into stationary intervals using non-parametric Kendall statistics is considered, as well as methods for estimating probabilistic characteristics on the stationary interval using ordinal statistics. The article presents the results of statistical modeling using the Mathcad program.

Among the various generalizations of persistent topology, the one based on rank functions and leading to indexing-aware functions appears to be particularly suited to catch graph-theoretical properties without the need for a simplicial construction and a homology computation. This paper defines and studies "simple" and "single-vertex" features in directed and undirected graphs, by which several indexing-aware persistence functions are produced, within the scheme of steady and ranging sets. The implementation of the "sink" feature and its application to trust networks provide an example of the ease of use and meaningfulness of the method.

This paper is concerned with developing an efficient numerical algorithm for fast implementation of the sparse grid method for computing the $d$-dimensional integral of a given function. The new algorithm, called the MDI-SG ({\em multilevel dimension iteration sparse grid}) method, implements the sparse grid method based on a dimension iteration/reduction procedure, it does not need to store the integration points, nor does it compute the function values independently at each integration point, instead, it reuses the computation for function evaluations as much as possible by performing the function evaluations at all integration points in a cluster and iteratively along coordinate directions. It is shown numerically that the computational complexity (in terms of CPU time) of the proposed MDI-SG method is of polynomial order $O(Nd^3 )$ or better, compared to the exponential order $O(N(\log N)^{d-1})$ for the standard sparse grid method, where $N$ denotes the maximum number of integration points in each coordinate direction. As a result, the proposed MDI-SG method effectively circumvents the curse of dimensionality suffered by the standard sparse grid method for high-dimensional numerical integration.

To assess the impact of tourism on the incidence of HIV and AIDS using Malaysian epidemiological data over the period of 1986-2011 with additional consideration for newborns infected with HIV. A population-level mathematical model was used to investigate: i) the role of tourism in the spread of HIV and measures used to reduce HIV spread in Malaysia; ii) whether the stability of infectious disease transmission is dependent on the flow of visiting tourists. We first derived an equation for the reproduction number (R0) threshold to quantify the contagiousness of HIV in Malaysia. Sensitivity analyses were used to determine the effect of various parameters on HIV transmission with respect to the increase in tourism. Our findings suggest that a stable disease-free state is sustainable based on the low value of R0 was 0.0017. This result is encouraging from a public health perspective. Approximately 14% of outbound tourists who leave the country return infected with HIV and the difference between the rate at which tourists move to the susceptible category and the rate at which tourists leave the susceptible is category is 12%. Estimated parameters for the influx of tourist rates, δ=1.1540x10-3[1.1477x10-3 - 1.15954x10-3], δ1=7.7901x10-4[7.7867x10-4 - 7.79418x10-4], and δ2=1.4030x10-8[-7.2287x10-7-7.5096x10-7], significantly impacted the spread of HIV in Malaysia. Some significant adjustments were made to the expected parameters. The methods used are helpful to public health analyses and provide a framework for epidemiological modeling of HIV spread among tourists. The trend and magnitude of tourist inflows may be determinants in the incidence of HIV and AIDS in Malaysia.

In this paper, we consider the one-dimensional Ising model (shortly, 1D-MSIM) having mixed spin-(s,(2t−1)/2) with nearest neighbors and the external magnetic field. We establish the partition function of the model by means of the transfer matrix. Under a null boundary condition, we compute certain thermodynamic quantities for the 1D-MSIM. We find some precise formulas to determine the model’s free energy, entropy, magnetization, and susceptibility. By examining the model’s associated iterative equations, we use the cavity approach to investigate the phase transition problem. We numerically determine the model’s periodicity.

This paper investigates the ion-acoustic wave structures in fluid ions for the Benjamin-Bona-Mahony-Peregrine-Burgers (BBMPB) equation. The various types of wave structures, are extracted including the three-wave hypothesis, breather wave, lump periodic, mixed-type wave, periodic cross-kink, cross-kink rational wave, M-shaped rational wave, M-shaped rational wave solution with one kink wave and M-shaped rational wave with two kink wave solutions. The Hirota bilinear transformation is a powerful tool that allows us to accurately solutions and predict the behavior of these wave structures. Through our analysis, we gain a better understanding of the complex dynamics of ion-acoustic waves and their potential applications in various fields. Moreover, our findings contribute to the ongoing research in plasma physics that utilize ion-acoustic wave phenomena. To show the physical behavior of the solutions, some 3D plots have been performed and their respective contour level, choosing different values of the parameters.

TThis paper delves into the extension and characterization of radial positive definite functions into non-integer dimensions. We provide a thorough investigation by employing the Riemann-Liouville fractional integral and fractional Caputo derivatives, enabling a comprehensive understanding of these functions. Additionally, we introduce a secondary characterization based on the Bernstein characterization of completely monotone functions. The practical significance of our study is showcased through an examination of the positivity of the fundamental solution of the space-fractional Bessel diffusion equation, highlighting the real-world applicability of the developed concepts. Through this work, we contribute to the broader understanding of radial positive definite functions and their utility in diverse mathematical and applied contexts.

With technological transformations such as big data, blockchain, artificial intelligence, and cloud computing, digital techniques are penetrating the field of finance. Digital finance is a resource-saving and environmentally friendly innovative financial service. It shows great green attributes and can drive the flow of financial resources towards environmentally friendly enterprises, thereby promoting green and low-carbon development. This paper investigates the effects of digital finance on green and low-carbon cyclic development and the mechanism. First, the level of green and low carbon cyclic development in China is estimated from multiple aspects based on the panel data of 31 provinces by using the spatio-temporal range entropy weight method. Then, the working mechanism of digital finance on green and low carbon cyclic development is revealed by performing empirical tests based on panel regression models, mediating effect models, and threshold models. Finally, the effects of digital finance and conventional variables on green and low-carbon cyclic development are investigated by using a random forest model and a CatBoost model in based on the machine learning. The results show that digital finance has significant positive effects on green and low-carbon cyclic development, and technological innovation plays a key role in the effects of digital finance on green and low-carbon cyclic development; meanwhile, the driving effect of digital finance on green and low carbon cyclic development shows nonlinear features with increasing “marginal effect”; besides, both digital finance and conventional factors have significant impacts on green and low carbon cyclic development. This study provides an empirical basis and path reference for digital finance to achieve “carbon peak, carbon neutralization” in China.

The rapidly evolving field of artificial intelligence (AI) continues to witness the introduction of innovative open-source pre-trained models, fostering advancements in various applications. One such model is Llama 2, an open-source pre-trained model released by Meta, which has garnered significant attention among early adopters. In addition to exploring the foundational elements of the Llama v2 model, this paper investigates how these early adopters leverage the capabilities of Llama 2 in their AI projects. Through a qualitative study, we delve into the perspectives, experiences, and strategies employed by early adopters to leverage Llama 2's capabilities. The findings shed light on the model's strengths, weaknesses, and areas of improvement, offering valuable insights for the AI community and Meta to enhance future model iterations. Additionally, we discuss the implications of Llama 2's adoption on the broader open-source AI landscape, addressing challenges and opportunities for developers and researchers in the pursuit of cutting-edge AI solutions. The present study constitutes an early exploration of the Llama 2 pre-trained model, holding promise as a foundational basis for forthcoming research investigations.

This paper presents a numerical method for solving a two-dimensional subdiffusion equation with a Caputo fractional derivative. The problem considered assumes symmetry in both the equation’s solution domain and the boundary conditions, allowing for a reduction of the two-dimensional equation to a one-dimensional one. The proposed method is an extension of the fractional Crank-Nicolson method, based on the discretization of the equivalent integral-differential equation. To validate the method, the obtained results were compared with a solution obtained through Laplace transform. The analytical solution in the image of the Laplace transform was inverted using the Gaver-Wynn-Rho algorithm implemented in the specialized mathematical computing environment, Wolfram Mathematica. The results clearly show the mutual convergence of the solutions obtained by the two methods.

In this paper we have studied some properties for determinant-calculating for cubic-matrix of order 2 and order 3. These properties are analogous to some properties for determinants of square matrix we have proved and noted that these properties also are applicable (or not in some details) on this concept for cubic-matrix of orders 2 and 3. All results in this paper, are presented in detail during the theorem proofs.

In this paper, we introduce as a pedagogical strategy an internal division-free, straightforward, and symmetrically progressing algorithm in manually computing matrix inverse and solving systems of linear equations by revisiting the application of elementary row operations in the Gauss-Jordan reduction method and connecting it to the determinant method. The proposed cross-multiplication-flip (CMF) algorithm employs cross-multiplication similar to the butterfly movement in computing determinants as a strategic application of elementary row operations to efficiently reduce the rows and then applies flipping of rows and entries to put an upper triangular matrix into lower triangular form to continue the reduction process.

In this paper, a new multi parameter iterative algorithm is proposed to address the PageRank problem based on the multi-splitting iteration method described by Gu et al . The proposed method in each iteration needs to solve two linear subsystems by splitting the coefficient matrix, therefore, we consider inner and outer iteration to find the approximate solutions of these linear subsystems. It can be shown that the iterative sequence generated by the multi parameter iterative algorithm finally converges to the PageRank vector when the parameters satisfy the certain conditions. Numerical experiments show that the proposed algorithm has better convergence and numerical stability than the existing algorithms.

It is shown that for any integers k≥2, q≥2k and N≥k+q+2 there exists a real solvable Lie algebra of rank one with a maximal torus of derivations t possessing the eigenvalue spectrum spec(t)=1,2,⋯,k,q,q+1⋯,N and a nilradical of nilpotence index N−k and characteristic sequence (N−k,1k).

The (numerical) solution of Ordinary Differential Equations (ODEs) problems is of paramount relevance, ODEs system being an ubiquitous mathematical formulation of many physical phenomena (such as those involved in fluid dynamics, chemistry, biology, evolutionary-anthropology, ...): almost every dynamici phenomenon can be modeled by means of an ODEs system. The present paper is the first manifesto of FOODIE, a library aimed to numerically solve ODEs problems by means of a clear, concise and efficient abstract interface. FOODIE, meaning Fortran Object oriented Ordinary Differential Equations integration library, has manifolds aims: to provide a set to built-in numerical schemes that are accurate, robust, validated and efficient and to allow easy application of these schemes to (almost) all ODEs problems by means of an effective Abstract Calculus Pattern. The key idea is to allow the same solver-implementation to be applied to all ODEs problems thus avoiding the re-implementation of the ODEs solver for each different ODEs problem: code re-usability is consequently maximized, FOODIE being a general robust framework. Besides, the same framework also allows rapid development of new ODEs solvers due to the high abstraction level of the library itself. The present paper is the first announcement of FOODIE project: the current implementation is extensively discussed and its capabilities are proved by means of tests and examples.

This paper applied the space-time generalized finite difference scheme for solving the nonlinear dispersive shallow water waves as the modified Camassa−Holm equation, modified Degasperis-Procesi equation, Fornberg-Whitham equation, and its modified form. The proposed meshless numerical scheme was composed of the space-time generalized finite difference method, the two-step Newton-Raphson method, and the time-marching method. The space-time approach can treat the temporal derivative as one of the spatial derivatives. This numerical technique enables all the partial derivatives in the governing equation can be discretized by a spatial discretization method, and the mixed derivative can efficiently deal with using the proposed meshless numerical scheme. The space-time generalized finite difference method is advanced from the Taylor series expansion and the moving-least square method. The numerical discretization process is only related to functional data and weighting coefficients on the central node and its nearby nodes. Thus, the matrix system composed of nonlinear algebraic equations will be a sparse matrix and can be efficiently solved by the two-step Newton-Raphson method. Furthermore, the time-marching method was utilized to proceed with the space-time domain along the time axis. In this paper, several numerical examples were tested to verify the capability of the proposed space-time generalized finite difference scheme.

New analytical solutions of the heat conduction equation are presented in cylindrical and spherical coordinates. Then these solutions are reproduced with high accuracy by recent explicit and unconditionally stable finite difference methods. After this, real experimental data from the literature regarding a heated cylinder are reproduced by the explicit numerical methods as well as by Finite Element Methods (FEM) ANSYS workbench. Convection and nonlinear radiation are also considered on the boundary of the cylinder, and it is shown that the explicit methods are much more accurate than the commercial software.

Quantum computing arrives. Preceded by Mādhava of Sangamagrāma and other Hindu mathematicians, around 1,500 CE, and our previous work, we show at least 4 quantum properties that are indeed universal in some number systems; here we use them to enable quantum computing. Using the sets B={0,1}, B^n, N, Z, Q, and Q*, one has +4 quantum properties that one can trust, as archetypes of easy communication to friends and foes, to ignoranti or cognoscenti, and for quantum consciousness. Therefore, this work applies to computer calculations, apps in cell phones, algebra, atoms, mathematics, physics, and the human mind.

This paper proposed a time two-mesh (TT-M) finite difference numerical scheme to improve the efficiency of solving the symmetric regularized long wave (SRLW) equation. The TT-M Crank-Nicolson discretization and finite difference method are employed in time and space approximation respectively. The scheme involves three main steps: firstly, the time interval is divided into coarse and fine time meshes, then the nonlinear system is solved on the coarse time mesh; secondly, coarse numerical solutions on the fine time mesh are computed using an interpolation formula based on the solutions derived in the step one; lastly, the TT-M finite difference numerical solutions can be obtained through constructing the linearized fine time mesh system using Taylor’s formula. Compared to the currently existing TT-M numerical methods, the novelty of this study is that the nonlinear term including derivatives is linearized by Taylor’s formula for a function with three variables, whose error analysis is more complex. Finally, some numerical examples, including computational time and accuracy, preservation of conservation laws, are given to verify the efficiency of the scheme. By comparing it with the standard nonlinear finite difference scheme, this method can reduce CPU time without sacrificing accuracy.

Due to nonlinear components in the charging piles of electric vehicles, harmonics and non-stationary signals in the electric vehicle charging load brings voltage and current distortion, seriously affecting the accuracy of the power-related calculation in non-sinusoidal environments. This paper proposed a new approach to calculate the active power and root mean square values from decomposed components using the adaptive chirp mode decomposition (ACMD) method on voltage and current. The advantage of the ACMD-based method is that it correctly provides the power-related quantities of harmonics or non-stationary components for the electric vehicle charging load. The performance of the proposed method was verified using synthetic signals and simulation tests. The experimental results presented better estimations for each quantity defined in IEEE Standard 1459-2010, compared with the discrete wavelet transform approach.

In this paper, we consider the fourth-order parabolic equations with integer and fractional order time derivatives with Neumann boundary conditions. The integer order time derivatives are approximated by backward Euler difference quotients, and the fractional order time derivatives are approximated by L1 interpolation. We propose the block-centered finite difference scheme for fourth-order parabolic equations of integer and fractional order time derivatives. We prove the stability of the block-centered finite difference scheme and the second-order convergence of the discrete L2 norms of the approximate solution and its derivatives of every order. Numerical examples are given to verify the effectiveness of the block-centered finite difference scheme.

In this work, we offer a novel and accurate method in order to find the solution of the linear differential equations over the intervals [0, 1) based on the generalization of Legendre wavelets. The mechanism is still upon workable implementation of the operational matrix of integration and its derivatives. This method reduces the problems into algebraic equations via the properties of generalized Legendre wavelet (GLW) together with the operational matrix of integration. The function approximation has been picked out in such a way so as to enumerate the connection coefficients in an facile manner. The proposed numerical technique, based on the GLW, has been examined on three linear problems as a consequence of this investigation. The outcomes have shown that this method, as opposed to some other existing numerical and analytical methods, is a very useful and advantageous for tackling such problems.

Commercial banks usually classify customers according to their credit reports when making loans. In this study, we put our focus on classifying customers based on their credit reports from the People's Bank of China (PBC). Since there are no target labels of users in the credit report of the People's Bank of China, we put forward the fuzzy clustering method for the initial label, and then Construct ant colony search to optimize intelligent recognition. Finally, this study uses SVM, BP neural network, and random forest to classify users and compare their results. The research re-sults indicate that using ant colony clustering algorithm and random forest for classification is the most effective method with the PBC credit reports.

When there is uncertainty in the value of parameters of the input random components of a stochastic simulation model, two-level nested simulation algorithms are used to estimate the expectation of performance variables of interest. In the outer level of the algorithm (n) observations are generated for the parameters, and in the inner level (m) observations of the simulation model are generated with the value of parameters fixed at the value generated in the outer level. In this article, we consider the case in which the observations at both levels of the algorithm are independent, showing how the variance of the observations can be decomposed into the sum of a parametric variance and a stochastic variance. Next, we derive central limit theorems that allow us to compute asymptotic confidence intervals to assess the accuracy of the simulation-based estimators for the point forecast and the variance components. Under this framework, we derive analytical expressions for the point forecast and the variance components of a Bayesian model to forecast sporadic demand; and we use these expressions to illustrate the validity of our theoretical results by performing simulation experiments using this forecast model.

A wave is an energy that can propagate with a medium, the propagation of a wave moves with respect to time by carrying energy that moves with velocity per unit of time. Sea waves are one of the propagating wave problems that are broken down to produce wave propagation with a relatively inhomogeneous minimum amplitude and speed of sea waves which have their own difficulties in solving them numerically. This study aims to analyze the stability of wave propagation of submerged breakwaters using the Boundary Element Method. This research will approximate the boundary discretization of the breakwater domain and then combine it with the Finite Element Method in determining the moving elements of the velocity of fluid flow through a porous submerged breakwater. This study varies the magnitude of the incoming propagation velocity and the influence of the breakwater distance. The results of this study indicate that the resulting minimal wave assuming v = 1 m/s and the breakwater distance of s = 20 m gives a wave reflection with a minimum wave speed and amplitude of 0.12515 m

Topological indices are invariant numerical fields of a graph that give facts about the structure of graphs and are found to be very helpful in predicting the physical properties of aluminophosphates. The characteristics of the aluminophosphates are similar to those of zeolites. Two examples of current applications are natural gas dehydration and humidity sensor. New frameworks are being synthesised by researchers in chemistry and materials science. There are many layers and holes in these substances. In this study, Vertex version of distance-based topological indices, the entropy of topological indices and their numerical analysis are explained.

We present a new model formulation for a class of capacitated lot-sizing problem considering setup costs, product returns, and remanufacturing (CLSP-RM). We investigate a broad class of instances that fall into two groups, in the first group we can reformulate the problem with a relaxation and test whether the original problem is solvable. The relaxation gives near optimal solutions and the solution of this class does not give any difficulty to known solvers such as Cplex, Gurobi or Xpress. The second group of instances are of category NP and will be solved with a simple period-by-period simulation

In this paper a combined Laplace transform (LT) and boundary element method (BEM) is used to find numerical solutions to problems of anisotropic functionally graded media which are governed by the transient diffusion-convection-reaction equation. First, the variable coefficients governing equation is reduced to a constant coefficients equation. Then, the Laplace-transformed constant coefficients equation is transformed a boundary-only integral equation. Using a BEM, the numerical solutions in the frame of Laplace transform may then be obtained from this integral equation. Then the solutions are inversely transformed numerically using the Stehfest formula. Some problems considered are those of compressible or incompressible flow, and of media which are quadratically, exponentially and trigonometrically graded materials. The results obtained show that the analysis used to transform the variable coefficients equation into the constant coefficients equation is valid, and the mixed LT-BEM is easy to implement for obtaining the numerical solutions. The numerical solutions are verified by showing their accuracy and steady state. For symmetric problems, the symmetry of solutions is also justified. Moreover, the effect of the anisotropy and inhomogeneity of the material on the solutions are also shown, as to suggest that it is important to take the anisotropy and inhomogeneity into account when doing experimental studies.

The goal of finding a commutative group of gates from the set of unitary matrices is to simplify the process of quantum computing. If a set of gates is commutative, then we can apply the gates in any order without affecting the final outcome. This is important because quantum systems are very sensitive to errors and decoherence, and any disruption to the system can cause errors in the computation.By having a commutative group of gates, we can simplify the process of designing quantum algorithms and reduce the risk of errors. This is particularly important for solving complex computational problems that cannot be solved by classical computers.

The deep energy method (DEM), a type of physics-informed neural network, is evolving as an alternative to finite element analysis. This method employs the principle of minimum potential energy to predict deformations under static loading conditions. However, the model’s accuracy is contingent upon choosing the appropriate architecture for the model, which can be challenging due to the high interactions between hyperparameters, large search space, difficulty in identifying objective functions, and non-convex relationships with the objective functions. To improve DEM’s accuracy, we first introduce random Fourier feature (RFF) mapping. RFF mapping helps with the training of the model by reducing bias towards high frequencies. The effects of six hyperparameters are then studied under compression, tension, and bending loads in planar linear elasticity. Based on this study, a systematic automated hyperparameter optimization approach is proposed. Due to the high interaction between hyperparameters and the non-convex nature of the optimization problem, Bayesian optimization algorithms are used. The models trained using optimized hyperparameters and having Fourier feature mapping can accurately predict deflections compared to finite element analysis. Additionally, the deflections obtained for tension and compression load cases are more sensitive to variations in hyperparameters than bending.

The article presents a new scalable iterative method for linear programming called the “apex method”. The key feature of this method is constructing a path close to optimal on the surface of the feasible region from a certain starting point to the exact solution of linear programming problem. The optimal path refers to a path of minimum length according to the Euclidean metric. The apex method is based on the predictor-corrector framework and proceeds in two stages: quest (predictor) and target (corrector). The quest stage calculates a rough initial approximation of linear programming problem. The target stage refines the initial approximation with a given precision. The main operation used in the apex method is an operation that calculates the pseudoprojection, which is a generalization of the metric projection to a convex closed set. This operation is used both in the quest stage and in the target stage. A parallel algorithm using a Fejér mapping to compute the pseudoprojection is presented. An analytical estimation of the parallelism degree of this algorithm is obtained. Also, an algorithm implementing the target stage is given. The convergence of this algorithm is proven. An experimental study of the scalability of the apex method on a cluster computing system is described. The results of applying the apex method to solve problems from the Netlib-LP repository are presented.

We present a simplified computational rule for the back-propagation formulas for artificial neural networks. In this work, we provide a generic two-step rule for the back-propagation algorithm in matrix notation. Moreover, this rule incorporates both the forward and backward phases of the computations involved in the learning process. Specifically, this recursively computing rule permits the propagation of the changes to all synaptic weights in the network, layer by layer, efficiently. In particular, we use this rule to compute both the up and down partial derivatives of the cost function of all the connections feeding into the output layer.

To investigate the impact of a magnetic field on plaque development in a stenotic bifurcated artery, a finite element method is utilized. The blood flow is modelled as a stable, incompressible, Newtonian, biomagnetic, and laminar fluid. Furthermore, the arterial wall is assumed to be linear elastic. The Arbitrary Lagrangian Eulerian (ALE) method is employed to describe the hemodynamic flow in a bifurcated artery under the influence of an asymmetric magnetic field, taking into account two-way fluid-structure interaction coupling. A stable $P_2P_1$ finite element pair discretizes a nonlinear system of partial differential equations that requires a solution. The Newton-Raphson method is utilized to find a solution to the resulting nonlinear algebraic equation system. Numerical modelling is used to simulate the presence of magnetic fields, and the resulting displacement, velocity magnitude, pressure, and wall shear stresses are shown for a range of Reynolds numbers ($Re = 500$, $1000$, $1500$, and $2000$). The results of the numerical analysis demonstrate that the presence of a magnetic field has a significant effect not only on the magnitude of displacement but also on the velocity of the flow. The application of a magnetic field reduces flow separation, extends the recirculation area near the stenosis, and increases wall shear stress.

Gauss quadrature integral approximation is extended to include integrals with a measure consisting of a continuous as well as a discrete component. That is, we give an approximation for the integral of a function plus its sum over a discrete weighted set.

The efficiency with which an integer may be factored into its prime factors determines several public key cryptosystems′ security in use today. Although there is a quantum-based technique with a polynomial time for integer factoring, on a traditional computer, there is no polynomial time algorithm. We investigate how to enhance the wheel factoring technique in this paper. Current wheel factorization algorithms rely on a very restricted set of prime integers as a base. In this study, we intend to adapt this notion to rely on a greater number of prime integers, resulting in a considerable improvement in the execution time. The experiments on composite numbers n reveal that the proposed algorithm improves on the existing wheel factoring algorithm by about 75%

A system of wavelet collocation upwind schemes is constructed for solving hyperbolic conserva-tion laws based on a class of interpolation wavelets. The bias magnitude and symmetry factor are defined to depict the asymmetry of the adopted scaling basis function in wavelet theory. Effects of characteristics of the scaling functions on the schemes are explored based on numerical tests and Fourier analysis. The numerical results reveal that the stability of the constructed scheme is af-fected by the smoothness order, N, and the asymmetry of the scaling function. The dissipation analysis suggests that schemes with Neven have negative dissipation coefficients, leading to unstable behaviors. Only scaling functions with Nodd and bias magnitude of 1 can be used to construct stable upwind schemes due to the non-negative dissipation coefficients. Resolution of the wavelet scheme tends to the spectral resolution as the order of accuracy of the scheme in-creases.

The agricultural sector in Palestine has a significant role in its economy. However, the production of this sector is affected by different kinds of plant diseases, specifically leaf diseases. Automatic agricultural leaf disease detection is essential for the early diagnosis and controls the overall health of fields. Image segmentation techniques, clustering, and deep learning are often used to detect diseased leaves. This study proposes a novel hybrid approach based on image classification. The hybrid approach combines the k-means clustering algorithm with Convolutional Neural Network (CNN), where k-means is used to detect the leaf’s infected area, then CNN is used for specifying the disease. We used the PlantVillage dataset for experimental verification as it contains several crops with different kinds of challenging diseases. We also examined the selection of optimal k-value using the Silhouette coefficient, Elbow method, and Kneedle Algorithm. The Silhouette technique was analyzed using three distance metrics; Euclidean, Manhattan, and Cosine. Its scores for the three-distance metrics were low, near-zero, and failed to produce the optimum k value. Besides, the Elbow method was complicated to use in image segmentation in terms of executing and visualizing the k value in its graph plot. Based on verification results, the Kneedle Algorithm produced better results in the consistency of choosing the optimal k value and showed superiority over other approaches. Therefore, the processed images were segmented with the k-means clustering algorithm with a Kneedle algorithm-based k value. Finally, a Convolutional Neural Network (CNN) is trained to classify the type of disease based on analyzing and testing leaf images. The hybrid model achieved high accuracy of 93.79% in disease identification, confirming the proposed model’s robustness.

In this paper we present a successful implementation of the Hindmarsh–Rose model within a SC environment. The merits of the proposed approach are design simplicity, due to stochastic computing, and the ease of implementation. Simulation results showed that the approximation achieved is equivalent to introducing a noise source into the original model. A study for the level of noise introduced, according to the number of bits in the stochastic sequence, has been performed. Additionally, we demonstrate that such an approach, even though it is noisy, it reproduces the behaviour of biological systems, which are intrinsically noisy. It is also demonstrated that a speedup of x2 compared to biological systems is easily achievable, with a very small number of gates, thus paving the road for the in silico implementation of large neuron networks.

An essential step in solving any topology optimization problem is determining the sensitivities of the objective function and optimization constraints. Unfortunately, these sensitivities are usually derived and implemented manually. Nontrivial objective functions and constraints, especially with the involvement of material and geometric nonlinearities, need strenuous mathematical derivation, leading to error-prone implementation. Another intriguing approach to finding sensitivities is automatic differentiation. This paper uses the automatic differentiation and adjoint method to find the sensitivities for two multiphysics topology optimization problems: 1) thermoelasticity and 2) piezoelectricity. This approach is not limited to these examples and can be easily extended to other single- or multi-physics topology optimization problems.

Previously, using the conjugate frame-based reconciliation approach, we defined a method to correct errors produced in pairs of non-orthogonal quantum states that are transmitted through a quantum key distribution (QKD) link. The security of the frame-based reconciliation was discussed in order to deal with Photon Number Division (PNS) attack and Intercept and Forward (IR) attack, among others. However, until the time of publication we did not have the distillation software to test our method. In this article, following the conjugate frame distillation method, we present the implementation of the post-processing system that demonstrates that it is capable of correcting errors in the presence of error rates close to unity. The system shows that when the number of double-sensing events at Bob's station is as low as 100, the number of secret bits stays above 4500 bits in about 12 seconds, giving a secret rate of 375 bits per second while that the channel error rate reaches 90\%.

Based on some geometrical properties of the Rabinovich system the closed-form solutions of the equations has been established. Moreover the Rabinovich system is reduced to a nonlinear differential equation depending on an auxiliary unknown function. The approximate analytical solutions are built using the Optimal Auxiliary Functions Method (OAFM). A good agreement between the analytical and corresponding numerical results has been performed. The accuracy of the obtained results emphasizes that this procedure could be successfully applied for more dynamical systems with these geometrical properties.

This work emphasizes some geometrical properties of the Maxwell--Bloch equations. Based on these properties the closed-form solutions of their equations are established. Thus, the Maxwell-Bloch equations are reduced to a nonlinear differential equation depending on an auxiliary unknown function. The approximate analytical solutions were built using the Optimal Homotopy Asymptotic Method (OHAM). A good agreement between the analytical and corresponding numerical results was found. The accuracy of the obtained results is validated through the representative figures. This procedure could be successfully applied for more dynamical systems with geometrical properties.

Classical religious texts remain an essential part of human culture due to their undiminished influence on the advancement of civilization. Although their entirely divine origin is questioned repeatedly, explicit or implicit quoting and adherence to their basic guidelines are fundamental in modern society. In this respect, these documents’ inner structure and linguistic style appear to be pivotal. This paper considers the topic from the standpoint of small textual patterns classified using deep learning methods, traditionally applied to analyze short textual material like tweets. We divide the considered documents into small sequential chunks imitating tweets and categorizing them, classifying an entire text. The proposed method demonstrates that the religious text collections correspond to stable ”Twitter”-like structures that adequately reflect stylistic properties. So, concise word combinations seem to be an inborn textual attribute that adequately outlines the proposed multi-source authorship. This approach differs from traditional methods of analyzing classical religious documents, which are based on the consideration and interpretation of relatively long templates. The case study consists of three famous collections of Mosaic authorship in the Old Testament (Hebrew), Pauline authorship in the New Testament (Greek), and Al-Ghazali authorship (Arabic). The obtained results go well with most previously expressed evaluations and complement them with new implications, particularly in the authorship of two famous manuscripts attributed to Al-Ghazali.

To support the decision making process of new investors, this paper aims to implement Machine Learning algorithms to generate investment indications. Three artificial intelligence techniques were implemented, namely: Multilayer Perceptron, Logistic Regression and Decision Tree, which performed the classification of investments. The results of the different algorithms were compared to each other using the metrics: accuracy, precision, recall, and F1-score. The Decision Tree was the algorithm that obtained the best classification metrics and an accuracy of 77%.

Matrix multiplication is probably one of the most basic and important operations having a wide range of applications in studying Linear algebra. We will be primarily focused on reviewing different algorithms for the multiplication of two n×n matrices. The most Naive method has a complexity of O(n3) but interestingly, algorithms with better complexity have been achieved. We will get to see how the complexity can be improved further, occasionally giving a survey.

Mathematical modeling is crucial in investigating the pandemic of the ongoing coronavirus disease (COVID-19). The primary target area of the SARS-CoV-2 virus is epithelial cells in the human lower repertory track. During this viral infection, infected cells can initiate innate and adaptive immune responses to viral infection. Immune response in COVID -19 infection can lead to longer recovery time and more severe secondary complications. We formulate a target cell limited mathematical model by incorporating a saturation term for SARS-CoV-2 infected epithelial cell loss reliant on infected cell levels. Forward and backward bifurcation between disease-free and endemic equilibrium points has been analyzed. Global stability of both disease-free and endemic equilibrium is provided. We have seen that the disease-free equilibrium is globally stable for $R_0<1$, and endemic equilibrium exists and is globally stable for $R_0>1$. Impulsive application of drug dosing has been applied for the treatment of covid-19 patients. Also, the dynamics of the impulsive system are discussed when a patient takes drug holidays. The numerical simulations are performed in support of our analytical findings and for the qualitative analysis of the system's dynamics with and without impulse drug dosing.

The Svenonius theorem establishes the correspondence between definability of relations in a countable structure and automorphism groups of these relations in the extension of the structure. This correspondence may help in finding the description of the definability lattice constituted by all definability spaces (reducts) of the original structure. However, the major difficulty here is the necessity to consider the extensions which generally are obscure and hardly amenable to classification. Because of that results on definability lattices were obtained only for $\omega$-categorical structures (i.\,e. those in which all elementary extensions are isomorphic to the structure itself). All known definability lattices for such structures proved to be finite. In this work we introduce the concept of upwards complete structure as such in which all its extensions are isomorphic. Further we define upwards completions structures. For such structures Galois correspondence between definability lattice and the lattice of closed supergroups of automorphism group of the structure is an anti-automorphism. These lattices could be infinite in general. We describe the natural class of structures which have upwards completion, that is discretely homogeneous graphs, present the explicit constrcution of their completion and automorphism groups of completions. We establish the general \emph{localness} property of discretely homogeneous graphs and present the examples of completable structures and their completions.

This paper presents a new method for approximating the classical arcsine function. The proposed approximating methodology is simpler in its approach than other classical approaches and undeniably innovative. It is based on matrix representation besides the basic interpolation to approximate the inverse trigonometric function. It provides an efficient model which allows for reliable and precise calculations. The results are as per our knowledge unseen results in the previous literature.

It is no news that the COVID–19 pandemic has affected many persons in different ways. As the number of reported cases rises across the globe, efforts are geared towards production and administration of effective vaccines for the disease. However, many developing countries are faced with the dilemma of how to slow the spread and flatten the curves of the disease as the available vaccines are not enough. Interestingly, the dynamics of the disease can be analysed to get useful insights to enhance the making of suitable preventive policies that will slow the spread, ultimately flatten the curves of the disease and also help in managing any future occurrence. In this work, the aim is to analyse the dynamics, and estimate the basic reproduction number of the second wave of the pandemic in Nigeria using a Susceptible-Infected-Recovered-Deceased (SIRD) compartmental–based model. The dynamics of the disease is described by a system of nonlinear ordinary differential equations. The model takes into consideration the current control policies in place - social distancing, mask usage, personal hygiene and quarantine. Available data provided by Nigeria Centre for Disease Control (NCDC), World Health Organization (WHO) and Wolfram Data Repository were used for the computations. The Quasi–Newton algorithm was implemented in fitting the proposed model to the available data and a sensitivity analysis was presented. Major parameters - effective contact rate, average recovery time, average mortality rate, and overall effectiveness of the control policies - influencing the dynamics of the disease, and the basic reproduction numbers were estimated. The turning points of the disease during the second wave were also obtained. The proposed model gave estimated values for the parameters influencing the spread of the disease. Also, the measure of the overall effectiveness of the current control policies gave insight into how effective the measures are.

Bayesian techniques for engineering problems, that rely on Gaussian process (GP) regression, are known for their ability to quantify epistemic and aleatory uncertainties and for being data efficient. The mathematical elegance of applying these methods usually comes at a high computational cost when compared to deterministic and empirical Bayesian methods. Furthermore, using these methods becomes practically infeasible in scenarios characterized by a large number of inputs and thousands of training data. The focus of this work is on enhancing Gaussian Process-based metamodeling and model calibration tasks, when the size of the training datasets is significantly large. To achieve this goal, we employ a stochastic variational inference algorithm that enables rapid statistical learning of the calibration parameters and hyperparameter tuning, while retaining the rigor of Bayesian inference. The numerical performance of the algorithm is demonstrated on multiple metamodeling and model calibration problems with thousands of training data.

The quest for accurate and more efficient methods for solving periodic/oscillatory problems is gaining more attention in recent time. This paper presents the construction and implementation of a family of exponentially–fitted Obrechkoff methods. A single–step Obrechkoff method involving terms up to the fourth derivatives was used as the base method. We also present the stability and convergence properties of the constructed family of methods. Two numerical examples were use to illustrate the performance of the constructed methods.

The Chebyshev collocation method (ChC) implemented as Chebfun is used in order to solve a class of second order one-dimensional singular and genuinely nonlinear boundary value problems. Efforts to solve these problems with conventional ChC have generally failed, and the outcomes obtained by finite differences or finite elements are seldom satisfactory. We try to fix this situation using the new Chebfun programming environment. However, for toughest problems we have to loosen the default Chebfun tolerance in Newton's solver as the ChC runs into trouble with ill-conditioning of the spectral differentiation matrices. Although in such cases the convergence is not quadratic the Newton updates decrease monotonically. This fact, along with the decreasing behaviour of Chebyshev coefficients of solutions, suggests that the outcomes are trustworthy, i.e., the collocation method has exponential (geometric) rate of convergence or at least an algebraic rate. We consider first a set of problems that have exact solutions or prime integrals and then another set of benchmark problems that do not possess these properties. Actually, for each test problem carried out we have determined how Chebfun solution converges, its length, the accuracy of the Newton method and especially how well the numerical results overlap with the analytical ones (existence and uniqueness).

Cell migration is essential for physiological, pathological and biomedical processes such as, in embryogenesis, wound healing, immune response, cancer metastasis, tumour invasion and inflammation. In light of this, quantifying mechanical properties during the process of cell migration is of great interest in experimental sciences, yet few theoretical approaches in this direction have been studied. In this work, we propose a theoretical and computational approach based on the optimal control of geometric partial differential equations to estimate cell membrane forces associated with cell polarisation during migration. Specifically, cell membrane forces are inferred or estimated by fitting a mathematical model to a sequence of images, allowing us to capture dynamics of the cell migration. Our approach offers a robust and potentially accurate framework to compute geometric mechanical membrane forces associated with cell polarisation during migration and also yields geometric information of independent interest, we illustrate one such example that involves quantifying cell proliferation levels which are associated with cell division, cell fusion or cell death.

The evolution of some epidemics, as influenza, shows common patterns both in different regions and from year to year. On the contrary, epidemics like the novel COVID-19 show quite heterogeneous dynamics and are extremely susceptible to the measures taken to mitigate their spread. In this paper we propose empirical dynamic modeling to predict the evolution of influenza in Spain’s regions. It is a non-parametric method that looks into the past for coincidences with the present to make the forecasts. Here we extend the method to predict the evolution of other epidemics at any other starting territory and we test also this procedure with Spanish COVID-19 data. We finally build influenza and COVID-19 networks to check possible coincidences in the geographical distribution of both diseases. With this, we grasp the uniqueness of the geographical dynamics of COVID-19.

This paper presents a theorem in factorial functions with the sum of any two nonnegative integers that is equal to multiple of the product of factorial of the same two nonnegative integers.

For solving the fractional differential equations in computational fluid dynamics (CFD), it’s complicated and difficult by the Laplace and Fourier transforms. Based on the Caputo fractional derivative, the analytical solutions for unsteady unidirectional flows of a generalized Oldroyd-B fluid are deduced by the separation of variables method. Results show that the analytical solutions are given easily, and have good university. For some specific parameter values, the well-known analytical solutions for the generalized second grade fluid, the generalized Upper-Convected Maxwell (UCM) fluid as well as the ordinary Oldroyd-B fluid can be obtained.

The paper continues the study of efficient algorithms for the computation of zeta functions over the complex plane. We aim to apply the modifications of algorithms to the investigation of underlying fractal structures associated with the Riemann zeta function. We discuss the computational complexity and numerical aspects of the implemented algorithms based on series with binomial-like coefficients.

To guide analysts to select the right tool and parameters in differential gene expression analysis of single-cell RNA sequencing (scRNA-seq) data, we developed a novel simulator that recapitulates the data characteristics of real scRNA-seq datasets while accounting for all the relevant sources of variation in a multi-subject, multi-condition scRNA-seq experiment: the cell-to-cell variation within a subject, the variation across subjects, the variability across cell types, the mean/variance relationship of gene expression across genes, library size effects, group effects, and covariate effects. By applying it to benchmark 12 differential gene expression analysis methods (including cell-level and pseudo-bulk methods) on simulated multi-condition, multi-subject data of the 10x Genomics platform, we demonstrated that methods originating from the negative binomial mixed model such as glmmTMB and NEBULA-HL outperformed other methods. Utilizing NEBULA-HL in a statistical analysis pipeline (https://github.com/interactivereport/scRNAseq_DE) for single cell analysis will enable scientists to better understand cell-type specific transcriptomic response to disease or treatment effects and to discover new drug targets. Further, application to two real datasets showed the outperformance of our differential expression (DE) pipeline, with unified findings of differentially expressed genes (DEG) and a pseudo-time trajectory transcriptomic result. In the end, we made recommendations of filtering strategies of cells and genes based on simulation results to achieve optimal experimental goals.

Functional Data Analysis (FDA) is a relatively new field of statistics dealing with data expressed in the form of functions. FDA methodologies can be easily extended to the study of imaging data, an application proposed in Wang et al. (2020), where the authors settle the mathematical groundwork and properties of the proposed estimators. This methodology allows for the estimation of mean functions and simultaneous confidence corridors (SCC), also known as simultaneous confidence bands, for imaging data and for the difference between two groups of images. This is especially relevant for the field of medical imaging, as one of the most extended research setups consists on the comparison between two groups of images, a pathological set against a control set. FDA applied to medical imaging presents at least two advantages compared to previous methodologies: it avoids loss of information in complex data structures and avoids the multiple comparison problem arising from traditional pixel-to-pixel comparisons. Nonetheless, computing times for this technique have only been explored in reduced and simulated setups (Arias-López et al., 2021). In the present article, we apply this procedure to a practical case with data extracted from open neuroimaging databases and then measure computing times for the construction of Delaunay triangulations, and for the computation of mean function and SCC for one-group and two-group approaches. The results suggest that previous researcher has been too conservative in its parameter selection and that computing times for this methodology are reasonable, confirming that this method should be further studied and applied to the field of medical imaging.

The objective of parsing is to transform a natural language sentence it in to a standard order. and in a same way a sentence is tokenized with an appropriate format. There are certain English grammar evaluation rules and the parsing approach which is to be followed for the proper formation of a particular sentence syntactically and semantically using the parsing approach. A sentence in English language is the main element in the semantic parser, which creates a parse tree with the help of applying semantic dating technique to a number of phrases. A parser divides a token into smaller components by applying sets of guidelines that characterize and a series of the tokens to determine its structure of the language, which specified by grammar. The illustration provides easy records on grammatical connections, which can simply know and put into practice with those who have no prior knowledge of the language, such as those who need to obtain textual family members. The semantic family members represent the relationships of a number of the words in the sentence. We advocate utilizing our parser to acquire the tagged sets as well as a context-free layout grammatical representation for the source form. All pronouns, adverbs, singular, plural, nouns, verbs, people, adjectives, tenses and other words are kept in a database.

This study develops a predictor-corrector algorithm for the numerical simulation of IVPs involving singular generalized fractional derivatives with Mittag-Leffler kernels. The proposed algorithm converts the considered IVP into a Volterra-type integral equation and then uses Trapezoidal rule to obtain approximate solutions. Numerical approximate solutions of some singular generalized fractional derivative with Mittag-Leffler kernels models have been presented to demonstrate the efficiency and accuracy of the proposed algorithm. The algorithm describes the influence of the fractional derivative parameters on the dynamics of the studied models. The suggested method is expected to be effectively employed in the field of simulating generalized fractional derivative models

We introduce a novel key exchange protocol based on non-commutative matrix multiplication defined in $\mathbb{F}_p^{n \times n}$. The security of our method does not rely on computational problems as integer factorization or discrete logarithm whose difficulty is conjectured. We show that the public, secret and channel keys become indistinguishable to the eavesdropper under matrix multiplication. Remarkably, for achieving a 512-bit security level, the public key is 1024 bits and the private key is 768 bits, making them the smallest keys among post-quantum key exchange algorithms. Also, we discuss how to achieve key authentication, interdomain certification and Perfect Forward Secrecy (PFS). Therefore, Lizama's algorithm becomes a promising candidate to establish shared keys and secret communication between (IoT) devices in the quantum era.

During the COVID-19 pandemic, individuals with symptoms other than cough or fever have refrained from seeking medical advice. However, a delay in treatment might lead to serious consequences. At the same time, digital health initiatives have emerged to overcome this bottleneck of healthcare. Herein, we report the results of a multi-center initiative using a combination of patient history and artificial intelligence (AI) to identify individuals with rare neuromuscular diseases. First, a questionnaire with 46 items was developed by interviewing patients with muscular dystrophies, amyotrophic lateral sclerosis, Morbus Pompe, neuropathies, and myasthenia gravis. Second, patients with proven neurological diseases answered the questionnaire. Third, a combination of classifiers (artificial neural network, support vector, and random forest) was trained and, finally, the system was challenged with new questionnaires. Users with an abnormal questionnaire pattern received a unique code for data privacy and contact details for a neurologist for further advice. The neurologists confirmed or refuted the AI-based diagnosis. The questionnaire was accessed 3122 times, leading to 853 unique codes. Only for a few patients the computer-based diagnoses and the confirmed final diagnoses were reported to us. However, for these few patients, the genetic testing and high CK levels finally ended their long-lasting diagnostic odyssey.

Computation of Discrete Fourier Transform (DFT) is a challenging task. Especially, on computational machines/embedded systems where resources are limited. The importance of Fourier Transform (FT) cannot be denied in the field of signal processing. This paper proposes a technique that can compute Discrete Fourier Transforms for a matrice or vector with the help of matrix multiplication. Moreover, this paper discusses the trivial methods used for computation of DFT along with methods based on matrix multiplication used to compute discrete Fourier Transform in addition to the shortcomings. The proposed method can help in the calculation of a Discrete Fourier Transformation matrix by truncation of values from the proposed generic method which can help in computing DFT of varying lengths of vectors. On legacy computing machines and programming environments, having support for matrix multiplication, the proposed methodology can be implemented.

Solving Linear equations with large number of variable contains many computations to be performed either iteratively or recursively. Thus it consumes more time when implemented in a sequential manner. There are many ways to solve the linear equations such as Gaussian elimination, Cholesky factorization, LU factorization, QR factorization. But even these methods when implemented on a sequential platform yield slower results as compared to a parallel platform where the time consumption is reduced considerably due to concurrent execution of instructions. The above mentioned linear equation solving methods can be implemented on the parallel platform using the direct approaches such as pipelining or 1D and 2D Partitioning approach. Vedic mathematics is a very ancient approach for solving mathematical problems. These Vedic mathematical approaches are well known for quicker and faster computation of mathematical problems. Vedic Mathematics provides a very different outlook towards the approach of solving linear Equation on parallel platform. It could be considered as a better approach for reducing space consumption and minimizing the number of algebraic operations involved in solving linear equation. In future Vedic Mathematics might serve as a viable solution for solving linear equation on parallel platform.

We provide methodology and numerical results for the Hattendorff differential equa- tion for the continuous time evolution of the variance of L(j)t , the loss at time t random variable for a multi-state process, given that the state at time t is j.

We propose a new binary formulation of the Travelling Salesman Problem (TSP), with which we overcame the best formulation of the Vehicle Routing Problem (VRP) in terms of the minimum number of necessary variables. Furthermore, we present a detailed study of the constraints used and compare our model (GPS) with other frequent formulations (MTZ and native formulation). Finally, we have carried out a coherence and efficiency check of the proposed formulation by running it on a quantum annealing computer, D-Wave\_2000Q6.

In this paper the D 3 dihedral logistic map of fractional order is introduced. The map 1 presents a dihedral symmetry D 3 . It is numerically shown that the construction and interpretation 2 of the bifurcation diagram versus the fractional order require special attention. The system stability 3 is determined and the problem of hidden attractors is analyzed. Also, analytical and numerical 4 results show that the chaotic attractor of integer order, with D 3 symmetries, looses its symmetry 5 in the fractional-order variant.

The research presented in this paper concerns the determination of the attraction basins of the Newton’s iterative method which was used to solve the non-linear systems of observational equations associated with the geodetic measurements. The authors considered simple observation systems corresponding to the intersections, or linear and angular resections, used in practice. The main goal was to investigate the properties of the sets of convergent in the initial points of the applied iterative method. An important issue regarding the possibility of automatic and quick selection of such points was also considered. Therefore, the answers to the questions regarding the geometric structure of the basins, their limitations, connectedness or self-similarity were sought. The research also concerned the iterative structures of the basins, i.e. maps of the number of iterations which are necessary to achieve the convergence of the Newton’s method. The determined basins were compared with the areas of convergence that result from theorems on the convergence of the Newton’s method, i.e. the conditions imposed on the eigenvalues and norms of the matrices of the studied iterative systems. One of the essential results of the research is the indication that the obtained basins of attraction contain areas resulting from the theoretical premises and their diameters can be comparable with the sizes of the analyzed geodetic structures. Consequently, in the analyzed cases it is possible to construct methods that enable quick selection of the initial starting points or automation of such selection. The paper also characterizes the global convergence mechanism of the Newton’s method for disconnected basins and, as a consequence, the non-local initial points, i.e. located far from the solution points.

The Physics Informed Neural Networks framework is applied to the understanding of the dynamics of Coronavirus of 2019. To provide the governing system of equations used by the framework, the Susceptible-Infected-Recovered-Death mathematical model is used. The study focused on finding the patterns of the dynamics of the disease which involves predicting the infection rate, recovery rate and death rate; thus predicting the active infections, total recovered, susceptible and deceased at any required time. The study used data that was collected on the dynamics of COVID-19 from the Kingdom of Eswatini between March 2020 and September 2021. The obtained results showed less errors thus making highly accurate predictions.

The method of regularized stokeslets is widely-used to model microscale biological propulsion. The method is usually implemented with only the single layer potential, with the double layer potential being neglected, despite this formulation often not being justified a priori due to non-rigid surface deformation. We describe a meshless approach enabling inclusion of the double layer which is applied to several Stokes flow problems in which neglect of the double layer is not strictly valid: the drag on a spherical droplet with partial slip boundary condition, swimming velocity and rate of working of a force-free spherical squirmer, and trajectory, swimmer-generated flow and rate of working of undulatory swimmers of varying slenderness. The resistance problem is solved accurately with modest discretization on a notebook computer with the inclusion of the double layer ranging from no-slip to free slip limits; neglect of the double layer potential results in up to 24% error, confirming the importance of the double layer in applications such as nanofluidics, in which partial slip may occur. The squirming swimmer problem is also solved for both velocity and rate of working to within a few percent error when the double layer potential is included, but the error in the rate of working is above 250% when the double layer is neglected. The undulating swimmer problem by contrast produces a very similar value of the velocity and rate of working for both slender and non-slender swimmers, whether or not the double layer is included, which may be due to the deformation’s `locally rigid body’ nature, providing empirical evidence that its neglect may be reasonable in many problems of interest. Inclusion of the double layer enables us to confirm robustly that slenderness provides major advantages in efficient motility despite minimal qualitative changes to the flow field and force distribution.

In this paper we formally define the hierarchical clustering network problem (HCNP) as the problem to find a good hierarchical partition of a network. This new problem focuses on the dynamic process of the clustering rather than on the final picture of the clustering process. To address it, we introduce a new hierarchical clustering algorithm in networks, based on a new shortest path betweenness measure. To calculate it, the communication between each pair of nodes is weighed by the importance of the nodes that establish this communication. The weights or importance associated to each pair of nodes are calculated as the Shapley value of a game, named as the linear modularity game. This new measure, (the node-game shortest path betweenness measure), is used to obtain a hierarchical partition of the network by eliminating the link with the highest value. To evaluate the performance of our algorithm, we introduce several criteria that allow us to compare different dendrograms of a network from two point of view: modularity and homogeneity. Finally, we propose a faster algorithm based on a simplification of the node-game shortest path betweenness measure, whose order is quadratic on sparse networks. This fast version is competitive from a computational point of view with other hierarchical fast algorithms, and, in general, it provides better results.

The behavior of convective boundary conditions is studied to delineate their role in heat and mass relegation in the presence of radiation, chemical reaction, and hydromagnetic forces in three-dimensional Powell-Eyring nanofluids. Implications concerning non-Fourier’s heat flux and non-Fick’s mass flux with respect to temperature nanoparticle concentration were examined to discuss the graphical attributes of the principal parameters. An efficient optimal homotopy analysis method is used to solve the transformed partial differential equations. Tables and graphs are physically interpreted for significant parameters

This Paper intends to introduce the notion of prime ideals of Intuitionistic fuzzy normed Rings and to establish basic properties related to it. It investigates these notions and shown anew Result using intuinistic fuzzy points and non membership function incorparating with t-norm and s-norm to show aome results of fuzzy prime ideal.

We present a new analytical method to find the asymptotic stable equilibria states based on the Markov chain technique. We reveal this method on the SIR-type epidemiological model that we developed for viral diseases with long-term immunity memory pandemic. This is a large-scale model containing 15 nonlinear ODE equations, and classical methods have failed to analytically obtain its equilibria. The proposed method is used to conduct a comprehensive analysis by a stochastic representation of the dynamics of the model, followed by finding all asymptotic stable equilibrium states of the model for any values of parameters and initial conditions.

Trachsummaroma is an eye infectious disease caused by Chlamydia Trachomatis bacterium, which may lead to irreversible blindness. The disease is spread directly or indirectly by contacting a contaminated material. It can also be transmitted through the disease vector known as “Musca sorbens” or “Bazaar fly”. To curtail the spread of the disease in a population, a meaningful information on the spread and possible control of the disease is required. Mathematical modeling provides efficient tools that can be used to understand and analyze the dynamics of the disease and its control. Several compartmental epidemic models have been proposed in the literature to study the dynamics of trachoma; including SI, SIR and SEIR. However, majority of the existing trachoma models consider only person to person transmission. Thus, the information provided by such models is insufficient since they did not capture the disease vector transmission. The current study proposed a novel SEIR-SEI model that consider both person-person and vector transmission dynamics. The threshold quantity, basic reproduction number R0 is obtained using the next generation matrix, and it was proved that the disease-free equilibrium is asymptotically stable when R0 < 1, and the endemic equilibrium is globally asymptotically stable when R0 > 1. Some simulation results with the aid of mesh plots for the reproductive number as a function of two different biological parameters were obtained. Furthermore, a comprehensive sensitivity analysis is conducted to identify the influence of the individual parameters on the R0. Numerical results show that the vector contact rate has the highest sensitivity with respect to R0, and the value of R0 increases with increase in, hence, the disease can be controlled by decreasing the vector contact rate. Similarly, improving the rate of environmental hygiene and facial cleanliness will decrease the size of R0 and result in the declination of the disease transmission. Moreover, a detailed parameter estimation of the model parameters and model fitting was presented with the use of field data cases from Northern Nigeria using least-square fitting method. The study provides alternative tools that can be used for planning trachoma control program to achieve global eradication of trachoma as a public heath challenge as targeted by WHO in 2030.

We introduce a novel key exchange protocol based on non-commutative matrix multiplication defined in $\mathbb{Z}_p^{n \times n}$. The security of our method does not rely on computational problems as integer factorization or discrete logarithm whose difficulty is conjectured. We claim that the unique eavesdropper's opportunity to get the secret/private key is by means of an exhaustive search which is equivalent to the unsorted database search problem. Furthermore, we show that the secret/private keys become indistinguishable to the eavesdropper. Remarkably, to achieve a 512-bit security level, the keys (public/private) are of the same size when matrix multiplication is done over a reduced 8-bit size modulo. Also, we discuss how to achieve key certification and Perfect Forward Secrecy (PFS). Therefore, Lizama's algorithm becomes a promising candidate to establish shared keys and secret communication between (IoT) devices in the quantum era.

Hybrid Classical-Quantum computing has already arrived at several commercial quantum computers, offered to researchers and businesses. Here, application is made to a classical-quantum model of human neocortex, Statistical Mechanics of Neocortical Interactions (SMNI), which has had its applications published in many papers since 1981. However, this project only uses Classical (super-)computers. Since 2015, a path-integral algorithm, PATHINT, used previously to accurately describe several systems in several disciplines, has been generalized from 1 dimension to N dimensions, and from classical to quantum systems, qPATHINT. Published papers have described the use of qPATHINT to neocortical interactions and financial options. The classical space described by SMNI applies nonlinear nonequilibrium multivariate statistical mechanics to synaptic neuronal interactions, while the quantum space described by qPATHINT applies synaptic contributions from Ca2+ waves generated by astrocytes at tripartite neuron-astrocyte-neuron sites. Previous SMNI publications since 2013 have calculated the astrocyte Ca2+ wave synaptic interactions from a closed-form (analytic) expression derived by the author. However, more realistic random shocks to the Ca2+ waves from ions entering and leaving these wave packets should be included using qPATHINT between electroencephalographic (EEG) measurements which decohere the quantum wave packets. This current project extends calculations to multiple scales of interaction between classical events and expectations over the Ca2+ quantum processes to include these random shocks in previous codes used to fit EEG data to the SMNI model, that included the analytic forms for the quantum processes but now replaced by qPATHINT. The author's Adaptive Simulated Annealing (ASA) importance-sampling optimization code is used for fitting the combined classical-quantum system. Gaussian Quadratures is used for numerical calculation of momenta expectations of the astrocyte processes that contribute to SMNI synaptic interactions. This project thereby demonstrates how some hybrid classical-quantum systems may be calculated quite well using only classical (super-)computers.

An extension of the models used to generate fractal traffic flows is presented by means of the formulation of a model that considers the use of one-dimensional chaotic maps. Based on the disaggregation of the temporal series generated by the model, a valid explanation of behavior of the values of Hurst exponent is proposed and the feasibility of their control from the parameters of the proposed model is shown.

This paper proposes a multifractal model, with the aim of providing a possible explanation for the locality phenomenon that appears in the estimation of the Hurst exponent in stationary second order temporal series representing self-similar traffic flows in current high-speed computer networks. It is shown analytically that this phenomenon occurs if the network flow consists of several components with different Hurst exponents.

This article explores the required amount of time series points from a high-speed traffic network to accurately estimate the Hurst exponent. The methodology consists in designing an experiment using estimators that are applied to time series, followed by addressing the minimum amount of points required to obtain accurate estimates of the Hurst exponent in real-time. The methodology addresses the exhaustive analysis of the Hurst exponent considering bias behavior, standard deviation, mean square error, and convergence using fractional Gaussian noise signals with stationary increases. Our results show that the Whittle estimator successfully estimates the Hurst exponent in series with few points. Based on the results obtained, a minimum length for the time series is empirically proposed. Finally, to validate the results, the methodology is applied to real traffic captures in a high-speed network based on the IEEE 802.3ab standard.

We present a general approach to define reproduction ratios or numbers to monitor the outbreak of epidemics that are modeled by mathematical evolution equations. This provides a solution to an important topic that has not been completely settled in the literature, especially in the case of complex epidemiological models. We illustrate our procedure with a full implementation of a standard deterministic SEIR model that is applied to examine the Covid-19 outbreaks and the effects of intervention measures in several countries in America (Argentina, Brazil, Mexico, USA) and Europe (France, Italy, Spain and UK) in 2020. Our code is also used to investigate herd immunity levels for Covid-19, indicating values between 85% and 90%.

Several problems of radiative transfer are yet unsolved because of the difficulties of the calculations involved in them, especially if the intervening shapes are geometrically complex. The main goal of our investigation in this domain is to convert the formulas that were previously derived, into a graphical interface based on the projected solid-angle principle. Such procedure is now feasible by virtue of several widely diffused programs for Algorithms Aided Design (AAD). Accuracy and reliability of the process is controlled by means of the analytical software DianaX developed at an earlier stage by the authors. With this new approach the often cumbersome procedure of lighting and thermal exchange calculations can be simplified and made available for the neophyte, with the undeniable advantage of reduced computer time.

A new generation of universal tools and languages for modeling and simulation multi-physical domain applications emerged and became widely accepted, which generate large-scale systems of differential algebraic equations (DAEs) automatically. Motivated by the characteristics of DAEs systems with large dimension, high index or block structures, we first propose a modified Pantelides’ algorithm (MPA) for any high order DAEs based on its Σ matrix, which is similar to Pryce’s Σ method. By introducing a vital parameter vector, a modified Pantelides’ algorithm with parameter has been presented.It leads to a block Pantelides’ algorithm (BPA) naturally which can immediately compute the crucial canonical offsets for whole (coupled) systems with block-triangular form. We illustrate these algorithms by some examples. And numerical experiments show that the time complexity of BPA can be reduced by at least O(ℓ) compared to the MPA, which is mainly consistent with the results of our analysis.

This study aims to evaluate a new approach in modeling gully erosion susceptibility based on deep learning neural network (DLNN) model, ensemble Particle swarm optimization (PSO) algorithm with DLNN (PSO-DLNN) and comparing these approaches with common artificial neural network (ANN) and support vector machine (SVM) models in Shiran watershed, Iran. For this purpose, 13 independent variables affecting gully erosion susceptibility in the study area, including altitude, slope, aspect, plan curvature, profile curvature, drainage density, distance from river, land use, soil, lithology, rainfall, , stream power index (SPI), topographic wetness index (TWI), were prepared. Also, 132 gully erosion locations were identified during field visits. Data for modeling were divided into two categories of training (70%) and testing (30%). Receiver operating characteristic (ROC) parameters including sensitivity, specificity, negative predictive value (NPV), positive predictive value (PPV) and area under curve (AUC) were used to evaluate the performance of the models. The results showed that, the AUC values from ROC with considering testing datasets of PSO-DLNN is 0.89 and which is associated with superb accuracy. Rest of the models also associated with optimal accuracy and near about PSO-DLNN model; the AUC values from ROC of DLNN, SVM and ANN for testing datasets are 0.87, 0.85 and 0.84 respectively. The PSO algorithm has updated and optimized the weights of DLNN model, and as a result, the efficiency of this model in predicting gully erosion susceptibility has increased. Therefore, it can be concluded that the use of DLNN model and its ensemble with PSO algorithm can be used as a novel and practical method in predicting the susceptibility of gully erosion that helps planners and managers in managing and reducing the risk of this phenomenon.

A micromechanical model is implemented to indicate the progressive fatigue problem of a laminated composite with a central circular hole under fatigue loading based on a finite element model. The mechanical properties of the composite lamina are represented based on the characteristics of the fiber and the matrix through a micromechanics model. An appropriate algorithm is then adopted to simulate fatigue damage development in the composite lamina. According to this algorithm, the stress field of the composite subjected to fatigue load is initially obtained using the finite element method. Finally, the predicted results of the stresses in the constituents i.e. fiber and matrix are determined according to the micromechanical bridging model. Finally applying proper damage driving relations leads to damage degree in each element. The proposed model is proven to be successful in the observation of the fatigue behavior with stiffness degradation in each element of the composite in each cycle. Results are reported and validated using those micromechanical models and experimental data available in the literature.

In this paper, we deduce explicit formulas to evaluate the determinants of nonsymmetrical structure Toeplitz Bohemians by two determinants of specific Hessenberg Toeplitz matrices, which are linear combinations in terms of determinants of specific Hessenberg Toeplitz matrices. We get some new results very di¤erent from [Massimiliano Fasi, Gian Maria Negri Porzio, Determinants of normalized upper Hessenberg matrices, Electronic Journal of Linear Algebra, Volume 36, pp. 352-366, June 2020].

Graph symmetry detection, similarity, and identity measures have been extensively studied in graph automorphism and isomorphism problems. Nevertheless, graph isomorphism and automorphism detection remain an open (unsolved) problem for many decades. In this paper, a new optinalytic coefficient termed as an optical moment coefficient was introduced for optinalysis. Its characteristic efficiency was tested for bijective property, invariance, deterministic polynomiality and non-polynomiality. The test results show that the new optical moment coefficient is very efficient for symmetry detections, similarity and identity measures between two isometric isomorphs and automorphs; and deterministic on polynomial and non-polynomial graph models.

The question does P = NP has confounded mathematicians and computer scientists alike for over 50 years and although there is an almost unanimous agreement that it in fact does not, there still is no absolute proof. In this paper, I attempt to prove to that P does not equal NP.

We review a number of preconditioners for the advection-diffusion operator and for the Schur complement matrix which in turn constitute the building blocks for Constraint and Triangular Preconditioners to accelerate the iterative solution of the discretized and linearized Navier-Stokes equations. An intensive numerical testing is performed onto the driven cavity problem with low values of the viscosity coefficient. We devise an efficient multigrid preconditioner for the advection-diffusion matrix which, combined with the commuted BFBt Schur complement approximation, and inserted in a 2 x 2 block preconditioner, provides convergence of the GMRES method in a number of iteration independent of the meshsize for the lowest values of the viscosity parameter. The low-rank acceleration of such preconditioner is also investigated showing its great potential.

The new barrier mode in Apache Spark allows embedding distributed deep learning training as a Spark stage to simplify the distributed training workflow. In Spark, a task in a stage doesn’t depend on any other tasks in the same stage, and hence it can be scheduled independently. However, several algorithms require more sophisticated inter-task communications, similar to the MPI paradigm. By combining distributed message passing (using asynchronous network IO), OpenJDK’s new auto-vectorization and Spark’s barrier execution mode, we can add non-map/reduce based algorithms, such as Cannon’s distributed matrix multiplication to Spark. We document an efficient distributed matrix multiplication using Cannon’s algorithm, which improves significantly on the performance of the existing MLlib implementation. Used within a barrier task, the algorithm described herein results in an up to 24% performance increase on a 10,000x10,000 square matrix with a significantly lower memory footprint. Applications of efficient matrix multiplication include, among others, accelerating the training and implementation of deep convolutional neural network based workloads, and thus such efficient algorithms can play a ground-breaking role in faster, more efficient execution of even the most complicated machine learning tasks

In this research, an attempt was made to reduce the dimension of wavelet-ANFIS/ANN (artificial neural network/adaptive neuro-fuzzy inference system) models toward reliable forecasts as well as to decrease computational cost. In this regard, the principal component analysis was performed on the input time series decomposed by a discrete wavelet transform to feed the ANN/ANFIS models. The models were applied for dissolved oxygen (DO) forecasting in rivers which is an important variable affecting aquatic life and water quality. The current values of DO, water surface temperature, salinity, and turbidity have been considered as the input variable to forecast DO in a three-time step further. The results of the study revealed that PCA can be employed as a powerful for dimension reduction of input variables and also to detect inter-correlation of input variables. Results of the PCA-Wavelet-ANN models are compared with those obtained from Wavelet-ANN models while the earlier one has the advantage of less computational time than the later models. Dealing with ANFIS models, PCA is more beneficial to avoid Wavelet-ANFIS models creating too many rules which deteriorate the efficiency of the ANFIS models. Moreover, manipulating the Wavelet-ANFIS models utilizing PCA leads to a significant decreasing in computational time. Finally, it was found that the PCA-Wavelet-ANN/ANFIS models can provide reliable forecasts of dissolved oxygen as an important water quality indicators in rivers.

In this study we investigate the formation of dynamical energy cascades in higher order KdV-type equations. In the beginning we recall what is known about the dynamic cascades for the classical KdV (quadratic) and mKdV (cubic) equations. Then, we investigate further the mKdV case by considering a richer set of initial perturbations in order to check the validity and persistence of various facts previously established for the narrow-banded perturbations. Afterwards we focus on higher order nonlinearities (quartic and quintic) which are found to be quite different in many respects from the mKdV equation. Throughout this study we consider both the direct and double energy cascades. It was found that the dynamic cascade is always formed, but its formation is not necessarily accompanied by the nonlinear stage of the modulational instability. Direct cascade structure remains invariant regardless the size of the spectral domain. In contrast, the double cascade shape can depend on the size of the spectral domain, even if the total number of cascading modes remains invariant. Results obtained in this study can be potentially applied to plasmas, free surface and internal wave hydrodynamics.

Real-time estimation of the parameters characterising infectious disease transmission is important for optimization quarantine interventions during outbreaks. One of the most significant parameters is the effective reproduction number - number of secondary cases produced by a single infection. The current study presents an approach for estimating the effective reproduction number and its application to COVID-19 outbreak. The method is based on fitting SIR epidemic model to observation data in a sliding time window and allows to show real-time dynamics of reproduction number at any phase of epidemic for countries globally. Online data on COVID-19 daily cases of infections, recoveries, deaths are used.Finally, time-dependent reproduction number is explored in connection with dynamics of peoples mobility. The method allows to assess the disease transmission potential and understand the effect of interventions on epidemics spread. It also can be easily adapted to future outbreaks of different pathogens. The tool is available online as Python code from the Github repository.

In mathematics, the Riemann hypothesis is a conjecture that the Riemann zeta function has its zeros only at the negative even integers and complex numbers with real part 1/2. Many consider it to be the most important unsolved problem in pure mathematics. It is one of the seven Millennium Prize Problems selected by the Clay Mathematics Institute to carry a US 1,000,000 prize for the first correct solution. We prove the Riemann hypothesis using the Complexity Theory. Number theory is a branch of pure mathematics devoted primarily to the study of the integers and integer-valued functions. The Goldbach's conjecture is one of the most important and unsolved problems in number theory. Nowadays, it is one of the open problems of Hilbert and Landau. We show the Goldbach's conjecture is true using the Complexity Theory as well. An important complexity class is 1NSPACE(S(n)) for some S(n). These mathematical proofs are based on if some unary language belongs to 1NSPACE(S(log n)), then the binary version of that language belongs to 1NSPACE(S(n)) and vice versa.

In this paper the dynamics of spatially extended infected phytoplankton with the Holling type II functional response and logistically growing susceptible phytoplankton system is studied. The proposed model is an extension of temporal model available [6], in spatiotemporal domain. The reaction diffusion system exhibits spatiotemporal chaos in phytoplankton dynamics. This is particularly important for the spatially extended systems that are studied in this paper as they display a wide spectrum of ecologically relevant behavior, including chaos. In this system stability of the system is studied with respect to disease contact rate and the growth fraction of infected phytoplankton indirectly rejoin the susceptible phytoplankton population. The results of numerical experiments in one dimension and two dimensions in space as well as time series in temporal models are presented using MATLAB simulation. Moreover, the stability of the corresponding temporal model is studied analytically. Finally, the comparison of the three types of numerical experimentations are discussed in conclusion.