In this paper, we develop bound-preserving discontinuous Galerkin (DG) methods for chemical reactive flows. There are several difficulties in constructing suitable numerical schemes. First of all, the density and internal energy positive, mass fraction each species is between 0 1. Second, due to rapid reaction rate, system may contain stiff sources, strong-stability-preserving explicit Runge-Ku...

In $1994,$ degree distance  of a graph was introduced by Dobrynin, Kochetova and Gutman. And Gutman proposed the Gutman index of a graph in $1994.$ In this paper, we introduce the concepts of  multiplicative version of degree distance and the multiplicative version of Gutman index of a graph. We find the sharp upper bound for the  multiplicative version of degree distance and multiplicative ver...

Background: The gold standard for detection of bladder cancer is cystoscopy, which is an invasive and complicated procedure. Our study was conducted to find a tumor marker with high specificity, sensitivity, and accuracy for the diagnosis of bladder cancer. Methods: Serum samples were collected from 58 bladder cancer patients and 60 healthy control subjects. Levels of lipid-bound sialic acid...

We give further results on the question of code optimality for linear codes over finite Frobenius rings for the homogeneous weight. This article improves on the existing Plotkin bound derived in an earlier paper [6], and suggests a version of a Singleton bound. We also present some families of codes meeting these new bounds.

this paper investigates existence and uniqueness results for the first order fuzzy integro-differential equations. then numerical results and error bound based on the left rectangular quadrature rule, trapezoidal rule and a hybrid of them are obtained. finally an example is given to illustrate the performance of the methods.

In this paper, we consider convex quadratic semidefinite optimization problems and provide a primal-dual Interior Point Method (IPM) based on a new kernel function with a trigonometric barrier term. Iteration complexity of the algorithm is analyzed using some easy to check and mild conditions. Although our proposed kernel function is neither a Self-Regular (SR) fun...