The application of waste rubber powder (WRP) for asphalt pavement could achieve the harmless and resourceful utilization of solid waste, but the storage stability of waste rubber powder modified asphalt (RA) is one of the main problems restricting its application. Existing studies have demonstrated that graphene could enhance the storage stability of RA, but graphene's size effect on the modifying effect and its corresponding mechanism are still uncertain. In this research, the effects of graphene microstructural properties (i.e., molecular size and layer number) on the storage stability of RA were investigated by storage stability testing, dynamic shear rheometry (DSR) testing and fluorescence microscopy (FM) testing, in combination with molecular dynamics simulation (MD). The experimental results indicated that graphene improved the storage stability of RA significantly, with few-layer graphene being more effective in enhancing it. MD was used to investigate the graphene size effect on RA in compatibility, intermolecular binding energy and structural stability of the system. The simulation results revealed that small-sized graphene molecules were more compatible with RA. Meanwhile, few-layer, small-sized graphene can provide higher binding energy and better enhancement of storage stability of RA. The number of graphene layers mainly influences the binding energy rather than solubility parameters. The relative concentration distribution results demonstrated that graphene facilitated the spatial distribution of asphaltenes, rubber components and light components. This research provides theoretical support for the rational selection of microstructural properties of graphene to improve the modified asphalt storage stability performance.
{"title":"Study on the storage stability performance enhancement mechanism of graphene on rubber-modified asphalt based on size effect","authors":"Yutong Xie, Yingli Gao, M. Liao, Weiwei Tian","doi":"10.3934/era.2023105","DOIUrl":"https://doi.org/10.3934/era.2023105","url":null,"abstract":"The application of waste rubber powder (WRP) for asphalt pavement could achieve the harmless and resourceful utilization of solid waste, but the storage stability of waste rubber powder modified asphalt (RA) is one of the main problems restricting its application. Existing studies have demonstrated that graphene could enhance the storage stability of RA, but graphene's size effect on the modifying effect and its corresponding mechanism are still uncertain. In this research, the effects of graphene microstructural properties (i.e., molecular size and layer number) on the storage stability of RA were investigated by storage stability testing, dynamic shear rheometry (DSR) testing and fluorescence microscopy (FM) testing, in combination with molecular dynamics simulation (MD). The experimental results indicated that graphene improved the storage stability of RA significantly, with few-layer graphene being more effective in enhancing it. MD was used to investigate the graphene size effect on RA in compatibility, intermolecular binding energy and structural stability of the system. The simulation results revealed that small-sized graphene molecules were more compatible with RA. Meanwhile, few-layer, small-sized graphene can provide higher binding energy and better enhancement of storage stability of RA. The number of graphene layers mainly influences the binding energy rather than solubility parameters. The relative concentration distribution results demonstrated that graphene facilitated the spatial distribution of asphaltenes, rubber components and light components. This research provides theoretical support for the rational selection of microstructural properties of graphene to improve the modified asphalt storage stability performance.","PeriodicalId":48554,"journal":{"name":"Electronic Research Archive","volume":"1 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70244632","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Xuecheng Tian, Ran Yan, Shuaian Wang, Yannick Liu, Lu Zhen
The development of the Internet of things (IoT) and online platforms enables companies and governments to collect data from a much broader spatial and temporal area in the logistics industry. The huge amount of data provides new opportunities to handle uncertainty in optimization problems within the logistics system. Accordingly, various prescriptive analytics frameworks have been developed to predict different parts of uncertain optimization problems, including the uncertain parameter, the combined coefficient consisting of the uncertain parameter, the objective function, and the optimal solution. This tutorial serves as the pioneer to introduce existing literature on state-of-the-art prescriptive analytics methods, such as the predict-then-optimize framework, the smart predict-then-optimize framework, the weighted sample average approximation framework, the empirical risk minimization framework, and the kernel optimization framework. Based on these frameworks, this tutorial further proposes possible improvements and practical tips to be considered when we use these methods. We hope that this tutorial will serve as a reference for future prescriptive analytics research on the logistics system in the era of big data.
{"title":"Tutorial on prescriptive analytics for logistics: What to predict and how to predict","authors":"Xuecheng Tian, Ran Yan, Shuaian Wang, Yannick Liu, Lu Zhen","doi":"10.3934/era.2023116","DOIUrl":"https://doi.org/10.3934/era.2023116","url":null,"abstract":"The development of the Internet of things (IoT) and online platforms enables companies and governments to collect data from a much broader spatial and temporal area in the logistics industry. The huge amount of data provides new opportunities to handle uncertainty in optimization problems within the logistics system. Accordingly, various prescriptive analytics frameworks have been developed to predict different parts of uncertain optimization problems, including the uncertain parameter, the combined coefficient consisting of the uncertain parameter, the objective function, and the optimal solution. This tutorial serves as the pioneer to introduce existing literature on state-of-the-art prescriptive analytics methods, such as the predict-then-optimize framework, the smart predict-then-optimize framework, the weighted sample average approximation framework, the empirical risk minimization framework, and the kernel optimization framework. Based on these frameworks, this tutorial further proposes possible improvements and practical tips to be considered when we use these methods. We hope that this tutorial will serve as a reference for future prescriptive analytics research on the logistics system in the era of big data.","PeriodicalId":48554,"journal":{"name":"Electronic Research Archive","volume":"121 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70244932","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, fast numerical methods for solving the real quasi-symmetric Toeplitz linear system are studied in two stages. First, based on an order-reduction algorithm and the factorization of Toeplitz matrix inversion, a sequence of linear systems with a constant symmetric Toeplitz matrix are solved. Second, two new fast algorithms are employed to solve the real quasi-symmetric Toeplitz linear system. Furthermore, we show a fast algorithm for quasi-symmetric Toeplitz matrix-vector multiplication. In addition, the stability analysis of the splitting symmetric Toeplitz inversion is discussed. In mathematical or engineering problems, the proposed algorithms are extraordinarily effective for solving a sequence of linear systems with a constant symmetric Toeplitz matrix. Fast matrix-vector multiplication and a quasi-symmetric Toeplitz linear solver are proven to be suitable for image encryption and decryption.
{"title":"Algorithms for solving a class of real quasi-symmetric Toeplitz linear systems and its applications","authors":"Xinglong Zhang, Xiaoyu Jiang, Zhaolin Jiang, Hee-Young Byun","doi":"10.3934/era.2023101","DOIUrl":"https://doi.org/10.3934/era.2023101","url":null,"abstract":"In this paper, fast numerical methods for solving the real quasi-symmetric Toeplitz linear system are studied in two stages. First, based on an order-reduction algorithm and the factorization of Toeplitz matrix inversion, a sequence of linear systems with a constant symmetric Toeplitz matrix are solved. Second, two new fast algorithms are employed to solve the real quasi-symmetric Toeplitz linear system. Furthermore, we show a fast algorithm for quasi-symmetric Toeplitz matrix-vector multiplication. In addition, the stability analysis of the splitting symmetric Toeplitz inversion is discussed. In mathematical or engineering problems, the proposed algorithms are extraordinarily effective for solving a sequence of linear systems with a constant symmetric Toeplitz matrix. Fast matrix-vector multiplication and a quasi-symmetric Toeplitz linear solver are proven to be suitable for image encryption and decryption.","PeriodicalId":48554,"journal":{"name":"Electronic Research Archive","volume":"1 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70244968","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Wuhua Jiang, Yuexin Zhang, Jie Liu, Daisheng Zhang, Y. Yan, Chuanzheng Song
In order to solve the problem of insufficient range caused by the excessive weight of the pure electric bus, a multi-objective genetic algorithm (GA) and radial basis function (RBF) model are combined in this paper to realize the lightweighting of steel and aluminum hybrid body of the pure electric bus. First, the upper and lower frames of the pure electric bus body are initially designed with aluminum alloy and steel materials respectively to meet the lightweight requirements. Second, a finite element (FE) model of the bus body is established, and the validity of the model is validated through physical tests. Then, the sensitivity analysis is performed to identify the relative importance of individual design parameters over the entire domain. The Hamosilei sampling method is selected for the design of the experiment (DOE) because users can specify the number of experiments and ensure that the set of random numbers is a good representative of real variability, and the RBF model is adopted to approximate the responses of objectives and constraints. Finally, the multi-objective optimization (MOO) method based on GA with RBF model is used to solve the optimization problem of the lightweight steel-aluminum hybrid bus body. The results show that compared with the traditional fully steel body, the use of the aluminum alloy lower-frame structure can reduce body mass by 38.4%, and the proposed optimization method can further reduce the mass of the steel-aluminum body to 4.28% without affecting the structural stiffness and strength performance of the body.
{"title":"Multi-objective optimization design for steel-aluminum lightweight body of pure electric bus based on RBF model and genetic algorithm","authors":"Wuhua Jiang, Yuexin Zhang, Jie Liu, Daisheng Zhang, Y. Yan, Chuanzheng Song","doi":"10.3934/era.2023102","DOIUrl":"https://doi.org/10.3934/era.2023102","url":null,"abstract":"In order to solve the problem of insufficient range caused by the excessive weight of the pure electric bus, a multi-objective genetic algorithm (GA) and radial basis function (RBF) model are combined in this paper to realize the lightweighting of steel and aluminum hybrid body of the pure electric bus. First, the upper and lower frames of the pure electric bus body are initially designed with aluminum alloy and steel materials respectively to meet the lightweight requirements. Second, a finite element (FE) model of the bus body is established, and the validity of the model is validated through physical tests. Then, the sensitivity analysis is performed to identify the relative importance of individual design parameters over the entire domain. The Hamosilei sampling method is selected for the design of the experiment (DOE) because users can specify the number of experiments and ensure that the set of random numbers is a good representative of real variability, and the RBF model is adopted to approximate the responses of objectives and constraints. Finally, the multi-objective optimization (MOO) method based on GA with RBF model is used to solve the optimization problem of the lightweight steel-aluminum hybrid bus body. The results show that compared with the traditional fully steel body, the use of the aluminum alloy lower-frame structure can reduce body mass by 38.4%, and the proposed optimization method can further reduce the mass of the steel-aluminum body to 4.28% without affecting the structural stiffness and strength performance of the body.","PeriodicalId":48554,"journal":{"name":"Electronic Research Archive","volume":"1 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70245009","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Learning from imbalanced data is a challenging task, as with this type of data, most conventional supervised learning algorithms tend to favor the majority class, which has significantly more instances than the other classes. Ensemble learning is a robust solution for addressing the imbalanced classification problem. To construct a successful ensemble classifier, the diversity of base classifiers should receive specific attention. In this paper, we present a novel ensemble learning algorithm called Selective Evolutionary Heterogeneous Ensemble (SEHE), which produces diversity by two ways, as follows: 1) adopting multiple different sampling strategies to generate diverse training subsets and 2) training multiple heterogeneous base classifiers to construct an ensemble. In addition, considering that some low-quality base classifiers may pull down the performance of an ensemble and that it is difficult to estimate the potential of each base classifier directly, we profit from the idea of a selective ensemble to adaptively select base classifiers for constructing an ensemble. In particular, an evolutionary algorithm is adopted to conduct the procedure of adaptive selection in SEHE. The experimental results on 42 imbalanced data sets show that the SEHE is significantly superior to some state-of-the-art ensemble learning algorithms which are specifically designed for addressing the class imbalance problem, indicating its effectiveness and superiority.
{"title":"A selective evolutionary heterogeneous ensemble algorithm for classifying imbalanced data","authors":"Xiaomeng An, Sen Xu","doi":"10.3934/era.2023138","DOIUrl":"https://doi.org/10.3934/era.2023138","url":null,"abstract":"Learning from imbalanced data is a challenging task, as with this type of data, most conventional supervised learning algorithms tend to favor the majority class, which has significantly more instances than the other classes. Ensemble learning is a robust solution for addressing the imbalanced classification problem. To construct a successful ensemble classifier, the diversity of base classifiers should receive specific attention. In this paper, we present a novel ensemble learning algorithm called Selective Evolutionary Heterogeneous Ensemble (SEHE), which produces diversity by two ways, as follows: 1) adopting multiple different sampling strategies to generate diverse training subsets and 2) training multiple heterogeneous base classifiers to construct an ensemble. In addition, considering that some low-quality base classifiers may pull down the performance of an ensemble and that it is difficult to estimate the potential of each base classifier directly, we profit from the idea of a selective ensemble to adaptively select base classifiers for constructing an ensemble. In particular, an evolutionary algorithm is adopted to conduct the procedure of adaptive selection in SEHE. The experimental results on 42 imbalanced data sets show that the SEHE is significantly superior to some state-of-the-art ensemble learning algorithms which are specifically designed for addressing the class imbalance problem, indicating its effectiveness and superiority.","PeriodicalId":48554,"journal":{"name":"Electronic Research Archive","volume":"1 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70245123","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We study the following quasilinear pursuit-evasion model: begin{document}$ begin{equation*} left{ begin{array}{ll} u_{t} = Delta u-chinabla cdot (u(u+1)^{alpha}nabla w)+u(lambda_{1}-mu_{1}u^{r_{1}-1}+ av), & xin Omega, t>0,[2.5mm] v_{t} = Delta v+xinabla cdot(v(v+1)^{beta}nabla z)+v(lambda_{2}-mu_{2}v^{r_{2}-1}-bu), & xin Omega, t>0,[2.5mm] 0 = Delta w-w+v, & xin Omega, t>0 ,[2.5mm] 0 = Delta z-z+u, & xin Omega, t>0 , end{array} right. end{equation*} $end{document} in a smooth and bounded domain $ Omegasubsetmathbb{R}^{n}(ngeq 1), $ where $ a, b, chi, xi, lambda_{1}, lambda_{2}, mu_{1}, mu_{2} > 0, $ $ alpha, beta inmathbb{R}, $ and $ r_{1}, r_{2} > 1. $ When $ r_{1} > max{1, 1+alpha}, r_{2} > max{1, 1+beta}, $ it has been proved that if $ min{(r_{1}-1)(r_{2}-beta-1), (r_{1}-alpha-1)(r_{2}-beta-1)} > frac{(n-2)_{+}}{n}, $ then for some suitable nonnegative initial data $ u_{0} $ and $ v_{0}, $ the system admits a unique globally classical solution which is bounded in $ Omegatimes(0, infty) $.
We study the following quasilinear pursuit-evasion model: begin{document}$ begin{equation*} left{ begin{array}{ll} u_{t} = Delta u-chinabla cdot (u(u+1)^{alpha}nabla w)+u(lambda_{1}-mu_{1}u^{r_{1}-1}+ av), & xin Omega, t>0,[2.5mm] v_{t} = Delta v+xinabla cdot(v(v+1)^{beta}nabla z)+v(lambda_{2}-mu_{2}v^{r_{2}-1}-bu), & xin Omega, t>0,[2.5mm] 0 = Delta w-w+v, & xin Omega, t>0 ,[2.5mm] 0 = Delta z-z+u, & xin Omega, t>0 , end{array} right. end{equation*} $end{document} in a smooth and bounded domain $ Omegasubsetmathbb{R}^{n}(ngeq 1), $ where $ a, b, chi, xi, lambda_{1}, lambda_{2}, mu_{1}, mu_{2} > 0, $ $ alpha, beta inmathbb{R}, $ and $ r_{1}, r_{2} > 1. $ When $ r_{1} > max{1, 1+alpha}, r_{2} > max{1, 1+beta}, $ it has been proved that if $ min{(r_{1}-1)(r_{2}-beta-1), (r_{1}-alpha-1)(r_{2}-beta-1)} > frac{(n-2)_{+}}{n}, $ then for some suitable nonnegative initial data $ u_{0} $ and $ v_{0}, $ the system admits a unique globally classical solution which is bounded in $ Omegatimes(0, infty) $.
{"title":"The effects of cross-diffusion and logistic source on the boundedness of solutions to a pursuit-evasion model","authors":"Chang-Jian Wang, Zi-Han Zheng","doi":"10.3934/era.2023170","DOIUrl":"https://doi.org/10.3934/era.2023170","url":null,"abstract":"We study the following quasilinear pursuit-evasion model: begin{document}$ begin{equation*} left{ begin{array}{ll} u_{t} = Delta u-chinabla cdot (u(u+1)^{alpha}nabla w)+u(lambda_{1}-mu_{1}u^{r_{1}-1}+ av), & xin Omega, t>0,[2.5mm] v_{t} = Delta v+xinabla cdot(v(v+1)^{beta}nabla z)+v(lambda_{2}-mu_{2}v^{r_{2}-1}-bu), & xin Omega, t>0,[2.5mm] 0 = Delta w-w+v, & xin Omega, t>0 ,[2.5mm] 0 = Delta z-z+u, & xin Omega, t>0 , end{array} right. end{equation*} $end{document} in a smooth and bounded domain $ Omegasubsetmathbb{R}^{n}(ngeq 1), $ where $ a, b, chi, xi, lambda_{1}, lambda_{2}, mu_{1}, mu_{2} > 0, $ $ alpha, beta inmathbb{R}, $ and $ r_{1}, r_{2} > 1. $ When $ r_{1} > max{1, 1+alpha}, r_{2} > max{1, 1+beta}, $ it has been proved that if $ min{(r_{1}-1)(r_{2}-beta-1), (r_{1}-alpha-1)(r_{2}-beta-1)} > frac{(n-2)_{+}}{n}, $ then for some suitable nonnegative initial data $ u_{0} $ and $ v_{0}, $ the system admits a unique globally classical solution which is bounded in $ Omegatimes(0, infty) $.","PeriodicalId":48554,"journal":{"name":"Electronic Research Archive","volume":"1 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70245622","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The fractional-stochastic Fokas-Lenells equation (FSFLE) in the Stratonovich sense is taken into account here. The modified mapping method is used to generate new trigonometric, hyperbolic, elliptic and rational stochastic fractional solutions. Because the Fokas-Lenells equation has many implementations in telecommunication modes, complex system theory, quantum field theory, and quantum mechanics, the obtained solutions can be employed to describe a wide range of exciting physical phenomena. We plot several 2D and 3D diagrams to demonstrate how multiplicative noise and fractional derivatives affect the analytical solutions of the FSFLE. Also, we show how multiplicative noise at zero stabilizes FSFLE solutions.
{"title":"The exact solutions of the fractional-stochastic Fokas-Lenells equation in optical fiber communication","authors":"S. Albosaily, W. Mohammed, M. El-Morshedy","doi":"10.3934/era.2023180","DOIUrl":"https://doi.org/10.3934/era.2023180","url":null,"abstract":"The fractional-stochastic Fokas-Lenells equation (FSFLE) in the Stratonovich sense is taken into account here. The modified mapping method is used to generate new trigonometric, hyperbolic, elliptic and rational stochastic fractional solutions. Because the Fokas-Lenells equation has many implementations in telecommunication modes, complex system theory, quantum field theory, and quantum mechanics, the obtained solutions can be employed to describe a wide range of exciting physical phenomena. We plot several 2D and 3D diagrams to demonstrate how multiplicative noise and fractional derivatives affect the analytical solutions of the FSFLE. Also, we show how multiplicative noise at zero stabilizes FSFLE solutions.","PeriodicalId":48554,"journal":{"name":"Electronic Research Archive","volume":"1 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70246015","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A three-dimensional dynamic heat transfer mathematical model of the process when cored wire feed in molten iron is established based on finite volume method (FVM). The calculation area is meshed with triangles and quadrilaterals to determine nodes and control volumes, and implicit time integration method is used to ensure the stability of calculating process. For exposing the dynamic heat transfer behavior, the variation of temperature field and explosion characteristics of cored wires are studied. In addition, the melt loss rate of the top end of cored wire and the correlation among melt explosion depth, molten iron temperature and feeding speed of cored wires are theoretically calculated. More importantly, the influence of different structures of cored wires on the absorption rate of magnesium are considered. The calculation results are in good agreement with the experimental data, which indicate that the existing theoretical model has good validity and can provide theoretical guidance for spheroidization process in molten iron.
{"title":"Mathematical modeling and simulation analysis of different structured cored wire feeding spheroidization by finite volume method","authors":"Huiming Wang, Yimin Shi, Xingshi He, Wenzhi Zhao","doi":"10.3934/era.2023202","DOIUrl":"https://doi.org/10.3934/era.2023202","url":null,"abstract":"A three-dimensional dynamic heat transfer mathematical model of the process when cored wire feed in molten iron is established based on finite volume method (FVM). The calculation area is meshed with triangles and quadrilaterals to determine nodes and control volumes, and implicit time integration method is used to ensure the stability of calculating process. For exposing the dynamic heat transfer behavior, the variation of temperature field and explosion characteristics of cored wires are studied. In addition, the melt loss rate of the top end of cored wire and the correlation among melt explosion depth, molten iron temperature and feeding speed of cored wires are theoretically calculated. More importantly, the influence of different structures of cored wires on the absorption rate of magnesium are considered. The calculation results are in good agreement with the experimental data, which indicate that the existing theoretical model has good validity and can provide theoretical guidance for spheroidization process in molten iron.","PeriodicalId":48554,"journal":{"name":"Electronic Research Archive","volume":"1 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70246286","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, the problem on finite-/fixed-time synchronization (FFTS) is investigated for a class of diffusive Hopfield neural networks with leakage and discrete delays. Some new and useful criteria independent on time delays but dependent on the diffusion coefficients are established to guarantee the FFTS for the addressed network model under a unified framework. In sharp contrast to the existed results which can only finite-timely or fixed-timely synchronize the systems with both diffusion effects and leakage delays, the theoretical results of this paper are more general and practical. Finally, a numerical example is presented to show the effectiveness of the proposed control methods.
{"title":"Finite-/fixed-time synchronization of leakage and discrete delayed Hopfield neural networks with diffusion effects","authors":"Minglei Fang, Jin-zhi Liu, Wei Wang","doi":"10.3934/era.2023208","DOIUrl":"https://doi.org/10.3934/era.2023208","url":null,"abstract":"In this paper, the problem on finite-/fixed-time synchronization (FFTS) is investigated for a class of diffusive Hopfield neural networks with leakage and discrete delays. Some new and useful criteria independent on time delays but dependent on the diffusion coefficients are established to guarantee the FFTS for the addressed network model under a unified framework. In sharp contrast to the existed results which can only finite-timely or fixed-timely synchronize the systems with both diffusion effects and leakage delays, the theoretical results of this paper are more general and practical. Finally, a numerical example is presented to show the effectiveness of the proposed control methods.","PeriodicalId":48554,"journal":{"name":"Electronic Research Archive","volume":"1 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70246553","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We construct 3-Hom-Lie superalgebras on a commutative Hom-superalgebra by means of involution and even degree derivation. We construct a representation of induced 3-Hom-Lie superalgebras by means of supertrace.
{"title":"Induced 3-Hom-Lie superalgebras","authors":"Baoling Guan, Xinxin Tian, Lijun Tian","doi":"10.3934/era.2023237","DOIUrl":"https://doi.org/10.3934/era.2023237","url":null,"abstract":"<abstract><p>We construct 3-Hom-Lie superalgebras on a commutative Hom-superalgebra by means of involution and even degree derivation. We construct a representation of induced 3-Hom-Lie superalgebras by means of supertrace.</p></abstract>","PeriodicalId":48554,"journal":{"name":"Electronic Research Archive","volume":"1 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70246949","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：