Search

In order to solve the Sylvester equations more efficiently, a new four parameters positive and skew-Hermitian splitting (FPPSS) iterative method is proposed in this paper based on the previous research of the positive and skew-Hermitian splitting (PSS) iterative method. We prove that when coefficient matrix A and B satisfy certain conditions, the FPPSS iterative method is convergent in the parameter&rsquo, s value region. The numerical experiment results show that compared with previous iterative method, the FPPSS iterative method is more effective in terms of iteration number IT and runtime.

Max-plus algebra is the similarity of the classical linear algebra with two binary operations, maximum and addition. The notation Ax = Bx, where A, B are given (interval) matrices, represents (interval) two-sided (max, plus)-linear system. For the solvability of Ax = Bx, there are some pseudopolynomial algorithms, but a polynomial algorithm is still waiting for an appearance. The paper deals with the analysis of solvability of two-sided (max, plus)-linear equations with inexact (interval) data. The purpose of the paper is to get efficient necessary and sufficient conditions for solvability of the interval systems using the property of the solution set of the non-interval system Ax = Bx. The main contribution of the paper is a transformation of weak versions of solvability to either subeigenvector problems or to non-interval two-sided (max, plus)-linear systems and obtaining the equivalent polynomially checked conditions for the strong versions of solvability.

The aim of this paper is to compute the exact solutions and conservation of a generalized (1 + 1) dimensional system. This can be achieved by employing symbolic manipulation software such as Maple, Mathematica, or MATLAB. In theoretical physics and in many scientific applications, the mentioned system naturally arises. Time, space, and scaling transformation symmetries lead to novel similarity reductions and new exact solutions. The solutions obtained include solitary waves and cnoidal and snoidal waves. The familiarity of closed-form solutions of nonlinear ordinary and partial differential equations enables numerical solvers and supports stability analysis. Although many efforts have been dedicated to solving nonlinear evolution equations, there is no unified method. To the best of our knowledge, this is the first time that Lie point symmetry analysis in conjunction with an ansatz method has been applied on this underlying equation. It should also be noted that the methods applied in this paper give a unique solution set that differs from the newly reported solutions. In addition, we derive the conservation laws of the underlying system. It is also worth mentioning that this is the first time that the conservation laws for the equation under study are derived.

The traditional set stability of Boolean networks (BNs) refers to whether all the states can converge to a given state subset. Different from the existing results, the set stability investigated in this paper is whether all states in a given initial set can converge to a given destination set. This paper studies the set stability and set stabilization avoiding undesirable sets of BNs and Boolean control networks (BCNs), respectively. First, by virtue of the semi-tensor product (STP) of matrices, the dynamics of BNs avoiding a given undesirable set are established. Then, the set reachability and set stability of BNs from the initial set to destination set avoiding an undesirable set are investigated, respectively. Furthermore, the set stabilization of BCNs from the initial set to destination set avoiding a given undesirable set are investigated. Finally, a design method for finding the time optimal set stabilizer is proposed, and an example is provided to illustrate the effectiveness of the results.

In this paper, the mixed performance and reachable set of uncertain discrete systems with slow variation interval time-varying delay are considered. The original uncertain discrete systems with interval time-varying delay are first transformed into a switched system. Then, the proposed improved results are used to guarantee the stability and reachable set of the uncertain system with slow variation interval time-varying delay. The mixed performance (H2/H∞) can be derived in the same formulation simultaneously. The design scheme of robust switched control is also developed in this paper. The gains of the controller can be designed and switched to achieve stabilization and mixed performance of the system according to the delay value. Some comparisons with published results are made to show the main contribution of the proposed approach. Finally, some numerical examples are illustrated to show the main results.

Helicopters are extraordinarily complex mechanisms. Such complexity makes it difficult to model, simulate and pilot a helicopter. The present paper proposes a mathematical model of a fantail helicopter type based on Lie-group theory. The present paper first recalls the Lagrange–d’Alembert–Pontryagin principle to describe the dynamics of a multi-part object, and subsequently applies such principle to describe the motion of a helicopter in space. A good part of the paper is devoted to the numerical simulation of the motion of a helicopter, which was obtained through a dedicated numerical method. Numerical simulation was based on a series of values for the many parameters involved in the mathematical model carefully inferred from the available technical literature.

The processing of a sparse matrix is a hot topic in the recommendation system. This paper applies the method of hesitant fuzzy set to study the sparse matrix processing problem. Based on the uncertain factors in the recommendation process, this paper applies hesitant fuzzy set theory to characterize the historical ratings embedded in the recommendation system and studies the data processing problem of the sparse matrix under the condition of a hesitant fuzzy set. The key is to transform the similarity problem of products in the sparse matrix into the similarity problem of two hesitant fuzzy sets by data conversion, data processing, and data complement. This paper further considers the influence of the difference of user ratings on the recommendation results and obtains a user’s recommendation list. On the one hand, the proposed method effectively solves the matrix in the recommendation system, on the other hand, it provides a feasible method for calculating similarity in the recommendation system.

Starting with the interactive relationship between electronic money and household consumption stimuli, this paper deeply analyzes the changes in the behavior of each monetary subject under the impact of electronic money, and establishes a DSGE model based on the three economic sectors of family, commercial bank and central bank under the New Keynesian framework. On this basis, the impact of electronic money on savings, loans, output and the interest rate, and its impact on monetary policy, are described by numerical simulation. The simulation results show that: (1) electronic money has asymmetric effects on savings and loans, but an irrational deviation on households, (2) the influence of electronic money on the interest rate has a reverse effect, and the “inverse adjustment” of the interest rate increases the management difficulty of the micro subject to a certain extent, and affects the effectiveness of monetary policy, (3) the regulatory effect of price monetary policy is better than that of quantitative monetary policy, and electronic money has the effect of its risk restraining impact. Finally, based on the analysis, this paper gives policy recommendations.

This paper deals with the problem of managing the risks of complex systems under targeted attacks. It is usually solved by using Defender–Attacker models or similar ones. However, such models do not consider the influence of the defending system structure on the expected attack outcome. Our goal was to study how the structure of an abstract system affects its integral risk. To achieve this, we considered a situation where the Defender knows the structure of the expected attack and can arrange the elements to achieve a minimum of integral risk. In this paper, we consider a particular case of a simple chain attack structure. We generalized the concept of a local risk function to account for structural effects and found an ordering criterion that ensures the optimal placement of the defending system’s elements inside a given simple chain structure. The obtained result is the first step to formulate the principles of optimally placing system elements within an arbitrarily complex network. Knowledge of these principles, in turn, will allow solving the problems of optimal allocation of resources to minimize the risks of a complex system, considering its structure.

Much applied research uses expert judgment as a primary or additional data source, thus the problem solved in this publication is relevant. Despite the expert’s experience and competence, the evaluation is subjective and has uncertainty in it. There are various reasons for this uncertainty, including the expert’s incomplete competence, the expert’s character and personal qualities, the expert’s attachment to the opinion of other experts, and the field of the task to be solved. This paper presents a new way to use the Bayesian method to reduce the uncertainty of an expert judgment by correcting the expert’s evaluation by the a posteriori mean function. The Bayesian method corrects the expert’s evaluation, taking into account the expert’s competence and accumulated long-term experience. Since the paper uses a continuous case of the Bayesian formula, perceived as a continuous approximation of experts’ evaluations, this is not only the novelty of this work, but also a new result in the theory of the Bayesian method and its application. The paper investigates various combinations of the probability density functions of a priori information and expert error. The results are illustrated by the example of the evaluation of distance learning courses.

The paper is devoted to the comparison of different one-dimensional models of blood flow. In such models, the non-Newtonian property of blood is considered. It is demonstrated that for the large arteries, the small parameter is observed in the models, and the perturbation method can be used for the analytical solution. In the paper, the simplified nonlinear problem for the semi-infinite vessel with constant properties is solved analytically, and the solutions for different models are compared. The effects of the flattening of the velocity profile and hematocrit value on the deviation from the Newtonian model are investigated.

The research paper is devoted to developing a mathematical approach for dealing with time-varying parameters in rolling window logit models for credit risk assessment. Forecasting coefficients yields a better model accuracy than a trivial approach of using computed past statistics parameters for the next time period. In this paper, a new method of dealing with time-varying parameters of scoring models is proposed, which is aimed at computing the default probability of a borrower. It was empirically shown that in a continuously changing economic environment factors’ influence on a target variable is also changing. Therefore, forecasting coefficients yields a better financial result than simply applying parameters obtained by accumulated statistics over past time periods. The paper develops a new theoretical approach, incorporating a combination of the ARIMA class model, the DCC-GARCH model and the state–space model, which is more accurate, than using only the ARIMA model. Rigorous simulation testing is provided to confirm the efficiency of the proposed method.

The paper discusses several control techniques for a class of systems described by fractional order equations. The paper presents the unit frequency criteria that ensure the closed loop control for: Fractional Order Linear Systems, Fractional Order Linear Systems with nonlinear components, Time Delay Fractional Order Linear Systems, Time Delay Fractional Order Linear Systems with nonlinear components. The stability criterion is proposed for the systems composed of fractional order subsystems. These techniques are used in two applications: Soft Exoskeleton Glove Control, studied as a nonlinear model with time delay and Disabled Man-Wheelchair model, analysed as a fractional-order multi-system.

Linear complexity is an important property to measure the unpredictability of pseudo-random sequences. Trace representation is helpful for analyzing cryptography properties of pseudo-random sequences. In this paper, a class of new Ding generalized cyclotomic binary sequences of order two with period pq is constructed based on the new segmentation of Ding Helleseth generalized cyclotomy. Firstly, the linear complexity and minimal polynomial of the sequences are investigated. Then, their trace representation is given. It is proved that the sequences have larger linear complexity and can resist the attack of the Berlekamp–Massey algorithm. This paper also confirms that generalized cyclotomic sequences with good randomness may be obtained by modifying the characteristic set of generalized cyclotomy.

The paper is a reflection on the author’s work with students enrolled in undergraduate and graduate elementary mathematics content and methods courses. Two specific pedagogical issues make up the focus of the paper. The first issue deals with demonstrating to future teachers the diversity of mathematical ideas behind a contextual question asked by a second-grade pupil allowing for multiple solution strategies to be used in addressing the question. The second issue deals with the use of Wolfram Alpha in aiding different mathematical features of this demonstration. The paper is congruous with mathematics teaching standards used across six continents and illustrated by reflective comments of the author’s students regarding their mathematics teacher education experiences. Teaching ideas shared in the paper may be of interest to instructors who want to explore elementary mathematics in depth with teacher candidates.

Pension funds became a fundamental part of financial security in pensioners’ lives, guaranteeing stable income throughout the years and reducing the chance of living below the poverty level. However, participating in a pension accumulation scheme does not ensure financial safety at an older age. Various pension funds exist that result in different investment outcomes ranging from high return rates to underperformance. This paper aims to demonstrate alternative clustering of Latvian second pillar pension funds, which may help system participants make long-range decisions. Due to the demonstrated ability to extract meaningful features from raw time-series data, the convolutional neural network was chosen as a pension fund feature extractor that was used prior to the clustering process. In this paper, pension fund cluster analysis was performed using trained (on daily stock prices) convolutional neural network feature extractors. The extractors were combined with different clustering algorithms. The feature extractors operate using the black-box principle, meaning the features they learned to recognize have low explainability. In total, 32 models were trained, and eight different clustering methods were used to group 20 second-pillar pension funds from Latvia. During the analysis, the 12 best-performing models were selected, and various cluster combinations were analyzed. The results show that funds from the same manager or similar performance measures are frequently clustered together.

Service-oriented architecture (SOA) has emerged as a flexible software design style. SOA focuses on the development, use, and reuse of small, self-contained, independent blocks of code called web services that communicate over the network to perform a certain set of simple tasks. Web services are integrated as composite services to offer complex tasks and to provide the expected services and behavior in addition to fulfilling the clients’ requests according to the service-level agreement (SLA). Web service selection and composition problems have been a significant area of research to provide the expected quality of service (QoS) and to meet the clients’ expectations. This research paper presents a hybrid web service composition model to solve web service selection and composition problems and to optimize web services’ resource utilization using k-means clustering and knapsack algorithms. The proposed model aims to maximize the service compositions’ QoS and minimize the number of web services integrated within the service composition using the knapsack algorithm. Additionally, this paper aims to track the service compositions’ QoS attributes by evaluating and tracking the web services’ QoS using the reward function and, accordingly, use the k-means algorithm to decide to which cluster the web service belongs. The experimental results on a real dataset show the superiority and effectiveness of the proposed algorithm in comparison with the results of the state–action–reward–state–action (SARSA) and multistage forward search (MFS) algorithms. The experimental results show that the proposed model reduces the average time of the web service selection and composition processes to 37.02 s in comparison to 47.03 s for the SARSA algorithm and 42.72 s for the MFS algorithm. Furthermore, the average of web services’ resource utilization results increased by 4.68% using the proposed model in comparison to the resource utilization by the SARSA and MFS algorithms. In addition, the experimental results showed that the average number of service compositions using the proposed model improved by 26.04% compared with the SARSA and MFS algorithms.

The covariance allocation principle is one of the most widely used capital allocation principles in practice. Risks change over time, so capital risk allocations should be time-dependent. In this paper, we propose a dynamic covariance capital allocation principle based on the variance-covariance of risks that change over time. The conditional correlation of risks is modeled by means of a dynamic conditional correlation (DCC) model. Unlike the static approach, we show that in our dynamic capital allocation setting, the distribution of risk capital allocations can be estimated, and the expected future allocations of capital can be predicted, providing a deeper understanding of the stochastic multivariate behavior of risks. The methodology presented in the paper is illustrated with an example involving the investment risk in a stock portfolio.

Last decades have witnessed that exposure to business activities, through family and direct experience, positively influences students’ entrepreneurial intention (EI). The paper aims to present and analyze the relationship between business experience (BE) and EI in the case of final-year university students, specialized in business administration and marketing, resorting to this end to a standardized questionnaire, developed by the authors and finalized following a pilot survey. The hypotheses considered, centered on the study of the existence of any contingency or correlational relationship between the BE of students, and their EI, based on related coefficients applicable in such case, have been confirmed, in line with similar studies. Theoretically, this paper contributes to the enrichment of the literature on students’ EI in higher education institutions (HEIs). Practically, students’ EI can be stimulated and encouraged by a deeper involvement of HEIs in entrepreneurship education, thereby creating a challenging entrepreneurial academic environment through a plethora of measures, such as establishing university spin-offs and closer relationships with their specific external stakeholders (e.g., entrepreneurs, businessmen).

The paper deals with the problem of developing a multi-output soft sensor for the industrial reactive distillation process of methyl tert-butyl ether production. Unlike the existing soft sensor approaches, this paper proposes using a soft sensor with filters to predict model errors, which are then taken into account as corrections in the final predictions of outputs. The decomposition of the problem of optimal estimation of time delays is proposed for each input of the soft sensor. Using the proposed approach to predict the concentrations of methyl sec-butyl ether, methanol, and the sum of dimers and trimers of isobutylene in the output product in a reactive distillation column was shown to improve the results by 32%, 67%, and 9.5%, respectively.

One of the famous third-order iterative methods for finding simultaneously all the zeros of a polynomial was introduced by Ehrlich in 1967. In this paper, we construct a new family of high-order iterative methods as a combination of Ehrlich’s iteration function and an arbitrary iteration function. We call these methods Ehrlich’s methods with correction. The paper provides a detailed local convergence analysis of presented iterative methods for a large class of iteration functions. As a consequence, we obtain two types of local convergence theorems as well as semilocal convergence theorems (with computer verifiable initial condition). As special cases of the main results, we study the convergence of several particular iterative methods. The paper ends with some experiments that show the applicability of our semilocal convergence theorems.

The paper presents an analytical solution for the centric viscoelastic impact of two smooth balls. The contact period has two phases, compression and restitution, delimited by the moment corresponding to maximum deformation. The motion of the system is described by a nonlinear Hunt–Crossley equation that, when compared to the linear model, presents the advantage of a hysteresis loop closing in origin. There is only a single available equation obtained from the theorem of momentum. In order to solve the problem, in the literature, there are accepted different supplementary hypotheses based on energy considerations. In the present paper, the differential equation is written under a convenient form, it is shown that it can be integrated and a first integral is found—this being the main asset of the work. Then, all impact parameters can be calculated. The effect of coefficient of restitution upon all collision characteristics is emphasized, presenting importance for the compliant materials, in the domain of small coefficients of restitution. The results (variations of approach, velocity, force vs. time and hysteresis loop) are compared to two models due to Lankarani and Flores. For quasi-elastic collisions, the results are practically the same for the three models. For smaller values of the coefficient of restitution, the results of the present paper are in good agreement only to the Flores model. The simplified algorithm for the calculus of viscoelastic impact parameters is also presented. This algorithm avoids the large calculus volume required by solving the transcendental equations and definite integrals present in the mathematical model. The method proposed, based on the viscoelastic model given by Hunt and Crossley, can be extended to the elasto–visco–plastic nonlinear impact model.

In some previous works, two of the authors introduced a technique to design high-order numerical methods for one-dimensional balance laws that preserve all their stationary solutions. The basis of these methods is a well-balanced reconstruction operator. Moreover, they introduced a procedure to modify any standard reconstruction operator, like MUSCL, ENO, CWENO, etc., in order to be well-balanced. This strategy involves a non-linear problem at every cell at every time step that consists in finding the stationary solution whose average is the given cell value. In a recent paper, a fully well-balanced method is presented where the non-linear problems to be solved in the reconstruction procedure are interpreted as control problems. The goal of this paper is to introduce a new technique to solve these local non-linear problems based on the application of the collocation RK methods. Special care is put to analyze the effects of computing the averages and the source terms using quadrature formulas. A general technique which allows us to deal with resonant problems is also introduced. To check the efficiency of the methods and their well-balance property, they have been applied to a number of tests, ranging from easy academic systems of balance laws consisting of Burgers equation with some non-linear source terms to the shallow water equations—without and with Manning friction—or Euler equations of gas dynamics with gravity effects.

The paper discusses the problem of performance and timing parameters with respect to the validation of digital instrumentation and control systems (I&amp, C). Statistical methods often implicitly assume that the probability distribution law of the estimated parameters is close to normal. Thus, the confidence intervals for the parameter are determined on the grounds of this assumption. However, we encountered cases when the delay distribution law in I&amp, C is not normal. In these cases, we used the non-statistical network calculus method for time parameters estimation. The network calculus method is well elaborated for lossless digital system models with seamless processing algorithm depending only on data volume. We consider the extension of the method to the case of I&amp, C systems with considerable changes in the data flow and content-dependent processing disciplines. The model is restricted to systems with cyclic processing algorithms and fast network connections. Network calculus describes the data flow and system parameters in terms of flow envelopes and service curves that are generally unknown in advance. In this paper, we define equations that allow the calculation of these characteristics from experimental data. The correspondence of the Network Calculus and classical statistical estimation methods is discussed. Additionally, we give an example of model application to a real I&amp, C system.

Games of inspection and corruption are well developed in the game-theoretic literature. However, there are only a few publications that approach these problems from the evolutionary point of view. In previous papers of this author, a generalization of the replicator dynamics of the evolutionary game theory was suggested for inspection modeling, namely the pressure and resistance framework, where a large pool of small players plays against a distinguished major player and evolves according to certain myopic rules. In this paper, we develop this approach further in a setting of the two-level hierarchy, where a local inspector can be corrupted and is further controlled by the higher authority (thus combining the modeling of inspection and corruption in a unifying setting). Mathematical novelty arising in this investigation involves the analysis of the generalized replicator dynamics (or kinetic equation) with switching, which occurs on the “efficient frontier of corruption”. We try to avoid parameters that are difficult to observe or measure, leading to some clear practical consequences. We prove a result that can be called the “principle of quadratic fines”: We show that if the fine for violations (both for criminal businesses and corrupted inspectors) is proportional to the level of violations, the stable rest points of the dynamics support the maximal possible level of both corruption and violation. The situation changes if a convex fine is introduced. In particular, starting from the quadratic growth of the fine function, one can effectively control the level of violations. Concrete settings that we have in mind are illegal logging, the sales of products with substandard quality, and tax evasion.

In this paper, we consider fractional ordinary differential equations and the fractional Euler–Poisson–Darboux equation with fractional derivatives in the form of a power of the Bessel differential operator. Using the technique of the Meijer integral transform and its modification, fundamental solutions to these equations are derived in terms of the Fox–Wright function, the Fox H-function, and their particular cases. We also provide some explicit formulas for the solutions to the corresponding initial-value problems in terms of the generalized convolutions introduced in this paper.

The paper presents k-version of the finite element method for boundary value problems (BVPs) and initial value problems (IVPs) in which global differentiability of approximations is always the result of the union of local approximations. The higher order global differentiability approximations (HGDA/DG) are always p-version hierarchical that permit use of any desired p-level without effecting global differentiability. HGDA/DG are true Ci, Cij, Cijk, hence the dofs at the nonhierarchical nodes of the elements are transformable between natural and physical coordinate spaces using calculus. This is not the case with tensor product higher order continuity elements discussed in this paper, thus confirming that the tensor product approximations are not true Ci, Cijk, Cijk approximations. It is shown that isogeometric analysis for a domain with more than one patch can only yield solutions of class C0. This method has no concept of finite elements and local approximations, just patches. It is shown that compariso of this method with k-version of the finite element method is meaningless. Model problem studies in R2 establish accuracy and superior convergence characteristics of true Cijp-version hierarchical local approximations presented in this paper over tensor product approximations. Convergence characteristics of p-convergence, k-convergence and pk-convergence are illustrated for self adjoint, non-self adjoint and non-linear differential operators in BVPs. It is demonstrated that h, p and k are three independent parameters in all finite element computations. Tensor product local approximations and other published works on k-version and their limitations are discussed in the paper and are compared with present work.

After the death of Peter Wynn in December 2017, manuscript documents he left came to our knowledge. They concern continued fractions, rational (Padé) approximation, Thiele interpolation, orthogonal polynomials, moment problems, series, and abstract algebra. The purpose of this paper is to analyze them and to make them available to the mathematical community. Some of them are in quite good shape, almost finished, and ready to be published by anyone willing to check and complete them. Others are rough notes, and need to be reworked. Anyway, we think that these works are valuable additions to the literature on these topics and that they cannot be left unknown since they contain ideas that were never exploited. They can lead to new research and results. Two unpublished papers are also mentioned here for the first time.

This paper presents a new method of steganography based on a combination of Catalan objects and Voronoi–Delaunay triangulation. Two segments are described within the proposed method. The first segment describes the process of embedding data and generating a complex stego key. The second segment explains the extraction of a hidden message. The main goal of this paper is to transfer a message via the Internet (or some other medium) using an image so that the image remains absolutely unchanged. In this way, we prevented the potential attacker from noticing some secret message hidden in that picture. Additionally, the complex stego key consists of three completely different parts (the image, the encrypted Delaunay triangulation, and the array Rk in Base64 code), which are very difficult to relate with each other. Finally, a few security analyses of the proposed method are conducted, as well as the corresponding steganalysis.

Power electronic converters are mathematically represented by a system of ordinary differential equations discontinuous right-hand side that does not verify the conditions of the Cauchy-Lipschitz Theorem. More generally, for the properties that characterize their discontinuous behavior, they represent a particular class of systems on which little has been investigated over the years. The purpose of the paper is to prove the existence of at least one global solution in Filippov’s sense to the Cauchy problem related to the mathematical model of a power converter and also to calculate the error in norm between this solution and the integral of its averaged approximation. The main results are the proof of this theorem and the analytical formulation that provides to calculate the cited error. The demonstration starts by a proof of local existence provided by Filippov himself and already present in the literature for a particular class of systems and this demonstration is generalized to the class of electronic power converters, exploiting the non-chattering property of this class of systems. The obtained results are extremely useful for estimating the accuracy of the averaged model used for analysis or control of the effective system. In the paper, the goodness of the analytical proof is supported by experimental tests carried out on a converter prototype representing the class of power electronics converter.

In this paper, we introduce the concept of n-dimensional Diamond-Alpha integral on time scales. In particular, it transforms into multiple Delta, Nabla and mixed integrals by taking different values of alpha. Some of its properties are explored, and the relationship between it and the multiple mixed integral is provided. As an application, we establish some weighted Ostrowski type inequalities through the new integral. These new inequalities expand some known inequalities in the monographs and papers, and in addition, furnish some other interesting inequalities. Examples of Ostrowski type inequalities are posed in detail at the end of the paper.

The switched reluctance machine (SRM) design is different from the design of most of other machines. SRM has many design parameters that have non-linear relationships with the performance indices (i.e., average torque, efficiency, and so forth). Hence, it is difficult to design SRM using straight forward equations with iterative methods, which is common for other machines. Optimization techniques are used to overcome this challenge by searching for the best variables values within the search area. In this paper, the optimization of SRM design is achieved using multi-objective Jaya algorithm (MO-Jaya). In the Jaya algorithm, solutions are moved closer to the best solution and away from the worst solution. Hence, a good intensification of the search process is achieved. Moreover, the randomly changed parameters achieve good search diversity. In this paper, it is suggested to also randomly change best and worst solutions. Hence, better diversity is achieved, as indicated from results. The optimization with the MO-Jaya algorithm was made for 8/6 and 6/4 SRM. Objectives used are the average torque, efficiency, and iron weight. The results of MO-Jaya are compared with the results of the non-dominated sorting genetic algorithm (NSGA-II) for the same conditions and constraints. The optimization program is made in Lua programming language and executed by FEMM4.2 software. The results show the success of the approach to achieve better objective values, a broad search, and to introduce a variety of optimal solutions.

In previous papers, a technique has been suggested to avoid order reduction when integrating initial boundary value problems with several kinds of exponential methods. The technique implies in principle to calculate additional terms at each step from those already necessary without avoiding order reduction. The aim of the present paper is to explain the surprising result that, many times, in spite of having to calculate more terms at each step, the computational cost of doing it through Krylov methods decreases instead of increases. This is very interesting since, in that way, the methods improve not only in terms of accuracy, but also in terms of computational cost.

The actual behavior of welded T-junctions in tubular structures depends strongly on the topology of the junction at the joint level. In finite element analysis, beam-type elements are usually employed due to their simplicity and low computational cost, even though they cannot reproduce the joints topologies and characteristics. To adjust their behavior to a more realistic situation, elastic elements can be introduced at the joint level, whose characteristics must be determined through costly validations. This paper studies the optimization and implementation of the validation data, through the creation of an optimal surrogate model based on neural networks, leading to a model that predicts the stiffness of elastic elements, introduced at the joint level based on available data. The paper focuses on how the neural network should be chosen, when training data is very limited and, more importantly, which of the available data should be used for training and which for verification. The methodology used is based on a Monte Carlo analysis that allows an exhaustive study of both the network parameters and the distribution and choice of the limited data in the training set to optimize its performance. The results obtained indicate that the use of neural networks without a careful methodology in this type of problems could lead to inaccurate results. It is also shown that a conscientious choice of training data, among the data available in the problem of choice of elastic parameters for T-junctions in finite elements, is fundamental to achieve functional surrogate models. Sitio web de la revista (Consulta: 30-07-2021)

Gravity and flexibility will cause fluctuations of the rotation angle in the servo system for flexible manipulators. The fluctuation will seriously affect the motion accuracy of end-effectors. Therefore, this paper adopts a control method combining the RBF (Radial Basis Function) neural network and pole placement strategy to suppress the rotation angle fluctuations. The RBF neural network is used to identify uncertain items caused by the manipulator’s flexibility and the time-varying characteristics of dynamic parameters. Besides, the pole placement strategy is used to optimize the PD (Proportional Differential) controller’s parameters to improve the response speed and stability. Firstly, a dynamic model of flexible manipulators considering gravity is established based on the assumed mode method and Lagrange’s principle. Then, the system’s control characteristics are analyzed, and the pole placement strategy optimizes the parameters of the PD controllers. Next, the control method based on the RBF neural network is proposed, and the Lyapunov stability theory demonstrates stability. Finally, numerical analysis and control experiments prove the effectiveness of the control method proposed in this paper. The means and standard deviations of rotation angle error are reduced by the control method. The results show that the control method can effectively reduce the rotation angle error and improve motion accuracy.

In this paper we give some common fixed point theorems for Ćirić type operators in complex valued b-metric spaces. Also, some corollaries under this contraction condition are obtained. Our results extend and generalize the results of Hammad et al. In the second part of the paper, in order to strengthen our main results, an illustrative example and some applications are given.

This paper describes a number of simple but quite effective methods for constructing exact solutions of nonlinear partial differential equations that involve a relatively small amount of intermediate calculations. The methods employ two main ideas: (i) simple exact solutions can serve to construct more complex solutions of the equations under consideration and (ii) exact solutions of some equations can serve to construct solutions of other, more complex equations. In particular, we propose a method for constructing complex solutions from simple solutions using translation and scaling. We show that in some cases, rather complex solutions can be obtained by adding one or more terms to simpler solutions. There are situations where nonlinear superposition allows us to construct a complex composite solution using similar simple solutions. We also propose a few methods for constructing complex exact solutions to linear and nonlinear PDEs by introducing complex-valued parameters into simpler solutions. The effectiveness of the methods is illustrated by a large number of specific examples (over 30 in total). These include nonlinear heat equations, reaction–diffusion equations, wave type equations, Klein–Gordon type equations, equations of motion through porous media, hydrodynamic boundary layer equations, equations of motion of a liquid film, equations of gas dynamics, Navier–Stokes equations, and some other PDEs. Apart from exact solutions to `ordinary’ partial differential equations, we also describe some exact solutions to more complex nonlinear delay PDEs. Along with the unknown function at the current time, u=u(x,t), these equations contain the same function at a past time, w=u(x,t−τ), where τ&gt, 0 is the delay time. Furthermore, we look at nonlinear partial functional-differential equations of the pantograph type, which, in addition to the unknown u=u(x,t), also contain the same functions with dilated or contracted arguments, w=u(px,qt), where p and q are scaling parameters. We propose an efficient approach to construct exact solutions to such functional-differential equations. Some new exact solutions of nonlinear pantograph-type PDEs are presented. The methods and examples in this paper are presented according to the principle “from simple to complex”.

Asphalt production plants play an important role in the field of civil engineering, but also in the entire economic system since the construction of roads enables uninterrupted functioning within it. In this paper, the ranking of asphalt production plants on the territory of the Autonomous Province of Vojvodina has been performed. The modern economy needs contemporary models and methods to solve complicated MCDM problems and, for these purposes, it has been developed an original Interval Rough Number (IRN) Multi-criteria decision-making (MCDM) model that implies an extension of two methods belonging to the field with interval rough numbers. After forming a list of eight most significant criteria for assessing the efficiency of asphalt production plants, the Interval Rough Number PIvot Pairwise RElative Criteria Importance Assessment (IRN PIPRECIA) method was developed to determine the significance of the criteria. A total of 21 locations with asphalt mixture installation were considered. For that purpose, seven asphalt production plants were included, and for their ranking, the IRN EDAS (Evaluation based on Distance from Average Solution) method was created. The aim of this paper is to develop a novel interval rough model that can be useful for determining the efficiency of asphalt production plants. Averaging in group decision-making (GDM) for both methods was performed using an IRN Dombi weighted geometric averaging (IRNDWGA) aggregator. The obtained results show that (A15) Ruma (SP)–Mačvanska Mitrovica–Zasavica has the best characteristics out of the set of locations considered in this study. However, Alternatives A6 and A19 are also variants with remarkably good characteristics since there is very little difference in values compared to the first-ranked alternative. Also, the obtained results have shown that the developed model is applicable, which is proven through a comparative analysis.

In this paper, we present a numerical solution of a two-phase fractional Stefan problem with time derivative described in the Caputo sense. In the proposed algorithm, we use a special case of front-fixing method supplemented by the iterative procedure, which allows us to determine the position of the moving boundary. The presented method is an extension of a front-fixing method for the one-phase problem to the two-phase case. The novelty of the method is a new discretization of the partial differential equation dedicated to the second phase, which is carried out by introducing a new spatial variable immobilizing the moving boundary. Then, the partial differential equation is transformed to an equivalent integro-differential equation, which is discretized on a homogeneous mesh of nodes with a constant spatial and time step. A new convergence criterion is also proposed in the iterative algorithm determining the location of the moving boundary. The motivation for the development of the method is that the analytical solution of the considered problem is impossible to calculate in some cases, as can be seen in the figures in the paper. Moreover, the change of the boundary conditions makes obtaining a closed analytical solution very problematic. Therefore, creating new numerical methods is very valuable. In the final part, we also present some examples illustrating the comparison of the analytical solution with the results received by the proposed numerical method.

This paper is concerned with the orthogonal polynomials. Upper and lower bounds of Legendre polynomials are obtained. Furthermore, entropies associated with discrete probability distributions is a topic considered in this paper. Bounds of the entropies which improve some previously known results are obtained in terms of inequalities. In order to illustrate the results obtained in this paper and to compare them with other results from the literature some graphs are provided.

This paper described a method to design a limit-cycle suppressor. The dithering technique was used to eliminate self-sustained oscillations or limit cycles. Otherwise, the Dual Input Describing Function (DIDF) method was applied to design dither parameters and analyze the existence of limit cycles. This method was done in a nonlinear system with relay nonlinearity using three standard dither signals, namely sine, triangle, and square waves. The aim of choosing varying dithers was to investigate the effect of dither shapes and the minimum amplitude required for the quenching strategy. First, the possibility and amplitude of limit cycles were determined graphically on the DIDF curve. Then, the minimum amplitude of dither was calculated based on the DIDF analysis. Finally, a simulation was built to verify the analytical work using a digital computer. The simulation results were related to the analysis results. It was evident that the dithering technique is a simple way to suppress limit cycles in a nonlinear system. This paper also presented that dither is an amplitude function, and square-wave dither has the minimum amplitude to quench limit cycles.

Since the 17-th century the concepts of differentiability and multiple differentiability have become fundamental to mathematical analysis. By now we have the generally accepted definition of what a multiply differentiable function f:Rn&rarr, R is (in this paper we call it standard). This definition is sufficient to prove some of the key properties of a multiply differentiable function: the Generalized Young&rsquo, s theorem (a theorem on the independence of partial derivatives of higher orders of the order of differentiation) and Taylor&rsquo, s theorem with Peano remainder. Another definition of multiple differentiability, actually more general in the sense that it is suitable for the infinite-dimensional case, belongs to Fr&eacute, chet. It turns out, that the standard definition and the Fr&eacute, chet definition are equivalent for functions f:Rn&rarr, R. In this paper we introduce a definition (which we call weak) of multiple differentiability of a function f:Rn&rarr, R, which is not equivalent to the above-mentioned definitions and is in fact more general, but at the same time is sufficient enough to prove the Generalized Young&rsquo, s and Taylor&rsquo, s theorems.

A fuzzy least squares estimator in the multiple with fuzzy-input&ndash, fuzzy-output linear regression model is considered. The paper provides a formula for the L2 estimator of the fuzzy regression model. This paper proposes several operations for fuzzy numbers and fuzzy matrices with fuzzy components and discussed some algebraic properties that are needed to use for proving theorems. Using the proposed operations, the formula for the variance, provided and this paper, proves that the estimators have several important optimal properties and asymptotic properties: they are Best Linear Unbiased Estimator (BLUE), asymptotic normality and strong consistency. The confidence regions of the coefficient parameters and the asymptotic relative efficiency (ARE) are also discussed. In addition, several examples are provided including a Monte Carlo simulation study showing the validity of the proposed theorems.

The present paper aims to construct an inequality for bi-warped product submanifolds in a special class of almost metric manifolds, namely nearly Kenmotsu manifolds. As geometric applications, some exceptional cases that generalized several other inequalities are discussed. We also deliberate some applications in the context of mathematical physics and derive a new relation between the Dirichlet energy and the second fundamental form. Finally, we present a constructive remark at the end of this paper which shows the motive of the study.

In this paper a new method called the least squares differential quadrature method (LSDQM) is introduced as a straightforward and efficient method to compute analytical approximate polynomial solutions for nonlinear partial differential equations with fractional time derivatives. LSDQM is a combination of the differential quadrature method and the least squares method and in this paper it is employed to find approximate solutions for a very general class of nonlinear partial differential equations, wherein the fractional derivatives are described in the Caputo sense. The paper contains a clear, step-by-step presentation of the method and a convergence theorem. In order to emphasize the accuracy of LSDQM we included two test problems previously solved by means of other, well-known methods, and observed that our solutions present not only a smaller error but also a much simpler expression. We also included a problem with no known exact solution and the solutions computed by LSDQM are in good agreement with previous ones.

This paper proposes an optimization model for selecting a larger subsample that improves the representativeness of a simple random sample previously obtained from a population larger than the population of interest. The problem formulation involves convex mixed-integer nonlinear programming (convex MINLP) and is, therefore, NP-hard. However, the solution is found by maximizing the size of the subsample taken from a stratified random sample with proportional allocation and restricting it to a p-value large enough to achieve a good fit to the population of interest using Pearson&rsquo, s chi-square goodness-of-fit test. The paper also applies the model to the Continuous Sample of Working Lives (CSWL), which is a set of anonymized microdata containing information on individuals from Spanish Social Security records and the results prove that it is possible to obtain a larger subsample from the CSWL that (far) better represents the pensioner population for each of the waves analyzed.

In this paper, we introduce a new construction method of a fuzzy implication from n increasing functions gi:0,1⟶0,&infin, (g0=0) (i=1,2,&hellip, n, n &isin, N) and n+1 fuzzy negations Ni (i=1,2,&hellip, n+1, n &isin, N). Imagine that there are plenty of combinations between n increasing functions gi and n+1 fuzzy negations Ni in order to produce new fuzzy implications. This method allows us to use at least two fuzzy negations Ni and one increasing function g in order to generate a new fuzzy implication. Choosing the appropriate negations, we can prove that some basic properties such as the exchange principle (EP), the ordering property (OP), and the law of contraposition with respect to N are satisfied. The worth of generating new implications is valuable in the sciences such as artificial intelligence and robotics. In this paper, we have found a novel method of generating families of implications. Therefore, we would like to believe that we have added to the literature one more source from which we could choose the most appropriate implication concerning a specific application. It should be emphasized that this production is based on a generalization of an important form of Yager&rsquo, s implications.

In this paper, a new method for determining weight coefficients by forming a non-decreasing series at criteria significance levels (the NDSL method) is presented. The NDLS method includes the identification of the best criterion (i.e., the most significant and most influential criterion) and the ranking of criteria in a decreasing series from the most significant to the least significant criterion. Criteria are then grouped as per the levels of significance within the framework of which experts express their preferences in compliance with the significance of such criteria. By employing this procedure, fully consistent results are obtained. In this paper, the advantages of the NDSL model are singled out through a comparison with the Best Worst Method (BWM) and Analytic Hierarchy Process (AHP) models. The advantages include the following: (1) the NDSL model requires a significantly smaller number of pairwise comparisons of criteria, only involving an n &minus, 1 comparison, whereas the AHP requires an n(n &minus, 1)/2 comparison and the BWM a 2n &minus, 3 comparison, (2) it enables us to obtain reliable (consistent) results, even in the case of a larger number of criteria (more than nine criteria), (3) the NDSL model applies an original algorithm for grouping criteria according to the levels of significance, through which the deficiencies of the 9-degree scale applied in the BWM and AHP models are eliminated. By doing so, the small range and inconsistency of the 9-degree scale are eliminated, (4) while the BWM includes the defining of one unique best/worst criterion, the NDSL model eliminates this limitation and gives decision-makers the freedom to express the relationships between criteria in accordance with their preferences. In order to demonstrate the performance of the developed model, it was tested on a real-world problem and the results were validated through a comparison with the BWM and AHP models.

In this paper, we introduce two new modified inertial Mann Halpern and viscosity algorithms for solving fixed point problems. We establish strong convergence theorems under some suitable conditions. Finally, our algorithms are applied to split feasibility problem, convex feasibility problem and location theory. The algorithms and results presented in this paper can summarize and improve corresponding results previously known in this area., 11 pages, 4 Figures

This paper is devoted to the study of the stability of finite-dimensional distribution of time-inhomogeneous, discrete-time Markov chains on a general state space. The main result of the paper provides an estimate for the absolute difference of finite-dimensional distributions of a given time-inhomogeneous Markov chain and its perturbed version. By perturbation, we mean here small changes in the transition probabilities. Stability estimates are obtained using the coupling method.