In real-life scenario, there are many mathematical tools to handle the incomplete and imprecise data. One of them is the fuzzy approach. This article aims to contribute to the literature of fuzzy multi-objective dynamic programming issues involving the fuzzy objective functions. The piecewise quadratic fuzzy numbers characterize these fuzzy parameters. Some basic notions in the problem under the α-pareto optimal solution concept is redefined and analyzed to study the stability of the problem. Furthermore, a technique, named as enhancing decomposition approach, is presented for achieving a subset for the parametric space that contains the sameα-pareto optimal solution. For a better understanding and comprehension of the suggested concept, a numerical example is provided.

This paper focuses on robust multi-criteria traffic network equilibrium problems with path capacity constraints. The concepts of robust vector equilibrium and robust vector equilibrium with respect to worst case are introduced, respectively. To generate a subset of robust vector equilibrium, an equivalent min-max optimization problem is constructed. In addition, a direct search algorithm, in which the step size without derivatives and redundant parameters, for solving this min-max problem is proposed. To find a subset of robust vector equilibrium with respect to worst case, an equivalent smoothing optimization problem based on a variant version of ReLU activation function is established. Numerical experiments are also presented to expound the advantages of the algorithms.

In this compact and focused paper, we revisit the interplay between Bramble and Filter through the lens of a submodular partition function.

In 1937,German mathematician L.Collatz proposed a conjeture:for any positive integer,if it is even,divide it by 2;if it is odd,multiply it by 3 and 1 to get an even number;keep going on and on, the final result is 1.This paper gives a sequence classification of odd numbers,and gives 1-1 mapping of odd numbers and odd number sequences,and uses these results to give a proof of this conjecture.

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.

We firstly present two popular space discretization models of the Nonlinear Schrödinger Equation in dark solitons motion : the Direct-Discrete model and the Ablowitz-Ladik model. Applying the midpoint scheme to the space discretization models, we get two time-space discretization models: the Crank-Nicolson method and the New-Difference method. Secondly, we demonstrate that the solutions of the two space discretization models converge to the solution of the Nonlinear Schrödinger Equation. Also, we prove that the convergence order of the two time-space discretization models are O(h2+τ2) in discrete L2-norm error estimates. Finally, the numerical experiments agree well with the proven theoretical results.

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.

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.

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.

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.

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.

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 paper describes the use of topological indices in conjunction with high cholesterol drugs, specifically Fibrates, to predict their physicochemical properties and biological activities. Fibrates are known to lower high triglycerides, increase HDL cholesterol, and reduce the small dense fraction of LDL cholesterol. The study uses a quantitative structural-property relationships (QSPR) approach, which involves analyzing the relationships between physicochemical properties and topological indices using curvilinear regression. The QSPR model predicts the physicochemical properties of the drugs based on degrees and distances determined from topological indices. The study also conducted (DFT) calculations at the B3LYP/6-31G(d,p) level on the four investigated derivatives to gain insights into their optimized geometries, DOS plots, HOMO and LUMO orbital energies, and distribution. The theoretical results presented in the study suggest that the use of topological indices in QSPR models could provide a powerful tool for predicting the physicochemical properties and biological activities of molecules, including drugs. These findings could lead to the development of new cholesterol-lowering drugs with desirable properties.

In this work, we consider two SIR patterns with demography: the classical pattern and a modified pattern with a linear transmission coefficient of the infection. By reformulating of each first order differential systems as a system with two second-order differential equations, we investigate the nonlinear dynamics of the system from the Jacobi stability point of view by using the KCC geometric theory. We will study the intrinsic geometric properties of the systems by determining the geometric associated objects: the zero-connection curvature tensor, the nonlinear connection, the Berwald connection, and the five KCC invariants: the first invariant - the external force εi, the second invariant - the deviation curvature tensor Pji, the third invariant - the torsion tensor Pjki, the fourth invariant - the Riemann-Christoffel curvature tensor Pjkli, and the fifth invariant - the Douglas tensor Djkli. In order to obtain necessary and sufficient conditions for the Jacobi stability near the equilibrium points, the deviation curvature tensor will be determined at each equilibrium points. Furthermore, we will compare the Jacobi stability with the classical linear stability, inclusive by diagrams related to the values of parameters of the system.

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.

In an $m$-person symmetric game, all players are identical and indistinguishable. In this paper, we find that the payoff tensor of the player $k$ in an $m$-person symmetric game is $k$-mode symmetric, and the payoff tensors of two different individuals are the transpose of each other. Furthermore, we reformulate the $m$-person symmetric game as a tensor complementary problem and demonstrate that locating a symmetric Nash equilibrium is equivalent to finding a solution to the resulting tensor complementary problem. Finally, we use the hyperplane projection algorithm to solve the resulting tensor complementary problem, and we present some numerical results to find the symmetric Nash equilibrium.

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.

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.

This paper presents a new approach to a different proof of "Fermat's Last Theorem.” For the proof of the theorem, it is proposed to use a more straightforward geometrical approach. A special family of curves, the Elba curves, is introduced to facilitate the proof. This approach makes the proof easier to comprehend by mathematicians and those interested in the subject.

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.

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.

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.

Machine learning forks into three main branches such as supervised learning, unsupervised learning, and reinforcement learning where reinforcement learning is much potential to artificial intelligence (AI) applications because it solves real problems by progressive process in which possible solutions are improved and finetuned continuously. The progressive approach, which reflects ability of adaptation, is appropriate to the real world where most events occur and change continuously and unexpectedly. Moreover, data is getting too huge for supervised learning and unsupervised learning to draw valuable knowledge from such huge data at one time. Bayesian optimization (BO) models an optimization problem as a probabilistic form called surrogate model and then directly maximizes an acquisition function created from such surrogate model in order to maximize implicitly and indirectly the target function for finding out solution of the optimization problem. A popular surrogate model is Gaussian process regression model. The process of maximizing acquisition function is based on updating posterior probability of surrogate model repeatedly, which is improved after every iteration. Taking advantages of acquisition function or utility function is also common in decision theory but the semantic meaning behind BO is that BO solves problems by progressive and adaptive approach via updating surrogate model from a small piece of data at each time, according to ideology of reinforcement learning. Undoubtedly, BO is a reinforcement learning algorithm with many potential applications and thus it is surveyed in this research with attention to its mathematical ideas. Moreover, the solution of optimization problem is important to not only applied mathematics but also AI.

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.

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

Abstract: The objective of Peter Chew Triangle Diagram is to clearly illustrate the topic solution of triangle and provide a complete design for the knowledge of AI age. Peter Chew's triangle diagram will suggest a better single rule that allows us to solve any problem of topic solution of triangle simple , directly and more accurately. There are two important rules for solving the topic solution of triangle today [1,2], namely the sine rule and the cosine rule. The sine rule is used to find a non-included angle when are given two sides and a non-included angle or the opposite side angle given when are given two angles and one side. The cosine rule normally is used to find the included angle when are given three sides or the third side when are given two sides and the included angle. Peter Chew Method[3] allow us to find the third side simple and directly when given two sides and a non-included angle. Peter Chew rule [4] allow us to find a non included angle simple, directly and more accurately when given 2 sides and an included angle. Aply Peter Chew Triangle Diagram to Education 4.0 Calculator , Peter Chew Triangle Diagram Calculator allows the Calculator to solve any problems in the topic solution of triangle simple, directly and more accurate. This can be effective in increasing students' interest in using technology while learning mathematics and will help in the learning of mathematics, especially when similar covid-19 issues arise in the future.

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.

The work proposes a new approach for evolutionary global optimization which, in simple terms, may be described as a fusion of quantum and simulated annealing. This becomes possible by using basic concepts from Homotopy Theory, conjugated to the already existing Fuzzy Adaptive Simulated Annealing paradigm and other components. In this fashion, it occurs a temporal and nonlinear superposition of the two types of annealing, provoking interesting effects in runtime, including the so-called quantum tunneling, when there is a sudden transition between attraction basins of different minima without "climbing" potential barriers. In addition, the proposal includes a generalization of the "deformation" of Hamiltonians used in quantum annealing by suggesting the use of general homotopies between the surface corresponding to the cost function under processing and another specific landscape, being this possible because of the ability of Fuzzy ASA of handling time-varying objective functions. The proposed paradigm shows that it is possible and beneficial to superpose the two types of annealing, displaying amazing numerical results and suggesting a kind of interlacing or synergic behavior - perhaps we could call it an "annealing entanglement". Finally, given the fast advances in commercial quantum annealing processors, it seems sensible to expect that an implementation of the proposed approach using such devices may occur very soon. In order to demonstrate the efficacy of the proposed algorithm, some significant and detailed examples are included in the text, so as to illustrate and clarify the presented ideas.

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.

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>0 holds with red, and the edges for which αik<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.

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.

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.

This paper presents a new approach to a different proof of "Fermat's Last Theorem.” For the proof of the theorem, it is proposed to use a more straightforward geometrical approach. A special family of curves, the Elba curves, is introduced to facilitate the proof. This approach makes the proof easier to comprehend by mathematicians and those interested in the subject.

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.

In the present study, a simple approximation expression is given for the relationship between the period and amplitude of a simple pendulum under magnetic action. The analytical solution presented for the given problem. Two numerical quadrature methods Simpson's and Boole's method were utilized to demonstrate a new approximation of the problem. The results of the numerical quadrature have been compared to the exact solution. Absolute and relative mistakes of the problem have been presented. The Matlab program 2013R has created a numerical method that is used to analyze the outcome, It has been determined that the comparison's outcomes attest to the method's suitability and correctness. Moreover, the results show that numerical solution is suitable for the problem.

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.

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.

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.

The collision avoidance mechanism adopted by the IEEE 802.11 standard is not optimal. The mechanism employs a binary exponential backoff (BEB) algorithm in the medium access control (MAC) layer. Such an algorithm increases the backoff interval whenever a collision is detected to minimize the probability of subsequent collisions. However, the expansion of the backoff interval causes degradation of the radio spectrum utilization (i.e., bandwidth wastage). That problem worsens when the network has to manage the channel access to a dense number of stations, leading to a dramatic decrease in network performance. Furthermore, a wrong backoff setting increases the probability of collisions such that the stations experience numerous collisions before achieving the optimal backoff value. Therefore, to mitigate bandwidth wastage and, consequently, maximize the network performance, this work proposes using reinforcement learning (RL) algorithms, namely Deep Q Learning (DQN) and Deep Deterministic Policy Gradient (DDPG), to tackle such an optimization problem. As for the simulations, the NS-3 network simulator is used along with a toolkit known as NS3-gym, which integrates a reinforcement-learning (RL) framework into NS-3. The results demonstrate that DQN and DDPG have much better performance than BEB for static and dynamic scenarios, regardless of the number of stations. Moreover, the performance difference is amplified as the number of stations increases, with DQN and DDPG showing a 27% increase in throughput with 50 stations compared to BEB. Furthermore, DQN and DDPG presented similar performances.

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.

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.

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.

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 Functional Analysis as well as Topology, we frequently encounter sets, say $X$, that contain elements close to each other. These sets display a defining "finite-ness" property: for all open cover $\mathcal{O}$ of $X$, there exists a finite subcollection $\mathcal{U}\subseteq\mathcal{O}$ such that $\mathcal{U}$ covers $X$. Such spaces $X$ are called $\textbf{compact}$, and the above "finite-ness" property afford us great convenience, because we can always investigate $X$ by investigating its finite open cover $\mathcal{U}$Arzela-

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.

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.

Background: Bangladeshi students from science, technology, engineering, and mathematics (STEM) often struggle with solving many mathematical problems in different pedagogic contexts. They mostly lack the considerable prior learning or strong basics required to cope with the teaching and learning materials used at the undergraduate levels, which leads many students to take readmissions every year. Objective: This research aims at investigating the factors affecting the success and deficit of university undergraduate mathematics students in Bangladesh. The mixed-method research incorporates quantitative and qualitative data analysis on the students' and teachers’ perspectives regarding the issues. The authors focus more on categorizing the reasons influencing effective mathematics pedagogies than on identifying new or unknown causes. Methodology: This study is outlined in three phases. The phases include i. Exploratory qualitative survey ii. Quantitative triangulation survey, iii. Explanatory semi-structured interviews. Findings: First, the qualitative survey exposes the important factors that highlight the student’s success and failure in mathematics. Next, the quantitative data confirm that there are some similarities and dissimilarities between students’ and teachers’ perceptions. Also, the coefficient correlation analysis shows male students lack consistency and passion for study resulting in poor performances. Conversely, female students emphasize the inability to connect mathematical theories to real-life usages, curriculum loads, and unavailable resources as the reasons for underperformance. Finally, the interview data demonstrate the students attribute their failure to inadequate practices, memorizing habits, poor teaching, low motivation, and external distractions. Also, students acknowledge the necessity of steady practice, clear understanding, regular study, and working strategies for successful mathematics education. Teachers emphasize students’ clear concepts, aptitude, motivation, and curiosity for successful learning. Conclusion: This conclusion proposes a fresh start with the local mathematics pedagogic practices by analyzing teacher-student feedback on the success and failure factors impacted by varied individual and contextual elements. The study offers inclusive feedback on the part of both stakeholders. However, an open discussion or interaction between students and teachers might be needed to enhance mutual trust and understanding between them.

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

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

Global optimization is an imperative development of local optimization because there are many problems in artificial intelligence and machine learning requires highly acute solutions over entire domain. There are many methods to resolve the global optimization, which can be classified into three groups such as analytic methods (purely mathematical methods), probabilistic methods, and heuristic methods. Especially, heuristic methods like particle swarm optimization and ant bee colony attract researchers because their effective and practical techniques which are easy to be implemented by computer programming languages. However, these heuristic methods are lacking in theoretical mathematical fundamental. Fortunately, minima distribution establishes a strict mathematical relationship between optimized target function and its global minima. In this research, I try to study minima distribution and apply it into explaining convergence and convergence speed of optimization algorithms. Especially, weak conditions of convergence and monotonicity within minima distribution are drawn so as to be appropriate to practical optimization methods.

Video segmentation is crucial in a variety of practical applications especially in computer visions. Most of recent works in video segmentation are focusing on Deep learning based video segmentation, there are rooms for improvement in respect of the evolutionary algorithms. This paper aims to propose the novel method to video segmentation by using the optimization of segmentation parameters based on ensemble-based random forest and gradient boosting decision tree. The experimental results show Pareto front of segmentation parameters (hue, brightness, luminance, and saturation). Our optimization model yields accuracy: 85% +/-8.85 % (micro average: 85.00 %), average class precision: 84.88%, and average class recall: 85%. We also show the video segmentation results based on our optimization method and compare our results with Kinect-based video segmentation.

The switching game Lights Out and its variants were studied extensively as recreational mathematics problems. The game board of the ordinary Lights Out is a rectangular grid of lights, where each light is either on or off. By clicking a light, the clicked light and its adjacent rectilinear neighbors are toggled. Given an arbitrary initial configuration of lights, the final mission is to “solve” this game by switching off all the lights. Most studies on Lights Out and its variants focused on the solvability of given games or the number of solvable games, but when the game is viewed in a coding-theoretical perspective, more interesting questions with special meanings in coding theory will naturally pop up, such as finding the minimal number of lit lights among all solvable games except the solved game, or finding the minimal number of lit lights that the player can achieve from a given unsolvable game, etc. However, these problems are usually hard to be solved in general in terms of algorithmic complexity. This study considers a natural extension of the Lights Out game, which enlarges the toggle pattern in a way that all the lights in the same row and those in the same column of the clicked light are toggled. This variant of Lights Out is a two-state version of a switching game called Alien Tiles. In this paper, we investigate the properties of the two-state Alien Tiles, and discuss several coding-theoretical problems about this game. Then, we apply this game as an error correction code and investigate its optimality. We also give a brief overview on algorithmic complexity and coding theory for readers who are not familiar with these topics. The purpose of this paper is to propose ways of playing switching games in a think-outside-the-box manner, which benefit the recreational mathematics community.

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.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

We evaluate some binomial cubic Fibonacci sums.

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

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

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

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

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

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

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

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

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