I want to find an extension of the Hausdorff Measure and Fractal Measure which allows me to compute a unique, satisfying average for functions defined on non-fractal, measurable sets in the sense of Carathedory which has no gauge function.

One of the most broadly used models for membrane fouling is the Hermia model, which separates this phenomenon into four blocking mechanisms, each with an associated parameter n. These mechanisms are complete blocking (n=2), intermediate blocking (n=1), standard blocking (n=3/2) and cake formation (n=0). The original model, which was obtained through experimental data, is given by an Ordinary Differential Equation (ODE) dependent on n. At the time, this ODE was only solved for these four values of n, which limits the effectiveness of the model when adjusted to experimental data. The aim of this paper is to not only mathematically prove the original Hermia model, but also to broaden the scope of this model for any real number n by using the original ODE, the equations of fluid mechanics and the properties of single and multivariable calculus. The final generalized Hermia model is given by a power-law for any n≠2 and is given by an exponential function at n=2 and can be fitted to ultrafiltration, microfiltration, nanofiltration and reverse osmosis data with acceptable values of R2 (>0.93). Here it is also shown that the accumulated volume as a function of time follows the same type of ODE. The values of n between the four original discreate values could be physically interpreted as the existence of new blocking mechanisms.

COVID-19 outbreak started in the Chinese city of Wuhan and spread around the globe in months due to its high contagious level. Hence, this disease posed a great challenge to researchers and mathematicians. Numerous mathematical models have been suggested to visualize the spreading speed and trends of this pandemic. In this paper, a comparison of a widely established and accepted method, the Susceptible-Exposed-Infected-Quarantined-Recovered-Death-Insusceptible (SEIQRDP) model with a newly-proposed fractional-order SEIQRDP is studied. Densely populated Countries of Asia (Pakistan, India, and Bangladesh) have been chosen as data sets and both algorithms have been applied to their data. The same comparison technique has also been used on the data of two polar countries, New Zealand and Russia, that validated our findings. Error comparison of both algorithms has been recorded in a tabulated form which shows multi-fold erroneous trends over WHO data of selected countries.

In this study, we present a numerical method for solving two--dimensional space--time fractional partial differential equations (FPDEs), where the solutions of the FPDEs are expanded in terms of the shifted Chebyshev polynomials. The numerical approximations are evaluated at the Chebyshev-Gauss-Lobatto points. In the case when the FPDE is nonlinear, we employ a Newton-Raphson approach to linearize the equation. Both the linear and nonlinear cases lead to a consistent system of linear algebraic equations. The scheme is tested on selected FPDEs and the numerical results show that the proposed numerical scheme is accurate and computationally efficient in terms of CPU times. To establish the accuracy of the method, we also present an error analysis which shows the convergence of the numerical method. These positive attributes make the proposed method a good approach for solving two--dimensional fractional partial differential equations with both space and time fractional orders.

Ultrasonic based inspection of thin-walled structures often requires prior knowledge of their mechanical properties. Their accurate estimation could be achieved in a non-destructive manner employing, e.g., elastic guided waves. Such procedures require efficient approaches for experimental data extraction and processing, which is still a challenging task. An advanced automated technique for material properties identification of an elastic waveguide is proposed in this investigation. It relies on the information on dispersion characteristics of guided waves, which are extracted by applying the matrix pencil method to the measurements obtained via laser Doppler vibrometry. Two objective functions have been successfully tested, and the advantages of both approaches are discussed (accuracy vs computational costs). The numerical analysis employing the synthetic data generated via the mathematical model as well as experimental data shows that both approaches are stable and accurate. The influence of the presence of various modes in the extracted data is investigated. One can conclude that the influence of the corruptions related to the extraction of dispersion curves is not critical if the majority of guided waves propagating in the considered frequency range are presented. Possible extensions of the proposed technique for damaged and multi-layered structures are also discussed.

Inverse problems of recovering surface fluxes on the boundary of a domain from pointwise observations are considered. Sharp conditions on the data ensuring existence and uniqueness of solutions in Sobolev classes are exposed. They are smoothness conditions on the data, geometric conditions on the location of measurement points, and the boundary of a domain. The proof relies on asymptotics of fundamental solutions to the corresponding elliptic problems and the Laplace transform. The problem is reduced to a linear algebraic system with a nondegerate matrix.

Wireless cellular communication technology has developed into a very resourceful commodity worldwide. Today, people of all races can hardly live without means of voice and data cellular communication technology. Imprecise propagation loss estimation leads to high power waste, high co-channel interference and poor service quality in cellular communication system networks. This paper proposes a realistic adaptive fine-tuning method for distinctive propagation loss estimation over a microcellular communication radio links based on signal power measurements from Long Term Evolution radio broadband networks, taking non-line of sight (NLOS) and line of sight (LOS) environments into consideration. The methodology is verified by measurements taken in non-line of sight and line of sight signal propagation scenarios. The results showed that the estimated propagation losses using the proposed realistic adaptive tuning models were more accurate than the existing Cost -231 modelling estimation approach

In this paper a new monolithic Eulerian formulation in the framework of non-classical continuum is presented for the analysis of fluid-strucutre interaction problems. In this respect, Cosserat continuum theory taking into account the micro-rotational degrees of freedom of the particles is considered. Continuum description of the model and variational formulation of the governing flow dynamics for non-classical -fluid-structure interaction nCFSI is presented. The model is analyzed by computing a well known benchmark problem by Hecht and Pironneau [16]. The algorithmic description is presented and implemented using FreeFEM++. Code is validated with the benchmark solution of Turek and Hron [38] in case of flow around a flag attached with cylinder. New microstructral behavior of the solution is studied and numerical simulations and results are shown in the form of figures. Some interesting feature of the flow is observed and microstructural characteristics are discussed.

Many authors proposed analytical methods for solving fully fuzzy Sylvester matrix equation (FFSME) based on Vec-operator and Kronecker product. However, these methods are restricted to nonnegative fuzzy numbers and cannot be extended to FFSME with near-zero fuzzy numbers. The main intention of this paper is to develop a new numerical method for solving FFSME with near-zero trapezoidal fuzzy numbers that provides a wider scope of trapezoidal fully fuzzy Sylvester matrix equation (TrFFSME) in scientific applications. This numerical method can solve the trapezoidal fully fuzzy Sylvester matrix equation with arbitrary coefficients and find all possible finite arbitrary solutions for the system. In order to obtain all possible fuzzy solutions, the TrFFSME is transferred to a system of non-linear equations based on newly developed arithmetic fuzzy multiplication between trapezoidal fuzzy numbers. The fuzzy solutions to the TrFFSME are obtained by developing a new two-stage algorithm. To illustrate the proposed method numerical example is solved.

We enhance Frobenius' method for solving linear ordinary differential equations about regular singular points. Key to Frobenius' approach is the exploration of the derivative with respect to a single parameter; this parameter is introduced through the powers of generalized power series. Extending this approach, we discover that tandem recurrence relations can be derived. These relations render coefficients for series occurring in logarithmic solutions. The method applies to the, practically important, exceptional cases in which the roots of the indicial equation are equal, or differ by a non-zero integer. We demonstrate the method on Bessel's equation and derive previously unknown tandem recurrence relations for coefficients of solutions of the second kind, for Bessel equations of all integer and half-integer order.

This article describes the methodology used to identify the mathematical model that describes the correlations between the input parameters of an experiment and the parameters being followed. As a technological process, the aerodynamic separation was chosen, respectively, the behavior of a solid particle within an ascending vertical airflow. The experimental data obtained were used to identify two parameters, the average linear velocity, and the angular velocity, and through the Table Curve 3D program was developed a mathematical model which describes the dependence between the input parameters (the shape and size of the solid particle and the velocity of the airflow) and the monitored parameters. In order to determine a single mathematical equation that describes as accurately as possible the correlation between the input variables and those obtained, a pyramid-type analysis was designed. The determination of the mathematical equation started from the number of equations generated by the Table Curve 3D program, then the equations with a correlation coefficient greater than 0.85 were chosen, and finally, the common equations were identified. Respecting the working methodology was identified one equation which has for the average linear velocity a correlation coefficient r2 between 0.88-0.99 and 0.86-0.99 for the angular velocity.

Branching patterns are ubiquitous in nature, consequently over the years many researchers have tried to characterize the complexity of their structures. Due to their hierarchical nature and resemblance to fractal trees, they are often thought to have fractal properties, however their non-homogeneity (i.e., lack of strict self-similarity) is often ignored. In this paper we review and examine the use of the box-counting and sandbox methods to estimate the fractal dimensions of branching structures. We highlight the fact that these methods rely on an assumption of self-similarity that is not present in branching structures due to their non-homogeneous nature. Looking at the local slopes of the log-log plots used by these methods reveals the problems caused by the non-homogeneity. Finally, we examine the role of the canopies (endpoints or limit points) of branching structures in the estimation of their fractal dimensions.

We construct a novel family of summation-integral type hybrid operators in terms of shape parameter $\alpha\in \lbrack 0,1]$ in this paper. Basic estimates, rate of convergence, and order of approximation are also studied using the Korovkin theorem and the modulus of smoothness. We investigate the local approximation findings for these sequences of positive linear operators utilising Peetre's K-functional, Lipschitz class, and second-order modulus of smoothness.

The main goal of this paper is to show that Bayesian optimization could be regarded as a general framework for the data driven modelling and solution of problems arising in water distribution systems. Hydraulic simulation, both scenario based, and Monte Carlo is a key tool in modelling in water distribution systems. The related optimization problems fall in a simulation/optimization framework in which objectives and constraints are often black-box. Bayesian Optimization (BO) is characterized by a surrogate model, usually a Gaussian process, but also a random forest and increasingly neural networks and an acquisition function which drives the search for new evaluation points. These modelling options make BO nonparametric, robust, flexible and sample efficient particularly suitable for simulation/optimization problems. A defining characteristic of BO is its versatility and flexibility, given for instance by different probabilistic models, in particular different kernels, different acquisition functions. These characteristics of the Bayesian optimization approach are exemplified by the two problems: cost/energy optimization in pump scheduling and optimal sensor placement for early detection on contaminant intrusion. Different surrogate models have been used both in explicit and implicit control schemes. Showing that BO can drive the process of learning control rules directly from operational data. BO can also be extended to multi-objective optimization. Two algorithms have been proposed for multi-objective detection problem using two different acquisition functions.

Manufacturing corporations has the acceptance of the Outsourcing Process (OP) to improve industrial activities as well as to archive the revenue objectives, and with this, Risk Analysis (RA) tools are constantly used to assure expected results. Failure Mode and Effect Analysis (FMEA) is one of preferred RA tools, moreover, it is proven that FMEA adds uncertainty because of the human participation at the RA, afterward it is demonstrated that Pythagorean Fuzzy Dimensional Analysis – FMEA – Value Stream Mapping (PFDA-FMEA-VSM) method removes the uncertainty in RA, likewise it aids to the stakeholders for decision making, giving more advantages improving the use of the resources on the project. This document exhibits a real case scenario in a manufacturing firm applying PFDA-FMEA-VSM method adapted for manufacturing OP. The application of PFDA-FMEA-VSM shows solid RA results, removing the human intervention uncertainty added to the risk ranking, gives advantages to the stakeholders for visualize the main risks in detailed diagram, as well as make easier to take better decisions on where to apply resources and mitigate risks during OP.

In this note we study the computation of the minimum polynomial of a matrix $A$ and how we can use it for the computation of the matrix $A^n$. We also describe the form of the elements of the matrix $A^{-n}$ and we will see that it is closely related with the computation of the Drazin generalized inverse of $A$. Next we study the computation of the exponential matrix and finally we give a simple proof of the Leverrier - Faddeev algorithm for the computation of the characteristic polynomial.

In the era of sustainable development, green supplier selection has become a key component of supply chain management, as it considers criteria such as carbon footprint, water usage, energy usage and recycling capacity. Since the green supplier selection problem involves subjective criteria and uncertainty in preferences, it is well suited to using multi-criteria decision-making methods (MCDM). Although few researchers have investigated MCDM for green supplier selection under uncertainty using intuitionistic and Pythagorean fuzzy sets. Still, the newly developed fermatean fuzzy can handle greater data uncertainty than intuitionistic and Pythagorean fuzzy sets. Since interval extension of fuzzy theory provides more accurate modeling, in this paper, we propose an interval extension of fermatean fuzzy set and discuss its fundamental set operations, arithmetic operations and related properties. We propose the Hamming distance function and the score function of the interval-valued fermatean fuzzy numbers. The recently developed Multi-attribute Border Approximation Area Comparison (MABAC) method is also considered due to its stable and simple computation compared to other conventional MCDM methods. Therefore, an interval-valued fermatean fuzzy MABAC method is proposed and solved to select a green supplier based on multiple criteria. The proposed method's comparative analysis and sensitivity analysis validate the proposed method's effectiveness and robustness.

Offshore grids can have a key role in the transition of the energy system to sustainability. Although they require extensive infrastructure investments, they open up for the exploitation of additional resources and may be important to provide for part of the increasing electricity demand driven by sector coupling. This paper quantifies the socio-economic value of offshore grids and identifies their major drivers, performing energy system optimization in a model application of the Northern-central European energy system and the North Sea offshore grid towards 2050. The increasing wake loss with the size of hub-connected wind farms is integrated in the modelling. We find that without sector coupling no offshore grid may develop, and that the higher the level of sector coupling, the higher the value of offshore grids. Therefore, it can be strongly stated that offshore grid infrastructure development should not be discussed as a separate political topic, but seen in connection to sector coupling.

Gradient based methods are popularly used in training neural networks and can be broadly categorized into first and second order methods. Second order methods have shown to have better convergence compared to first order methods, especially in solving highly nonlinear problems. The BFGS quasi-Newton method is the most commonly studied second order method for neural network training. Recent methods have shown to speed up the convergence of the BFGS method using the Nesterov’s acclerated gradient and momentum terms. The SR1 quasi-Newton method though less commonly used in training neural networks, are known to have interesting properties and provide good Hessian approximations when used with a trust-region approach. Thus, this paper aims to investigate accelerating the Symmetric Rank-1 (SR1) quasi-Newton method with the Nesterov’s gradient for training neural networks and briefly discuss its convergence. The performance of the proposed method is evaluated on a function approximation and image classification problem.

We examine a family of linear partial differential equations both singularly perturbed in a complex parameter and singular in complex time at the origin. These equations entail forcing terms which combine polynomial and logarithmic type functions in time and that are bounded holomorphic on horizontal strips in one complex space variable. A set of sectorial holomorphic solutions are built up by means of complete and truncated Laplace transforms w.r.t time and parameter and Fourier inverse integral in space. Asymptotic expansions of these solutions relatively to time and parameter are investigated and two distinguished Gevrey type expansions in monomial and logarithmic scales are exhibited.

The nonlocal boundary value problem, dtρu(t)+Au(t)=f(t) (0<ρ<1, 0<t≤T), u(ξ)=αu(0)+φ (α is a constant and 0<ξ≤T), in an arbitrary separable Hilbert space H with the strongly positive selfadjoint operator A, is considered. The operator dt on the left hand side of the equation expresses either the Caputo derivative or the Riemann-Liouville derivative; naturally, in the case of the Riemann - Liouville derivatives, the nonlocal boundary condition should be slightly changed. Existence and uniqueness theorems for solutions of the problems under consideration are proved. The influence of the constant α on the existence of a solution to problems is investigated. Inequalities of coercivity type are obtained and it is shown that these inequalities differ depending on the considered type of fractional derivatives. The inverse problems of determining the right-hand side of the equation and the function φ in the boundary conditions are investigated.

An approach to estimating the objective function value of minimization maximum lateness problem is proposed. It is shown how to use transformed instances to define a new continuous objective function. After that, using this new objective function, the approach itself is formulated. We calculate the objective function value for some polynomially solvable transformed instances and use them as interpolation nodes to estimate the objective function of the initial instance. What is more, two new polynomial cases, that are easy to use in the approach, are proposed. In the end of the paper numeric experiments are described and their results are provided.

Ramsey’s theory (RAM) from combinatorics and network theory goes looking for regularities and repeated patterns inside structures equipped with nodes and edges. RAM represents the outcome of a dual methodological commitment: by one side a top-down approach evaluates the possible arrangement of specific subgraphs when the number of graph’s vertices is already known, by another side a bottom-up approach calculates the possible number of graph’s vertices when the arrangement of specific subgraphs is already known. Since natural neural networks are often represented in terms of graphs, we suggest to utilize RAM for the analytical and computational assessment of a peculiar structure supplied with neuronal vertices and axonal edges, i.e., the human brain connectome. We discuss how a RAM approach in neuroscientific issues might be able to locate and trace unexplored motifs shared between different cortical and subcortical subareas. Furthermore, we will describe how notable RAM outcomes, such as the Ramsey’s theorem and the Ramsey’s number, could contribute to uncover still unknown anatomical connexions endowed in neuronal networks and unexpected functional interactions among grey zones of the human brain.

This paper presents an approach to the Euler-Bernoulli beam theory (EBBT) using the finite difference method (FDM). The EBBT covers the case of small deflections, and shear deformations are not considered. The FDM is an approximate method for solving problems described with differential equations. The FDM does not involve solving differential equations; equations are formulated with values at selected points of the structure. Generally, the finite difference approximations are derived based on fourth-order polynomial hypothesis (FOPH) and second-order polynomial hypothesis (SOPH) for the deflection curve; the FOPH is made for the fourth and third derivative of the deflection curve while the SOPH is made for its second and first derivative. In addition, the boundary conditions and not the governing equations are applied at the beam’s ends. In this paper, the FOPH was made for all of the derivatives of the deflection curve, and additional points were introduced at the beam’s ends and positions of discontinuity (concentrated loads or moments, supports, hinges, springs, etc.). The introduction of additional points allowed us to apply the governing equations at the beam’s ends and to satisfy the boundary and continuity conditions. Moreover, grid points with variable spacing were also considered, the grid being uniform within beam segments. First-order analysis, second-order analysis, and vibration analysis of structures were conducted with this model. Furthermore, tapered beams were analyzed (element stiffness matrix, second-order analysis). Finally, a direct time integration method (DTIM) was presented. The FDM-based DTIM enabled the analysis of forced vibration of structures, with damping taken into account. The results obtained in this paper showed good agreement with those of other studies, and the accuracy was increased through a grid refinement. Especially in the first-order analysis of uniform beams, the results were exact for uniformly distributed and concentrated loads regardless of the grid. Further research will be needed to investigate polynomial refinements (higher-order polynomials such as fifth-order, sixth-order…) of the deflection curve; the polynomial refinements aimed to increase the accuracy, whereby non-centered finite difference approximations at beam’s ends and positions of discontinuity would be used.

In this paper, we consider with a class of system of differential equations whose argument transforms are involution. In this an initial value problem for a differential equation with involution is reduced to an initial value problem for a higher order ordinary differential equation. Than either two initial conditions are necessary for a solution, the equation is then reduced to a boundary value problem for a higher order ODE.

In this work, we studied the Green’s functions of the second order differential operators with involution. Uniform equiconvergence of spectral expansions related to the second-order differential operators with involution is obtained. Basicity of eigenfunctions of the second-order differential operator operator with complex-valued coefficient is established.

The key concepts in symmetry detection and similarity, identity measures are automorphism and isomorphism respectively. Therefore, methods for symmetry detection and similarity, identity measures should be functionally bijective, inverse, and invariance under a set of mathematical operations. Nevertheless, few or no existing method is functional for these properties. In this paper, a new methodological paradigm, called optinalysis, is presented for symmetry detections, similarity, and identity measures between isoreflective or autoreflective pair of mathematical structures. The paradigm of optinalysis is the re-mapping of isoreflective or autoreflective pairs with an optical scale. Optinalysis is characterized as invariant under a set of transformations and its isoreflective polymorphism behaves on polynomial and non-polynomial models.

The statistical properties of a good estimator include robustness, unbiasedness, efficiency, and consistency. However, the commonly used estimators of dispersion have lack or are weak in one or more of these properties. In this paper, I proposed statistical mirroring as a good alternative estimator of dispersion around defined location estimates or points. In the main part of the paper, attention is restricted to Gaussian distribution and only estimators of dispersion around the mean that functionalize with all the observations of a dataset were considered at this time. The different estimators were compared with the proposed estimators in terms of alternativeness, scale and sample size robustness, outlier biasedness, and efficiency. Monte Carlo simulation was used to generate artificial datasets for application. The proposed estimators (of statistical meanic mirroring) turn out to be suitable alternative estimators of dispersion that is less biased (more resistant) to contaminations, robust to scale and sample size, and more efficient to a random distribution of variable than the standard deviation, variance, and coefficient of variation. However, statistical meanic mirroring is not suitable with a mean (of a normal distribution) close to zero, and on a scale below ratio level.

In this work, Gaussian Tribonacci functions are defined and investigated on the set of real numbers $\mathbb{R},$ \textit{i.e}., functions $f_{G}$ $:$ $\mathbb{R}\rightarrow \mathbb{C}$ such that for all $% x\in \mathbb{R},$ $n\in \mathbb{Z},$ $f_{G}(x+n)=f(x+n)+if(x+n-1)$ where $f$ $:$ $\mathbb{R}\rightarrow \mathbb{R}$ is a Tribonacci function which is given as $f(x+3)=f(x+2)+f(x+1)+f(x)$ for all $x\in \mathbb{R}$. Then the concept of Gaussian Tribonacci functions by using the concept of $f$-even and $f$-odd functions is developed. Also, we present linear sum formulas of Gaussian Tribonacci functions. Moreover, it is showed that if $f_{G}$ is a Gaussian Tribonacci function with Tribonacci function $f$, then $% \lim\limits_{x\rightarrow \infty }\frac{f_{G}(x+1)}{f_{G}(x)}=\alpha \ $and\ $\lim\limits_{x\rightarrow \infty }\frac{f_{G}(x)}{f(x)}=\alpha +i,$ where $% \alpha $ is the positive real root of equation $x^{3}-x^{2}-x-1=0$ for which $\alpha >1$. Finally, matrix formulations of Tribonacci functions and Gaussian Tribonacci functions are given. In the literature, there are several studies on the functions of linear recurrent sequences such as Fibonacci functions and Tribonacci functions. However, there are no study on Gaussian functions of linear recurrent sequences such as Gaussian Tribonacci and Gaussian Tetranacci functions and they are waiting for the investigating. We also present linear sum formulas and matrix formulations of Tribonacci functions which have not been studied in the literature.

More than 110 countries including 500 cities worldwide have set the goal of reaching carbon neutrality. Heating contributes to most of the residential energy consumption and carbon emissions. The green energy transition of fossil-based heating systems is needed to reach the emission goals. However, the heating systems vary in energy source, heating technology, equipment location, and these complexities make it challenging for households to compare heating systems and make decisions. Hence, a decision support tool that provides a generalized ranking of individual heating alternatives is proposed for households as decision-makers to identify the optimal choice. This paper presents an analysis of 13 heating alternatives and 19 quantitative criteria in technological, environmental, and financial aspects, combines ideal solution based Multi-Criteria Decision Making with 6 weighting methods and 4 normalization methods, and introduces ensemble learning with a fuzzy membership function derived from Cauchy distribution to finalize the final ranking. The robustness of the proposed method is verified by 3 sensitive analyses from different aspects. Air to water heat pump, solar heating and direct district heating are the top three rankings in the final result under Danish national average data. A framework is designed to guide the decision-makers apply this ranking guideline with their practical feasible situations.

Applications in high-performance computing (HPC) may not use all available computational resources, leaving some of them underutilized. By co-scheduling, i.e. running more than one application on the same computational node, it is possible to improve resource utilization and overall throughput. Some applications may have conflicting requirements on resources and co-scheduling may cause performance degradation, so it is important to take it into account in scheduling decisions. In this paper, we formalized co-scheduling problem and proposed multiple scheduling strategies to solve it: an optimal strategy, an online strategy and heuristic strategies. These strategies vary in terms of the optimality of the solution they produce and a priori information about the system they require. We showed theoretically that the online strategy provides schedules with a competitive ratio that has a constant upper limit. This allowed us to solve the co-scheduling problem using heuristic strategies that approximate this online strategy. Numerical simulations showed how heuristic strategies compare to the optimal strategy for different input systems. We proposed a method for measuring input parameters of the model in practice and evaluated this method on HPC benchmark applications. We showed high accuracy of measurement method, which allows to apply proposed scheduling strategies in scheduler implementation.

Let $G$ be a group with identity $e$ and $R$ be a commutative $G$-graded ring with nonzero unity $1$. Graded semi-primary and graded $1$-absorbing primary ideals have been investigated and examined by several authors as generalizations of graded primary ideals. However, these three concepts are different. In this article, we characterize graded rings over which every graded semi-primary ideal is graded $1$-absorbing primary and graded rings over which every graded $1$-absorbing primary ideal is graded primary.

This paper answers the need to plan a cost-minimizing charging schedule for electric buses and proposes a three-stage procedure, which is oriented around the participation of electric buses aggregator in a day-ahead energy auction. First, optimization models are provided to determine charging availability expressed as minimum and maximum hourly energy requirements taking into account detailed, minutely characteristics and constraints of the charging equipment and the buses. Next, the auction model is formulated by considering aggregated bids submitted by the electric buses aggregator once the charging availability is determined. Hence, the day-ahead prices reflect the optimal schedules of auction participants, and the bus aggregator is safe against peak-hour charging. Finally, hourly auction-based schedules are disaggregated into optimal minutely charging schedules. Mixed-integer linear programming models are formulated for aggregation-disaggregation stages investigated in this paper, while the variables and constraints introduced into the auction model are linear. The proposed methodology has been verified on a recently published case study of a real-world bus service operated on The Ohio State University campus. We show that the auction-based charging of all 22 buses outperforms as-soon-as-possible schedules by 7% to even 28% of daily cost savings. Using the aggregated bids, buses can flexibly shift charges between high- and low-price periods while preserving constraints of the charging equipment and timetables.

The visualization of hyperspectral images in display devices, having RGB colour composition channels is quite difficult due to the high dimensionality of these images. Thus, principal component analysis has been used as a dimensionality reduction algorithm to reduce information loss, by creating uncorrelated features. To classify regions in the hyperspectral images, K-means clustering has been used to form clusters/regions. These two algorithms have been implemented on the three datasets imaged by AVIRIS and ROSIS sensors.

An embryonic version of membrane theory can be date back to the Bernstein's work reported more than a hundred years ago. Such an originally old work has evolved conceptually and mathematically up until today, and it plays a central role in current membrane theory. Goldman-Hodgkin-Katz equation (GHK eq.) is one of the math-based monumental works, which constitutes the present membrane theory. Goldman theoretically derived GHK eq., but its physiological meaning was provided by the two renowned scientists, Hodgkin and Katz. These two employed an assumption that the electric field (EF) across the plasma membrane is constant to validate the GHK eq. physiologically. Proposal of Hodgkin-Huxley model (HH model) is another math-based monumental works developed from the membrane theory and now forms a fundamental part of the current membrane theory. GHK eq. and HH model are quite fundamental central concepts in the current physiology. Despite the broad acceptance of GHK eq. at present time, its prerequisite that the EF within the plasma membrane is constant is hardly believable. Especially when the action potential is generated, it sounds totally nonsense. Furthermore, the existence of constant EF within the plasma membrane is conceptually almost in conflict with the HH model. The authors will discuss those problematic issues the membrane theory inherits.

We evaluate some binomial cubic Fibonacci sums.

This paper reviews how dynamically adaptive wavelet methods can be designed to simulate atmosphere and ocean dynamics in both flat and spherical geometries. We highlight the special features that these models must have in order to be valid for climate modelling applications. These include exact mass conservation and various mimetic properties that ensure the solutions remain physically realistic, even in the under-resolved conditions typical of climate models. Particular attention is paid to the implementation of complex topography in adaptive models. Using \textsc{wavetrisk} as an example, we explain in detail how to build a semi-realistic global atmosphere or ocean model of interest to the geophysical community. We end with a discussion of the challenges that remain to developing a realistic dynamically adaptive atmosphere or ocean climate models. These include scale-aware subgrid scale parameterizations of physical processes, such as clouds. Although we focus on adaptive wavelet methods, many of the topics we discuss are relevant for adaptive mesh refinement (AMR).

In this paper, the author utilizes Saddle Theorem and variational methods to deduce existence of at least six stationary solutions for reaction-diffusion Gilpin-Ayala competition model (RDGACM). To obtain the global stabilization of the positive stationary solution of the RDGACM, the author designs a suitable impulsive event triggered mechanism (IETM) to derive the global exponential stability of the the positive stationary solution. It is worth mentioning that the new mechanism can exclude Zeno behavior and effectively reduce the cost of impulse control through event triggering mechanism. Besides, compared with existing literature, the restrictions on the parameters of the RDGACM are relaxed so that the methods used in existing literature can not be applied to the relaxed case of this paper, and so the author makes comprehensive use of Saddle Theorem, orthogonal decomposition of Sobolev space $H_0^1(\Omega)$ and variational methods to overcome the mathematical difficulty. Numerical examples show the effectiveness of the methods proposed in this paper.

In this paper, we use three different experimental methods (particle method, grid method and hybrid method) to model and simulate the smoke from the perspective of fluid dynamics. Through the comparison of different methods, we conclude: The particle method can avoid the numerical dissipation problem caused by grid calculation, but it also brings problems such as the distortion of the trajectory of the example. The grid method is accurate in calculation, but it is prone to numerical dissipation and loss of details. Finally, we choose the hybrid method to store the vorticity in the form of particles in vortex particles, avoiding the numerical dissipation problem caused by the use of grids, and including rich turbulence, which perfectly shows the simulation effect of smoke.

The purpose of this paper is to build a new bridge between category theory and a generalized probability theory known as noncommutative probability or quantum probability, which was originated as a mathematical framework for quantum theory, in terms of states as linear functional defined on category algebras. We clarify that category algebras can be considered as generalized matrix algebras and that the notions of state on category as linear functional defined on category algebra turns out to be a conceptual generalization of probability measures on sets as discrete categories. Moreover, by establishing a generalization of famous GNS (Gelfand-Naimark-Segal) construction, we obtain a representation of category algebras of †-categories on certain generalized Hilbert spaces which we call semi-Hilbert modules over rigs.

This paper presents an approach to the vibration analysis of axially functionally graded (AFG) non-prismatic Euler-Bernoulli beams using the finite difference method (FDM). The characteristics (cross-sectional area, moment of inertia, elastic moduli, and mass density) of AFG beams vary along the longitudinal axis. The FDM is an approximate method for solving problems described with differential or partial differential equations. It does not involve solving differential equations; equations are formulated with values at selected points of the structure. The model developed in this paper consists of formulating differential or partial differential equations with finite differences and introducing new points (additional or imaginary points) at boundaries and positions of discontinuity (concentrated loads or moments, supports, hinges, springs, and brutal change of stiffness). The introduction of additional points allows satisfying boundary and continuity conditions. Vibration analysis of AFG non-prismatic Euler-Bernoulli beams was conducted with this model, and natural frequencies were determined. Finally, the direct time integration method (DTIM) was presented. The FDM-based DTIM enabled the analysis of forced vibration of AFG non-prismatic Euler-Bernoulli beams, considering the damping. The efforts and displacements could be determined at any time.

A major task in Functional Time Series Analysis is measuring the dependence within and between processes, for which lagged covariance and cross-covariance operators have proven to be a practical tool in well-established spaces. This article deduces estimators and asymptotic upper bounds of the estimation errors for lagged covariance and cross-covariance operators of processes in Cartesian products of abstract Hilbert spaces for fixed and increasing lag and Cartesian powers. We allow the processes to be non-centered, and to have values in different spaces when investigating the dependence between processes. Also, we discuss features of estimators for the principle components of our covariance operators.

Abstract:Shown is the derivation of Lorentz-Einstein k-factor in SRT as an amplitude-term of oscillation-differential equations of second order.This case is shown for classical Lorentz-factor as solution of an equation for undamped oscillation as well as the developed theorem as a second solution for advanced SRT of fourth order with an equation for damped oscillation-states.This advanced term allows a calculation for any velocities by real rest mass

We present a method using contour integration to derive definite integrals and their associated infinite sums which can be expressed as a special function. We give a proof of the basic equation and some examples of the method. The advantage of using special functions is their analytic continuation which widens the range of the parameters of the definite integral over which the formula is valid. We give as examples definite integrals of logarithmic functions times a trigonometric function. In various cases these generalizations evaluate to known mathematical constants such as Catalan’s constant and π

In this paper, we introduce a new iteration scheme, named as the S**-iteration scheme, for approximation of fixed point of the nonexpansive mappings. This scheme is faster than Picard, Mann, Ishikawa, Noor, Agarwal, Abbas, Thakur, and Ullah iteration schemes. We show the stability of our instigated scheme and give a numerical example to vindicate our claim. We also put forward some weak and strong convergence theorems for Suzuki's generalized nonexpansive mappings in the setting of uniformly convex Banach spaces. Our results comprehend, improve, and consolidate many results in the existing literature.

The aim of this paper is to bring together quaternions and generalized complex numbers. Generalized quaternions with generalized complex number components are expressed and their algebraic structures are examined. Several matrix representations and computational results are introduced. As a crucial part, alternative approach for generalized quaternion matrix with elliptic number entries are developed.

By introducing a variable transformation $\xi=\frac{1}{2}(\sin \theta+1)$, a complex-form ordinary differential equation (ODE) for the small symmetrical deformation of an elastic torus is successfully transformed into the well-known Heun's ODE, whose exact solution is obtained in terms of Heun's functions. To overcome the computational difficulties of the complex-form ODE in dealing with boundary conditions, a real-form ODE system is proposed. A general code of numerical solution of the real-form ODE is written by using Maple. Some numerical studies are carried out and verified by both finite element analysis and H. Reissner's formulation. Our investigations show that both deformation and stress response of an elastic torus are sensitive to the radius ratio, and suggest that the analysis of a torus should be done by using the bending theory of a shell.

The bilateral tempered fractional derivatives are introduced generalising previous works on the one-sided tempered fractional derivatives and the two-sided fractional derivatives. An analysis of the tempered Riesz potential is done and showed that it cannot be considered as a derivative.

Clustering algorithms for multi-database mining (MDM) rely on computing $(n^2-n)/2$ pairwise similarities between $n$ multiple databases to generate and evaluate $m\in[1, (n^2-n)/2]$ candidate clusterings in order to select the ideal partitioning which optimizes a predefined goodness measure. However, when these pairwise similarities are distributed around the mean value, the clustering algorithm becomes indecisive when choosing what database pairs are considered eligible to be grouped together. Consequently, a trivial result is produced by putting all the $n$ databases in one cluster or by returning $n$ singleton clusters. To tackle the latter problem, we propose a learning algorithm to reduce the fuzziness in the similarity matrix by minimizing a weighted binary entropy loss function via gradient descent and back-propagation. As a result, the learned model will improve the certainty of the clustering algorithm by correctly identifying the optimal database clusters. Additionally, in contrast to gradient-based clustering algorithms which are sensitive to the choice of the learning rate and require more iterations to converge, we propose a learning-rate-free algorithm to assess the candidate clusterings generated on the fly in a fewer upper-bounded iterations. Through a series of experiments on multiple database samples, we show that our algorithm outperforms the existing clustering algorithms for MDM.

The current paper explores the potential interlink between names of individuals in a society and its collective social consciousness, particularly with reference to the pervasive occurrence of the ‘mathematical names’ in the current Hindu society in the Indian subcontinent and beyond. Initially, an attempt is made to put things into mathematical perspective by drawing a quick sketch of some of the stellar achievements of the Indian mathematicians. Under the six broad categories of geometry, trigonometry, numeration, arithmetic, algebra, and mathematics in the Vedic tradition, a concise simple description of these subdivisions is presented, underlining the names of the concepts and terms, sometimes by producing the textual references. Then, upon identification of such mathematical terms, an attempt is made to juxtapose these with the names current in the Indian Hindu society. By employing an extensive dataset of university student names in India and the directories of Facebook and LinkedIn, we produce both qualitative and quantitative evidence of the presence of such names in the Indian subcontinent. Evidently, these names reflect the impressions of the tremendously rich mathematical heritage left by the Hindu stalwart mathematicians. This hypothesis has also been examined by taking surveys of people bearing these mathematical names, as well as by documenting the ‘conscious procedures’ that go behind the naming of a Hindu Indian child. In trying to investigate if such a phenomenon is unique to the Indian tradition, a stark contrast with the ‘names in mathematics’ as prevalent in the European mathematical traditions is presented, as cultural roots of mathematics are explored. Further, we ascribe the presence of these names as the extant remains of the colossal impact of multifarious mathematical traditions existing in India. Interestingly, the present research also brings to the fore, certain unseen facets of the Indian Hindu society as regards the education of mathematics to women – through an indirect exploration of their names. We also show that the pervasive occurrence of these names is not merely the result of semantic chance events, but denotes the richness of the Indian mathematical legacy. Next, we also present cross-cultural comparisons to show the uniqueness of Indian mathematical and scientific traditions that led to the pervasiveness of ‘mathematical names’ in India. Finally, an attempt is made to clarify some subtle points on the associations between mathematics and religion in India and other cultures of the world. It is sincerely hoped that the present study may shed light on the cultural roots of mathematics and may furnish a new dimension in the study of mathematics, culture and civilizations across the world.

Chellali et al. introduced two degree concepts, ve-degree and ev-degree (Chellali et al, 2017). The ve-degree of a vertex equals to number of different edges which are incident to a vertex from the closed neighborhod of v. Moreover the ev-degree of an edge e=ab equals to the number of vertices of the union of the closed neighborhoods of a and b. The most private feature of these degree concepts is, total number of ve-degrees and total number of ev-degrees equal to first Zagreb index of the graphs for triangle-free graphs. In this paper we introduce ve-degree entropy, ev-degree entropy and investigate the relations between these entropies and the first Zagreb index entropy. Finally we obtain the maximal trees with respect to ve-degree irregularity index.

This paper proposes a definition of fractional line integral, generalising the concept of fractional definite integral. The proposal replicates the properties of the classic definite integral, namely the fundamental theorem of integral calculus. It is based on the concept of fractional anti-derivative used to generalise the Barrow formula. To define the fractional line integrals the Gr\"unwald-Letnikov and Liouville directional derivatives are introduced and their properties described. The integral is defined first for broken line paths and afterwards to any regular curve

In this article, we set up some adequate conditions for analytic functions associated with cosine hyperbolic function. We determine conditions on α such that 1+α (ϰ^(2+P(j-1) ) g^' (ϰ))/(Pg^j (ϰ)),for each j=0,1,2,3 are subordinated by Janowski function, then (g(ϰ))/ϰ^P <cosℏ⁡(ϰ),(ϰ∈C). By choosing specific values of functions g we get some adequate conditions for multivalent starlike function related with cosine hyperbolic.

This note addresses a fundamental problem in matrix theory on establishing and characterizing range equalities for matrix expressions that involve generalized inverses. We first establish a group of necessary and sufficient conditions for the matrix range equality ${\rm range}(D_1 - C_1A_1^{\dag}B_1) = {\rm range}(D_2 - C_2A_2^{\dag}B_2)$ to hold, where $(\cdot)^{\dag}$ denotes the Moore--Penrose inverse of matrix. We then give several groups of range equalities with extrusion properties for multiple matrix products associated with two matrices and their conjugate transposes and Moore--Penrose inverses.

Ultrasonic imaging & NDE applications can greatly improve their signal-to-noise ratios (SNR) by driving each transducer (composing piezoelectric arrays) with a spike giving pulsed power of k-Watts, repetitively at a PRF = 5000 spikes/s, by using a HV capacitive-discharge generator. However very-high levels, of pulsed intensities (3-10 A) and voltages (300-700 V) must be considered for a rigorous spike modeling. Even though the consumed "average" power will be small, the intensity through each transducer achieves several amperes, so the pulsed powers delivered by each HV generator can attain levels higher than in CW high-power ultrasonic applications: e.g., up to 5 kW / spike. This is concluded here from a transient modeling of the loaded generator. Then, unforeseen phenomena rise: intense brief pulses of driving power & emitted force in transducers, and non-linearities in driver semiconductors, because their characteristic curves only include linear ranges. But fortunately, piezoelectric devices working in this intense regime do not show serious heating problems, because the average power remains being moderate. Intensity, power and voltage, driving a broadband transducer from a HV capacitive pulser, are calculated to drastically improve (in ≅ 40 dB) the ultrasonic net dynamic range available, with emitted forces ≅ 250 Newtons pp and E/R received pulses of 70 V pp.

We present set-theoretical solutions of the Yang-Baxter equation in BCK–algebras. Some solutions in BCK−algebras are not solutions in other structures (such as MV −algebras). Related to our investigations we also consider some new structures: Boolean coalgebras and a unified braid condition – quantum Yang-Baxter equation. Finally, we will see how poetry has accompanied the development / history of the Yang–Baxter equation.

In this paper, we investigate the recurrence properties of the generalized Tribonacci sequence and present how the generalized Tribonacci sequence at negative indices can be expressed by the sequence itself at positive indices.

Natural circulation loop (NCL) systems are buoyancy-driven heat exchangers that are used in various industrial applications. The concept of passive heat exchange in NCL systems is attractive, because there is no need for an externally driven equipment (e.g., a pump) to maintain the fluid circulation. However, relying on buoyancy as the sole driving force may lead to several potential difficulties, one of which is generation of (possibly) time-varying nonlinearities in the dynamical system, where a difference in the time scales of heat transfer and fluid flow causes the flow to change from a steady-state regime to either an oscillatory regime or a flow-reversal regime, both of which are undesirable. In this paper, tools of symbolic time series analysis (e.g., probabilistic finite state automata (PFSA)) are proposed to identify selected regimes of operation in NCL systems, where the underlying principle is built upon the concept of pattern classification from measurements of fluid-flow dynamics. The proposed method is shown to be capable of identifying the current regime of operation from the initial time response under a given set of operational parameters. The efficacy of regime classification is demonstrated by testing on two data sets, generated from numerical simulation of a MATLAB SimuLink model that has previously been validated with experimental data. The results of the proposed PFSA-based classification are compared with those of a hidden Markov model (HMM) that serves as the baseline.

Software is playing the most important role in recent vehicle innovation, and consequently the amount of software has been rapidly growing last decades. Safety-critical nature of ships, one sort of vehicles, makes Software Quality Assurance (SQA) has gotten to be a fundamental prerequisite. Just-In-Time Software Defect Prediction (JIT-SDP) aims to conduct software defect prediction (SDP) on commit-level code changes to achieve effective SQA resource allocation. The first case study of SDP in maritime domain reported feasible prediction performance. However, we still consider that the prediction model has still rooms for improvement since the parameters of the model are not optimized yet. Harmony Search (HS) is a widely used music-inspired meta-heuristic optimization algorithm. In this article, we demonstrated that JIT-SDP can produce the better performance of prediction by applying HS-based parameter optimization with balanced fitness value. Using two real-world datasets from the maritime software project, we obtained an optimized model that meets the performance criterion beyond baseline of previous case study throughout various defect to non-defect class imbalance ratio of datasets. Experiments with open source software also showed better recall for all datasets despite we considered balance as performance index. HS-based parameter optimized JIT-SDP can be applied to the maritime domain software with high class imbalance ratio. Finally, we expect that our research can be extended to improve performance of JIT-SDP not only in maritime domain software but also in open source software.

Nowadays, speed up development and use of digital devices such as smartphones have put people at risk of internet crimes. The evidence of present crimes in a computer file can be easily unreachable by changing the prefix of a file or other algorithms. In more complex cases, either file divided into different parts or the parts of a file that has information about the file type are deleted, where the file fragment recognition issue is discussed. The known files are divided into different fragments, and different classification algorithms to solve the problems of file fragment recognition. A confusion matrix measures the accuracy of type recognition. In the present study, first, the file is divided into different fragments. Then, the file fragment features, which are obtained from Binary Frequency Distribution (BFD), are reduced by 2 feature reduction algorithms; Sequential Forward Selection algorithm (SFS) as well as Sequential Floating Forward Selection algorithm (SFFS) to delete sparse features that result in increased accuracy and speed. Finally, the reduced features are given to 3 classifier algorithms, Multilayer Perceptron (MLP), Support Vector Machines (SVM), and K-Nearest Neighbor (KNN) for classification and comparison of the results. In this paper, we proposed the algorithm of file type recognition that can recognize 6 types of useful files ( pdf, txt, jpg, doc, html, exe), which may distinguish a type of file fragments with higher accuracy than the similar works done.

We are concerned with the use of some classical spectral collocation methods as well as with the new software system Chebfun in order to compute high order (index) eigenpairs of singular as well as regular Schrodinger eigenproblems. We want to highlight both the qualities as well as the shortcomings of these methods and evaluate them vis-a-vis the usual ones. In order to resolve a boundary singularity we use Chebfun with the simple domain truncation technique. Although this method is equally easy to apply with spectral collocation, things are more nuanced in the case of these methods. A special technique to introduce boundary conditions as well as a coordinate transform which maps an unbounded domain to a nite one are the ingredients. A challenging set of "hard" benchmark problems, for which usual numerical methods (f. d., f. e. m., shooting etc.) fail, are analysed. In order to separate "good"and "bad"eigenvalues we estimate the drift of the set of eigenvalues of interest with respect to the order of approximation and/or scaling of domain parameter. It automatically provides us with a measure of the error within which the eigenvalues are computed and a hint on numerical stability. We pay a particular attention to problems with almost multiple eigenvalues as well as for problems with a mixed (continuous) spectrum. In the latter case we try to numerically highlight its existence. Special attention will be paid to the higher eigenpairs (the pair of eigenvalue and the corresponding eigenfunction approximated by an eigenvector spanning its nodal values).

We derive new infinite series involving Fibonacci numbers and Riemann zeta numbers. The calculations are facilitated by evaluating linear combinations of polygamma functions of the same order at certain arguments.

In this paper, we present a relapse based demonstrating way to deal with investigate various arrangement MTC information. A commonplace use of this displaying approach incorporates three stages: first, define a model that approximates the connection between quality articulation and trial factors, with boundaries consolidated to address the exploration premium; second, utilize least-squares and assessing condition methods to gauge boundaries and their relating standard blunders; third, register test insights, P-qualities and NFD as proportions of factual criticalness. The benefits of this methodology are as per the following. To begin with, it tends to the exploration interest in a particular, precise way, and maximally uses all the information and other important data. Second, it represents both orderly and irregular varieties related with the information, and the consequences of such examination give not just quality explicit data applicable to the exploration objective, yet additionally its dependability, in this way helping agents to settle on better choices for subsequent investigations. Third, this methodology is truly adaptable, and can undoubtedly be stretched out to different sorts of MTC considers or other microarray explores by detailing various models dependent on the test plan of the investigations.

In this article, author performs computational analysis for the generalized zeta functions by using computational software Mathematica. To achieve the purpose recently obtained difference equations are used. These difference equations have a computational power to compute these functions accurately while they can not be computed by using their known integral represenations. Several authors investigated such functions and their analytic properties, but no work has been reported to study the graphical representations and zeors of these functions. Author performs numerical computations to evaluate these functions for different values of the involved parameters. Taylor series expansions are also presented in this research.

We consider a multitude of topics in mathematics where unification constructions play an important role: the Yang–Baxter equation and its modified version, Euler’s formula for dual numbers, means and their inequalities, topics in differential geometry, etc. It is interesting to observe that the idea of unification (unity and union) is also present in poetry. Moreover, Euler’s identity is a source of inspiration for the post-modern poets.

In this article, the Legendre-Gould Hopper polynomials are combined with Sheffer sequences to introduce certain mixed type special polynomials. Generating functions, differential equations and certain other properties of Legendre-Gould Hopper based Sheffer polynomials are derived. Further, operational and integral representations providing connections between these polynomials and known special polynomials are established. Certain identities and results for some members of these new mixed polynomials are also obtained. Finally, the determinantal definitions of Legendre-Gould Hopper based Sheffer polynomials are also given.

In this paper, Lyapunov-Razumikhin technique, design of state-dependent switching laws, a fixed point theorem and variational methods are employed to derive the existence and the unique existence results of (globally) exponentially stable positive stationary solution of delayed reaction-diffusion cell neural networks under Dirichlet zero boundary value, including the global stability criteria \textbf{in the classical meaning}. Next, sufficient conditions are proposed to guarantee the global stability invariance of ordinary differential systems under the influence of diffusions. New theorems show that the diffusion is a double-edged sword in judging the stability of diffusion systems. Besides, an example is constructed to illuminate that any non-zero constant equilibrium point must be not in the phase plane of dynamic system under Dirichlet zero boundary value, or it must lead to a contradiction. Next, under Lipschitz assumptions on active function, another example is designed to prove that the small diffusion effect will cause the essential change of the phase plane structure of the dynamic behavior of the delayed neural networks via a Saddle point theorem. Finally, a numerical example illustrates the feasibility of the proposed methods.

In this paper, we introduce a new type of degenerate poly-Fubini polynomials and numbers, are called degenerate poly-Fubini polynomials and numbers, by using the degenerate polylogarithm function and derive several properties on the degenerate poly-Fubini polynomials and numbers. In the last section, we also consider the degenerate unipoly-Fubini polynomials attached to an arithmetic function, by using the degenerate polylogarithm function and investigate some identities of those polynomials. In particular, we give some new explicit expressions and identities of degenerate unipoly polynomials related to special numbers and polynomials.

Motivation by the definition of the type 2 poly-Bernoulli polynomials introduced by Kim-Kim [9], in the present paper, we consider a new class of new generating function for the Fubini polynomials, called the type 2 poly-Fubini polynomials by means of the polyexponential function. Then, we derive some useful relations and properties. We show that the type 2 poly-Fubini polynomials equal a linear combination of the classical of the Fubini polynomials and Stirling numbers of the first kind. In a special case, we give a relation between the type 2 poly-Fubini polynomials and Bernoulli polynomials of order r. Moreover, inspired by the definition of the unipoly-Bernoulli polynomials introduced by Kim-Kim [9]. We introduce the type 2 unipoly-Fubini polynomials by means of unipoly function and give multifarious properties including derivative and integral properties. Furthermore, we provide a correlation between the unipoly-Fubini polynomials and the classical Fubini polynomials.

In this paper, we construct the degenerate poly-Fubini polynomials, called the type 2 degenerate poly-Fubini polynomials, by using the modified degenerate polyexponential function and derive several properties on the degenerate poly-Fubini polynomials and numbers. In the last section, we introduce type 2 degenerate unipoly- Fubini polynomials attached to an arithmetic function, by using the modified degenerate polyexponential function and investigate some identities for those polynomials. Furthermore, we give some new explicit expressions and identities of degenerate unipoly polynomials related to special numbers and polynomials.

The $k$-means problem is to compute a set of $k$ centers (points) that minimizes the sum of squared distances to a given set of $n$ points in a metric space. Arguably, the most common algorithm to solve it is $k$-means++ which is easy to implement, and provides a provably small approximation factor in time that is linear in $n$. We generalize $k$-means++ to support: (i) non-metric spaces and any pseudo-distance function. In particular, it supports M-estimators functions that handle outliers, e.g. where the distance $\mathrm{dist}(p,x)$ between a pair of points is replaced by $\min {\mathrm{dist}(p,x),1}$. (ii) $k$-means clustering with $m\geq 1$ outliers, i.e., where the $m$ farthest points from the $k$ centers are excluded from the total sum of distances. This is the first algorithm whose running time is linear in $n$ and polynomial in $k$ and $m$.

Susceptible, infective, recovered, and hospitalized/isolated individuals are placed on the cells of a nxn square lattice, where each cell is occupied by a single individual or is vacant. At discrete time units (typically one day each) all susceptibles and infectives execute a random movement and when a coincidence of the two types occurs the susceptible is converted to infective status according to some probability. Infectives are labelled by the number of days since originally infected. At each time increment the age label of the infectives is increased by one unit. When the label reaches a number like 15 or 20 days the susceptibles recover with some probability or become isolated/hospitalized. Upon reaching some age the latter types either recover or die. Probabilities for the movements and conversions from one status to another are implemented by random numbergeneration. Simulations were carried out to investigate the effect of several probability and age parameters, the size of population (proportional to nxn) and density (related to fraction of occupied cells), and the size of the movements. Mid-term gradual conversion of susceptibles to isolated was explored as intervention policy.

This paper aims to introduce the notions of various types of Qc-contractions for which we establish some fixed circle and fixed disc theorems in the setting of metric spaces. Some illustrative examples are also provided to support our results. Moreover, we present some fixed circle and fixed disc results of integral type contractive self-mappings.

In this paper, we proposed the numerical method called the variational iteration orthogonal collocation method (VIOCM), for the approximate solution of the deadly Corona virus model using Mamadu-Njoseh polynomials as basis functions. The proposed method is an elegant mixture of the variational iteration method (VIM) and the orthogonal collocation method (OCM). It was observed that the proposed method converges rapidly to the exact solution even as N increases. This suggests that the use of orthogonal polynomials as trial functions for the SEIR model is indeed an effective approximant as it produces the analytic solution at just few iterations. Resulting numerical evidences were compared with the standard variational iteration method as available in literature. All computational frameworks were executed with MAPLE software.

Kronecker products of matrices have some striking operation properties, one of which is called the mixed-product property $(A \!\otimes\! B)(C \!\otimes\! D) = AC \!\otimes\! BD$. In view of this property, the two-term Kronecker product $A_1 \otimes A_2$ can be rewritten as $A_1 \otimes A_2 = (A_1 \otimes I_{m_2})(I_{m_1} \otimes A_2)$ of dilation forms of $A_1$ and $A_2$, and three-term Kronecker product $A_1 \otimes A_2 \otimes A_3$ can be rewritten as the products $A_1 \otimes A_2 \otimes A_3 = (A_1\otimes I_{m_2} \otimes I_{m_3})(I_{m_1} \otimes A_2 \otimes I_{m_3})(I_{m_1} \otimes I_{m_2} \otimes A_3)$ of the dilation forms of $A_1$, $A_2$, and $A_3$, respectively, where the matrices on the right-hand sides of the two factorizations are commutative. In this note, we approach the commutative Kronecker products on the right-hand sides of the two factorization equalities, and present a variety of new and useful analytical formulas for calculating the ranks, dimensions, orthogonal projectors, and ranges of matrices composed of these Kronecker products.

A simplified nonlinear dispersive system of BBM-type, initially derived by D. Mitsotakis, is employed here in order to model the generation and propagation of surface water waves over variable bottom. The simplification consists in applying the so-called Boussinesq approximation. Using the finite element method and the FreeFem++ software, we solve numerically this system for three different complexities for the bathymetry function: a flat bottom case, a variable bottom in space, and a variable bottom both in space and in time. The last case is illustrated with the Java 2006 tsunami event. This article is designed rather as a tutorial paper even if it contains the description of completely new adaptation techniques.

In this four-month-long study (from April 1, 2020 to August 1, 2020), we have collected, modeled, and analyzed COVID-19 data from the top five most infected counties per top six most infected states in the United States (30 counties total). More specifically, we collected data on each state’s total COVID-19 cases, deaths, tests conducted, and their counties’ population, density, percentage of seniors, number of hospitals, total COVID-19 cases, and total COVID-19 related deaths. In this study, we have models illustrating the growth of COVID-19 cases and deaths per county, growth of COVID-19 cases and deaths per state (which is really the sum of our chosen five counties), and growth of COVID-19 tests conducted per state. In addition, our study also contains models illustrating the statistics of several variables that might have affected a county’s COVID-19 data, which has been mentioned above: population, density, percentage of seniors, and number of hospitals. An interesting finding we have noticed upon modeling the 30 counties’ density and total COVID-19 cases as an xy scatter plot is that there is a considerably strong relationship between the two variables. Los Angeles County (which was an extreme outlier), in particular, supports the idea that a county’s most populous city can greatly affect its entire county’s COVID-19 cases; if the largest city is extremely dense, it appears that the entire county has a greater total COVID-19 case count.

Scattering hyperspectral technology is a nondestructive testing method with many advantages. Here, we propose a method to improve the accuracy of egg freshness, research the influence of incident angles of light source on the accuracy and explain its mechanism. A variety of weak classifiers classify eggs based on the spectra after preprocessing and feature wavelength extraction to obtain three classifiers with the highest accuracy. The three classifiers are used as metamodels of stacking ensemble learning to improve the highest accuracy from 96.25% to 100%. Moreover, the highest accuracy of scattering, reflection, transmission and mixed hyperspectral of eggs are 100.00%, 88.75%, 95.00% and 96.25%, respectively, indicating that the scattering hyperspectral for egg freshness detection is better than that of the others. In addition, the accuracy is inversely proportional to the angle of incidence due that the smaller the incident angle, the camera collects a larger proportion of scattering light, which contains more biochemical parameters of an egg than that of reflection and transmission. These results are very important for improving the accuracy of non-destructive testing and selecting the incident angle of the light source, and have potential applications in online non-destructive testing.

By unraveling a persistent misconception in the zeta Hadamard product expansion, and employing the zeta functional equation, a concise proof of the Riemann Hypothesis is presented, which conclusively demonstrate that the Riemann Hypothesis is true.

This document focuses attention on the fundamental solution of an autonomous linear retarded functional differential equation (RFDE) along with its supporting cast of actors: kernel matrix, characteristic matrix, resolvent matrix, and the Laplace transform. The fundamental solution is presented in a form of the convolutional powers of the kernel matrix in the manner of a convolutional exponential matrix function. The fundamental solution combined with a solution representation gives an exact expression in explicit form for the solution of a RFDE. Algebraic graph theory is applied to the RFDE in the form of a weighted loop-digraph to illuminate the system structure and system dynamics and to identify the strong and weak components. Examples are provided in the document to elucidate the behavior of the fundamental solution. The paper introduces fundamental solutions of other functional differential equations.

Motivated by Kim-Kim [19] introduced the new type of degenerate poly- Bernoulli polynomials by means of the degenerate polylogarithm function. In this paper, we define the degenerate poly-Frobenius-Euler polynomials, called the new type of degenerate poly-Frobenius-Euler polynomials, by means of the degenerate polylogarithm function. Then, we derive explicit expressions and some identities of those numbers and polynomials.

This work is intended to lead a study of necessary and sufficient optimality conditions for scalar optimization problems on Hadamard manifolds. In the context of this geometry, we obtain and present new function types characterized by the property of having all their second-order stationary points to be global minimums. In order to do so, we extend the concept convexity in Euclidean space to a more general notion of invexity on Hadamard manifolds. This is done employing notions of second-order directional derivative, second-order pseudoinvexity functions and the second-order Karush-Kuhn-Tucker-pseudoinvexity problem. Thus, we prove that every second-order stationary point is a global minimum if and only if the problem is either second-order pseudoinvex or second-order KKT-pseudoinvex depending on whether the problem regards unconstrained or constrained scalar optimization respectively. This result has not been presented in the literature before. Finally, examples of these new characterizations are provided in the context of \textit{"Higgs Boson like"} potentials among others.

The last series of Raven's standard progressive matrices (SPM-LS) test were studied with respect to its psychometric properties in a series of recent papers. In this paper, the SPM-LS dataset is analyzed with regularized latent class models (RLCM). For dichotomous item response data, an alternative estimation approach for RLCMs is proposed. For polytomous item responses, different alternatives for performing regularized latent class analysis are proposed. The usefulness of the proposed methods is demonstrated in a simulated data illustration and for the SPM-LS dataset. For the SPM-LS dataset, it turned out the regularized latent class model resulted in five partially ordered latent classes.

This paper reviews the unilateral and bilateral, one- and two-dimensional Laplace transforms. The unilateral and bilateral Laplace transforms are compared in the one-dimensional case, leading to the formulation of the initial-condition theorem. This problem is solved with all generality in the one- and two-dimensional cases with the bilateral Laplace transform. General two-dimensional linear systems are introduced and the corresponding transfer function defined.

Kim-Kim [20] studied the type 2 degenerate poly-Bernoulli numbers and polynomials by using modified degenerate polylogarithm function. In this paper, we construct the new type of degenerate poly-Cauchy polynomials and numbers of the second kind, called the new type of degenerate poly-Cauchy polynomials and numbers of the second kind by using degenerate polylogarithm function and derive several properties on the degenerate poly-Cauchy polynomials and numbers of the second kind. Furthermore, we consider the degenerate unipoly-Cauchy polynomials of the second kind and discuss some properties of them.

Has anyone ever missed an event because he was confused in days and dates? Do we remember the date of any day without looking at a calendar? Is the current Gregorian Calendar efficient enough for use, and does it facilitate our life or make it more complicated? Have you ever thought about a much simpler way to calculate days and dates in a year? All these questions are answered in this paper, in which the author proposes original optimization algorithm that creates optimal perennial calendars. Results show that there is more than one way to create a perennial calendar, in which the number of days in each month does not change, neither the dates. Hence, all months have the same sequence of days and dates. In other meaning, Monday becomes the first day of every month, and Sunday becomes the last day. Consequently, the calendars become much easier to memorize and very simple to predict the days and dates in any year.

In tracking-by-detection paradigm for multi-target tracking, target association is modeled as an optimization problem that is usually solved through network flow formulation. In this paper, we proposed combinatorial optimization formulation and used a bipartite graph matching for associating the targets in the consecutive frames. Usually, the target of interest is represented in a bounding box and track the whole box as a single entity. However, in the case of humans, the body goes through complex articulation and occlusion that severely deteriorate the tracking performance. To partially tackle the problem of occlusion, we argue that tracking the rigid body organ could lead to better tracking performance compared to the whole body tracking. Based on this assumption, we generated the target hypothesis of only the spatial locations of person’s heads in every frame. After the localization of head location, a constant velocity motion model is used for the temporal evolution of the targets in the visual scene. Qualitative results are evaluated on four challenging video surveillance dataset and promising results has been achieved.

The angular diameter is the angle subtended by a generic object – an apple or a star – to the eye of an observer, and it describes how large the object appears from a given viewpoint. The angular diameter represents a powerful tool for distance calculations starting from a directly measurable information and it finds application in several contexts varying from cosmography to architecture. In this article, the author proposes a novel equation to calculate the apparent diameter of whatever object. This equation defines the relationship between the object’s apparent diameter with respect to the travelled distance starting from the initial distance R₀ at which the observed object is located. Based on the preliminary tests conducted, the model seems to faithfully portray this relation with respect to measured values, also at the astronomical scale, thus considering the Earth-Moon distance, where, the absolute error detected is about 0.56%. Tests highlight also a dependency between the results accuracy and the measurement conditions suggesting a high level of sensibility linked to the initial magnification effect produced by the retina or the artificial lens employed.

This note reconsiders a matrix equality $A_1A_2^{-}A_3A_4^{-}A_5 = A$ composed by six matrices of appropriate sizes, where $A_2^{-}$ and $A_4^{-}$ are generalized inverses of $A_2$ and $A_4$, respectively, and solves a selection of matrix set inclusion problems associated with various mixed reverse order laws for generalized inverses of products of two, three, and four matrices by means of this equality and its variations.

One of essential procedure nowadays to analyze a dynamic process in Science and Engineering is Computational modeling. Most of dynamic processes are distributed parameter systems, i.e., systems with state variables depend on the number of independent variables (such as space and time) which are expressed by a set of Partial Differential Equations (PDEs). Lateral method of lines is a method which used for solving PDEs numerically by solving a set of boundary value problems sequentially. The aim is to report the development of PDE toolbox based on SCILAB. This paper provides users with a method that is very easy to understand in the applications related to dynamic process. The method uses a SCILAB template to develop numerical simulations in the new field. In this paper, a model of tropical fruit heat treatment for decimating insect is presented. The illustration will be given to show how the lateral method of line template works to solve the problem.

The comparison of group means in item response models constitutes an important issue in empirical research. The present article discusses an extension of Haebara linking by proposing a flexible class of robust linking functions for comparisons of many groups. These robust linking functions are particularly suited to item response data that are generated under partial invariance. In a simulation study, it is shown that the newly proposed robust Haebara linking approach outperforms existing approaches of Haebara linking. In an empirical application using PISA data, it is illustrated that country means can be sensitive to the choice of linking functions.

The comparison of group means in latent variable models plays a vital role in empirical research in the social sciences. The present article discusses extensions of invariance alignment and Haberman linking concerning the choice of linking functions for comparisons of many groups. Robust linking functions are proposed for invariance alignment and robust Haberman linking that are particularly suited to item response data under partial invariance. In a simulation study, it is shown that both linking approaches have comparable performance, and in some conditions, the newly proposed robust Haberman linking outperforms invariance alignment.

This study developed a system dynamics model to understand the spread of coronavirus disease (COVID-19) in Japan. The model is built on the generic SEIR (Susceptible, Exposed, Infected, and Recovered) framework adopted by Ghaffarzadegan and Rahmandad (2020) to build a system dynamics model for the spread of COVID-19 in Iran. Japan seems to be successful in containing the spread compared with other countries, and its first peak has passed. However, because this also leaves a large population still susceptible to the virus, it could cause a second and potentially higher peak of infection after the state of emergency aimed at reducing contact rate is lifted. As the government has proposed the “New Lifestyle,” it is critical to behave cautiously so as not to be infected. While the model focuses on the SEIR structure, the reflection of other sub-structures such as economy and hospital capacity that have tradeoffs with reducing contact rate should be beneficial. However, before extending the model, it is also critical to conduct estimates using confidence intervals rather than point estimates to better reflect uncertainties.

Through the half-unit circle area computation using the integration of the corresponding curve power series representation, we deduce a slow converging positive infinite series to $\pi$. However, by studying the remainder of that series we establish sufficiently close inequalities with equivalent lower and upper bound terms allowing us to estimate, more precisely, how the series approaches $\pi$. We use the obtained inequalities to compute up to four-digit denominator, what are in this sense, the best rational numbers that can replace $\pi$. It turns out that the well-known convergents of the continued fraction of $\pi$, $22/7$ and $355/113$ called, respectively, Yuel\"{u} and Mil\"{u} in China are the only ones found. Thus we apply a similar process to find rational estimations to $\pi+e$ where $e$ is taken as the power series of the exponential function evaluated at $1$. For rational numbers with denominators less than $2000$, the convergent $920/157$ of the continued fraction of $\pi+e$ turns out to be the only rational number of this type.

Multi-objective optimization (MOO) is the subset of optimization which deals with minimization of several objective functions more than the conventional one objective optimization. These have useful application in decision making. Many of the current methodologies addresses challenges and solutions to multi-objective optimization problem which attempt to simultaneously solve several objectives with multiple constraints subjoined to each objective. Such as evolutionary algorithm, genetic algorithm, flower pollination algorithm, and many more. However, most challenges in MOO are generally subjected to linear inequality constraints that prevent all objectives from being optimized at once. This paper discusses some approaches presented by scholars in MOO and then presents some new concepts by introducing methods in solving problem in MOO which comes due to periodical objectives that do not stay for the entire duration of process life time unlike permanent objectives which are optimized once for the entire process life time. A methodology based on partial optimization which optimizes each objective iteratively and weight convergence method which optimizes sub-group of objectives is given. Furthermore, another methods is introduced which involve objective classification ranking, estimation and prediction where objectives are classified base on their properties, and rank using a given criteria and in addition estimated for its optimal weight point if it certifies a coveted optimal weight point. Then finally predicted to find how much it deviates from the estimated point.

The prevalence of differential equations as a mathematical technique has refined the fields of control theory and constrained optimization due to the newfound ability to accurately model chaotic, unbalanced systems. However, in recent research, systems are increasingly more nonlinear and difficult to model using Differential Equations only. Thus, a newer technique is to use policy iteration and Reinforcement Learning, techniques that center around an action and reward sequence for a controller. Reinforcement Learning (RL) can be applied to control theory problems since a system can robustly apply RL in a dynamic environment such as the cartpole system (an inverted pendulum). This solution successfully avoids use of PID or other dynamics optimization systems, in favor of a more robust, reward-based control mechanism. This paper applies RL and Q-Learning to the classic cartpole problem, while also discussing the mathematical background and differential equations which are used to model the aforementioned system.

In this research work, we present a mathematical model for novel coronavirus -19 (NCOVID-19) which is consisted on three different compartments susceptible, infected and recovered classes abbreviated as under convex incident rate involving and emigration rate. We first derive the formulation of the model. Also, we give some qualitative aspects for the model including existence of equilibriums and its stability results by using various tools of nonlinear analysis. Then by mean of nonstandard finite difference scheme (NSFD), we simulate the results against the data of Wuhan city for the sixty days. By means of simulation, we show how protection, exposure, emigration, death and cure rates affect the susceptible, infected and recovered population with the passage of time involving emigration. On the basis of simulation, we observe the dynamical behavior due to emigration of susceptible and infected classes or one of these two.

We applied a generalized SEIR epidemiological model to the recent SARS-CoV-2 outbreak in the world, with a focus on Italy and its Lombardia, Piemonte, and Veneto regions. We focus on the application of a stochastic approach in fitting the model numerous parameters using a Particle Swarm Optimization (PSO) solver, to improve the reliability of predictions in the medium term (30 days). We analyze the official data and the predicted evolution of the epidemic in the Italian regions, and we compare the results with data and predictions of Spain and South Korea. We link the model equations to the changes in people’s mobility, with reference to Google’s COVID-19 Community Mobility Reports. We discuss the effectiveness of policies taken by different regions and countries and how they have an impact on past and future infection scenarios.

Let f : V → V be a Cohomological Expanding Mapping¹ of a smooth complex compact homogeneous manifold with $ dim_{\mathbb{C}}(\Vc)=k \ge 1$ and Kodaira Dimension $\leq 0$. We study the dynamics of such mapping from a probabilistic point of view, that is, we describe the asymptotic behavior of the orbit $ O_{h} (x) = \{h^{n} (x), n \in \mathbb{N} \quad \mbox{or}\quad \mathbb{Z}\}$ of a generic point. Using pluripotential methods, we have constructed in our previous paper \cite{Armand4} a natural invariant canonical probability measure of maximal Cohomological Entropy $ \nu_{h} $ such that ${\chi_{2l}^{-m}} (h^m)^\ast \Omega \to \nu_h \qquad \mbox{as} \quad m\to\infty$ for each smooth probability measure $\Omega $ in $\Vc$ . We have also studied the main stochastic properties of $ \nu_{h}$ and have shown that $ \nu_{h}$ is a smooth equilibrium measure , ergodic, mixing, K-mixing, exponential-mixing. In this paper we are interested on equidistribution problems and we show in particular that $ \nu_{h}$ reflects a property of equidistribution of periodic points by setting out the Third and Fourth Main Results in our study. Finally we conjecture that $$\nu_h:=T_l^+ \wedge T_{k-l}^-,$$ $$\dim_\HH(\nu_h)= \Psi h_{\chi}(h) , $$ $$\dim_\HH( \mbox{Supp} T_l^+) \geq 2(k-l) + \frac{\log \chi_{2l}}{\psi_l},$$ $$|\langle \nu_m^x-\nu_h,\zeta\rangle|\leq M \Big[1+\log^+{1\over D(x,\Tc)}\Big]^{\beta/2}\|\zeta\|_{\Cc^\beta} \gamma^{-\beta m/2}$$ and $$|\langle \nu_m^x-\nu_h,\zeta\rangle|\leq M \Big[1 +\log^+{1\over D(x,E_\gamma)}\Big]^{\beta/2}\|\zeta\|_{\Cc^\beta} \gamma^{-\beta m/2}.$$

In this paper, inspired by Jleli and Samet [journal of inequalities and applications 38 (2014) 2 1–8] we introduce two new classes of auxiliary functions and utilize the same to define (q, y)R-weak 3 contractions. Utilizing (q, y)R-weak contractions, we prove some fixed point theorems in the setting 4 of relational metric spaces. We employ some examples to substantiate the utility of our newly proved 5 results. Finally, we apply one of our newly proved results to ensure the existence and uniqueness of 6 solution of a Volterra-type integral equation.