Smart grids require flexible data driven forecasting methods. We propose clustering tools for bottom-up short-term load forecasting. We focus on individual consumption data analysis which plays a major role for energy management and electricity load forecasting. The two first sections are dedicated to the industrial context and a review of individual electrical data analysis. We are interested in hierarchical time-series for bottom-up forecasting. The idea is to disaggregate the signal in such a way that the sum of disaggregated forecasts improves the direct prediction. The 3-steps strategy defines numerous super-consumers by curve clustering, builds a hierarchy of partitions and selects the best one minimizing a forecast criterion. Using a nonparametric model to handle forecasting, and wavelets to define various notions of similarity between load curves, this disaggregation strategy applied to French individual consumers leads to a gain of 16\% in forecast accuracy. We then explore the upscaling capacity of this strategy facing massive data and implement proposals using R, the free software environment for statistical computing. The proposed solutions to make the algorithm scalable combines data storage, parallel computing and double clustering step to define the super-consumers.

Causal relationships lie at the very core of our scientific description of biophysical phenomena. Nevertheless, observable facts such as chaotic dynamics, symmetry breaks, long-range collisionless neural interactions, zero-value energy singularities, particle/wave duality, ecological approaches to visual perception elude cause effect inductive explanations. We illustrate how simple topological claims, seemingly useless and far away from scientific inquiry (e.g., “given at least some wind on Earth, there must at all times be a cyclone or anticyclone somewhere”; “if one stirs to dissolve a lump of sugar in a cup of coffee, it appears there is always a point without motion”; “at any moment, there is always a pair of antipodal points on the Earth’s surface with equal temperatures and barometric pressures”) describe a real world, made of projections and mappings unsupplied with causality. Unavoidable, necessary, passive, spontaneous changes in systems’ shapes, dimensions and symmetries incarnate biophysical quantifiable counterparts of abstract mathematical concepts. Real features arising from topological mechanisms do not require causal powers to be produced, because are independent of exerted physical forces, energetic fields’ actions and thermodynamic constraints. Providing examples that shed novel interpretative light on phenomena such as double slit experiments, cellular mechanisms and brain function, we conclude as follows: countless scientific matters can be accessed through methodological weapons which not just break causality, replace temporal correlations and probabilistic a priori knowledge of previous cases, but also permit augments in available information devoid of entropy increases and energy losses.

Background: Outbreak of the Covid-19 is now an ongoing global health emergency. At the end of December 2019, the first infection was reported in Wuhan and the world did not pay attention to this extremely contaminated disease and plucked to react rapidly. The World is in an vulnerable state in disease spreading, facing a great loss of lives and socio-economic aspects also. That is why we have proposed a potential mathematical model with data analysis to predict and control the outcome of this pandemic. Methods: The model presented the epidemic dynamics of multiple compartments. We collected available online data of Spain. In primary step, we estimated the parameters using either the data analysis or reference papers. Then we did the data fitting analysis in comparison with the outcome of our mathematical results. The results of the system depended not only the parameters also on social consciousness. Results: It is found that disease progression in this model is determined by the basic reproductive ratio, $R_0$, the actual epidemic of $R_0$ and effective $R(t)$ of each day. If $R_0>1$, the number of latently infected individuals grows exponentially; endemic solution is stable while infection rate decays if $R_0<1$. The optimal control theory stated that vaccination and treatment strategies are highly effective for reducing both susceptible and infected population and to increase the recover rate high. In Spain, after state of alarm (quarantine) on 14 March 2020, reported cases increasing for 13 days only and from the 14th day, daily reported cases started to decline albeit with small fluctuation. Our proposed model approximates that the disease in Spain could be fully under control by after July 2020. Conclusion: Outbreak will be in control of health care system, reduce the death rate and will ensure social-economic stability.

Rough volatility models are popularized by \cite{gatheral2018volatility}, where they have shown that the empirical volatility in the financial market is extremely consistent with rough volatility. Fractional Riccati equation as a part of computation for the characteristic function of rough Heston model is not known in explicit form as of now and therefore, we must rely on numerical methods to obtain a solution. In this paper, we give a short introduction to option pricing theory and an overview of the current advancements on the rough Heston model.

A method for noise reduction of spectra based on fitting a multi-window model is presented. The spectrum is modeled as the sum of the polynomial background and Lorentzian peaks. This model applies to all points in the spectrum and to all window sizes. An iterative algorithm is used for fitting. Based on the initial data, the background calculated by the direct least squares method is subtracted. Positive data values ​​are inverted using the 1/x function and the same procedure is used to fit the Lorentzian peaks. The weighted sum of all windows fit containing the point to be processed is used as the result. The weighting factors are calculated by evaluating the quality of the fit. The performance of the presented method is compared with the Savitsky-Golay method and the wavelet noise reduction method. The proposed approach provides good noise reduction performance without using user-entered parameters.

We consider the maximum entropy Markov chain inference approach to characterize the collective statistics of neuronal spike trains, focusing on the statistical properties of the inferred model. We review large deviations techniques useful in this context to describe properties of accuracy and convergence in terms of sampling size. We use these results to study the statistical fluctuation of correlations, distinguishability and irreversibility of maximum entropy Markov chains. We illustrate these applications using simple examples where the large deviation rate function is explicitly obtained for maximum entropy models of relevance in this field.

This article describes an algorithm for generating fractals using polar coordinates. The classic Julie and Mandelbrot polynomial iteration applied to a complex number is replaced by a separate iteration for distance and angle. By varying the polynomial parameters of the iteration functions, a wide range of attractive images can be created. Distance and angle values ​​are used to colorize fractal images.

Malaria and Pneumonia are leading causes of serious illness in children and adults worldwide with their death rate and prevalence on the rise. Such alarming statistics may retard the milestones so far achieved in meeting the Millennium Development Goals 4 and 6 whose targets are to improve child survival and reverse the high prevalence of diseases such as pneumonia and malaria respectively. Two sub-models of malaria-pneumonia co-infection namely malaria model and pneumonia model were considered first and then followed by the full malaria-pneumonia co-infection model. The malaria model, pneumonia model and co-infection model basic reproduction numbers denoted by R_m, R_p and R_mp respectively was obtained using the Next Generation Matrix method. The model disease free equilibrium’s local and global stability was analysed using Descartes’ Rule of signs and Comparison method. The bifurcation analysis for the malaria, pneumonia and co-infection models was studied using the Centre Manifold Theory. The sensitivity indices of the model basic reproduction numbers R_m, R_p and R_mp to the parameters in the models were calculated. Optimal control theory was applied using the Pontryagins’ Maximum Principle to investigate optimal strategies for controlling the spread of malaria, pneumonia and co-infection models using insecticide treated bed nets (u₁(t)) spraying of mosquitoes insecticides (u₂(t)), sanitation (u₃(t)), vaccination (u₄(t)), anti-malaria drugs (u₅(t)), anti-pneumonia drugs (u₆(t)), both anti-malaria drugs and anti-pneumonia drugs (u₇(t)) as the system time control variables. Numerical simulations using a set of parameter values were provided to validate the analytical results.

DGJ (Daftardar-Gejii-Jafaris) method is used to obtain numerical solution of the third order fractional differential equation. Providing the DGJ method converges, the approximate solution is a good and effective numerical result which is close to the exact solution or the exact solution. For this,the examples of the explaning the method are presented. The proposed method is implemented for the approximation solution of the third order nonlinear fractional partial differential equations. The method was shown to be unsuitable and inconsistent for an example of a nonlinear fractional partial differential equation depend on initial-boundary value conditions. The fact that these numerical results are not consistent can be explained by the fact that the method is not convergent.

We address the dynamics of two-dimensional Navier-Stokes models with infinite delay and hereditary memory, whose kernels are a much larger class of functions than the one considered in the literature, on a bounded domain. We prove the existence and uniqueness of weak solutions by means of Faedo-Galerkin method. Moreover, we establish the existence of global attractor for the system with the existence of a bounded absorbing set and asymptotic compact property.

A method of solution to solve the compressible unsteady 3D Navier-Stokes Equations in cylindrical co-ordinates coupled to the continuity equation in cylindrical coordinates is presented in terms of an additive solution of the three principle directions in the radial, azimuthal and z directions of flow. A dimensionless parameter is introduced whereby in the large limit case a method of solution is sought for in the boundary layer of the tube. A reduction to a single partial differential equation is possible and integral calculus methods are applied for the case of a body force directed to the centre of the tube to obtain an integral form of the Hunter-Saxton equation. Also an extension for a more general body force is shown where in addition there is a rotational force applied.

This paper deals with the form, the stability character, the periodicity and the global behavior of solutions of the following four rational difference equations x_{n+1} = ((±1)/(x_{n}(x_{n-1}±1)-1)) x_{n+1} = ((±1)/(x_{n}(x_{n-1}∓1)+1)).

This paper presents the simplified and quick way to obtain an experimental measure of the modulus of elasticity(E) of a piece of metal rod using the Smartphone microphone and through the experimental configuration in mode of unsupport beam Euler-Bernoulli(E-B). To understand it, it is required to have knowledge about flexural vibration of E-B beams and to know the analysis of the spectogram of the audio signal. The methodology consists in measuring the flexural resonance frequency through an app installed on a Smartphone and using the E formula deduced from the E-B theoretical framework. The results of the experimental measurements have a discrepancy of less than 5% with respect to the factory value, for a carbon steel rod with circular cross section using the impact excitation technique. It describes the precision and accuracy of the experimental measurement. It is useful, because it helps to classify the materials in the Faculty of Engineering and it helps to make a more efficient quality control.

The ordinary continuity equation relating the current and density of a system is extended to incorporate systems with dual (longitudinal and transverse) currents. Such a system of equations is found to have the same mathematical structure as that of Maxwell equations. The horizontal and transverse currents and the densities associated with them are found to be coupled to each other. Each of these quantities are found to obey a wave equation traveling at the velocity of light in vacuum. London's equations of super-conductivity are shown to emerge from some sort of continuity equations. The new London's equations are symmetric and are shown to be dual to each other. It is shown that London's equations are Maxwell's equations with massive electromagnetic field (photon). These equations preserve the gauge invariance that is broken in other massive electrodynamics. The duality invariance may allow magnetic monopoles to be present inside superconductors. The new duality is called the comprehensive duality transformation.

Unlike the volume, the expression for the lateral area of a regular conoid has not yet been obtained by means of direct integration or a differential geometry procedure. As this form is relatively used in engineering, the inability to determine its surface, represents a serious hindrance for several problems which arise in radiative transfer, lighting and construction, to cite just a few. Since this particular shape can be conceived as a set of linearly dwindling ellipses which remain parallel to a circular directrix, a typical problem appears when looking for the length of such ellipses. We conceived a new procedure which, in principle, consists in dividing the surface into infinitesimal elliptic strips to which we have subsequently applied Ramanujan’s second approximation. In this fashion, we can obtain the perimeter of any ellipse pertaining to the said form as a function of the radius of the directrix and the position of the ellipse’s center on the X-axis. Integrating the so-found perimeters of the differential strips for the whole span of the conoid, an unexpected solution emerges through the newly found number psi (ψ). As the strips are slanted in the symmetry axis, their width is not uniform and we need to perform some adjustments in order to complete the problem with sufficient precision. Relevant implications for technology, building science, radiation and structure are derived in the ensuing discussion.

In this article, some kinds of triple belongs to metric dimensions are defined. Some classes of graphs in the matter of these kinds, are studied and the relation amid these kinds are considered. The kind of having equivalency amid these notions and some classes of graphs, is obtained. The kind of locating some vertices by some vertices when the number of locating vertices is increased, has the key role to analyze the classes of graphs, general graphs, and graph's parameters.

In light of Liu \emph{at el.}'s original works, this paper revisits the solution of Burgers's nonlinear equation $u_t=a(u_x)^2+bu_{xx} $. The study found two exact and explicit solutions for groups $G_4$ and $G_6$, as well as a general solution. A numerical simulation is carried out. In the appendix a Maple code is provided

In this paper, we propose a new mathematical model based on the association between susceptible and recovered individual, where the association between susceptible and recovered individual is disturbed by white noise. This model is based on demographic changes and is used for long term behavior. We study the stability of equilibria of the deterministic model and prove the conditions for the extinction of diseases. Then, we investigate and obtain the critical condition of the stochastic epidemic model for the extinction and the permanence in mean of the disease with the white noise. To verify our results, we present some numerical simulations for real data related to disease.

We extended the usage of the expansion method based on Sine-Gordon equation to the two dimensional Fisher equation. The relation between the trigonometric and hyperbolic functions are derived from the Sine-Gordon equation dened in two space dimension. The complex-valued traveling wave solutions to the two dimensional Fisher and Nagumo equations are set in forms a nite series of multiplications of powers of sech(.) and tanh(.) functions.

One challenging problem is the representation of three-dimensional datasets that vary with time. These datasets can be though as a cloud of points that gradually deforms. But point-wise variations lack of information about the overall deformation pattern, and more importantly, about the extreme deformation locations inside the cloud. The present article applies a technique in computational mechanics to derive the strain-rate state of a time-dependent and three-dimensional data distribution, by which one can characterize its main trends of shift. Indeed, the tensorial analysis methodology is able to determine the global deformation rates in the entire dataset. With the use of this technique, one can characterize the significant fluctuations in a reduced multivariate description of an urban system and identify the possible causes of those changes: calculating the strain-rate state of a PCA-based multivariate description of an urban system, we are able to describe the clustering and divergence patterns between the districts of the city and to characterize the temporal rate in which those variations happen.

Sumudu transform of the Dixon elliptic function with non zero modulus a ≠ 0 for arbitrary powers sm^N(x,a) ; N ≥ 1 ; sm^N(x,a)cm(x,a) ; N ≥ 0 and sm^N(x,a)cm²(x,a) ; N ≥ 0 is given by product of Quasi C fractions. Next by assuming denominators of Quasi C fraction to 1 and hence applying Heliermann correspondance relating formal power series (Maclaurin series of Dixon elliptic functions) and regular C fraction, Hankel determinants are calculated and showed by taking a = 0 gives the Hankel determinants of regular C fraction. The derived results were back tracked to the Laplace transform of sm(x,a) ; cm(x,a) and sm(x,a)cm(x,a).

Nowadays industrial dryers are used instead of traditional methods for drying. In designing dryers suitable for controlling the process of drying and reaching a high quality product, it is necessary to predict the instantaneous moisture loss during drying. For this purpose, ten mathematical-experimental models with a neural network model based on the kinetic data of pistachio drying are studied. The data obtained from the cabinet dryer will be evaluated at four temperatures of inlet air and different air velocities. The pistachio seeds will be placed in a thin layer on an aluminum sheet on a drying tray and weighed by a scale attached to the computer at different times. In the neural network, data are divided into three parts: educational (60%), validation (20%) and test (20%). Finally, the best mathematical-experimental model using genetic algorithm and the best neural network structure for predicting instantaneous moisture are selected based on the least squared error and the highest correlation coefficient.

The widely used logistic model for epidemic case reporting data may be either restrictive or unrealistic in presence of containment measures when implemented after an epidemic outbreak. For flexibility in epidemic case reporting data modelling, we combined an exponential growth curve for the early epidemic phase with a flexible growth curve to account for the potential change in growth pattern after implementation of containment measures. We also fitted logistic regression models to recoveries and deaths from the confirmed positive cases. In addition, the growth curves were integrated into a SIQR (Susceptible, Infective, Quarantined, Recovered) model framework to provide an overview on the modelled epidemic wave. We focused on the estimation of: (1) the delay between the appearance of the first infectious case in the population and the outbreak (“epidemic latency period"); (2) the duration of the exponential growth phase; (3) the basic and the time-varying reproduction numbers; and (4) the peaks (time and size) in confirmed positive cases, active cases and new infections. The application of this approach to COVID-19 data from West Africa allowed to discuss the effectiveness of some containment measures implemented across the region.

Chimeric Antigen Receptor (CAR) T-cell therapy has demonstrated high rates of response in recurrent B-cell Acute Lymphoblastic Leukemia in children and young adults. Despite this success, a fraction of patients experience relapse after treatment. Relapse is often preceded by recovery of healthy B cells, which suggests loss or dysfunction of CAR T cells in bone marrow. This site is harder to access, and thus is not monitored as frequently as peripheral blood. Understanding the interplay between B cells, leukemic cells and CAR T cells in bone marrow is paramount in ascertaining the causes of lack of response. In this paper, we put forward a mathematical model representing the interaction between constantly renewing B cells, CAR T cells and leukemic cells in the bone marrow. Our model accounts for the maturation dynamics of B cells and incorporates effector and memory CAR T cells. The model provides a plausible description of the dynamics of the various cellular compartments in bone marrow after CAR T infusion. After exploration of the parameter space, we found that the dynamics of CAR T product and disease were independent of the dose injected, initial B-cell load and tumor burden. We also show theoretically the importance of CAR T product attributes in determining therapy outcome, and have studied a variety of possible response scenarios, including second dosage schemes. We conclude by setting out ideas for the refinement of the model.

We present a new mathematical model of disease spread reflecting specialties of covid-19 epidemic by elevating the role social clustering of population. The model can be used to explain slower approaching herd immunity in Sweden, than it was predicted by a variety of other mathematical models; see graphs Fig. \ref{GROWTH2}. The hierarchic structure of social clusters is mathematically modeled with ultrametric spaces having treelike geometry. To simplify mathematics, we consider homogeneous trees with $p$-branches leaving each vertex. Such trees are endowed with algebraic structure, the $p$-adic number fields. We apply theory of the $p$-adic diffusion equation to describe coronavirus' spread in hierarchically clustered population. This equation has applications to statistical physics and microbiology for modeling {\it dynamics on energy landscapes.} To move from one social cluster (valley) to another, the virus (its carrier) should cross a social barrier between them. The magnitude of a barrier depends on the number of social hierarchy's levels composing this barrier. As the most appropriate for the recent situation in Sweden, we consider {\it linearly increasing barriers.} This structure matches with mild regulations in Sweden. The virus spreads rather easily inside a social cluster (say working collective), but jumps to other clusters are constrained by social barriers. This behavior matches with the covid-19 epidemic, with its cluster spreading structure. Our model differs crucially from the standard mathematical models of spread of disease, such as the SIR-model. We present socio-medical specialties of the covid-19 epidemic supporting our purely diffusional model.

Starting from the tenets of human imagination, i.e., the concepts of lines, points and infinity, we provide a biological demonstration that the skeptical claim “human beings cannot attain knowledge of the world” holds true. We show that the Euclidean account of the point as “that of which there is no part” is just a conceptual device, untenable in our physical/biological realm: terms like “lines, surfaces and volumes” label non-existent, arbitrary properties. We also elucidate the psychological and neuroscientific features hardwired in our brain that lead us humans to think to points and lines as truly occurring in our environment. Therefore, our current scientific descriptions of objects’ shapes, graphs and biological trajectories in phase spaces need to be revisited, leading to a proper portrayal of the real world’s events. In order to provide also a positive account, we view miniscule bounded physical surface regions as the basic objects in a biological context in a traversal of spacetime instead of the usual Euclidean points. Our account makes it possible to erase a painstaking problem that causes many theories to break down and/or being incapable of describing extreme events: the unwanted occurrence of infinite values in equations, such as singularity in the description of black holes. We propose a novel approach, based on point-free geometrical standpoints, that banishes infinitesimals and leads to a tenable physical/biological geometry. We conclude that points, lines, volumes and infinity do not describe the world, rather they are fictions introduced by ancient surveyors of land surfaces.

For analysis tasks, time counts are of interest — values recorded at some, usually equidistant, points in time. The calculation can be performed at various intervals: after a minute, an hour, a day, a week, a month, or a year, depending on how much detail the process should be analyzed. In time series analysis problems, we deal with discrete-time, when each observation of a parameter forms a time frame. The same can be said about the behavior of Covid-19 over time.In this paper, we solve the problem of predicting Covid-19 diseases in the world using neural networks. This approach is useful when it is necessary to overcome difficulties related to non-stationarity, incompleteness, unknown distribution of data, or when statistical methods are not completely satisfactory. The problem of forecasting is solved with the help of the analytical platform Deductor Studio, developed by specialists of the company Intersoft Lab of the Russian Federation. When solving this problem, appropriate methods were used to clean the data from noise and anomalies, which ensured the quality of building a predictive model and obtaining forecast values for tens of days ahead. The principle of time series forecasting was also demonstrated: import, seasonal detection, cleaning, smoothing, building a predictive model, and predicting Covid-19 diseases in the world using neural technologies for 30 days ahead.

This paper reveals the physical properties of Jeffery nanofluid flow past a moving plate embedded in porous medium under the existence of radiation and thermal diffusion. The analysis is carried out in three cases of moving plate, namely stationary plate λ = 0, forth-moving plate λ = 1, back-moving plate λ = −1. Finite difference method is applied to solve the governing equations of the flow and pointed out the variations in velocity, temperature and concentration with the use of graphical presentations. The impact of several parameters on local skin friction, Nusselt number and Sherwood number is also noticed and discussed. Enhancement of velocity is observed under the impact of Jeffery parameter for the cases of stationary plate and back-moving plate, whereas reverse nature is found in the case of forth-moving plate. The velocity enhances as the values of porosity parameter increases for the case of stationary plate and forth-moving plate but a reverse nature is noticed in the case of back-moving plate.

An SIRS (Susceptible–Infected–Removed-Susceptible) mathematical model for the transmission dynamics of the Transfusion–Transmitted Malaria (TTM) model with optimal control pair u₁(t) and u₂(t) was developed and studied in this research work. The model Transfusion–Transmitted Malaria disease–free equilibrium and endemic equilibriums points were determined. The model exhibited two equilibriums; disease-free and endemic equilibrium. It is shown that the disease–free equilibrium was locally asymptotically stable if the associated basic reproduction numbers R₀ is less than unity while the disease persists if R₀ is greater than unity. The global stability of the Transfusion–Transmitted Malaria model at the disease-free equilibrium was established using the comparison method. The optimality system was derived and an optimal control model of blood screening and drug treatment for the Transfusion–Transmitted Malaria model was investigated. Conditions for the optimal control were considered using Pontryagin’s Maximum Principle and solved numerically using the Forward and Backward Finite Difference Method (FBDM). Numerical results obtained are in perfect agreement with our analytical results.

A new formulation for a proposed solution to the 3D Navier-Stokes Equations in cylindrical co-ordinates coupled to the continuity and level set convection equation is presented in terms of an additive solution of the three principle directions in the radial, azimuthal and z directions of flow and a connection between the level set function and composite velocity vector for the additive solution is shown. For the case of a vertical tube configuration with small inclination angle, results are obtained for the level set function defining the interface in both the radial and azimuthal directions. It is found that the curvature dependent part of the problem alone induces sinusoidal azimuthal interfacial waves wheras when the curvature together with the equation for the composite velocity is considered oscillating radial interfacial waves occur. The implications of two extremes indicate the importance of looking at the full equations including curvature.

The generalized Kuramoto–Sivashinsky equation is investigated using the modified Kudrayshov method for the exact analytical solution. The modified Kudrayshov method converts the nonlinear partial differential equation to algebraic equations, as a result of various steps, which on solving the so obtained equation systems yields the analytical solution. By this way various exact solutions including complex structures are found and drawn their behaviour in complex plane by Maple to compare the uniqueness of solutions.

A basic pattern in the body plan architecture of many animals, plants and some molecular and cellular systems is five-part units. This pattern has been understood as a result of genetic blueprints in development and as a widely conserved evolutionary character. Despite some efforts, a definitive explanation of the abundance of pentagonal symmetry at so many levels of complexity is still missing. Based on both, a computational platform and a statistical spatial organization argument, we show that five-fold morphology is substantially different from other abundant symmetries like three-fold, four-fold and six-fold symmetries in terms of spatial interacting elements. We develop a measuring system to determine levels of spatial organization in 2D polygons (homogeneous or heterogeneous partition of defined areas) based in principles of regularity in a morphospace. We found that spatial organization of five-fold symmetry is statistically higher than all other symmetries studied here (three to ten-fold symmetries) in terms of spatial homogeneity. The significance of our findings is based on the statistical constancy of geometrical constraints derived from spatial organization of shapes, beyond the material or complexity level of the many different systems where pentagonal symmetry occurs.

This article, we study the sufficient conditions for the controllability of second-order impulsive partial neutral evolution differential systems with infinite delay in Banach spaces by using the theory of cosine families of bounded linear operators and fixed point theorem.

Inferring algorithmic structure in data is essential for discovering causal generative models. In this research, we present a quantum computing framework using the circuit model, for estimating algorithmic information metrics. The canonical computation model of the Turing machine is restricted in time and space resources, to make the target metrics computable under realistic assumptions. The universal prior distribution for the automata is obtained as a quantum superposition, which is further conditioned to estimate the metrics. Specific cases are explored where the quantum implementation offers polynomial advantage, in contrast to an indispensable exhaustive enumeration in the corresponding classical case. The unstructured output data and the computational irreducibility of Turing machines make this algorithm impossible to approximate using heuristics. Thus, exploring the space of program-output relations is one of the most promising problems for demonstrating quantum supremacy using Grover search that cannot be dequantized. Experimental use cases for quantum acceleration are developed for self-replicating programs and algorithmic complexity of short strings. With quantum computing hardware rapidly attaining technological maturity, we discuss how this framework will have significant advantage for various genomics applications in meta-biology, phylogenetic tree analysis, protein-protein interaction mapping and synthetic biology. This is the first time experimental algorithmic information theory is implemented using quantum computation. Our implementation on the Qiskit quantum programming platform is copy-left and can be found on https://github.com/Advanced-Research-Centre/QPULBA

In the article, by applied the concept of strongly convex function and one known identity, we establish several Ostrowski type inequalities involving conformable fractional integrals. As applications, some new error estimations for the midpoint formula are provided as well.

Let G[F,Vk, Huv] be the graph with k pockets, where F is a simple graph of order n ≥ 1,Vk= {v1,v2,··· ,vk} is a subset of the vertex set of F and Hvis a simple graph of order m ≥ 2,v is a specified vertex of Hv. Also let G[F,Ek, Huv] be the graph with k edge pockets, where F is a simple graph of order n ≥ 2, Ek= {e1,e2,···ek} is a subset of the edge set of F and Huvis a simple graph of order m ≥ 3, uv is a specified edge of Huvsuch that Huv− u is isomorphic to Huv− v. In this paper, we derive closed-form formulas for resistance distance and Kirchhoff index of G[F,Vk, Hv] and G[F,Ek, Huv] in terms of the resistance distance and Kirchhoff index F, Hv and F, Huv, respectively.

This article deals with the conformable double Laplace transforms and their some properties with examples and also the existence Condition for the conformable double Laplace transform is studied. Finally, in order to obtain the solution of nonlinear fractional problems, we present a modified conformable double Laplace that we call conformable double Laplace decomposition methods (CDLDM). Then, we apply it to solve, Regular and singular conformable fractional coupled burgers equation illustrate the effectiveness of our method some examples are given.

A proxy war, between a coalition of countries, BLUE and a country, RED, is considered. RED wants to increase the size of the RED territory. BLUE wants to involve more regions in trade and other types of cooperation. GREEN is a small and independent nation that wants to become a member of BLUE. RED attacks GREEN and tries to invade. BLUE decides to give optimal arms support to GREEN. This support can help GREEN in the war against RED and simultaneously reduce the military power of RED, which is valuable to BLUE, also outside this proxy war, since RED may confront BLUE also in other regions. The optimal control problem of dynamic arms support, from the BLUE perspective, is defined in general form. The objective function is a weighted sum of the present value of the free GREEN territory and the present value to BLUE of the net loss of military resources in the RED army. The net loss of RED at a particular point in time is a function of the location of the front line and the size of the mobile GREEN forces behind the RED line. First, it is assumed that the expected net loss is proportional to the force ratio behind the red front line. It is proved that the net loss function is a strictly concave quadratic function of x, the location of the front line. It is also proved that the unique maximum of the net loss function occurs at the same front location, also if the net loss function is proportional to the strength ratio behind the RED lines, raised to any strictly positive exponent. From the BLUE perspective, there is an optimal position of the front. This position is a function of the weights in the objective function and all other parameters. Optimal control theory is used to determine the optimal dynamic BLUE strategy, conditional on a RED strategy, which is observed by BLUE military intelligence. The optimal arms support strategy for BLUE is to initially send a large volume of arms support to GREEN, to rapidly move the front to the optimal position. Then, the support should be almost constant during most of the war, keeping the war front location stationary. In the final part of the conflict, when RED will have almost no military resources left and tries to retire from the GREEN territory, BLUE should strongly increase the arms support and make sure that GREEN rapidly can regain the complete territory and end the war

In this paper, we established the existence of PC-mild solutions for non local fractional impulsive functional integro-differential equations with finite delay. The proofs are obtained by using the techniques of fixed point theorems, semi-group theory and generalized Bellman inequality. In this paper, we have used the distributed characteristic operators to define the mild solution of the system. Results obtained here improve and extend some known results.

In this paper we investigate the global asymptotic stability of following system ofhigher order difference equations with quadratic terms:xn+1=A+Byn/yn−m^2, yn+1=A+Bxn/xn−m^2, where A and B are positive numbers and the initial values are positive numbers.We also study the boundedness, rate of convergence and oscillation behaviour of thesolutions of related system.

Since December 2019, the coronavirus disease (COVID-19) has rapidly spread worldwide. The Mexican government has implemented public safety measures to minimize the spread of the virus. In this paper, the authors use statistical models in two stages to estimate the total number of coronavirus (COVID-19) cases per day at the state and national level in Mexico. Two types of models are proposed: first, a polynomial model of the growth for the first part of the outbreak until the inflection point of the pandemic curve and then a second nonlinear growth model is used to estimate the middle and the end of the outbreak. Model selection will be performed using Vuong’s test. The proposed models show overall fit similar to predictive models (e.g. time series, and machine learning); however, the interpretation of parameters is less complex for decision-makers and the residuals follow the expected distribution when fitting the models without autocorrelation being an issue.

The world is now undergoing through a global emergency due to COVID-19 which needs immediate remedies in order to strengthen the healthcare facility to save the nations. Looking towards to the remedies, research on different aspects including the genomic and proteomic level characterizations of the SARS-CoV2 are necessarily important. In this present study, the spatial representation/composition of twenty amino acids across the primary protein sequences of SARS-CoV2 have been looked into through different parameters viz. Shannon entropy, Hurst exponent in order to fetch the autocorrelation and amount of information over the spatial representations. Also frequency distribution of each of the amino acids over the protein sequences have been chalked out.

A probabilistic description is essential for understanding the dynamics of stochastic systems far from equilibrium. To compare different Probability Density Functions (PDFs), it is extremely useful to quantify the difference among different PDFs by assigning an appropriate metric to probability such that the distance increases with the difference between the two PDFs. This metric structure then provides a key link between stochastic processes and geometry. For a non-equilibrium process, we define an infinitesimal distance at any time by comparing two PDFs at times infinitesimally apart and sum these distances in time. The total distance along the trajectory of the system quantifies the total number of different states that the system undergoes in time and is called the information length. By using this concept, we investigate classical and quantum systems and demonstrate the utility of the information length as a unique Lagrangian diagnostic to quantify the information change as a system continuously evolves in time and to map out attractor structure. We further elucidate quantum effects (uncertainty relation) and the dual role of the width of PDF in quantum systems.

In this paper, the author obtains an analytic exact form of Heaviside function, which is also known as Unit Step function and constitutes a fundamental concept of the Operational Calculus.In particulat, this function is explicitly expressed in a very simple manner by the aid of purely algebraic representations. The novelty of this work is that the proposed explicit formula is not performed in terms of non – elementary special functions, e.g. Dirac delta function or Error function and also is neither the limit of a function, nor the limit of a sequence of functions with point wise or uniform convergence. Hence, it may be much more appropriate and useful in the computational procedures which are inserted into Operational Calculus techniques and other engineering practices.

We shall discuss three methods of inverse Laplace transforms. A Sinc-Thiele approxi- mation, a pure Sinc, and a Sinc-Gaussian based method. The two last Sinc related methods are exact methods of inverse Laplace transforms which allow us a numerical approximation using Sinc methods. The inverse Laplace transform converges exponentially and does not use Bromwich contours for computations. We apply the three methods to Mittag-Leffler functions incorporating one, two, and three parameters. The three parameter Mittag-Leffler function represents Prabhakar’s function. The exact Sinc methods are used to solve fractional differential equations of constant and variable differentiation order.

Present study offers mathematical calculations of the roll-coating procedure lubricated with upper Convected Maxwell Fluid. An incompressible isothermal viscoelastic fluid is considered with roll and the porous web having uniform velocities. By employing Lubrication Approximation Theory, the desired equations of motion for the fluid concerned over porous web are modelled and analyzed. The suction rate on the web and injection rate at the roll surface are anticipated proportionate. Results for velocity profile and pressure gradient are obtained analytically. Fluid parameters of industrial significance i.e. detachment point, pressure, sheet /roll separating force, power contribution and coating thickness are also calculated numerically. Substantial and monotonic increase is witnessed in these quantities with the increase of flow parameters.

The article analyzes Bernoulli 's binary sequences in representation of empirical events about the distribution of natural resources and population sizes. Considering the event as a nonlinear system, and consisting of two dependent random variables, with memory and probabilities in maximum finite or infinite lengths, constant and equal to ½ for both variables (stationary process). The expressions of the possible trajectories remain constant in sequences that are repeated alternating the presence or absence of one of the variables at each iteration (asymmetric). There are constant oscillations in the event except if the variables X₁ and X₂ are regulated as a function of time Y. It is observed that the variables X₁ and X₂ assume in time T_k → ∞ specific behaviors (geometric variable) that can be used as management tools for random systems. In this way, the article seeks to know from this analyzes, the maximum entropy of information in the system by a theoretical view and how to model resources distribution or containment in the given problem.

The Colebrook equation ζ is implicitly given in respect to the unknown flow friction factor λ ; λ=ζ(Re,ε*,λ) which cannot be expressed explicitly in exact way without simplifications and use of approximate calculus. Common approach to solve it is through the Newton-Raphson iterative procedure or through the fixed-point iterative procedure. Both requires in some case even eight iterations. On the other hand numerous more powerful iterative methods such as three-or two-point methods, etc. are available. The purpose is to choose optimal iterative method in order to solve the implicit Colebrook equation for flow friction accurately using the least possible number of iterations. The methods are thoroughly tested and those which require the least possible number of iterations to reach the accurate solution are identified. The most powerful three-point methods require in worst case only two iterations to reach final solution. The recommended representatives are Sharma-Guha-Gupta, Sharma-Sharma, Sharma-Arora, Džunić-Petković-Petković; Bi-Ren-Wu, Chun-Neta based on Kung-Traub, Neta, and Jain method based on Steffensen scheme. The recommended iterative methods can reach the final accurate solution with the least possible number of iterations. The approach is hybrid between iterative procedure and one-step explicit approximations and can be used in engineering design for initial rough, but also for final fine calculations.

In this paper, we investigate an analytical solution of a class of nonlinear fractional integro-differential equation base on a generalized fractional power series expansion. The fractional derivatives are described in the conformable's type. The new approach is a modified form of the well-known Taylor series expansion. The illustrative examples are presented to demonstrate the accuracy and effectiveness of the proposed method

The Colebrook equation is a popular model for estimating friction loss coefficients in water and gas pipes. The model is implicit in the unknown flow friction factor . To date, the captured flow friction factor can be extracted from the logarithmic form analytically only in the term of the Lambert -function. The purpose of this study is to find an accurate and computationally efficient solution based on the shifted Lambert -function also known as the Wright -function. The Wright -function is more suitable because it overcomes the problem with the overflow error by switching the fast growing term of the Lambert -function to the series expansions that further can be easily evaluated in computers without causing overflow run-time errors. Although the Colebrook equation transformed through the Lambert -function is identical to the original expression in term of accuracy, a further evaluation of the Lambert -function can be only approximate. Very accurate explicit approximations of the Colebrook equation that contains only one or two logarithms are shown. The final result is an accurate explicit approximation of the Colebrook equation with the relative error of no more than 0.0096%. The presented approximations are in the form suitable for everyday engineering use, they are both accurate and computationally efficient.

The activity of prioritizing software requirements should be done as efficiently as possible. Selecting the most stable requirements for the most important customers for the development company can be a positive factor when we consider that the available resource does not always encompass the implementation of all requirements. Quantitative methods for reaching software prioritization in releases are many in the field of Search-Based Software Engineering (SBSE). However, we show that it is possible to use qualitative Verbal Decision Analysis (VDA) methods to solve this same type of problem. Moreover, we will use the ZAPROS III-i methods to prioritize requirements considering the opinion of the decision-maker, who will participate in this process. Finally, the results obtained in the VDA structured methods were quite satisfactory when compared to the methods using SBSE. A comparison of results between quantitative and qualitative methods will be made and discussed later.

We investigate the exact travelling wave solutions of the Tzitzéica-Dodd–Bullough–Mikhailov (TDBM) and Tzitzéica-type (TT) equations, appear in nonlinear optics, using simple ansatz approach. We use the Painlevé and traveling wave transformations to convert the mentioned nonlinear equations into nonlinear ordinary differential equations. Then, the simple ansatz approach has been employed to procure wave solutions, in terms of bright, singular soliton and trigonometric functions, for the Tzitzéica-Dodd–Bullough–Mikhailov (TDBM) and Tzitzéica-type (TT) equations. The study shows that the simple ansatz approach is straightforward and easy to implement for solving nonlinear problems.

Local binary pattern is one of the visual descriptors and can be used as a powerful feature extractor for texture classification. In this paper, a novel representation for face recognition is proposed, called it Bilateral Line Local Binary Patterns (BL-LBP). This scheme is an extension of Line Local Binary Patterns descriptors in the statistical learning subspace. The present bilateral descriptors are fused with an ensemble learning of calibrated SVM models. The performance of this scheme is evaluated using 5 standard face databases. It is found that it is robust against illumination variation, diverse facial expressions and head pose variations and its recognition accuracy reaches 98 percent, running on a mobile device with a processing speed of 63 ms per face. Results suggest that our proposed method can be very useful for the vision systems that have limited resources where the computational cost is critical.

Here we studied Bianchi type-III string cosmological models generated by means of a cloud of strings with particles connected to them in the framework of Lyra geometry considering five-dimensional space-time. To obtain the exact solutions of field equations we consider that the shear scalar and the scalar expansion are proportional, σ∞θ which leads to D=cn and secondly we adopt the assumption considering the Reddy String Condition, ρ+λ=0. From the two different cases obtained here, first case leads to the Bianchi type-III string cosmological model in Lyra geometry in five-dimensional space-time and the second case leads to the five-dimensional vacuum universe in general relativity. The Geometrical and physical properties of the model universe are studied comparing with the present day’s observational findings. The model universe obtained here starts with the big bang and as time progresses both particle density ρp and energy density ρ decreases with expansion of our Universe.

Critical infrastructures are those that are essential. For this type of infrastructure, it is necessary to implement analytical methodologies that will allow us to quickly obtain the susceptibility or resilience and possible damage generated in extreme precipitation episodes, through a holistic perspective in which the factors linked to hydrological risk intervene. In particular, urban hydraulic infrastructures are analyzed considering the degree of criticality, defined as the number of interactions on the different activities of the population. For this purpose, a hydrological risk analysis methodology is required. This methodology is focused on an integral approach of the system indicators to be analyzed and linked to the hydrological threat. This work proposes to delimit and analyze those factors that involve risk using an analytical expression. This model will estimate the damage to these infrastructures breaking down the factors involved in the risk equation and analyzing their variability according to the intrinsic characteristics linked to them as well as the interaction with external factors.

In this lecture notes, we will introduce Asymptotics, then we will give a short glimpse on Perturbation theory (regular versus singular), which plays a crucial role especially in theoretical physics. Our goal is to find Asymptotic series that approximates the values of integrals depending on some parameter or the solutions of differential equations. These methods that lead to obtain more effective algorithms of numerical evaluation are called: Asymptotic Methods.

Digital twins are the foundation of autonomous off-road vehicles. Dynamic reduction methods are one of several ways to develop digital twins for off-road vehicles. The article commences with a comprehensive overview of the most widely used dynamic reduction methods and then introduces performance metrics for assessing their efficacies in the context of digital twins. The paper additionally includes a detailed mathematical derivation of the state-space representation for reduced-order finite element models. The state-space representation of the reduced finite element models facilitates their export to problem-solving environments for dynamic analysis. The state-space models are eventually solved utilizing the built-in libraries of numerical solvers in textual and graphical programming platforms. In addition, the article identifies the set of solvers that best suit the simulation of virtual models for off-road vehicles. This article also includes an evaluation of the simulation results of digital models with modes ranging from 0 to 30 Hz. In addition, the article demonstrates the lower bound of the frequency range necessary and sufficient to be retained in off-road vehicle virtual models. Finally, the paper presents the simulation outcomes for digital models of commercial off-road vehicles with custom-built control, electrical, and control systems.

In this article, the connections amid matroid and other notions have been studied. The structure of matroid could be a reflection of some other structure in lattice theory, group theory, other algebraic structure, graph theory, combinatorics and enumeration theory.

The efficient generation of high-quality random numbers is essential in the operation of cryptographic modules. The quality of a random number generator is evaluated by the min-entropy of its entropy source. Typical method used to achieve high min-entropy of the output sequence is an entropy accumulation based on a hash function. This is grounded in the famous Leftover Hash Lemma which guarantees a lower bound on the min-entropy of the output sequence. However, the hash function based entropy accumulation has slow speed in general. For a practical perspective we need a new efficient entropy accumulation with the theoretical background for the min-entropy of the output sequence. In this work, we obtain the theoretical bound for the min-entropy of the output random sequence through the very efficient entropy accumulation using only bitwise XOR operations, where the input sequences from the entropy source are independent. Moreover we examine our theoretical results by applying to the quantum random number generator that uses dark noise arising from image sensor pixels as its entropy source.

By using the new recently proposed extended rational methods, we set some solitary and multi wave solutions of the coupled Higgs system in the present study. Some new families of hyperbolic and trigonometric solutions of the coupled Higgs equations are successfully obtained. Some solutions are real as some are complex valued functions. Particular forms of some solutions derived by choice of some parameters are demonstrated in three dimensional spaces. The complex valued solutions are also depicted by plotting both real and complex component.

A new mathematical model is presented to study the effects of macrophages on the bone fracture healing process. The model consists of a system of nonlinear ordinary differential equations that represents the interactions among classically and alternatively activated macrophages, mesenchymal stem cells, osteoblasts, and pro- and anti-inflammatory cytokines. A qualitative analysis of the model is performed to determine the equilibria and their corresponding stability properties. Numerical simulations are also presented to support the theoretical results and to monitor the evolution of a broken bone for different types of fractures under various medical interventions. The model can be used to guide clinical experiments and to explore possible medical treatments that accelerate the bone fracture healing process either by surgical interventions or drug administrations.

A nonrenewable resource extraction game model is analyzed in a differential game theory framework with random duration. If the c.d.f. of the final time is discontinuous, the related subgames are differentiated based on the position of the initial instant with respect to the jump. We investigate properties of optimal trajectories and of imputation distribution procedures if the game is played cooperatively.

This paper investigates the inverse option problems (IOP) in the extended Black--Scholes model arising in financial markets. We identify the volatility and the drift coefficient from the measured data in financial markets using a Bayesian inference approach, which is presented as an IOP solution. The posterior probability density function of the parameters is computed from the measured data. The statistics of the unknown parameters are estimated by a Markov Chain Monte Carlo (MCMC) algorithm, which exploits the posterior state space. The efficient sampling strategy of the MCMC algorithm enables us to solve inverse problems by the Bayesian inference technique. Our numerical results indicate that the Bayesian inference approach can simultaneously estimate the unknown trend and volatility coefficients from the measured data.

This article aims to discuss, the stability and boundedness character of the solutions of the rational equation of the form \begin{equation}\label{eql21.1} y_{t+1}=\frac{\nu\epsilon^{-y_t}+\delta\epsilon^{-y_{t-1}}}{\mu+\nu y_t+\delta y_{t-1}},\quad t\in N(0). \end{equation} Here, $\epsilon>1, \nu,\delta,\mu\in (0,\infty)$ and $y_0, y_1$ are taken as arbitrary non-negative reals and $N(a)=\{a,a+1,a+2,\cdots \}$. Relevant examples are provided to validate our results. The exactness is tested using MATLAB.

In this paper, the fixed-time stabilization problem for a class of uncertain chained system is addressed by using a novel nonsingular recursive terminal sliding mode control approach. A fixed-time controller and an adaptive law are designed to guarantee the uncertain chained form system both Lyapunov stable and fixed-time convergent within the settling time. The advantage of the controller based on the sliding mode is that the settling time does not depend on the system initial state. Furthermore, we use RBF neural network to estimate the uncertainty of the system. Finally, the simulation results demonstrate the performance of the control laws.

In this paper, we investigate a new $q$-analogue of the higher order degenerate Changhee polynomials and numbers, which are called the Witt-type formula for the $q$-analogue of degenerate Changhee polynomials of order $r$. We can derive some new interesting identities related to the degenerate $(h,q)$-Changhee polynomials and numbers.

Deep coal beds have been suggested as possible usable underground geological locations for carbon dioxide storage. Furthermore, injecting carbon dioxide into coal beds can improve the methane recovery. Due to importance of this issue, a novel investigation has been done on adsorption of carbon dioxide on various types of coal seam. This study has proposed four types of Gaussian Process Regression (GPR) approaches with different kernel functions to estimate excess adsorption of carbon dioxide in terms of temperature, pressure and composition of coal seams. The comparison of GPR outputs and actual excess adsorption expresses that proposed models have interesting accuracy and also the Exponential GPR approach has better performance than other ones. For this structure, R2=1, MRE=0.01542, MSE=0, RMSE=0.00019 and STD=0.00014 have been determined. Additionally, the impacts of effective parameters on excess adsorption capacity have been studied for the first time in literature. According to these results, the present work has valuable and useful tools for petroleum and chemical engineers who dealing with enhancement of recovery and environment protection.

Targeted radionuclide therapy (TRT) has recently seen a surge in popularity, with the use of radionuclides conjugated to small molecules and antibodies. Similarly, immunotherapy also has shown promising results – an example being chimeric antigen receptor (CAR) T-cells therapy in hematologic malignancies. Moreover, TRT and CAR T therapies possess unique features that require special consideration when determining how to dose, time, and sequence combination treatments, including the distribution of TRT dose in the body, the decay rate of the radionuclide, and the proliferation and persistence of the CAR-T cells. These characteristics complicate additive or synergistic effects of combination therapies and warrant a mathematical treatment which includes these dynamics in relation to the proliferation and clearance rates of the target tumor cells. Here we combine two previously published mathematical models in a multiple myeloma setting to explore the effects of dose, timing, and sequencing of TRT and CAR-T cell based therapies. We find that for a fixed TRT and CAR-T cell dose, the tumor proliferation rate is the most important parameter in determining the best timing of TRT and CAR T therapies.

We proposed in this work the introduction of a new vision of stochastic processes through geometry induced by dilation. The dilation matrices of a given process are obtained by a composition of rotation matrices built in with respect to partial correlation coefficients. Particularly interesting is the fact that the obtention of dilation matrices is regardless of the stationarity of the underlying process. When the process is stationary, only one dilation matrix is obtained and it corresponds therefore to Naimark dilation. When the process is nonstationary, a set of dilation matrices is obtained. They correspond to Kolmogorov decomposition. In this work, the nonstationary class of periodically correlated processes was of interest. The underlying periodicity of correlation coefficients is then transmitted to the set of dilation matrices. Because this set lives on the Lie group of rotation matrices, we can see them as points of a closed curve on the Lie group. Geometrical aspects can then be investigated through the shape of the obtained curves, and to give a complete insight into the space of curves, a metric and the derived geodesic equations are provided. The general results are adapted to the more specific case where the base manifold is the Lie group of rotation matrices, and because the metric in the space of curve naturally extends to the space of shapes, this enables a comparison between curves’ shapes and allows then the classification of processes’ measure.

In this short note we present a technique using which one attributes frequency and wavevector to (almost) arbitrary scalar fields. Our proposed definition is then applied to the classical wave equation to yield a novel nonlinear PDE.

We consider a control problem for a diffusive PDE model of heterogeneous population of thermostatically controlled loads (TCLs) aiming to balance the aggregate power consumption within a given amount of time. Using the Green’s function approach, the problem is formulated as an approximate controllability problem for a residue depending on control parameters nonlinearly. A sufficient condition for approximate controllability is derived in terms of initial temperature distribution, operation time of TCLs and threshold value of the aggregate power consumption. Case studies allow to reveal the advantages of the proposed solution from numerical calculations point of view.

We consider a model of predator-prey interaction at fractional-order where the predation obeys the ratio-dependent functional response and the prey is linearly harvested. For the proposed model, we show the existence, uniqueness, non-negativity as well as the boundedness of the solutions. Conditions for the existence of all possible equilibrium points and their stability criteria, both locally and globally, are also investigated. The local stability conditions are derived using the Magtinon's theorem, while the global stability is proven by formulating an appropriate Lyapunov function. The occurance of Hopf bifurcation around the interior point is also shown analytically. At the end, we implement the Predictor-Corrector scheme to perform some numerical simulations.

Exact and soliton type solutions have great importance in propagation of surface waves, fluid dynamics, optics, and many other elds of nonlinear sciences. In this study, the explicit and exact soliton type solutions for two space-time fractional Equal- Width (FEW) equations with conformable derivative are procured via the hyperbolic function approach. The wave type solutions are represented in some hyperbolic and trigonometric functions.

In this paper, a complete tool for real-time detection of atypical energy behaviors of airplanes is presented. The methodology extends in real time an existing offline process using Dubins trajectories as a predictor of the remaining distance to the runway threshold. Two major contributions are presented in this paper. First, a real-time measure of the aircraft energy behaviour is defined, indicating whether the aircraft is in good condition to intercept the extended runway centreline from its current position. Secondly, a 2D trajectory suggestion is given, allowing safe management of the approach path according to atypical criteria of historical data. Finally, this document proposes a comprehensive tool for air traffic controllers, which is a major step forward in understanding, becoming aware of and resolving critical situations that could lead to accidents.

In this paper we provide a highly selected review and synthesis on some of the recent and notable contribution to research in portfolio analysis. A unique perspective on this development in the literature is offered in this paper by judiciously identifying a few sample eigenvalues adjustment patterns in a portfolio that leads to an improvement in the out-of-sample portfolio Sharpe ratio when the population covariance matrix admits a high-dimensional factor model. These patterns unveil a key insight into a portfolio performance improvement and shed an important light on the effectiveness of a few recently introduced ”robust to estimation errors” covariance matrix estimation approaches, which were not originally designed with the goal to improve the out-of-sample portfolio performance.

The aim of this expository article is to present recent developments in the centuries-old discussion on the interrelations between several types of domination in graphs. However, the novelty even more prominent in the newly discovered simplified presentations of several older results. Domination can be seen as arising from real-world application and extracting classical results as first described by this article.The main part of this article, concerning a new domination and older one, is presented in a narrative that answers two classical questions: (i) To what extend must closing set be dominating? (ii) How strong is the assumption of domination of a closing set? In a addition, we give an overview of the results concerning domination. The problem asks how small can a subset of vertices be and contain no edges or, more generally how can small a subset of vertices be and contain other ones. Our work was as elegant as it was unexpected being a departure from the tried and true methods of this theory that had dominated the field for one fifth a century. This expository article covers all previous definitions. The inability of previous definitions in solving even one case of real-world problems due to the lack of simultaneous attentions to the worthy both of vertices and edges causing us to make the new one. The concept of domination in a variety of graphs models such as crisp, weighted and fuzzy, has been in a spotlight. We turn our attention to sets of vertices in a fuzzy graph that are so close to all vertices, in a variety of ways, and study minimum such sets and their cardinality. A natural way to introduce and motivate our subject is to view it as a real-world problem. In its most elementary form, we consider the problem of reducing waste of time in transport planning. Our goal here is to first describe the previous definitions and the results, and then to provide an overview of the flows ideas in their articles. The final outcome of this article is twofold: (i) Solving the problem of reducing waste of time in transport planning at static state; (ii) Solving and having a gentle discussions on problem of reducing waste of time in transport planning at dynamic state. Finally, we discuss the results concerning holding domination that are independent of fuzzy graphs. We close with a list of currently open problems related to this subject. Most of our exposition assumes only familiarity with basic linear algebra, polynomials, fuzzy graph theory and graph theory.

We investigate the value distribution of dierence polynomials of entire and meromorphic functions, which can be viewed as the Hayman's conjecture. And we also study the uniqueness of dierence polynomials sharing a common value.

New setting is introduced to study “closing numbers” and “super-closing numbers” as optimal-super-resolving number, optimal-super-coloring number and optimal-super-dominating number. In this way, some approaches are applied to get some sets from (Neutrosophic)n-SuperHyperGraph and after that, some ideas are applied to get different types of super-closing numbers which are called by optimal-super-resolving number, optimal-super-coloring number and optimal-super-dominating number. The notion of dual is another new idea which is covered by these notions and results. In the setting of dual, the set of super-vertices is exchanged with the set of super-edges. Thus these results and definitions hold in the setting of dual. Setting of neutrosophic n-SuperHyperGraph is used to get some examples and solutions for two applications which are proposed. Both setting of SuperHyperGraph and neutrosophic n-SuperHyperGraph are simultaneously studied but the results are about the setting of n-SuperHyperGraphs. Setting of neutrosophic n-SuperHyperGraph get some examples where neutrosophic hypergraphs as special case of neutrosophic n-SuperHyperGraph are used. The clarifications use neutrosophic n-SuperHyperGraph and theoretical study is to use n-SuperHyperGraph but these results are also applicable into neutrosophic n-SuperHyperGraph. Special usage from different attributes of neutrosophic n-SuperHyperGraph are appropriate to have open ways to pursue this study. Different types of procedures including optimal-super-set, and optimal-super-number alongside study on the family of (neutrosophic)n-SuperHyperGraph are proposed in this way, some results are obtained. General classes of (neutrosophic)n-SuperHyperGraph are used to obtains these closing numbers and super-closing numbers and the representatives of the optimal-super-coloring sets, optimal-super-dominating sets and optimal-super-resolving sets. Using colors to assign to the super-vertices of n-SuperHyperGraph and characterizing optimal-super-resolving sets and optimal-super-dominating sets are applied. Some questions and problems are posed concerning ways to do further studies on this topic. Using different ways of study on n-SuperHyperGraph to get new results about closing numbers and super-closing numbers alongside sets in the way that some closing numbers super-closing numbers get understandable perspective. Family of n-SuperHyperGraph are studied to investigate about the notions, super-resolving and super-coloring alongside super-dominating in n-SuperHyperGraph. In this way, sets of representatives of optimal-super-colors, optimal-super-resolving sets and optimal-super-dominating sets have key role. Optimal-super sets and optimal-super numbers have key points to get new results but in some cases, there are usages of sets and numbers instead of optimal-super ones. Simultaneously, three notions are applied into (neutrosophic)n-SuperHyperGraph to get sensible results about their structures. Basic familiarities with n-SuperHyperGraph theory and neutrosophic n-SuperHyperGraph theory are proposed for this article.

In this study, based on our previous study, we examined the mathematical properties, especially the stability of the equilibrium for our proposed mathematical model. By means of the results of the stability in this study, we also used actual data representing transient booms and resurgent booms, and conducted parameter estimation for our proposed model using Bayesian inference. In addition, we conducted a model fitting to five actual data. By this study, we reconfirmed that we can express the resurgences or minute vibrations of actual data by means of our proposed model.

A detection system, modeled in a graph, uses "detectors" on a subset of vertices to uniquely identify an "intruder" at any vertex. We consider two types of detection systems: open-locating-dominating (OLD) sets and identifying codes (ICs). An OLD set gives each vertex a unique, non-empty open neighborhood of detectors, while an IC provides a unique, non-empty closed neighborhood of detectors. We explore their fault-tolerant variants: redundant OLD (RED:OLD) sets and redundant ICs (RED:ICs), which ensure that removing/disabling at most one detector guarantees the properties of OLD sets and ICs, respectively. This paper focuses on constructing optimal RED:OLD sets and RED:ICs on the infinite king's grid, and presents the proof for the bounds on their minimum densities; [3/10, 1/3] for RED:OLD sets and [3/11, 1/3] for RED:ICs.

Kim-Kim (Russ. J. Math. Phys. 2017, 24, 241-248) defined the degenerate Laplace transform and investigated some of their certain properties. Motivated by this study, in this paper, we introduce the degenerate Sumudu transform and establish some properties and relations. We derive degenerate Sumudu transforms of power functions, degenerate sine, degenerate cosine, degenerate hyperbolic sine, degenerate hyperbolic cosine, degenerate exponential function, and function derivatives. We also acquire a relationship between degenerate Sumudu transform and degenerate gamma function. Moreover, we investigate a scale preserving theorem for the degenerate Sumudu transform. Furthermore, we show that the degenerate Sumudu transform is the theoretical dual transform to the degenerate Laplace transform.

The symmetry properties of an ornament contain information about its civilisation and its interactions with other cultural sources. Two-dimensional periodic ornaments can be strictly classified into a limited set of 17 mathematical symmetry groups, also known as wallpaper groups. The collection of ornaments thus classified for a civilisation is characteristic of the cultural group and serves as a fingerprint to identify that group. If the distribution of wallpaper groups is available for several societies, mathematical methods can be applied to determine similarities and differences between the art practices of these communities. This method allows a systematic approach to the general ornamental practices within a culture and their interactions in the form of similarity of fingerprints. We test the feasibility of the method on examples of medieval Armenians, Byzantium, Seljuks first in Persia and then in Anatolia and among Arabs in the Middle East. For this purpose we present the distribution of the planar ornaments and calculate the Euclidean distances in pairs. We tested to what extend geographical and religious factors could account for the observed similarity of ornamental groups between cultures. The results suggest an intensive interaction between the Seljuk Turks and Arab craftsmen who produced the ornaments. Therefore the cultural interactions are religiously motivated.

In this paper, we demonstrate the Collatz conjecture using the mathematical complete induction method. We show that this conjecture is satisfied for the first values of natural numbers, and in analyzing the sequence generated by odd numbers, we can deduce a formula for the general term of the Collatz sequence for any odd natural number n after several iterations. This formula is used in one case that we analyze using the mathematical complete induction method in the process of demonstrating the conjecture.

New setting is introduced to study types of coloring numbers, degree of vertices, degree of hyperedges, co-degree of vertices, co-degree of hyperedges, neutrosophic degree of vertices, neutrosophic degree of hyperedges, neutrosophic co-degree of vertices, neutrosophic co-degree of hyperedges, neutrosophic number of vertices, neutrosophic number of hyperedges in neutrosophic hypergraphs. Different types of procedures including neutrosophic (r, n)−regular hypergraphs and neutrosophic complete r−partite hypergraphs are proposed in this way, some results are obtained. General classes of neutrosophic hypergraphs are used to obtain chromatic number, the representatives of the colors, degree of vertices, degree of hyperedges, co-degree of vertices, co-degree of hyperedges, neutrosophic degree of vertices, neutrosophic degree of hyperedges, neutrosophic co-degree of vertices, neutrosophic co-degree of hyperedges, neutrosophic number of vertices, neutrosophic number of hyperedges in neutrosophic hypergraphs. Using colors to assign to the vertices of neutrosophic hypergraphs and characterizing representatives of the colors are applied in neutrosophic (r, n)−regular hypergraphs and neutrosophic complete r−partite hypergraphs. Some questions and problems are posed concerning ways to do further studies on this topic. Using different ways of study on neutrosophic hypergraphs to get new results about number, degree and co-degree in the way that some number, degree and co-degree get understandable perspective. Neutrosophic (r, n)−regular hypergraphs and neutrosophic complete r−partite hypergraphs are studied to investigate about the notions, coloring, the representatives of the colors, degree of vertices, degree of hyperedges, co-degree of vertices, co-degree of hyperedges, neutrosophic degree of vertices, neutrosophic degree of hyperedges, neutrosophic co-degree of vertices, neutrosophic co-degree of hyperedges, neutrosophic number of vertices, neutrosophic number of hyperedges in neutrosophic (r, n)−regular hypergraphs and neutrosophic complete r−partite hypergraphs. In this way, sets of representatives of colors, degree of vertices, degree of hyperedges, co-degree of vertices, co-degree of hyperedges, neutrosophic degree of vertices, neutrosophic degree of hyperedges, neutrosophic co-degree of vertices, neutrosophic co-degree of hyperedges, neutrosophic number of vertices, neutrosophic number of hyperedges have key points to get new results but in some cases, there are usages of sets and numbers instead of optimal ones. Simultaneously, notions chromatic number, the representatives of the colors, degree of vertices, degree of hyperedges, co-degree of vertices, co-degree of hyperedges, neutrosophic degree of vertices, neutrosophic degree of hyperedges, neutrosophic co-degree of vertices, neutrosophic co-degree of hyperedges, neutrosophic number of vertices, neutrosophic number of hyperedges are applied into neutrosophic hypergraphs, especially, neutrosophic (r, n)−regular hypergraphs and neutrosophic complete r−partite hypergraphs to get sensible results about their structures. Basic familiarities with neutrosophic hypergraphs theory and hypergraph theory are proposed for this article.

The purpose of this paper is to bring to light a method through which the global in time existence for arbitrary large in H¹ initial data of a strong solution to 3D periodic Navier-Stokes equations follows. The method consists of subdividing the time interval of existence into smaller sub-intervals carefully chosen. These sub-intervals are chosen based on the hypothesis that for any wavenumber m, one can find an interval of time on which the energy quantized in low-frequency components (up to m) of the solution u is lesser than the energy quantized in high-frequency components (down to m) or otherwise the opposite. We associate then a suitable number m to each one of the intervals and we prove that the norm ||u(t)||_H1 is bounded in both mentioned cases. The process can be continued until reaching the maximal time of existence T_max which yields the global in time existence of strong solution.

The managers’ strategic behavior of commercial real estate in a competitive environment is discussed. The means of this research are methods of mathematical and experimental game theory. Illustrates an example of a decision-theoretic game problem with two players engaged in the management of competing shopping centers. The strategies of these players are determined by the costs of the development. Since the number of visitors is constantly and changing the quality of shopping centers, managers actually pull visitors from each other, the game-theoretical formulation of the problem of management of shopping centers corresponds to the zero-sum game. The model example shows that with the help of mathematical modeling it is possible to determine the theoretical expected behavior of agents. The model of the software module created specifically for experimental research is described. The experiments are designed to compare the theoretically predicted behavior with the real actions of people. The novelty is that at significant costs of the Manager for the development and promotion of shopping and entertainment centers, the strategies of managers are resistant to each other's actions, in contrast to changes in the external environment is shown.

In today’s world face detection is the most important task. Due to the chromosomes disorder sometimes a human face suffers from different abnormalities. For example, one eye is bigger than the other, cliff face, different chin-length, variation of nose length, length or width of lips are different, etc. For computer vision currently this is a challenging task to detect normal and abnormal face and facial parts from an input image. In this research paper a method is proposed that can detect normal or abnormal faces from a frontal input image. This method used Fast Fourier Transformation (FFT) and Discrete Cosine Transformation of frequency domain and spatial domain analysis to detect those faces.

In this study, by using Least Square Method, the dataset for the Gross Domestic Product per capita is modeled as a function satisfying the fractional differential equation. The function itself is assumed to be the finite summation of its previous values and the derivatives with unknown coefficients. Then, the prediction for the upcoming years is done by having an approach dividing the dataset into 4 regions corresponding to four different tasks. The mathematical model of the Gross Domestic Product (GDP) per capita of the countries (and union) which are Brazil, China, European Union (EU), India, Italy, Japan, UK, the USA, Spain, and Turkey is constructed with a new methodology called as the deep assessment method which comes from the expressing an arbitrary function modeling the dataset as the finite summation of its previous values and the derivatives with unknown coefficient. The method uses the fractional calculus properties combining with Least Square Method and is compared to Long short-term memory (LSTM) algorithm which is a special type of neural network used for time sequences in general.

In this essay, the new notion concerning longest path is introduced. Longest path has a close relation with the notion of diameter in graph. The classes of graph are studied in the terms of having the vertex with longest path. Valued number is the number of edges belong to the longest path in the matter of vertex. For every vertex, there’s a valued number and new notion of valued set is the generalization of valued number for the vertex when all vertices of the graphs are corresponded to a vertex which has the greater valued number. For any positive integer, there’s one graph in that, there’s vertex which its valued number is that. By deleting the vertices which don’t belong to valued set, new notion of new graph is up. It’s called valued graph. The comparison amid valued graph and initial graph is up, too.

New setting is introduced to study the alliances. Alliances are about a set of vertices which are applied into the setting of neutrosophic graphs. Neighborhood has the key role to define these notions. Also, neighborhood is defined based on the edges, strong edges and some edges which are coming from connectedness. These three types of edges get a framework as neighborhood and after that, too close vertices have key role to define offensive alliance, defensive alliance, t-offensive alliance, and t-defensive alliance based on three types of edges, common edges, strong edges and some edges which are coming from connectedness. The structure of set is studied and general results are obtained. Also, some classes of neutrosophic graphs containing complete, empty, path, cycle, bipartite, t-partite, star and wheel are investigated in the terms of set, minimal set, number, and neutrosophic number. In this study, there’s an open way to extend these results into the family of these classes of neutrosophic graphs. The family of neutrosophic graphs aren’t study but it seems that analogous results are determined. There’s a question. How can be related to each other, two sets partitioning the vertex set of a graph? The ideas of neighborhood and neighbors based on different edges illustrate open way to get results. A set is alliance when two sets partitioning vertex set have uniform structure. All members of set have different amount of neighbors in the set and out of set. It leads us to the notion of offensive and defensive. New ideas, offensive alliance, defensive alliance, t-offensive alliance, t-defensive alliance, strong offensive alliance, strong defensive alliance, strong t-offensive alliance, strong t-defensive alliance, connected offensive alliance, connected defensive alliance, connected t-offensive alliance, and connected t-defensive alliance are introduced. Two numbers concerning cardinality and neutrosophic cardinality of alliances are introduced. A set is alliance when its complement make a relation in the terms of neighborhood. Different edges make different neighborhoods. Three types of edges are applied to define three styles of neighborhoods. General edges, strong edges and connected edges are used where connected edges are the edges arising from connectedness amid two endpoints of the edges. These notions are applied into neutrosophic graphs as individuals and family of them. Independent set as an alliance is a special set which has no neighbor inside and it implies some drawbacks for this notions. Finding special sets which are well-known, is an open way to purse this study. Special set which its members have only one neighbor inside, characterize the connected components where the cardinality of its complement is the number of connected components. Some problems are proposed to pursue this study. Basic familiarities with graph theory and neutrosophic graph theory are proposed for this article.

In this paper study, we develop a Bayesian Network model selection principle that address addresses the incommensurability of network features obtained from incongruous datasets and overcomes performance irregularities of the Minimum Description Length model selection principle. This is achieved (i) by approaching model evaluation as a classification problem, (ii) by estimating the effect that sampling error has on the satisfiability of conditional independence criterion, as reflected by Mutual Information, and (iii) by utilizing this error estimate to penalize uncertainty in the Minimum Uncertainty (MU) model selection principle. We validate our findings numerically and demonstrate the performance advantages of the MU criterion. Finally, we illustrate the advantages of the new model evaluation framework on a tRNA structural biology example.

The paper is devoted to the investigation of regional observability with constraints on the state of semilinear parabolic systems. The purpose is to reconstruct the initial state between two prescribed functions only on an internal subregion $\omega$ of the system evolution domain $\Omega$. The proofs use two approaches, the subdifferential and HUM approach. Finally, a numerical example is provided to verify the effectiveness of our theory results.

The capacitated team orienteering problem with time windows (CTOPTW) is a NP-hard combinatorial optimization problem. In the CTOPTW, a set of customers is given each with a profit, a demand, a service time and a time window. A homogeneous fleet of vehicles is available for serving customers and collecting their associated profits. Each vehicle is constrained by a maximum tour duration and a limited capacity. The CTOPTW is concerned with the determination of a preset number of vehicle tours that begin and end at a depot, visit each customer no more than once while satisfying the time duration, time window and vehicle capacity constraints on each tour. The objective is to maximize the total profit collected. In this study we propose an iterated local search (ILS) algorithm to deal with the CTOPTW. ILS is a single solution based meta-heuristic that successively invokes a local search procedure to explore the solution space. A perturbation operator is used to modify the current local optimum solution in order to provide a starting solution for the local search procedure. As different problems and instances have different characteristics, the success of the ILS is highly dependent on the local search procedure, the perturbation operator(s) and the perturbation strength. The basic ILS uses a single perturbation operator and the perturbation strength remains the same during the optimization process. To address these issues, we use three different perturbation operators and a varying perturbation strength which changes as the algorithm progresses. The idea is to assign a larger perturbation strength in the early stages of the search in order to focus on exploring the search space. The perturbation strength is gradually decreased so that we focus more on exploitation. The computational results show that the proposed ILS algorithm is able to generate high quality solutions on the CTOPTW benchmark instances taken from the scientific literature, demonstrating its efficiency in terms of both the solution quality and computational time. Moreover, the proposed ILS produces 21 best known results and 5 new best solutions.

In this paper, we compare the performance between systems of ordinary and (Caputo) fractional differential equations depicting the susceptible-exposed-infectious-recovered (SEIR) models of diseases. In order to understand the origins of both approaches as mean-field approximations of integer and fractional stochastic processes, we introduce the fractional differential equations as approximations of some type of fractional nonlinear birth--death processes. Then, we examine validity of the two approaches against empirical courses of epidemics; we fit both of them to case counts of three measles epidemics that occurred during the pre-vaccination era in three different locations. While FDEs appear more flexible in fitting empirical data, our ODEs offered better fits to two out of three data sets. Important differences in transient dynamics between these modeling approaches are discussed.

In this paper, Lie symmetry and Painlevé Techniques are applied to the SIRD (Susceptible, Infected, Recovered and Dead) model. A demonstration of the integrability of the model is provided to present an exact solution. The study revealed that nonlinear system passes Painlevé test and does not possesses complex chaotic behaviour. However, the system fails to pass the Painlevé test while constraints reach values equivalent to the corresponding complex chaotic behaviour. The two-dimensional Lie symmetry algebra and the commutator table of the infinitesimal generators are obtained. Lie symmetry analysis serves to linearize the nonlinear system and find the corresponding invariant solution.

The kind of set which is based on edges, is introduced. The analysis on this set is done in the matter of operation which are the classes of graphs. The general notion which is related to this concept, is up. The set of edges is seen in the matter of common vertex, entitled neighbor edges and the set of edges which has specific condition on the vertices of graphs, entitled ghost set. The kind of viewpoint when the edges are up so the kind of efforts to assign some notions which get the sensible result of edges which make sense about these two types of notions. Notions of having some attributes about vertices concerning edges and edges' attributes to get result about edges in the matter of vertices.

A mathematical model given by a two - dimensional differential system is introduced in order to understand the transition process from the normal hematopoiesis to the chronic and accelerated acute stages in chronic myeloid leukemia. A previous model of Dingli and Michor is refined by introducing a new parameter in order to differentiate the bone marrow microenvironment sensitivities of normal and mutant stem cells. In the light of the new parameter, the system now has three distinct equilibria corresponding to the normal hematopoietic state, to the chronic state, and to the accelerated acute phase of the disease. A characterization of the three hematopoietic states is obtained based on the stability analysis. Numerical simulations are included to illustrate the theoretical results.

New setting is introduced to study failed zero-forcing number and failed zero-forcing neutrosophic-number. Leaf-like is a key term to have these notions. Forcing a vertex to change its color is a type of approach to force that vertex to be zero-like. Forcing a vertex which is only neighbor for zero-like vertex to be zero-like vertex but now reverse approach is on demand which is finding biggest set which doesn’t force. LetNTG : (V,E,σ,μ) be a neutrosophic graph. Then failed zero-forcing number Z(NTG) for a neutrosophic graph NTG : (V,E,σ,μ) is maximal cardinality of a set S of black vertices (whereas vertices in V (G) \ S are colored white) such that V (G) isn’t turned black after finitely many applications of “the color-change rule”: a white vertex is converted to a black vertex if it is the only white neighbor of a black vertex. Failed zero-forcing neutrosophic-number Zn(NTG) for a neutrosophic graphNTG : (V,E,σ,μ) is maximal neutrosophic cardinality of a set S of black vertices (whereas vertices in V (G) \ S are colored white) such that V (G) isn’t turned black afterfinitely many applications of “the color-change rule”: a white vertex is converted to a black vertex if it is the only white neighbor of a black vertex. Failed zero-forcing number and failed zero-forcing neutrosophic-number are about a set of vertices which are applied into the setting of neutrosophic graphs. The structure of set is studied and general results are obtained. Also, some classes of neutrosophic graphs namely path-neutrosophic graphs, cycle-neutrosophic graphs, complete-neutrosophic graphs, star-neutrosophic graphs, bipartite-neutrosophic graphs, and t-partite-neutrosophic graphs are investigated in the terms of maximal set which forms both of failed zero-forcing number and failed zero-forcing neutrosophic-number. Neutrosophic number is reused in this way. It’s applied to use the type of neutrosophic number in the way that, three values of a vertex are used and they’ve same share to construct this number to compare with other vertices. Summation of three values of vertex makes one number and applying it to a comparison. This approach facilitates identifying vertices which form failed zero-forcing number and failed zero-forcing neutrosophic-number. In path-neutrosophic graphs, the set of vertices such that every given two vertices in the set, have distance at least two, forms maximal set but with slightly differences, in cycle-neutrosophic graphs, the set of vertices such that every given two vertices in the set, have distance at least two, forms maximal set. Other classes have same approaches. In complete-neutrosophic graphs, a set of vertices excluding two vertices leads us to failed zero-forcing number and failed zero-forcing neutrosophic-number. In star-neutrosophic graphs, a set of vertices excluding only two vertices and containing center, makes maximal set. In complete-bipartite-neutrosophic graphs, a set of vertices excluding two vertices from same parts makes intended set but with slightly differences, in complete-t-partite-neutrosophic graphs, a set of vertices excluding two vertices from same parts makes intended set. In both settings, some classes of well-known neutrosophic graphs are studied. Some clarifications for each result and each definition are provided. Using basic set not to extend this set to set of all vertices has key role to have these notions in the form of failed zero-forcing number and failed zero-forcing neutrosophic-number. The cardinality of a set has eligibility to form failed zero-forcing number but the neutrosophic cardinality of a set has eligibility to call failed zero-forcing neutrosophic-number. Some results get more frameworks and perspective about these definitions. The way in that, two vertices don’t have unique connection together, opens the way to do some approaches. A vertex could affect on other vertex but there’s no usage of edges. These notions are applied into neutrosophic graphs as individuals but not family of them as drawbacks for these notions. Finding special neutrosophic graphs which are well-known, is an open way to pursue this study. Some problems are proposed to pursue this study. Basic familiarities with graph theory and neutrosophic graph theory are proposed for this article.

In this article, some notions about set, weight of set, number, number's position, special vertex are introduced. Some classes of graph under these new notions have been opted as if the study on the special attributes of these new notion when they've acted amid each other is considered. Internal and external relations amid these new notions have been obtained as if some classes of graphs in the matter of these notions are been pointed out.

The aim of this work is to explain the behaviour of the multiresistance percentage of Pseudomona aeruginosa in some countries of Europe through a multivariate statistical analysis and machine learning validation, using data from the European Antimicrobial Resistance Surveillance System, the World Health Organization and the World Bank. First, we will use a descriptive analysis and a principal components analysis. Then, we use a k-means clustering to determine the countries and regions that are most affected by the antibiotic resistance. Second, we expand the database by adding some socioeconomic, governance and antibiotic-consumption variables. We then run a data panel regression analysis to determine some functions that relates the multiresistance percentage with those new variables. Finally, we use machine learning techniques to validate a pooling panel data case, using XGBoost and random forest algorithms. The results of the data panel analysis indicate that the most important variables for the multiresistance percentage are corruption control and the rule of law. Similar results are found with the machine learning validation analysis, where the human development index is an additional important variable for the multiresistance percentage.