Search results

This study aims to investigate the most effective approach for governments and enterprises to combat desertification by considering the governance cycle. The focus is on understanding how the government can incentivize enterprises to actively engage in desertification combat efforts.

Both the government and the enterprise are treated as rational entities, making strategic choices for joint participation in combating desertification. Recognizing the dynamic nature of the desertification combat area, differential game models are employed to identify the optimal mode for combating desertification.

The findings underscore the significant influence of the governance cycle duration on the selection of desertification combat modes for government and enterprise. A cooperative mode is best suited to a short governance cycle, while an ecological subsidy mode is optimal for a longer cycle. Enhancing governance technology and shortening the governance cycle are conducive to combating desertification. Reducing taxes alone may not be an effective control strategy; rather, the government can better motivate enterprises by adopting tax rate policies aligned with the chosen governance mode.

This research contributes by elucidating the impact mechanism of the government cycle’s length on the desertification combat process. The results may offer valuable insights for governments in formulating strategies to encourage corporate participation in combating desertification and provide theoretical support for selecting optimal desertification combat modes.

Our result of this paper aims to indicate that the beta pricing formula could be applied in a long-term model setting as well.

In this paper, we show that the capital asset pricing model can be derived from a three-period general equilibrium model.

We show that our extended model yields a Pareto efficient outcome.

The capital asset pricing model (CAPM) model can be used for pricing long-lived assets.

Long-term modelling and sustainability can be modelled in our setting.

Our results were only known for two periods. The extension to 3 periods opens up a large scope of applicational possibilities in asset pricing, behavioural analysis and long-term efficiency.

The purpose of the present article is to obtain the similarity solution for the shock wave generated by a piston propagating in a self-gravitating nonideal gas under the impact of azimuthal magnetic field for adiabatic and isothermal flows.

The Lie group theoretic method given by Sophus Lie is used to obtain the similarity solution in the present article.

Similarity solution with exponential law shock path is obtained for both ideal and nonideal gas cases. The effects on the flow variables, density ratio at the shock front and shock strength by the variation of the shock Cowling number, adiabatic index of the gas, gravitational parameter and nonidealness parameter are investigated. The shock strength decreases with an increase in the shock Cowling number, nonidealness parameter and adiabatic index, whereas the strength of the shock wave increases with an increase in gravitational parameter.

Propagation of shock wave with spherical geometry in a self-gravitating nonideal gas under the impact of azimuthal magnetic field for adiabatic and isothermal flows has not been studied by any author using the Lie group theoretic method.

The need for precise synthesis of customized designs has resulted in the development of advanced coating processes for modern nanomaterials. Achieving accuracy in these processes requires a deep understanding of thermophysical behavior, rheology and complex chemical reactions. The manufacturing flow processes for these coatings are intricate and involve heat and mass transfer phenomena. Magnetic nanoparticles are being used to create intelligent coatings that can be externally manipulated, making them highly desirable. In this study, a Keller box calculation is used to investigate the flow of a coating nanofluid containing a viscoelastic polymer over a circular cylinder.

The rheology of the coating polymer nanofluid is described using the viscoelastic model, while the effects of nanoscale are accounted for by using Buongiorno’s two-component model. The nonlinear PDEs are transformed into dimensionless PDEs via a nonsimilar transformation. The dimensionless PDEs are then solved using the Keller box method.

The transport phenomena are analyzed through a comprehensive parametric study that investigates the effects of various emerging parameters, including thermal radiation, Biot number, Eckert number, Brownian motion, magnetic field and thermophoresis. The results of the numerical analysis, such as the physical variables and flow field, are presented graphically. The momentum boundary layer thickness of the viscoelastic polymer nanofluid decreases as fluid parameter increases. An increase in mixed convection parameter leads to a rise in the Nusselt number. The enhancement of the Brinkman number and Biot number results in an increase in the total entropy generation of the viscoelastic polymer nanofluid.

Intelligent materials rely heavily on the critical characteristic of viscoelasticity, which displays both viscous and elastic effects. Viscoelastic models provide a comprehensive framework for capturing a range of polymeric characteristics, such as stress relaxation, retardation, stretching and molecular reorientation. Consequently, they are a valuable tool in smart coating technologies, as well as in various applications like supercapacitor electrodes, solar collector receivers and power generation. This study has practical applications in the field of coating engineering components that use smart magnetic nanofluids. The results of this research can be used to analyze the dimensions of velocity profiles, heat and mass transfer, which are important factors in coating engineering. The study is a valuable contribution to the literature because it takes into account Joule heating, nonlinear convection and viscous dissipation effects, which have a significant impact on the thermofluid transport characteristics of the coating.

The momentum boundary layer thickness of the viscoelastic polymer nanofluid decreases as the fluid parameter increases. An increase in the mixed convection parameter leads to a rise in the Nusselt number. The enhancement of the Brinkman number and Biot number results in an increase in the total entropy generation of the viscoelastic polymer nanofluid. Increasing the strength of the magnetic field promotes an increase in the density of the streamlines. An increase in the mixed convection parameter results in a decrease in the isotherms and isoconcentration.

This paper focuses on the unconditionally optimal error estimates of a linearized second-order scheme for a nonlocal nonlinear parabolic problem. The first step of the scheme is based on Crank–Nicholson method while the second step is the second-order BDF method.

A rigorous error analysis is done, and optimal L² error estimates are derived using the error splitting technique. Some numerical simulations are presented to confirm the study’s theoretical analysis.

Optimal L² error estimates and energy norm.

The goal of this research article is to present and establish the unconditionally optimal error estimates of a linearized second-order BDF finite element scheme for the reaction-diffusion problem. An optimal error estimate for the proposed methods is derived by using the temporal-spatial error splitting techniques, which split the error between the exact solution and the numerical solution into two parts, that is, the temporal error and the spatial error. Since the spatial error is not dependent on the time step, the boundedness of the numerical solution in L∞-norm follows an inverse inequality immediately without any restriction on the grid mesh.

This paper aims to address a pollution-routing problem with one general period of congestion (PRP-1GPC), where the start and finish times of this period can be set freely.

In this paper, three sets of decision variables are optimized, namely, travel speeds before and after congestion and departure times on given routes, aiming to minimize total cost including green-house gas emissions, fuel consumption and driver wages. A two-phase algorithm is introduced to solve this problem. First, an adaptive large neighborhood search heuristic is used where new removal and insertion operators are developed. Second, an analysis of optimal speed before congestion is presented, and a tailored speed-and-departure-time optimization algorithm considering congestion is proposed by obtaining the best node to be served first over the congested period.

The results show that the newly developed operator of congested service-time insertion with noise is generally used more than other insertion operators. Besides, compared to the baseline methods, the proposed algorithm equipped with the new operators provides better solutions in a short time both in PRP-1GPC instances and time-dependent pollution-routing problem instances.

This paper considers a more general situation of the pollution-routing problem that allows drivers to depart before the congestion. The PRP-1GPC is better solved by the proposed algorithm, which adds operators specifically designed from the new perspective of the traveling distance, traveling time and service time during the congestion period.

The paper aims to study the constraint solutions of the periodic coupled operator matrix equations by the biconjugate residual algorithm. The new algorithm can solve a lot of constraint solutions including Hamiltonian solutions and symmetric solutions, as special cases. At the end of this paper, the new algorithm is applied to the pole assignment problem.

When the studied periodic coupled operator matrix equations are consistent, it is proved that constraint solutions can converge to exact solutions. It is demonstrated that the solutions of the equations can be obtained by the new algorithm with any arbitrary initial matrices without rounding error in a finite number of iterative steps. In addition, the least norm-constrained solutions can also be calculated by selecting any initial matrices when the equations of the periodic coupled operator matrix are inconsistent.

Numerical examples show that compared with some existing algorithms, the proposed method has higher convergence efficiency because less data are used in each iteration and the data is sufficient to complete an update. It not only has the best convergence accuracy but also requires the least running time for iteration, which greatly saves memory space.

Compared with previous algorithms, the main feature of this algorithm is that it can synthesize these equations together to get a coupled operator matrix equation. Although the equation of this paper contains multiple submatrix equations, the algorithm in this paper only needs to use the information of one submatrix equation in the equation of this paper in each iteration so that different constraint solutions of different (coupled) matrix equations can be studied for this class of equations. However, previous articles need to iterate on a specific constraint solution of a matrix equation separately.

This paper aims to study the issues of output reachable set estimation for the linear singular Markovian jump systems (SMJSs) with time-varying delay based on a proportional plus derivative (PD) bumpless transfer (BT) output feedback (OF) control scheme.

To begin with, a sufficient criterion is given in the form of a linear matrix inequality based on the Lyapunov stability theory. Then, a PD-BT OF controller is designed to keep all the output signs of the system are maintain within a predetermined ellipsoid. Finally, numerical and practical examples are used to demonstrate the efficiency of the approach.

Based on PD control and BT control method, an OF control strategy for the linear SMJSs with time-varying delay is proposed.

The output reachable set synthesis of linear SMJSs with time-varying delay can be solved by using the proposed approach. Besides, to obtain more general results, the restrictive assumptions of some parameters are removed. Furthermore, a sufficiently small ellipsoid can be obtained by the design scheme adopted in this paper, which reduces the conservatism of the existing results.

Motivated by empirical features that characterize cryptocurrency volatility data, the authors develop a forecasting strategy that can account for both model uncertainty and heteroskedasticity of unknown form. The theoretical investigation establishes the asymptotic optimality of the proposed heteroskedastic model averaging heterogeneous autoregressive (H-MAHAR) estimator under mild conditions. The authors additionally examine the convergence rate of the estimated weights of the proposed H-MAHAR estimator. This analysis sheds new light on the asymptotic properties of the least squares model averaging estimator under alternative complicated data generating processes (DGPs). To examine the performance of the H-MAHAR estimator, the authors conduct an out-of-sample forecasting application involving 22 different cryptocurrency assets. The results emphasize the importance of accounting for both model uncertainty and heteroskedasticity in practice.

The author presents new estimates of the probability weighting functions found in rank-dependent theories of choice under risk. These estimates are unusual in two senses. First, they are free of functional form assumptions about both utility and weighting functions, and they are entirely based on binary discrete choices and not on matching or valuation tasks, though they depend on assumptions concerning the nature of probabilistic choice under risk. Second, estimated weighting functions contradict widely held priors of an inverse-s shape with fixed point well in the interior of the (0,1) interval: Instead the author usually finds populations dominated by “optimists” who uniformly overweight best outcomes in risky options. The choice pairs used here mostly do not provoke similarity-based simplifications. In a third experiment, the author shows that the presence of choice pairs that provoke similarity-based computational shortcuts does indeed flatten estimated probability weighting functions.