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.

One of the typical forms of linear matrix expressions (linear matrix-valued functions) is given by $A + B_1X_1C_1 + \cdots + B_kX_kC_k$, where $X_1, \ldots, X_k$ are independent variable matrices of appropriate sizes, which include almost all matrices with unknown entries as its special cases. The domain of the matrix expression is defined to be all possible values of the matrix expressions with respect to $X_1, \ldots, X_k$. I this article, we approach some problems on the relationships between the domains of two linear matrix expressions by means of the block matrix method (BMM), the matrix rank method (MRM), and the matrix equation method (MEM). As application, we discuss some topics on the relationships among general solutions of some linear matrix equations and their reduced equations.

The aims of this paper are twofold. First, it is shown, for the first time, which types of nonsmooth functions are characterized by all vector critical points as being efficient or weakly efficient solutions of vector optimization problems in constrained and unconstrained scenarios on Hadamard manifolds. This implies the need to extend different concepts, such as the Karush--Kuhn--Tucker vector critical points and generalized invexity functions, to Hadamard manifolds. The relationships between these quantities are clarified through a great number of explanatory examples. Second, we present an economic application proving that Nash's critical and equilibrium points coincide in the case of invex payoff functions.

Let $f:V\rightarrow V $ be a Cohomological Expanding Mapping¹ of a smooth complex compact homogeneous manifold with dim_C(V) = k ≥ 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_{f} (x) = \{f^{n} (x), n \in \mathbb{N} \quad \mbox{or}\quad \mathbb{Z}\}$ of a generic point. Using pluripotential methods, we construct a natural invariant canonical probability measure of maximum Cohomological Entropy $ \mu_{f} $ such that ${\chi_{2l}^{-m}} (f^m)^\ast \Omega \to \mu_f \qquad \mbox{as} \quad m\to\infty$ for each smooth probability measure $\Omega $ on V . Then we study the main stochastic properties of $ \mu_{f}$ and show that $ \mu_{f}$ is a measure of equilibrium, smooth, ergodic, mixing, K-mixing, exponential-mixing and the unique measure with maximum Cohomological Entropy. We also conjectured that $\mu_f:=T_l^+ \wedge T_{k-l}^-$, $\dim_\H(\mu_f)= \Psi h_{\chi}(f) $ and $\dim_\H( \mbox{Supp} T_l^+) \geq 2(k-l) + \frac{\log \chi_{2l}}{\psi_l}.$

Reverse order laws for generalized inverses of matrix products is a classic object of study in the theory of generalized inverses. One of the well-known reverse order laws for a matrix product $AB$ is $(AB)^{(i,\ldots,j)} = B^{(s_2,\ldots,t_2)}A^{(s_1,\ldots,t_1)}$, where $(\cdot)^{(i,\ldots,j)}$ denotes an $\{i,\ldots, j\}$-generalized inverse of matrix. Because $\{i,\ldots, j\}$-generalized inverse of a singular matrix is unique, the relationships between both sides of the reverse order law can be divided into four situations for consideration. This paper provides a thorough coverage of the reverse order laws for $\{i,\ldots, j\}$-generalized inverses of $AB$, from the development of background and preliminary tools to the collection of miscellaneous formulas and facts on the reverse order laws in one place with cogent introduction and references for further study. We begin with the introduction of a linear mixed model $y = AB\beta + A\gamma + \epsilon$ and the presentation of two least-squares methodologies to estimate the fixed parameter vector $\beta$ in the model, and the description of connections between the two types of least-squares estimators and the reverse order laws for generalized inverses of $AB$. We then prepare some valued matrix analysis tools, including a general theory on linear or nonlinear matrix identities, a group of expansion formulas for calculating ranks of block matrices, two groups of explicit formulas for calculating the maximum and minimum ranks of $B^{(s_2,\ldots,t_2)}A^{(s_1,\ldots,t_1)}$, as well as necessary and sufficient conditions for $B^{(s_2,\ldots,t_2)}A^{(s_1,\ldots,t_1)}$ to be invariant with respect to the choice of $B^{(s_2,\ldots,t_2)}A^{(s_1,\ldots,t_1)}$. We then present a unified approach to the 512 matrix set inclusion problems associated with the above reverse order laws for the eight commonly-used types of generalized inverses of $A$, $B$, and $AB$ through use of the definitions of generalized inverses, the block matrix method (BMM), the matrix rank method (MRM), the matrix equation method (MEM), and various algebraic calculations of matrices.

The purpose of this paper is to prove strong convergent theorems for Browder's type iterations and Halpern's type iterations of a family of nonexpansive mappings in a complete geodesic space with curvature bounded above by a positive number. Moudafi's viscosity type methods are also discussed without the nice projection property.

In this paper, by using the q-integer, we introduce a new generalization of Fibonacci and Lucas sedenions called q-Fibonacci and q-Lucas sedenions. We present some fundamental properties of these type of sedenions such as Binet formulas, exponential generating fuctions, summation formulas, Catalan's identity, Cassini's identity and d'Ocagne's identity.

Interval-valued functions have been widely used to accommodate data inexactness in optimization and decision theory. In this paper, we study interval-valued vector optimization problems, and derive their relationships to interval variational inequality problems, of both Stampacchia and Minty types. Using the concept of interval approximate convexity, we establish necessary and sufficient optimality conditions for local strong quasi and approximate $LU$-efficient solutions to nonsmooth optimization problems with interval-valued multiobjective functions.

This paper focuses on quantifying the uncertainty in the specific absorption rate values of brain induced by the uncertain positions of the electroencephalography electrodes placed on patient's scalp. To avoid running a large number of simulations, an artificial neural network architecture for uncertainty quantification involving high-dimensional data is proposed in this paper. The proposed method is demonstrated to be an attractive alternative to conventional uncertainty quantification methods because of its considerable advantage in the computational expense and speed.

The aim of this survey is to review some recent developements in devising efficient preconditioners for sequences of linear systems A x = b. Such a problem arise in many scientific applications, such as discretization of transient PDEs, solution of eigenvalue problems, (Inexact) Newton method applied to nonlinear systems, rational Krylov methods for computing a function of a matrix. Full purpose preconditioners such as the Incomplete Cholesky (IC) factorization or approximate inverses are aimed at clustering eigenvalues of the preconditioned matrices around one. In this paper we will analyze a number of techniques of updating a given IC preconditioner (which we denote as P0 in the sequel) by a low-rank matrix with the aim of further improving this clustering. The most popular low-rank strategies are aimed at removing the smallest eigenvalues (deflation) or at shifting them towards the middle of the spectrum. The low-rank correction is based on a (small) number of linearly independent vectors whose choice is crucial for the effectiveness of the approach. In many cases these vectors are approximations of eigenvectors corresponding to the smallest eigenvalues of the preconditioned matrix P0 A. We will also review some techniques to efficiently approximate these vectors when incorporated within a sequence of linear systems all possibly having constant (or slightly changing) coefficient matrices. Numerical results concerning sequences arising from discretization of linear/nonlinear PDEs and iterative solution of eigenvalue problems show that the performance of a given iterative solver can be very much enhanced by the use of low-rank updates.

In this note we construct explicit complex and real matrix representations for the generators of real Clifford algebra $C\ell_{p,q}$. The representation is based on Pauli matrices and has an elegant structure similar to the fractal geometry. We find two classes of representation, the normal representation and exceptional one. The normal representation is a large class of representation which can only be expanded into $4m+1$ dimension, but the exceptional representation can be expanded as generators of the next period. In the cases $p+q=4m$, the representation is unique in equivalent sense. These results are helpful for both theoretical analysis and practical calculation. The generators of Clifford algebra are the faithful basis of $p+q$ dimensional Minkowski space-time or Riemann space, and Clifford algebra converts the complicated relations in geometry into simple and concise algebraic operations, so the Riemann geometry expressed in Clifford algebra will be much simple and clear.

Ultra-wideband wavelength division multiplexed networks enable operators to use more effectively the bandwidth offered by a single fiber pair and thus make significant savings, both in operational and capital expenditures. The main objective of this study is to minimize optical node resources, such as transponders, multiplexers and wavelength selective switches, needed to provide and maintain high quality of network services, in ultra-wideband wavelength division multiplexed networks, at low cost. A model based on integer programming is proposed, which includes a detailed description of optical network nodal resources. The developed optimization tools are used to study the ultra-wideband wavelength division multiplexed network performance when compared with the traditional C-band wavelength division multiplexed networks. The analysis is carried out for realistic networks of different dimensions and traffic demand sets.

The properties of iterative splitting methods with serial versions have been analyzed since recent years, see [1] and [3]. We extend the iterative splitting methods to a class of parallel versions, which allow to reduce the computational time and keep the benet of the higher accuracy with each iterative step. Parallel splitting methods are nowadays important to solve large problems, which can be splitted in subproblems and computed independently with the dierent processors. We present a novel parallel iterative splitting method, which is based on the multi-splitting methods, see [2], [10] and [15]. Such a exibilisation with multisplitting methods allow to decompose large iterative splitting methods and recover the benet of their underlying waveform-relaxation (WR) methods. We discuss the convergence results of the parallel iterative splitting methods, while we could reformulate such an error to a summation of the individual WR methods. We discuss the numerical convergence of the serial and parallel iterative splitting methods and present dierent numerical applications to validate the benet of the parallel versions.

A novel mathematical model is developed to calculate the temperature distribution on the surface and bulk of a steel plate under the laser hardening process. The model starts with the basic heat equation then it is developed into a volumetric form and is connected to the various solid existing phases. The proposed model is based on three influencing parameters of the laser hardening process which are the velocity of the laser spot and irradiation time. The results are compared with the available experimental data reported in the literature. The volumetric model provides an assessment of temperature distribution in both the vertical and horizontal axis. Laser irradiation at sufficiently high fluence can be used to create a solid-state phase change on the surface. Primary calculations show that the temperature profile has a Gaussian distribution in horizontal x and y-axis and presents an exponentially decreasing in the horizontal and vertical depth directions.

In this paper, we study the dynamics of following system of nonlinear difference equations x_n+1 = x_n-1y_n - 1, y_n+1 = y_n-1z_n - 1, z_n+1 = z_n-1x_n - 1. Especially we investigate the periodicity, boundedness and stability of related system of difference equations.

Limnologists often adhere to a discretized view of waterbodies—they classify them, divide them into zones, promote discrete management targets, and use research tools, experimental designs, and statistical analyses focused on discretization. This approach to limnology has profoundly benefited the way we understand, manage, and communicate about waterbodies. But the research questions and the research tools in limnology are changing rapidly with consequences for the relevance of our current discretization schemes. Here, I examine how and why we discretize and argue that selectively rethinking the extent to which we must discretize gives us an exceptional chance to advance limnology in new ways.

Topology optimization is a pioneering design method that can provide various candidates with high mechanical properties. However, the high-resolution for the optimum structures is highly desired, normally in turn leading to computationally intractable puzzle, especially for the famous Solid Isotropic Material with Penalization (SIMP) method. In this paper, an efficient and high-resolution topology optimization method is proposed based on the Super-Resolution Convolutional Neural Network (SRCNN) technique in the framework of SIMP. The SRCNN includes four processes, i.e. refining, path extraction & representation, non-linear mapping, and reconstruction. The high computational efficiency is achieved by a pooling strategy, which can balance the number of finite element analysis (FEA) and the output mesh in optimization process. To further reduce the high computational cost of 3D topology optimization problems, a combined treatment method using 2D SRCNN is built as another speeding-up strategy. A number of typical examples justify that the high-resolution topology optimization method adopting SRCNN has excellent applicability and high efficiency for 2D and 3D problems with arbitrary boundary conditions, any design domain shape, and varied load.

This paper is a continuation of previous papers on unification theories publishes in AXIOMS. We present results about the (modified) Yang-Baxter equation, Euler’s formula, dual numbers, coalgebra structures, non-associative structures, differential geometry, and (mean) inequalities. We will also attempt to relate our discussion to some Brain Studies and Machine Learnig.

This work focuses on expressing the TSP with Time Windows (TSPTW for short) as a quadratic unconstrained binary optimization (QUBO) problem. The time windows impose time constraints that a feasible solution must satisfy. These take the form of inequality constraints, which are known to be particularly difficult to articulate within the QUBO framework. This is, we believe, the first time this major obstacle is overcome and the TSPTW is cast in the QUBO formulation. We have every reason to anticipate that this development will lead to the actual execution of small scale TSPTW instances on the D-Wave platform.

This article is devoted to Feller's diffusion equation which arises naturally in probabilities and physics (e.g. wave turbulence theory). If discretized naively, this equation may represent serious numerical difficulties since the diffusion coefficient is practically unbounded and most of its solutions are weakly divergent at the origin. In order to overcome these difficulties we reformulate this equation using some ideas from the Lagrangian fluid mechanics. This allows us to obtain a numerical scheme with a rather generous stability condition. Finally, the algorithm admits an elegant implementation and the corresponding Matlab code is provided with this article under an open source license.

A unified presentation of a class of Humbert’s polynomials in two variables which generalizes the well known class of Gegenbauer, Humbert, Legendre, Chebycheff, Pincherle, Horadam, Kinnsy, Horadam-Pethe, Djordjević , Gould, Milovanović and Djordjević, Pathan and Khan polynomials and many not so called ’named’ polynomials has inspired the present paper and the authors define here generalized Humbert-Hermite polynomials of two variables. Several expansions of Humbert- Hermite polynomials, Hermite-Gegenbaurer (or ultraspherical) polynomials and Hermite- Chebyshev polynomials are proved.

This study demonstrates a global, non-parametric, non-iterative optimization of time-mean value of a kind of index vibrated by time-varying forcing. It is based on the fact that the (steady) forced vibration of non-autonomous ordinary differential equation systems is well approximated by an analytical solution when the amplitude of forcing is sufficiently small and its base state without forcing is linearly stable and steady. It is applied to optimize a time-averaged heat-transfer rate on a two-dimensional thermal convection field in a square cavity with horizontal temperature difference, and the globally optimal way of vibrational forcing, i.e. the globally optimal, spatial distribution of vibrational heat and vorticity sources, is first obtained. The maximized vibrational thermal convection corresponds well to the state of internal gravity wave resonance. In contrast, the minimized thermal convection is weak, keeping the boundary layers on both sidewalls thick.

We introduce a total energy and environmental evaluation method in the manufacturing industry. The method gives us a series of descriptive indexes to assess the overall environmental effect level on materials, energy, wastes and products in the life cycle process. Meanwhile, the method uses partial indexes, environmental effect factors, and correction offsets into the quantitative model to analyze the learning process and rebound effect on the energy and environment at each procedure. In this work, we choose S-shaped learning curves to describe how to decrease energy consumption and improve the technical learning by doing for recent 30 years. Also, we draw the different rebound effect curves of the total energy-environmental evaluation with technical learning method, which use the annual industrial production growth rate to show that it's significant to estimate its effect on technology changes. The ideas about the interaction of energy and production environment from material flows to energy consumption, direct us to build an example to estimate quantitatively the results with different condition factors, and realize the process improvement and develop new products.

A modified free-wake vortex ring model is proposed to compute the dynamics of a floating horizontal-axis wind turbine. The model is divided into two parts. The near wake model uses a blade bound vortex model and trailed vortex model, which is developed based on vortex filament method. By contrast, the far wake model is based on the vortex ring method. The proposed model is a good compromise between accuracy and computational cost, for example when compared with more complex vortex methods. The present model is used to assess the influence of floating platform motions on the performance of a horizontal-axis wind turbine rotor. The results are validated on the 5MW NREL rotor and compared with other aerodynamic models for the same rotor subjected to different platform motions. It was found that the results from the proposed method are more reliable than the results from BEM theory especially at small angles of attack in the region of low wind speeds, on the one hand, and high wind speeds with blade pitch motions, on the other hand. And also the proposed method is less time consuming and has similar accuracy when comparing with more advanced vortex based methods.

Although most biological processes are characterized by a strong temporal asymmetry, several popular mathematical models neglect this issue. Maximum entropy methods provide a principled way of addressing time irreversibility, which leverages powerful results and ideas from the3literature of non-equilibrium statistical mechanics. This article provides a comprehensive overview of these issues, with a focus in the case of spike train statistics. We provide a detailed account of the5mathematical foundations and work out examples to illustrate the key concepts and results from non-equilibrium statistical mechanics

The aim of this paper is to obtain Karush-Kuhn-Tucker optimality conditions for weakly efficient solutions to vector equilibrium problems with the addition of constraints in the novel context of Hadamard manifolds as opposed to the classical examples of Banach, normed or Hausdorff spaces. More specifically, classical necessary and sufficient conditions for weakly efficient solutions to the constrained vector optimization problem are presented. As well as some examples. The results presented in this paper generalize results obtained by Gong (2008) and Wei and Gong (2010) and Feng and Qiu (2014) from Hausdorff topological vector spaces, real normed spaces and real Banach spaces to Hadamard manifolds, respectively.

Various empirical models are available to evaluate the temperature effects on relative permeability of the different rock and fluid systems. However, the implementation of limited experimental data points may hinder the applicability of such models to other systems. This study aims to develop new predictive models for k_ro estimation based on multilayer perceptron artificial neural network (MLP-ANN), adaptive neuro-fuzzy inference system (ANFIS), and least squares support vector machine (LSSVM) approaches. A database comprising of 626 data points applied to the model development. The independent variables are temperature, oil viscosity, water viscosity, water saturation ( ), and the absolute permeability. Each variable covers a wide range of variations which increases models’ potential to be applied in various systems with different characteristics. The doubtful experimental data points excluded using a leverage value approach and a sensitivity analysis carried out to determine the quantitative impact of every individual independent variable on the k_ro. Statistical error analyses demonstrated the coefficient of determination (R²) values of 0.985, 0.975, and 0.999 for MLP-ANN, ANFIS, and LSSVM, respectively. The comparative study indicated that the LSSVM had the best performance regarding both graphical and statistical error analyses among the newly proposed models and previously reported models in the literature.

The airport ground handling service (AGHS) equipment vendor selection (AGHSEVS) problem is critical for ramp work safety management, because AGHS equipment malfunctions affect airport ramp work safety. Appropriate vendor selection can prevent aircraft damage and delays in airlines schedules, and ensure reliable and high-quality ground handling service. The AGHSEVS problem is a time-consuming and complex process that requires professional knowledge and experience to make judgments. Specifically, AGHSEVS is a multi-criteria decision-making (MCDM) problem. Previous research has seldom integrated MCDM methods with linear and goal programming to solve the AGHSEVS problem. The objective of this study was to develop a new system evaluation model for AGHSEVS by considering both qualitative and quantitative methods. We test the proposed approach on an AGHS company in Taiwan.

The purpose of this study is to ascertain whether implementation difficulty can be used in slot allocation model as a new mechanism for slightly weakening grandfather right. According to which, a linear integer programming model is designed to compare and analyze displacement, implementation difficulty and priority with different weights. Test results show that the implementation difficulty can be significantly reduced without causing excessive displacement and disruption of existing priorities, by weight setting while declared capacity is cleared. In addition to this, whether the movements are listed in order of descending priority or not have great impact on displacement and implementation difficulty within slot allocation model. Capacity is surely a key factor affecting displacement and implementation difficulties. This study contributes to propose a new mechanism for slightly weakening grandfather right, which can help decision makers to upgrade slot allocation policies.

Voronoi entropy for the random patterns and patterns demonstrating various elements of symmetry are calculated. The symmetric patterns are characterized by the values of the Voronoi entropy very close to those inherent to random ones. This contradicts the idea that the Voronoi entropy quantifies the ordering of the seed points, constituting the pattern. The extension of the Shannon-like formula embracing symmetric patterns is suggested. Analysis of Voronoi diagrams enables revealing of the elements of symmetry of the pattern.

In this article, our main purpose is to establish a new extension of Mittag-Leffler function by using the known extended beta function $\mathbf{B}_{\omega}(a,b;p)$ introduced in [1]. It led to a novel extension of the applicability of Mittag-Leffler function that introduced them as distributions defined for a specific set of functions. We also, investigate some of its important properties, namely recursion relation, Mellin transform and differential formulas.

In the present article we describe a few simple and efficient finite volume type schemes on moving grids in one spatial dimension for the sake of simplicity. The underlying finite volume scheme is conservative and it is accurate up to the second order in space. The main novelty consists in the motion of the grid. This new dynamic aspect can be used to resolve better the areas with high solution gradients or any other special features. No interpolation procedure is employed, thus an unnecessary solution smearing is avoided. Thus, our method enjoys excellent conservation properties. The resulting grid is completely redistributed according the choice of the so-called monitor function. Several more or less universal choices of the monitor function are provided. Finally, the performance of the proposed algorithm is illustrated on several examples stemming from the simple linear advection to the simulation of complex shallow water waves. We believe that the techniques described in our paper can be beneficially used to model tsunami wave propagation and run-up.

In standard construction of hyperrational numbers using ultra-power we assume that the ultralter is selective. It makes possible toassign real value to any nite hyperrational number. So, we can consider hyperrational numbers with selective ultralter as extension of traditional real numbers. Also proved the existence of strictly monotonic or stationary representing sequence for any hyperrational number.

This paper predict and effectively control the temperature distribution of the steady-state and transient states of anisotropic four-layer composite materials online, knowing the density, specific heat, heat conductivity and thickness of the composite materials. Based on the transfer function, a mathematical model was established to study the dynamic characteristics of heat transfer of the composite materials. First of all, the Fourier heat transfer law was used to establish a one-dimensional Fourier heat conduction differential equation for each composite layer, and the Laplace transformation was carried out to obtain the system function. Then the approximate second-order transfer function of the system was obtained by Taylor expansion, and the Laplace inverse transformation was carried out to obtain the transfer function of the whole system in the time domain. Finally, the accuracy of the simplified analytical solutions of the first, second and third order approximate transfer functions was compared with computer simulation. The results showed that the second order approximate transfer functions can describe the dynamic process of heat transfer better than others. The research on the dynamic characteristics of heat transfer in the composite layer and the dynamic model of heat transfer in composite layer proposed in this paper have a reference value for practical engineering application. It can effectively predict the temperature distribution of composite layer material and reduce the cost of experimental measurement of heat transfer performance of materials.

Multispectral remote sensing data may contain component images which are heavily corrupted by noise and pre-filtering (denoising) procedure is often applied to enhance these component images. To do this, one can use reference images – component images having relatively high quality and which are similar to the image subject to pre-filtering. Here we study the following problems: how to select component images that can be used as references (e.g., for the Sentinel multispectral remote sensing data) and how to perform the actual denoising. We demonstrate that component images of the same resolution as well as component images of a better resolution can be used as references. Examples of denoising of real-life images demonstrate high efficiency of the proposed approach.

This paper establishes a real integral representation of the reciprocal $\Gamma$ function in terms of a regularized hypersingular integral. The equivalence with the usual complex representation is demonstrated. A regularized complex representation along the usual Hankel path is derived.

In this paper, we study the entire or meromorphic solutions for differential-difference equations in f(z) , its shifts, its derivatives and derivatives of its shifts. and study some Hayman's results for differential-difference polynomials.

In this paper, some mixed type bounds on the spectral radius $\rho(A\circ B)$ for the Hadamard product of two nonnegative matrices ($A$ and $B$) and the minimum eigenvalue $\tau(C\star D)$ of the Fan product of two $M$-matrices ($C$ and $D$) are researched. These bounds complement some corresponding results on the simple type bounds. In addition, a new lower bound on the minimum eigenvalue of the Fan product of several $M$-matrices is also presented: $$ \tau(A_{1}\star A_{2}\cdots\star A_{m})\geq \min_{1\leq i\leq n}\{\prod^{m}_{k=1}A_{k}(i,i)-\prod^{m}_{k=1}[A_{k}(i,i)^{P_{k}}-\tau(A_{k}^{(P_{k})})]^\frac{1}{P_{k}}\}, $$ where $A_{1},\ldots, A_{k}$ are $n\times n$ $M$-matrices and $P_{1},\ldots, P_{k}>0$ satisfy $\sum^{m}_{k=1}\frac{1}{P_{k}}\geq 1$. Some special cases of the above result and numerical examples show that this new bound improves some existing results.

We propose a model for medium-term hydropower scheduling (MTHS) with variable head and uncertainty in inflow, reserve capacity, and energy price. With an increase of intermittent energy sources in the generation mix, it is expected that a flexible hydropower producer can obtain added profits by participating in other markets than just the energy market. To capture this added potential the hydropower system should be modeled with a higher level of details. In this context, we apply an algorithm based on stochastic dual dynamic programming (SDDP) to solve the nonconvex MTHS problem, and show that the use of Strengthened Benders (SB) cuts to represent the expected future profit (EFP) function provide accurate scheduling results for slightly nonconvex problems. A method to visualize the EFP function in a dynamic programming setting is provided, serving as a useful tool for a priori inspection of the EFP shape and its nonconvexity.

Existing proofs of the 4-color theorem succeeded by establishing an unavoidable set of reducible configurations. By this device, their authors showed that a minimum counterexample cannot exist. G.D. Birkhoff proved that a minimum counterexample must satisfy a connectivity property that is referred to in modern parlance as internal 6-connectivity. We show that a minimum counterexample must also satisfy a coloring property, one that we call Kempe-locking. We define the terms Kempe-locking configuration and fundamental Kempe-locking configuration. We provide a heuristic argument that a fundamental Kempe-locking configuration must be of low order and then perform a systematic search through isomorphism classes for such configurations. We describe a methodology for analyzing whether an arbitrary planar triangulation is Kempe-locked; it involves deconstructing the triangulation into a stack of configurations with common endpoints and then creating a bipartite graph of coloring possibilities for each configuration in the stack to assess whether certain 2-color paths can be transmitted from the configuration's top boundary to its bottom boundary. All Kempe-locked triangulations we discovered have two features in common: (1) they are Kempe-locked with respect to only a single edge, say $xy$, and (2) they have a Birkhoff diamond with endpoints $x$ and $y$ as a proper subgraph. On the strength of our various investigations, we are led to a plausible conjecture that the Birkhoff diamond is the only fundamental Kempe-locking configuration. If true, this would establish that the connectivity and coloring properties of a minimum counterexample to the 4-color theorem are incompatible. It would also point to the singular importance of a particularly elegant 4-connected triangulation of order 9 that consists of a triangle enclosing a pentagon enclosing a single vertex.

We consider several unification problems in mathematics. We refer to transcendental numbers. Also, we present some ways to unify the main non-associative algebras (Lie algebras and Jordan algebras) and associative algebras.

This paper puts forward an alteration for Tensor Calculus utliized in a coordinate system which is under a dynamic distortion drawing inspiration from similar fields such as the Calculus of Moving Surfaces (CMS). The paper establishes transformation laws for Tensors within these regions and establishes Operators such as the Tensorial Field Derivative which enforce a Tensorial Transformation on Tensors defined within a Dynamically Moving coordinate system. This variation of Tensor Calculus can be utilized to observe how disciplines such as QFT and Continuum Mechanics would change to accomodate for a distorting coordinate system and can be utliized to develop new theoretical models which account for this temporal distortion particularly within Biological Settings.

In this paper, we study the third order semilocal convergence of the Newton-like method for finding the approximate solution of nonlinear operator equations in the setting of Banach spaces. First, we discuss the convergence analysis under ω-continuity condition, which is weaker than the Lipschitz and Hölder continuity conditions. Second, we apply our approach to solve Fredholm integral equations, where the first derivative of involved operator not necessarily satisfy the Hölder and Lipschitz continuity conditions. Finally, we also prove that the R-order of the method is 2p + 1 for any p $\in$ (0,1].

This work deals with a numerical implementation of a fifth order CENTRAL WENO-TVD (\textit{Weighted Essentially Non-Oscillatory-Total Variation Dimimishing}) of Haschem (2006) scheme applied to the convective terms of some hyperbolic conservation laws problems, in a volume finite framework. The WENO-TVD scheme is used to solve the 1D advection and Burgers equations. For this case is implemented two different numerical fluxes: The Lax-Friedrichs and TVD fluxes. In the TVD fluxes the schemes applied are in flux-limiter form. The schemes implemented for this flux are: Van Albada-1 (van Albada et al.,1982), van Albada-2 (Kermani et al., 2003), van Leer (Hassanzadeh, 2009) and MINMOD (Hirsch, 2007). The WENO type schemes are characterized for their high order approximation, and do not produce spurious oscilations near discontinuities, shocks and higher gradients. A third order Runge-Kutta TVD for the temporal variable is used. Qualitative and quantitative comparison are presented. The numerical solutions are computed with an in-house computer code developed in MATLAB software. In future works, it will develope a paralelization of computer code for solving systems of conservation laws, e.g. Euler equations of gas dynamics.