Stabilization of planar premixed flame front on a lattice (porous) burner is considered. It is rigorously mathematically proved that there exist two different stabilization regimes: one with flame front located nearby the surface of the burner, and another with flame front located inside the lattice. These two regimes result in qualitatively different gas temperature profiles along the flow, that is monotonic and non-monotonic, respectively. Boundary between the two regimes is described in terms of dependence of the lattice solid material temperature on flow Peclet number. Likewise temperature profiles, such dependencies may be both monotonic and non-monotonic. Transition between the two types of dependencies is controlled by Arrhenius number. Conclusions of the study are supported by numerical analysis. They also compare favourably with available experimental data. Novelty of the present approach is fundamentally rigorous analytical analysis of the problem.

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.

Estimating the parameters of statistical distributions generally involves solving a system of nonlinear equations or a nonlinear equation, being a technical difficulty in their usual application in hydrology. This article presents improved approximations and, in some cases, new approximations for the estimation with the method of ordinary moments and the method of linear moments, which are useful for the direct calculation of the parameters, because the errors in the approximate estimation are similar to the use of iterative numerical methods. Thirteen statistical distributions of two and three parameters frequently used in hydrology are presented, for which parameter estimation was laborious. Thus, the approximate estimation of the parameters by the two methods is simple but also precise and easily applicable by hydrology researchers. The approximate forms characterized by very small errors are the result of the research conducted within the Faculty of Hydrotechnics to update the romanian normative standards in the hydrotechnical field.

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 study, we introduce a new class of bi-univalent functions using q-Janowski Function. We derive the Fekete-Szegö functional problems for functions in this new subclass, as well as estimates for the Taylor-Maclaurin coefficients |α2| and |α3|. Furthermore, a collection of fresh outcomes are3 presented by customizing the parameters employed in our initial discoveries.

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).

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.

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.

Aiming at the problem of low charging efficiency caused by the scattered sensor nodes in traditional wireless rechargeable sensor networks (WRSNs), a UAV-assisted WRSN Online Charging Strategy Based on Dynamic Queue and Improved K-means (UOCS) is proposed. The scheme assumes that the energy consumption of nodes is unpredictable, and only generates charging requests when the energy is lower than a threshold, and performs on-demand responses to nodes that issue charging requests. The scheme combines the characteristics of one-to-one charging of UAVs, the selection and allocation timing of waiting queues and the number of UAVs, and the improved K-means partitioning based on space-time coordination(SPKM), which simplifies the problem of coordinated charging of multiple UAVs and maximizes energy. Using the efficiency and charging success rate, the optimal charging trajectory can be found under the constraint that the node will not starve to death due to power shortage. Finally, a simulation comparison experiment is carried out with the existing UAV charging scheduling strategy. UOCS achieves the optimal node survival rate with low algorithm complexity.

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 $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$.

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.

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.

The basic challenges of this work are twofold: demonstrating the dependence between the functional and topological qualities of partition networks and finding the simplest—with respect to algorithmic complexity—network elements. The study of these problems is based on finding the solution to an appropriate antagonistic vertex game. The results of the numerical simulations of antagonistic partition games demonstrate that the winner’s graphs are “almost always” dense and hyperenergetic compared to the loser’s graphs. These observations reveal that successful evolutionary mechanisms can be realized, in principle, by the simplest objects (such as viruses).

In this paper, I introduce a new concept of representing numbers in base ; in other words, I have found new series for any number similar to series that could be written according to the collatz sequence which is called zi(n) in this article. These series need to end with 1. Then, we use two sets of rules to make a diagram which then proves the existence of such series for any number.In this diagram, by branching numbers into different branches in accordance to the modularity of 4 and continuing branching to the point that their numbers have enough common terms in their collatz series, we could reduce zi(n) to zi(k) so that k<n in any branch by Rule Number One. This diagram shows that zi(n) exists for every number, in other words, this proves the theorem (A) or zi-existence theorem. The proof of zi-existence theorem leads to a proof of the collatz conjecture because the collatz series could be written as a linear combination of such series that all of them end with 1, so the collatz series for any number ends with 1.

This short report contains a result that characterizes almost global pullback attractor of discrete-time non-autonomous systems. Analogously to the multiple Lyapunov functions approach for switched systems, we show here that existence of multiple Lyapunov densities implies pullback convergence of almost all initial states to the origin for a discrete-time non-autonomous system.

The present paper introduces a method of basis transformation of vector fields that is specifically applicable to polynomials space and differential equations with certain polynomials solutions such as Hermite, Laguerre and Legendre polynomials. The method based on separated transformation of vector space basis by a set of operators that are equivalent to the formal basis transformation and connected to it by linear combination with projection operators. Applying the Forbenius covariants yields a general method that incorporates the Rodrigues formula as a special case in polynomial space. Using the Lie algebra modules, specifically , on polynomial space results in isomorphic algebras whose Cartan sub-algebras are Hermite, Laguerre and Legendre differential operators. Commutation relations of these algebras and Baker-Campbell-Hausdorff formula gives new formulas for special polynomials

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.

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.

The present work concerns with presenting an explicit formula for new shifted wavelet (NSW) functions. Wavelet functions have many applications and advantages in both applied and theoretical fields. They are formulated with different orthogonal polynomials to construct new techniques for treating some problems in sciences, and engineering. A new important differentiation property of NSW in terms of NSW themselves is obtained and proved in this paper. Then it is utilized together with the state parameterization technique to find solution of optimal control problem (OCP) approximately. The suggested method converts the OCP into a quadratic programming problem, which can be easily determined on computer. As a result, the approximate solution closes with the exact solution even with a small number of NSW utilized in estimation. The error bound estimation for the proposed method is also discussed. Some test numerical examples are solved to demonstrate the applicability of the suggested method. For comparison, the exact known solutions against the obtained approximate results are listed in Tables.

Jaundice is a common condition for newborns, and its complications can be severe and cause permanent damage to the patient’s brain if no action is taken at its early stages. Current methods for jaundice detection are invasive, which include collecting blood samples from the patient, which can be painful and stressful and may cause some complications. Alternatively, a non-invasive approach can be used to diagnose jaundice through image-processing and artificial intelligence (AI) techniques, requiring a database of infant images to achieve a high-accuracy diagnosis. This data article provides a collection of newborn images, called NJN, with various birthweight and skin tones, with ages ranging from 2 to 8 days, and an excel sheet file in CSV format for the values of RGB and YCrCb channels and the status for each raw which is freely accessible at (https://sites.google.com/view/neonataljaundice). It also provides Python code for data testing using different AI techniques. Thus, this article offers a unique resource for all AI researchers to train their AI system and develop algorithms to help neonatal intensive care unit (NICU) healthcare specialists monitor neonates and provide fast, real-time, non-invasive, and accurate jaundice diagnosis.

University course scheduling (UCS) is one of the most important and time-consuming issues that all educational institutions face yearly. Most of the existing techniques to model and solve UCS problems have applied approximate methods, which are different in terms of efficiency, performance, and optimization speed. Accordingly, this research aims to apply an exact optimization method to provide an optimal solution to the course scheduling problem. In other words, in this research, an integer programming model is presented to solve the USC problem. In this model, hard and soft constraints include the facilities of classrooms, courses of different levels and compression of students' curriculum, courses outside the faculty and planning for them, and the limited time allocated to the professors. The objective is to maximize the weighted sum of allocating available times to professors based on their preferences in all periods. To evaluate the presented model's feasibility, it is implemented using the GAMS software. Finally, the presented model is solved in a larger dimension using a real data set from a college in China and compared with the current program in the same college. The obtained results show that considering the mathematical model's constraints and objective function, the faculty courses' timetable is reduced from 4 days a week to 3 working days. Moreover, master courses are planned in two days, and the courses in the educational groups do not interfere with each other. Furthermore, by implementing the proposed model for the real case study, the maximum teaching hours of the professors are significantly reduced. The results demonstrate the efficiency of the proposed model and solution method in terms of optimization speed and solution accuracy.

This paper serves as a seamless continuation of the previous work titled "Special Spirals are Produced by the ROTASE Galactic Spiral Equations with the Sequential Prime Numbers." Upon revisiting the data, a noteworthy observation emerged: the special spirals can be meticulously aligned with the prime spiral on a point-by-point basis through careful scaling and rotation for the parameter ρ remaining a constant greater than one. As ρ increases, both the scaling factor and rotation angle exhibit a corresponding augmentation, albeit with an intriguing caveat—the rotation angle asymptotically approaches its limit of 90°. Notably, the galactic spiral can be perceived as a remarkably close approximation of the Archimedean spiral, with the degree of proximity increasing as ρ grows larger. Furthermore, an intriguing correspondence arises when ρ takes on a value of 1; at this value, the galactic spiral bears a striking resemblance to the Fermat spiral, the space between two consecutive spiral loops undergoes a continuous reduction as the loop's radius expands, yet it never diminishes to zero; simultaneously, the area between two successive loops experiences an augmentation with the value of ρ.

In this paper we totally discard the traditional trial-and-error algorithms of choosing acceptable shape parameter c in the multiquadrics $-\sqrt{c^{2}+\|x\|^{2}}$ when dealing with differential equations. Instead, we choose c directly by the MN-curve theory and hence avoid the time-consuming steps of solving a linear system required by each trial of the c value in the traditional methods. The quality of the c value thus obtained is supported by the newly born choice theory of the shape parameter. Experiments show that the approximation error of the approximate solution to the differential equation is very close to the best approximation error among all possible choices of c.

The main purpose of this article is to consider the smoothness control of a weak solution after some moment if there is known solution regularity until this moment. The necessary tools can be varied. It is possible to control kinetic energy dissipation to fix moment or changing of velocity square or summability of acceleration square to fix at point time.

In this paper, we give the Galois adjunction form of the regular relation, and by using residuated mapping, we find the connection between it and order-generating set. Furthermore, we obtain the equivalent conclusion of "regular". In addition, by using the specialization order of topological space and the lower approximate operator in the rough set, we find a continuous homeomorphic mapping from a regular space to a Alexandrov topological space

This study presents the solution of the second type of a two-dimensional nonlinear integral equation in Banach space. Also, the existence and uniqueness of this equation’s solution are discussed. We utilize a numerical approach involving hybrid and block-pulse functions to obtain the approximate solution of a two-dimensional nonlinear integral equation. Nonlinear integral equation in two dimensions is reduced numerically to a system of nonlinear algebraic equations that can be solved using numerical methods. This study focuses on showing the convergence analysis for the numerical approach and obtaining an error estimate. Some numerical examples have been provided to demonstrate the approach’s viability and efficacy

The Physics-Informed Neural Networks (PINNs) improve the efficiency of data utilization by combining physical principles with neural network algorithms and ensure that the predictions are consistent and stable with the physical laws. PINNs opens up a new approach to address inverse problems in fluid mechanics. Based on the single-relaxation-time lattice Boltzmann method (SRT-LBM) with the Bhatnagar-Gross-Krook (BGK) collision operator, the PINN-SRT-LBM model is proposed in this paper for solving the inverse problem in fluid mechanics. The PINN-SRT-LBM model consists of three components. The first component involves a deep neural network that predicts the equilibrium control equations in different discrete velocity directions within SRT-LBM. The second component employs another deep neural network to predict non-equilibrium control equations, enabling inference of the fluid's non-equilibrium characteristics. The third component, a physics informed function translates the outputs of the first two networks into physical infor-mation. By minimizing the residuals of the physical partial differential equations (PDEs), the physics informed function infers relevant macroscopic quantities of the flow. The model evolves two sub-models applicable to different dimensions, named PINN-SRT-LBM-I and PINN-SRT-LBM-II models according to the construction of the physical informed function. The innovation of this work is the introduction of SRT-LBM and discrete velocity models as physical drivers into the neural network through the interpretation function. Therefore, PINN-SRT-LBM allows the neural network to handle inverse problems of various dimensions and focus on problem-specific solving. Experimental results confirm the accurate prediction of flow infor-mation at different Reynolds numbers within the computational domain. Relying on the PINN-SRT-LBM models, inverse problems in fluid mechanics can be solved efficiently.

In this paper, we introduced a generalized ∆-implicit locally contractive condition and give some examples to support it and to show its significance in fixed point theory. We prove that the mappings satisfying generalized ∆-implicit locally contractive condition admits a common fixed point, where, the ordered multiplicative GM−metric space is chosen as underlying space. The obtained fixed point theorems generalize many earlier fixed point theorems on implicit locally contractive mappings. In addition, some nontrivial and interesting examples are provided to support our findings. To demonstrate the originality of our new main result, we apply it to show existence of solutions to a system of nonlinear -Volterra type- integral equations.

This paper presents the symmetries of differential equations associated with one-variable and Bivariate Hermite polynomials by proposing a representation of Lie algebra for these differential operators. Applying the Baker-Campbell-Hausdorff formula to these algebras, results in new relations and generating functions in one-variable and Bivariate Hermite polynomials. A general form of representation for other orthogonal polynomials such as Laguerre polynomials is introduced.

We formulate a more straightforward, symmetry-based techniques in manually computing the determinant of any n×n matrix by revisiting Dodgson’s condensation method and strategically applying elementary row operations and the definition and properties of determinants. The result yields a more simplified mnemonical algorithm than the usual reduction by elementary row operations and co-factor expansion and with minimal terminal divisions performed compared to Dodgson’s internal divisions.

Proxy re-encryption (PRE) is a momentous and widely used cryptographic technique. It enables a proxy to forward ciphertext without the need of decryption. PRE has received significant interest in applications like cloud computing, blockchain, and the Internet of Things. Despite its wide range of uses, PRE has also been subject to new security and privacy regulations. In PKC’19, Cohen $et~al.$~first drew attention to the weakness in PRE's security against chosen-plaintext attacks (CPA) and put up a more stringent security concept known as security against honest re-encryption attacks (HRA). Notably, Cohen provides a beneficial conclusion as well. It is proveded that PRE schemes with re-encryption simulatability property can be elevated from CPA to HRA security. It is also proved that CPA-secure PRE schemes with re-encryption simulatability property can be directly elevated to those satisfying HRA security. However, those PRE schemes with re-encryption simulatability are almost always based on pairings. In this study, to the best of our knowledge, we directly construct HRA-secure PRE with re-encryption simulatability for the first time based on the learning with errors (LWE) assumption, which was widely believed to be quantum-resistant. Based on the re-encryption key generation algorithm and the re-encryption algorithm construction method of the above scheme, we can modify attribute-based conditional proxy re-encryption (AB-CPRE) as well as the corresponding attribute-based proxy re-encryption (AB-PRE) algorithm to make them have re-encryption simulatability properties. Finally, by using this property, We boost the security of AB-CPRE scheme of ESORICS'21 from CPA to HRA and simplify the HRA-security proof for the AB-PRE of ESORICS'21.

While the language model using the stop sign as an independent token has been widely used to decide when the model should stop, it may lead to the growth of vocabulary dimensions and further problems. Similarly, present research on game algorithms usually estimate stopping point related problems based on the evaluation of the winning rate. However, information redundancy may also exist in such models, thus increasing the training difficulty. Above two types of tasks (and similar autoregressive tasks) show a common problem of stopping point prediction. In this paper, we describe a design of separated model, trying to separate the complexity of stopping point prediction from the main task model, so that the information used for estimating stopping point can be reduced. On this basis, in order to verify the rationality of using separated model, we propose a model-free test method. It judges the separability of transformed data based on point difference and sequence difference metrics. In this way, it can predict the credibility of the separated model inference.

The objective of this study is to examine a nonparametric estimate , using the kernel approach, of the conditional distribution function of a scalar response variable that is given a random variable whose values take place in a separable real Hilbert space. The observations will be dependent on one another in a quasi-associated fashion. The pointwise practically perfect consistencies with rates of this estimator are established by us under some broad conditions. The study’s major objective is to investigate the convergence rate of the proposed estimator and its application in the convergence rate and asymptotic normality of the hazard function. The asymptotic normality of the developed estimator is established precisely. Simulation studies were conducted to investigate the behavior of the asymptotic property in the context of finite sample data.

In this study, we consider a Lambert series whose coefficients are the sum of divisors function. Utilizing the Lambert series in the sequel we introduce a normalized linear operator JR_(α,β) (z) by applying the convolution with Rabotnov function. We then, acquire sufficient conditions for JR_(α,β) (z) to be Univalent, Starlike and Convex respectively. In each component of this study, we expand the derived results by applying two Robin's inequalities, one of which is equivalent to the Riemann hypothesis.

Recently, Gohar et al. introduced a novel, local, and well-behaved fractional calculus. It possesses all the classical properties, and Its locality imposes simplicity and accuracy in modeling fractional order systems. In this article, we further develop the definitions and extend the classical properties of Gohar fractional calculus to address some of the open problems in Calculus. The fractional Gronwall's integral inequality, Taylor power series expansion, and Laplace transform are defined and applied to overcome some of the limitations in the classical integer-order calculus. The fractional Laplace transform is applied to solve Bernoulli-type logistic and Bertalanffy nonlinear fractional differential equations, and the criteria under which it can be applied to solve linear differential equations are investigated.

Endoscopic medical images can suffer from uneven illumination, low contrast, and lack of texture information due to the use of point directional light sources and the presence of narrow tissue structures, posing diagnostic difficulties for physicians. In this paper, a deep learning-based su-pervised illumination enhancement network is designed for low-light endoscopic images, aiming to improve both global illumination and local details. Initially, a global illumination enhancement module is formulated utilizing a higher-order curve function to improve global illumination. Sec-ondly, a local feature extraction module incorporating dual attention is designed to capture local detailed features. Considering the significance of color fidelity in biomedical scenarios, the designed loss function prioritizes introducing color loss to alleviate image color distortion. Compared with seven state-of-the-art enhancement algorithms on Endo4IE endoscopic datasets, experimental re-sults show that the proposed method can better enhance low-light endoscopic images and avoid image color distortion. It provides an efficient method to enhance images captured by endoscopes which can effectively assist clinical diagnosis and treatment.

With Unmanned Aerial Vehicles (UAV), a swift response to urgent needs like search \& rescue missions or medical deliveries can be realized. Simultaneously, the legislator is establishing so-called geographical zones, which restrict UAV operations to mitigate the air and ground risk to third parties. These geographical zones serve a particular safety interest, but they may also hinder the efficient usage of UAVs on time-critical missions with a range-limiting battery capacity. In this study, we address a facility location problem for up to two UAV hangars with a robust optimization model considering demand hotspots, geographical zones as restricted areas, a standard mission to satisfy battery capacity constraints, and the impact of wind scenarios. To this end, water rescue missions are used exemplary, for which positive and negative location factors for UAV hangars and areas of increased drowning risk as demand points are derived from open-source georeferenced data. Optimal UAV mission trajectories are computed with an A* algorithm considering five different restriction scenarios. As this pathfinding is very time-consuming, binary occupancy grids and image processing algorithms accelerate the computation by identifying either entirely inaccessible or restriction-free connections beforehand. For the optimal UAV hangar locations, we maximize accessibility while minimizing the service time to the hotspots, resulting in a decrease from the average service time of 570.4 s for all facility candidates to 351.1 s for one and 287.2 s for two optimal UAV hangar locations.

In this paper, we will extend the expected value of the function w.r.t the uniform probability measure on sets measurable in the Caratheodory sense to be finite for a larger class of functions, since the set of all measurable functions with infinite or undefined expected values may form a prevalent subset of the set of all measurable functions. This means "almost all" measurable functions have infinite or undefined expected values. Before we define the specific problem in section 2, with a unique solution that allows "more" functions to have finite expected values, we'll outline some preliminary definitions. We'll then define the specific problem in section 2 (with a partial solution in section 3) to visualize the complete solution to the problem. Along the way, we will ask a series of questions to clarify our understanding of the paper.

The study aimed to investigate the impact of incorporating deep learning strategies in mathematics instruction on students' problem-solving abilities, critical thinking skills, academic achievement, and mathematical skills development. The study population consisted of 280 students, with a sample size of 162 participants. Employing a purely quantitative approach, data collection utilized questionnaires and achievement tests as instruments. Data analysis involved simple linear regression, descriptive analysis, and Pearson correlation. The results of the study revealed that there was no significant enhancement observed in students' problem-solving abilities and critical thinking skills when deep learning strategies were incorporated into mathematics instruction. Additionally, students' attitudes towards deep learning activities in mathematics showed no effect on their academic achievement. Furthermore, students' engagement levels in deep learning activities did not impact their development of mathematical skills. Lastly, the frequency of deep learning activities in the mathematics classroom did not show a significant relationship with students' academic performance. These findings suggest that the implementation of deep learning strategies in mathematics instruction did not yield notable improvements in the specified areas based on the study outcomes.

Calculus, as a starting point to everyone's study of mathematics, was developed along with classical mechanics. Though not rigorously formulated, the intuition for differential form and infinitesimal motion makes calculus not hard to understand. And hence it does not require great effort to grasp the principles of classical mechanics. However, the situation becomes quite different when it comes to the quantum world. Given a particle system, what of interest is always the physical quantity of this system, such as energy, position, momentum, entropy, etc. But it is no longer straightforward.

A new set of basis functions is presented. The foundation in mathematics is established. To reconstruct a signal, it is compared to the Fourier basis functions. The M-basis functions' potential applications are also presented.

Matrices and their inverses allow accurate calculations to be produced quickly and compactly and can be used to control any process represented by a system of equations. Singular matrices require extensive workarounds (costing time and money) to solve these systems of equations because they have no inverse. Finding their inverse involves division by zero. Nevertheless, recently a new number set called semi-structured complex numbers was developed to enable division by zero in algebraic equations. The aim of this research was to demonstrate that the inverse of a singular matrix can be found using semi-structured complex numbers. This research reveals (1) Singular matrices and their inverses can be used to find a unique solution to a pair of simultaneous equations that appear to have infinitely many solutions or appear to have no solution; (2) Singular matrices map coordinates in projective space to coordinates in Euclidean space and their inverse maps coordinates in Euclidean space to coordinates in projective space; (3) the inverse of a singular matrix proves that parallel lines in Euclidean space do not intersect but in projective space intersect at a “point at infinity” and (4) collinear lines that intersect at infinitely many points in Euclidean space only intersect at one point in projective space.

The exponential growth of digital media content has introduced new challenges in managing and classifying internet traffic. Digital media traffic is composed of various applications such as video, audio, social media, and search, and its data structure is complex, incorporating a vast array of features. The classification of traffic data is a crucial aspect of internet traffic management and network security, and it forms the basis for several scenarios, including content distribution, advertising recommendations, and data analysis. Traditional classification methods rely mainly on deep packet inspection and port-based techniques, which have become increasingly ineffective due to the rapid evolution of network traffic. To address this issue, this study proposes a machine learning-based traffic classification method aimed at enhancing the accuracy and efficiency of digital media traffic classification to meet the current needs of traffic management and network security. The paper also analyzes and evaluates the classification effect and prediction capability of various algorithms under different training set sizes to validate the feasibility and effectiveness of the proposed method. The result demonstrates that the neural network algorithm has superior classification and prediction capabilities compared to the decision tree and support vector machine algorithms. Furthermore, our proposed method achieves the highest accuracy of 96.88% with a large training sample of 40,000 data streams, proving its superiority in handling high-dimensional data and complex datasets. The research results are significant for the development of digital media traffic classification and prediction methods and are expected to be applied in practical scenarios.

Let $m$ and $n$ be the fixed positive integers. Suppose $\mathcal{A}$ is a von Neuman algebra with no central summands of type $I_{1}$ and $L_{m}$ be a Lie type higher derivation i.e., an additive (linear) map $L_{m} :\mathcal{A}\to \mathcal{A}$ such that \begin{equation}\label{def2} \[L_{m}(p_{n}(\mathfrak{S}_{1},\mathfrak{S}_{2},\cdots,\mathfrak{S}_{n}))=\sum_{l_1+l_2+\cdots+l_n=m}p_{n}\big(L_{l_1}(\mathfrak{S}_{1}),L_{l_2}(\mathfrak{S}_{2}),\cdots,L_{l_n}(\mathfrak{S}_{n})\big)\] %L_{m}(p_{n}(\mathfrak{S}_{1},\mathfrak{S}_{2},\cdots,\mathfrak{S}_{n}))=\sum_{l_1+l_2+\cdots+l_n=m}p_{n}\big(L_{l_1}(\mathfrak{S}_{1}),L_{l_2}(\mathfrak{S}_{2}),\cdots,L_{l_n}(\mathfrak{S}_{n})\big)\nonumber \end{equation} for all $\mathfrak{S}_{1},\mathfrak{S}_{2},\cdots,\mathfrak{S}_{n}\in \mathcal{A}$. In the present paper, we study Lie type higher derivations on von Neuman algebras and prove that every additive Lie type higher derivation on $\mathcal{A}$ has a standard form at zero product as well as at projection product. Further, we discuss some more related results.

Non-normal mode stability analysis has long been employed to study linear transient characteristics of wall bounded shear flows. However, the application of this approach to investigate shear flows with stratified thermal conditions (STCF) has received limited attention. This paper examines thermal effects on Taylor-Couette flow. The results in this study indicate the possibility of a subcritical bifurcation in stratified Taylor-Couette flow.

We point out an inconsistency in Newton's equations of celestial mechanics. A set of differential equations implied by Newton's equations are shown to be free of this inconsistency. We then investigate the integrals of motion associated with this relative difference system.

In this study, we have considered for numerical solution of a Poisson equation in a domain. we have presented a first and second order finite difference method for solving the system of the intial boundary value. We have presented the numerical solution of the Poisson equations in a two-dimensional finite region. Numerical Solution and exact solution for the presented method has been compared and the figures presented. The present error analysis tables demonstrate the efficiency of the method.

Background: With the trend of intelligent display, the interface design of in-vehicle HUD is an expanding research field; Methods: To solve the subjectivity and uncertainty in the optimization of HUD interface design schemes, this paper proposed a hybrid scheme evaluation and optimization method based on entropy weight and VIKOR. The entropy weight method was used to reduce the subjectivity the decision-maker's weighting and obtain the objective weight of each indicator; The VIKOR method was used to obtain the best ranking of alternative schemes, and then the optimal interface design scheme was selected; Results: The evaluation of in-vehicle HUD interface design schemes were taken as an example for verification and calculation. The results showed that this method considers the subjectivity and uncertainty of the decision-making process in the optimization of design scheme, which can effectively improve the objectivity and accuracy of the evaluation results, and provide a reference for designers to optimize interface design schemes.

Classical numerical methods for solving ordinary differential equations often produce less accurate results when applied to problems with oscillatory or periodic behaviour. To adapt them for such problems, they are usually modified using the exponential fitting technique. This adaptation allows for the construction of new methods from their classical counterparts. The new methods are usually more accurate, efficient and suitable for handling the oscillatory or periodic behaviour of the problem. In this work, we construct a two-parameter exponentially-fitted Taylor method suitable for solving oscillatory or periodic problems that possess two frequencies. The construction algorithm is based on a proposed six-step flowchart discussed by authors in related literature. Two standard test problems were used to illustrate the accuracy and performance of the proposed method.

Teaching kinematic rotations is a daunting task for even some of the most advanced mathematical minds. However, envisioning and explaining the three-dimensional rotations can be highly simplified by changing the paradigm. This paradigm change allows for a high school student with a understanding of geometry to be able to not only develop the matrix but also explain the rotations at a collegiate level. The proposed method includes the assumption of a point (P) within the initial three-dimensional frame with axes (x ̂_i, y ̂_i, z ̂_i). It then utilizes a two-dimensional rotation view (2DRV) to measure how the coordinates of point P translate after the initial axis is rotated instead of using the established Euler's formula. The equations are used in matrix notation to develop a direction cosine matrix (DCM) for future equations. This method provides a high school student with an elementary and repeatable process to compose and explain kinematic rotations.

Work done by us shows that rough topology is a good tool for dealing with things that happen in the real world. The concept of ”basis” has been used to show out the deciding elements of the recent outbreak of COVID-19 that was reported all over the world.

Fermatean fuzzy sets (FFSs) are a versatile tool for handling uncertain problems and have shown great effectiveness in practical applications. However, many existing Fermatean fuzzy similarity measures exhibit counter-intuitive situations, making it challenging to accurately measure the similarity or difference between FFSs. To address this issue, several similarity and distance measures for FFSs are proposed, inspired by the Tanimoto similarity measure. The properties of the proposed measures are also explored, along with several comparative examples with existing measures for FFSs, which illustrate their superior performance in processing fuzzy information from FFSs. The proposed measures have effectively overcome the counter-intuitive challenges posed by many existing measures and significantly outperforms existing measures in differentiating different FFSs. Furthermore, we demonstrate the practical applicability of the proposed measures in solving pattern recognition, medical diagnosis and multiple-attribute decision-making problems.

This study provides a comprehensive comparison of the Peter Chew Sum method and Newton's Sum in Quadratic Root Function Computations. Both methods offer significant advancements by alleviating the need for memorization of multiple formulas. However, when confronted with higher-order quadratic root functions such as the calculation of power 33. Newton's Sum method proves cumbersome due to its requirement of all previous answers for final computation, leading to increased steps and error risks. In contrast, the Peter Chew Sum method simplifies the computational process by requiring only a few previous answers, resulting in a more straightforward series of operations. We contextualize our analysis within the historical progression of mathematical techniques, highlighting the transformative leap represented by the Peter Chew Sum method in quadratic root function computations. Peter Chew Sum addressing the limitations of Newton's Sum , especially concerning higher-order functions such as the calculation of power 256. Furthermore, study demonstrates that the innovative approach of the Peter Chew Sum method not only simplifies complex computations but also fosters enhanced conceptual understanding among students. In conclusion, study findings underscore the profound impact of the Peter Chew Sum method on quadratic root function computations.

Here, we describe the bicomplex (p,q)- Fibonacci numbers and the bicomplex (p,q)- Fibonacci quaternions that are based on these numbers and give some of their equations, including the Binet formula, generating function, Catalan, Cassini, d’Ocagne’s identities, and some summation formulas for both of them. Finally, we create a matrix for bicomplex (p,q)- Fibonacci quaternions, and we obtain a determinant of a special matrix that gives the terms of that quaternion.

Currently, Pythagorean fuzzy sets (PFSs) have been widely applied in various fields due to their substantial advantages in expressing and dealing with uncertainty. However, measuring the similarity and difference between PFSs effectively remains an unresolved issue. Inspired by Tanimoto similarity, we propose a novel set of similarity and distance measures for PFSs. We delve into the theoretical properties of the proposed measures and compare it with existing PFSs measures. Numerous numerical examples validate their rationality and effectiveness. Furthermore, our experimental findings suggest that in contrast to existing measures, the introduced measures successfully circumvent various counter-intuitive issues encountered by current measures, and yield more pronounced outcomes in the discrimination of different fuzzy sets. This enhances the uniqueness and superiority of our measures. Finally, we developed two decision models based on the proposed measures and validated their applicability in three applications.

In the present paper, we introduced a quadratically convergent Newton’s like normal S2 iteration method free from the second derivative for the solution of nonlinear equations permitting 3 f'(x) = 0 at some points in the neighborhood of the root. Our proposed method works well 4 when the Newton method fails. Numerically it has been verified that the Newton’s like normal 5 S-iteration method converges faster than Fang et al. method [A cubically convergent Newton-type 6 method under weak conditions, J. Compute. and Appl. Math., 220 (2008), 409-412]. We studied 7 different aspects of normal S-iteration method. Lastly, fractal patterns support the numerical 8 results and explain the convergence, divergence, and stability of method.

We apply the Ramsey theory to the analysis of geometrical properties of closed contours. Consider a set of six points placed on a closed contour. The straight lines connecting these points are yikx=αikx+βik i,k=1...6, αik≠0. We color the edges connecting the points for which αik&gt;0 holds with red, and the edges for which αik&lt;0 with green with red. At least one monochromic triangle should necessarily appear within the curve (according to the Ramsey number R3,3=6). This result is immediately applicable for the analysis of dynamical billiards. The second theorem emerges from the combination of the Jordan curve and Ramsey theorem. The closed curve is considered. We connect the points located within the same region with green links and the points placed within the different regions with red links. In this case, transitivity/intransitivity of the relations between the points should be considered. Ramsey constructions arising from the differential geometry of closed contours are discussed.

This paper introduces extensions H4,p and X8,p of Horn’s double hypergeometric function H4 and Exton’s triple hypergeometric function X8, taking into account recent extensions of Euler’s beta function, hypergeometric function, and confluent hypergeometric function. Among the numerous extended hypergeometric functions, the primary rationale for choosing H4 and X8 is their comparable extension type. Next, we present various integral representations of Euler and Laplace type, Mellin and inverse Mellin transforms, Laguerre polynomial representation, transformation formulae and a recurrence relation for the extended functions. In particular, we provide a generating function for the X8,p and several bounding inequalities for the H4,p and X8,p.

We extend the concept of metallic ratios to the real argument n considered as a dimension by analytic continuation showing that they are defined by an argument of a normalized complex number, and for rational n ≠ {0, ±2}, they are defined by Pythagorean triples. We further extend the concept of metallic ratios to metallic angles.

The notion of oriented set is the basic elementary concept of the theory of changeable sets. The main motivation for the introduction of changeable sets was the sixth Hilbert problem, that is, the problem of mathematically rigorous formulation of the fundamentals of theoretical physics. In the present paper the necessary and sufficient condition of the existence of one-point time on an oriented set is established. From the intuitive point of view, one-point time is the time associated with the evolution of a system consisting of only one object (for example, from one material point). Namely, it is proven that the one-point time exists on the oriented set if and only if this oriented set is a quasi-chain. Also, using the obtained result, the problem of describing all possible images of linearly ordered sets is solved. This problem naturally arises in the theory of ordered sets.

The fast and reliable processing of medical images is of paramount importance to adequately generate data to feed machine learning algorithms that can prevent and diagnose health issues. Here we benchmark different compressed sensing techniques applied to magnetic resonance imaging as a means to reduce the acquisition time spent in the collection of data and signals that form the image. We show that by using these techniques, it is possible to reduce the number of signals needed and, therefore, substantially decrease the time to acquire the measurements. To this end, we have considered and compared different algorithms: the Iterative Re-Weighted Least Squares, the Iterative Soft Thresholding Algorithm, the Iterative Hard Thresholding Algorithm, the Primal Dual Algorithm and the Log-Barrier Algorithm. We have implemented such algorithms in different analysis programs that have been used to perform the reconstruction of the images and found that the Iterative Soft Thresholding Algorithm gives the optimal results. We found that the images obtained with this algorithm have less quality than the original ones, but the quality is good enough to distinguish each body structure and detect any health problems.

Let G be a connected Lie group with Lie algebra g. This review is devoted to studying the fundamental dynamic properties of elements in the normalizer NG of G. Through an algebraic characterization of NG we analyze the different dynamics inside the normalizer. NG contains the well-known left-invariant vector fields and the linear and affine vector fields on G. In any case, we show the shape of the solutions of these ordinary differential equations on G. We give examples in low-dimensional Lie groups. It is worth saying that these dynamics generate the linear and bilinear control systems on Euclidean spaces and the invariant and linear control systems on Lie groups. Moreover, the Jouan Equivalence Theorem shows how to extend this theory to control systems on manifolds.

In different fields in our life, like physics, coding theory and computer science, graph labeling dramas an vital role and appears in many applications. A labeling of a graph is a map which assign each element in with a positive integer number. An edge irregular total -labeling is a function such that where and are weights for any two distinct edges. In this case, has total edge irregularity strength (TEIS) if is minimum. In our paper, we defined a new type of graphs called a triple star snake graph and star snake graph . Also, we investigated TEIS for a triple star snake graph . After that, we generalized the results for star snake graph .

In this article, an iterative method of two step is proposed for finding all roots simultaneously of polynomial equations. The order of convergence of the proposed algorithm is 2m, by using any iterative scheme of order m. Numerical tests are performed to confirm the theoretical results and to compare the proposed scheme with existing methods for finding all roots simultaneously.

We discuss two queueing-inventory systems with catastrophes in the warehouse. Catastrophes occur according to Poisson process and upon arrival of a catastrophe all inventory in the system is instantly destroyed. But consumer customers in the system (in the server or in the buffer) continue still waiting for the replenishment of the stock. The arrivals of the consumer customers follow a Markovian Arrival Process (MAP) and they can be queued in an infinite buffer. Service time of a consumer customer follows a phase-type distribution. The system receives negative customers whose have Poisson flows to service facility and upon arrival of a negative customer one consumer customer is pushed out from the system, if any. One of two replenishment policies can be used in the system: either (s,S) or (s,Q). If upon arrival of the consumer customer, the inventory level is zero, then according to the Bernoulli scheme, this customer is either lost (lost sale scheme) or join the queue (backorder sale scheme). The system is formulated by a four-dimensional continuous-time Markov chain. Steady state distribution is obtained using the matrix-geometric method. A comprehensive numerical study is performed on the performance measures under various replenishment policies. Finally, an optimization study is presented.

Since its original publication 1 in 1978, Lozi’s chaotic map has been thoroughly explored and continues to be. Hundreds of publications analyze its particular structure or apply its properties in many fields (electronic devices like memristor, A.I. with swarm intelligence, etc.). Several generalizations have been proposed, transforming the initial two-dimensional map into multidimensional one. However, they do not respect the original constraint that allows this map to be one of the few strictly hyperbolic: a constant Jacobian. In this paper we introduce a three-dimensional piece-wise linear extension respecting this constraint and we explore a special property never highlighted for chaotic mappings: the coexistence of thread-chaotic attractors (i.e., attractors which are formed by collection of lines) and sheet-chaotic attractors (i.e., attractors which are formed by collection of planes). This new 3-dimensional mapping can generate a large variety of chaotic and hyperchaotic attractors. We give five examples of such behavior in this article. In the first three examples, there is coexistence of thread and sheet-chaotic attractors. However, their shape are different and they are constituted by a different number of pieces. In the two last examples, the blow up of the attractors with respect to parameter a and b is highlighted.

Real and complex analytic functions are largely studied in the field of complex analysis and are seen as very useful tools in solving problems in mathematics, physics and engineering. Real and complex numbers are a subset of semi-structured complex numbers (a new number set created to algebraically solve division by zero). Nevertheless, the properties of analytic functions made up of semi-structured complex variables (called semi-structured complex analytic functions) is yet to be explored. This limits the range of possible problems that can be resolved using analytic functions). In this regard, the aim of this paper was to expound upon the properties of semi-structured complex analytic functions and show their application in solving engineering problems. The results of this paper included (1) developing a full set of Cauchy–Riemann Equations for the semi-structured complex -space; (2) define sufficient and necessary conditions for a semi-structured complex function to be analytic; (3) determine the relationship between semi-structured complex analytic functions, Laplace’s Equations and Poisson’s Equations; and (5) provide an example of the use of these functions.

Nonnegative matrix factorization (NMF) has been shown to be a strong data representation technique, with applications in text mining, pattern recognition, image processing, clustering and other fields. In this paper, we propose a hypergraph regularized Lp smooth nonnegative matrix factorization (HGSNMF), by incorporating hypergraph regularization and Lp smoothing constraint terms into the standard NMF. The hypergraph regularization term can capture the intrinsic geometry structure of the high dimension space data more comprehensively than simple graph, the Lp smoothing constraint may yield a smooth and more accurate solution to the optimization problem. The updating rules are given using multiplicative update techniques, and the convergence of HGSNMF is theoretically investigated. The experimental results on four different data sets show that the proposed method has better clustering effect than the related state-of-the-art methods in the vast majority of cases.

The fractional diffusion equations with integrals play a significant role in describing anomalous diffusion phenomena. We first construct an appropriate resolvent family, and use the convolution theorem of Laplace transform, the probability density function, Cauchy integral formula and Fubini theorem to study its related equicontinuity, strongly continuity, compactness, etc. Then, a reasonable mild solution is defined. Finally, by combining some fixed point theorems, we obtain some conclusions on the existence and uniqueness of mild solutions.

In this paper, we prove the existence of three solutions for a $p$-Kirchhoff problem with $\psi$-Hilfer fractional derivative. To be more precise, we use the variational method and we prove that the associated functional energy admits a critical point in each of the three constructed sets, these critical points are weak solutions for a studied problem. Moreover, by definition of these sets, one of these solutions is positive, the second is negative, and the third one change sign. At the end of this work, we present an example to validate our main results.

In this paper, we establish the necessary and sufficient conditions for solving a dual split quaternion matrix equation AXB=C, and present the general solution expression when solvability is achieved. As an application, we delve into the necessary and sufficient condition for the existence of Hermitian solution to this equation by using a newly defined real representation method. Furthermore, we obtain the solutions for the dual split quaternion matrix equations AX=C and XB=C. Finally, we provide a numerical example to demonstrate the findings of this paper.

This work aims to introduce a novel concept: the Riesz-Dunkl fractional derivatives, within the context of Dunkl type operators. A particularly noteworthy revelation is that when a specific parameter $\kappa$ equals zero, the Riesz-Dunkl fractional derivative smoothly reduces to both the well-known Riesz fractional derivative and the fractional second-order derivative. Furthermore, we introduce a new concept: the fractional Sobolev space. This space is defined and characterized using the versatile framework of the Dunkl transform.

The splitting method developed in a previous study for linear, multi – component, convection-diffusion mass transfer equations is extended to non-linear, multi-component, convection-diffusion mass transfer equations. The diffusion term is non-linear (the diffusion coefficients depend on chemical species concentrations). Theoretical results about the splitting error are presented, as well as numerical simulations for mixtures with n ≤ 5. The numerical experiments show second-order accuracy and stability for the present splitting algorithm.

In this paper, we introduce the notions of nearly Sasakian and nearly Kähler statistical structures with a non-trivial example. The conditions for a real hypersurface in a nearly Kähler statistical manifold to admit a nearly Sasakian statistical structure are given. We also study Invariant and anti-invariant statistical submanifolds of nearly Sasakian statistical manifolds. At the end, some conditions under which such a submanifold of a nearly Sasakian statistical manifold is itself a nearly Sasakian statistical manifold are given.

Quantum logic is a well-structured theory, which has recently received some attention because of its fundamental relation to quantum computing. However, the complex foundation of quantum logic borrowing concepts from different branches of mathematics as well as its peculiar settings have made it a non-trivial task to device suitable applications. This article aims to propose for the first time an approach to use quantum logic in image processing at hand of a process for shape classification. We show how to make use of the principal component analysis to realize quantum logical propositions. In this way we are able to assign a concrete meaning to the rather abstract quantum logical concepts, and we are able to compute a probability measure from the principal components. For shape classification we consider encrypting given point clouds of different objects by making use of specific distance histograms. This enables to initiate the principal component analysis. At hand of experiments, we explore the possibility to distinguish between different geometrical objects and discuss the results in terms of quantum logical interpretation.

In this paper, we consider a class of bilevel programming problems (abbreviated as, BLPP). Exploiting the generalized approximate convexity assumptions, we investigate the relations among the solutions of approximate Minty (respectively, Stampacchia) type variational inequalities (abbreviated as, AMTVI (respectively, ASTVI)), and the local ϵ-quasi solutions of the BLPP. Moreover, by employing the generalized Knaster–Kuratowski–Mazurkiewicz (abbreviated as, KKM)-Fan’s lemma, we derive some existence results for the solutions of approximate variational inequalities (abbreviated as, AVI), namely, AMTVI and ASTVI. A non-trivial example is given to highlight the importance of the established results. To the best of our knowledge, there is no research paper available in the literature that establishes relationships between the AVI and the BLPP under the assumptions of generalized approximate convexity in terms of limiting subdifferentials.

The paper proves the existence of a family of axisymmetric equilibrium figures as solutions of a stationary problem with unknown boundaries for the Navier–Stokes equations corresponding to the slow rotation of a viscous compressible two-layer liquid mass about some axis. It is assumed that the liquids are barotropic, capillary and have different viscosities, the internal fluid being bounded by a closed surface. This interface does not intersect with the external boundary of the cloud. The proof is based on implicit function theorem and carried out in the Hölder spaces.

This article introduces a new fractional approach to the concept of information dimension of complex networks, based on a (q,q′)-entropy proposed in the literature. The q parameter measures how far is the number of subsystems (for a given size ε) from the mean number of overall sizes. The q′ (interaction index) measures when the interactions between subsystems are greater (q′&gt;1), lesser (q′&lt;1) or equal to the interactions into these subsystems. The computations of the proposed information dimension are carried out on several real-world and synthetic complex networks. The results from the proposed information dimension are compared with those from the information dimension based on the Shannon entropy.

Incremental stability analysis for time-delay systems has attracted more and more attentions for its contemporary applications in transportation processes, population dynamics, economics, satellite positions, etc. This paper researches criteria on v(t)-incremental stability, which is defined to demonstrate the convergence rate for incremental stability, for time-delay systems. Firstly, the sufficient conditions for v(t)-incremental stability for time-delay systems with continuous right-hands are studied, and several corollaries for specific cases are provided. As for time-delay systems with discontinuous right-hands, after expounding the relevant conditions for the existence and uniqueness of the Filippov solution, by using approximation methods, sufficient conditions for v(t)-incremental stability are obtained. The conclusions are applied to linear switched time-delay systems and Hopfield neural network system with composite right-hand afterwards.

In the paper, we develop some numerical schemes including finite difference scheme and finite volume scheme for the fractional Laplacian operator, and apply the resulted numerical schemes to solve some fractional diffusion equations. First, the fractional Laplacian operator can be characterized as the weak singular integral by a integral operator with zero boundary condition. Second, because of the solution of fractional diffusion equation is usually singular near the boundary, we apply finite difference scheme to discrete fractional Laplacian operator and fractional diffusion equation by fractional interpolation function. Moreover, it is find that the differential matrix of the above scheme is symmetric matrix, and strictly row-wise diagonally dominant in special fractional interpolation function. Third, we show finite volume scheme to discrete fractional diffusion equation by fractional interpolation function, and analyze the properties of differential matrix. Finally, the numerical experiments are given, and verify the correctness of theoretical results and the efficiency of the schemes.

We consider two abstract systems of parabolic-hyperbolic type that model thermoelastic problems. We study the influence of the physical constants and the initial data on the nonexistence of global solutions that in our framework are produced by the blow-up in finite time of the norm of the solution in the phase space. We employ a differential inequality to find sufficient conditions that produce the blow-up. To that end, we construct a set that is positive invariant for any positive value of the initial energy. As a result we found that the coupling with the parabolic equation stabilizes the system, as well as the damping term in the hyperbolic equation. Moreover, for any pair of positive values $(\xi,\epsilon)$, there exist initial data such that the corresponding solution with initial energy $\xi$ blows-up at a finite time less than $\epsilon$. Our purpose is to improve results previously published in the literature.

Monge-Ampere equations have important research significance in many fields such as geometry, convex geometry and mathematical physics. In this paper, under some superlinear and sublinear conditions, the existence of nontrivial solutions for a system arising from Monge-Ampere equations with two parameters is investigated based on Guo-Krasnosel'skii fixed point theorem. In the end, two examples are given to illustrate our main results.

In Chuanming Zong’s program to attack Hadwiger’s covering conjecture, which is a longstanding open problem from Convex and Discrete Geometry, it is essential to estimate covering functionals of convex bodies effectively. Recently, He et al. [J. Optim. Theory Appl. 2023, 196, 1036–1055.] and Yu et al. [Mathematics, 2023, 11, 2000] provided two deterministic global optimization algorithms having high computational complexity for this purpose. Since satisfactory estimations of covering functionals will be sufficient in Zong’s program, we propose a stochastic global optimization algorithm based on CUDA and provide an error estimation for the algorithm. The accuracy of our algorithm is tested by comparing numerical and exact values of covering functionals of convex bodies including the Euclidean unit disc, the three-dimensional Euclidean unit ball, the regular tetrahedron, and the regular octahedron. We also present estimations of covering functionals for the regular dodecahedron and the regular icosahedron.

The main object of this work is to establish the existence and uniqueness of a solution to the 3D Navier-Stokes (NS) system for an incompressible fluid with viscosity. The nonlinearity of the NS system, as well as the need to estimate velocity and pressure for every value of the viscosity parameter [1] make them challenging to solve. In this regard, in the present work, we study the Navier-Stokes system, which describe the flow of a viscous incompressible fluid and the solution was obtained for velocity and pressure in an analytical form. In addition, the found pressure distribution law, which is described by a Poisson type equation and plays a fundamental role in the theory of Navier-Stokes systems in constructing analytic smooth (conditionally smooth) solutions.

It is known from ancient Egyptian mathematical papyri that the Egyptians were able to calculate the area of a circle with great accuracy. How they found the formula for this calculation was still unknown. Here it is shown how the unknown ancient Egyptian mathematician found a method for calculating the area of a circle and the ratio of a circle’s circumference to diameter.

It has been more than a century since Erlang published his paper in 1909. The classical queueing system for the M/D/c queue has been investigated by many authors. The key is to find the roots of an equation using explicit or numerical methods. We present an alternate form of explicit solution(s) of this/these root(s) using the Lambert-W function in this paper. In addition, the unsaturated probabilities of the number of customers in the system is derived explicitly in terms of this/these root(s). Finally, the mean number of customers in the system and the mean queueing delay are obtained from these probabilities. The exact queueing delay formula for the M/D/c queue is expressed in closed-form in terms of the root(s). Numerical results show that they are in excellent agreement with the numerical results published by Seelen, Tijms and Van Hoorn.

Voronoi mosaics inspired by the seed points placed on the Archimedes Spirals are reported. Voronoi entropy was calculated for these patterns. Equidistant and non-equidistant patterns are treated. Voronoi mosaics built from a sells of equal size which are of a primary importance for decorative arts are reported. The pronounced prevalence of hexagons is inherent for the patterns with an equidistant and non-equidistant distribution of points, when the distance between the seed points is of the same order of magnitude as the distance between the turns of the spiral. Penta- and heptagonal “defected” cells appeared in the Voronoi diagrams due to the finite nature of the pattern. The ordered Voronoi tessellations demonstrating the Voronoi entropy larger than 1.71, reported for the random 2D distribution of points, were revealed. The dependence of the Voronoi entropy on the total number of the seed points located on the Archimedes Spirals is reported. Voronoi tessellations generated by the phyllotaxis-inspired patterns are addressed. The aesthetic attraction of the Voronoi mosaics arising from seed points placed on the Archimedes Spirals is discussed.

Missing observation is a common problem in scientific and industrial experiments, particularly in a small-scale experiment. They often present significant challenges when experiment repetition is infeasible. In this research, we propose a multi-objective genetic algorithm as a practical alternative for generating optimal mixture designs that remain robust in the face of missing observation. Our algorithm prioritizes designs that exhibit superior D-efficiency while maintaining a high minimum D-efficiency due to missing observation. The focus on D-efficiency stems from its ability to minimize the impact of missing observations on parameter estimates, ensure reliability across the experimental space, and maximize the utility of available data. We study problems with three mixture components where the experimental region is an irregularly shaped polyhedral within the simplex. Our designs have proven to be D-optimal designs, demonstrating exceptional performance in terms of D-efficiency and robustness against missing observations. We provide a well-distributed set of optimal designs derived from the Pareto front, enabling experimenters to select the most suitable design based on their priorities using the desirability function.

The article outlines a creative approach by fusing ideas from fuzzy contractions, graph mappings, and Kannan mappings to create a brand-new notion known as "Kannan-graph-fuzzy contraction." This combination of concepts makes it possible to create a unique framework for resolving real-world issues controlled by nonlinear models. It is anticipated that using Kannan-graph-fuzzy contractions will offer a fresh approach to discussing solution existence in situations where these ideas overlap. This strategy might have a significant impact on a lot of real-world applications, proving how practical multidisciplinary techniques are for tackling issues in the real world originating from technology and engineering. The article includes several illustrated examples based on computer simulations, making the results more explicit.

The paper primarily demonstrates that the three internal triangles formed by connecting any point on a midsegment with the vertices of a generic triangle satisfy the geometric Proof of the Pythagorean theorem in Euclidean geometry. Moreover, this study elucidates the Pythagorean relationships inherent within three-dimensional geometric constructs resulting from the arrangement of three-dimensional spatial triangles. This geometric relationship, akin to a generalized extension of the Pythagorean theorem, unveils a unique spatial region characterized by this harmonious area interrelation among triangles.

The present study aims to show on the one hand how easily one can get confused when doing research on the internet. Different platforms, fora and homepages supply the visitor with different - and sometimes contradictory - information. On the other hand, we show how to overcome these contradictions and produce valuable research based on almost all sources. For our study, we use the example of the Feit-Thompson conjecture, which is - in opposite to the well-known Feit-Thompson theorem - not widely known. We try to clarify the scientific literature on this topic and we embed our own result into the present state of art. We prove that pq−1p−1 does not divide qp−1q−1 if p and q are twin primes, i.e. p=q+2. Thus we prove that the Feit-Thompson conjecture is true for twin prime numbers.

Molecular descriptors are essential in mathematical chemistry for studying quantitative structure-property relationships (QSPR), and topological indices are a valuable source of information about molecular properties such as size, cyclicity, branching degree, and symmetry. Graph theory has played a crucial role in the development of topological indices and dominating parameters for molecular descriptors. The molecule graph, under graph isomorphism conditions, represents an invariant number, and the graph theory approach considers dominating sets, which are subsets of the vertex set where every vertex outside the set is adjacent to at least one vertex inside the set. The dominating sigma index, a topological index that incorporates the mathematical principles of domination topological indices and the sigma index, is applicable to some families of graphs, such as book graphs, windmill graphs, and some graph operations, which have exact values for this new index. To evaluate the effectiveness of the domination sigma index in QSPR studies, a comparative analysis was conducted to establish an appropriate domination index that correlates with the physicochemical properties of octane and its isomers. Linear and non-linear models were developed using the QSPR approach to predict the properties of interest, and the results showed that both the domination forgotten and domination first Zagreb indices exhibited satisfactory performance in comparison testing. Further research into QSAR/QSPR domination indices is required to build more robust models for predicting the physicochemical properties of organic compounds while maintaining the importance of symmetry.

Exercising surds to represent figures is a common practice in scientific and Engineering fields, especially in scripts where calculators are banned or unapproachable. Peter Chew Theorem make result becomes simple when dealing with converting Quadratic Surds. The substance of the Peter Chew Theorem lies in enabling the forthcoming generation to simple break problems related to Quadratic Surds more effectively, easing a direct comparison with contemporary results. By employing the Peter Chew Theorem, one can streamline the tutoring and literacy of math, particularly concerning second- order direct equations with constant portions. This theorem's objective aligns with Albert Einstein's famed quotation Everything should be made as simple as possible, but not simpler.

In this study, we first discover some new concept coordinated UD-convex mappings with fuzzy-number values. After that, we look into Hermite-Hadamard type inequalities via fuzzy-number-valued coordinated UD-convex fuzzy-number-valued mapping (coordinated UD-convex FNVM). In the case of coordinated UD-convex FNVM, novel conclusions are derived by making particular decisions in recently proven inequalities. Additionally, it is demonstrated that the recently discovered inequalities are expansions of comparable findings in the literature. It is important to note that the main outcomes are validated by nontrivial examples.

Recently, Li et al [1] investigated the nonlinear Langevin equations existence including two fractional orders with infinite-point boundary conditions. It has shown that the outcomes given it does count on the solution form for which it has boundary values. It means that their solution needs more to be in the final step. In current work, we will have discussion about the existence and uniqueness for the same boundary conditions by investigating the closely explicit solution form that has no boundary values. Numerical example is supported to have more vision to compare the between new and previous results. It turns out that our results are superior.

The paper considers coherent states for the representation of Weyl commutation relations over a field of $p$-adic numbers. A geometric object, a lattice in vector space over a field of p-adic numbers, corresponds to the family of coherent states. It is proved that the bases of coherent states corresponding to different lattices are mutually unbiased, and the operators defining the quantization of symplectic dynamics are Hadamard operators.

Discretization in time and in the state space of the system leads to the necessity to solve the parameter identification problems for dynamic systems in a limited time (at a finite time interval) using observations obtained under the influence of unknown-but-bounded noise. Finding the solution in this case is more difficult compared to traditional identification problem setting which considers random independent zero-mean noise. For system parameter identification problem under unknown-but-bounded noise, a randomized stochastic optimization algorithm is given in the paper, estimates for the mean square values of the residuals for a finite observation interval are obtained. An example of application of the given method to the problem of tuning the parameters of a multi-mirror telescope is considered.

This paper proposed an optimal tracking control scheme through adaptive dynamic programming(ADP) for a class of partially unknown discrete-time nonlinear systems based on radial basis function neural network(RBF-NN). In order to acquire the unknown system dynamics, we use two RBF-NNs, the one is used to construct the identifier, and the another is used to directly approximate the steady-state control input, where a novel adaptive law is proposed to update neural network weights. While the optimal feedback control and the cost function are derived via feedforward neural networks approximating, it is proposed to regulate the tracking error, the critic network and the actor network are then trained online to obtain the solution of the associated Hamilton–Jacobi–Bellman (HJB) equation being built under the ADP framework. Simulations verify the effectiveness of the optimal tracking control technique using the neural networks.

A novel theoem is presented about a circle with four antipodal points, arbitrarily ordered counterclockwise (or clockwise), in a Euclidean plane.