The class of $ B_1 $-matrices is a subclass of $ P $-matrices and introduced as a generalization of $ B $-matrices. In this paper, we present several properties for $ B_1 $-matrices. Then, the infinity norm upper bound for the inverse of $ B_1 $-matrices is obtained. Furthermore, the error bound for the linear complementarity problem of $ B_1 $-matrices is presented. Finally, some numerical examples are given to illustrate our results.
$ B_1 $-矩阵是$ P $-矩阵的一个子类，是作为$ B $-矩阵的推广引入的。本文给出了$ B_1 $-矩阵的几个性质。然后，得到了$ B_1 $-矩阵逆的无穷范数上界。进一步给出了$ B_1 $-矩阵线性互补问题的误差界。最后，给出了一些数值算例来说明我们的结果。
{"title":"Some new results for $ B_1 $-matrices","authors":"Yan Li, Yaqiang Wang","doi":"10.3934/era.2023244","DOIUrl":"https://doi.org/10.3934/era.2023244","url":null,"abstract":"The class of $ B_1 $-matrices is a subclass of $ P $-matrices and introduced as a generalization of $ B $-matrices. In this paper, we present several properties for $ B_1 $-matrices. Then, the infinity norm upper bound for the inverse of $ B_1 $-matrices is obtained. Furthermore, the error bound for the linear complementarity problem of $ B_1 $-matrices is presented. Finally, some numerical examples are given to illustrate our results.","PeriodicalId":48554,"journal":{"name":"Electronic Research Archive","volume":"11 suppl_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":"70247113","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 order to overcome the low accuracy of traditional Extreme Learning Machine (ELM) network in the performance evaluation of Rotate Vector (RV) reducer, a pattern recognition model of ELM based on Ensemble Empirical Mode Decomposition (EEMD) fusion and Improved artificial Jellyfish Search (IJS) algorithm was proposed for RV reducer fault diagnosis. Firstly, it is theoretically proved that the torque transmission of RV reducer has periodicity during normal operation. The characteristics of data periodicity can be effectively reflected by using the test signal periodicity characteristics of rotating machinery and EEMD. Secondly, the Logistic chaotic mapping of population initialization in JS algorithm is replaced by tent mapping. At the same time, the competition mechanism is introduced to form a new IJS. The simulation results of standard test function show that the new algorithm has the characteristics of faster convergence and higher accuracy. The new algorithm was used to optimize the input layer weight of the ELM, and the pattern recognition model of IJS-ELM was established. The model performance was tested by XJTU-SY bearing experimental data set of Xi'an Jiaotong University. The results show that the new model is superior to JS-ELM and ELM in multi-classification performance. Finally, the new model is applied to the fault diagnosis of RV reducer. The results show that the proposed EEMD-IJS-ELM fault diagnosis model has higher accuracy and stability than other models.
{"title":"Application of Improved Jellyfish Search algorithm in Rotate Vector reducer fault diagnosis","authors":"Xiaoyan Wu, Guowen Ye, Yongming Liu, Zhuanzhe Zhao, Zhibo Liu, Yu Chen","doi":"10.3934/era.2023250","DOIUrl":"https://doi.org/10.3934/era.2023250","url":null,"abstract":"In order to overcome the low accuracy of traditional Extreme Learning Machine (ELM) network in the performance evaluation of Rotate Vector (RV) reducer, a pattern recognition model of ELM based on Ensemble Empirical Mode Decomposition (EEMD) fusion and Improved artificial Jellyfish Search (IJS) algorithm was proposed for RV reducer fault diagnosis. Firstly, it is theoretically proved that the torque transmission of RV reducer has periodicity during normal operation. The characteristics of data periodicity can be effectively reflected by using the test signal periodicity characteristics of rotating machinery and EEMD. Secondly, the Logistic chaotic mapping of population initialization in JS algorithm is replaced by tent mapping. At the same time, the competition mechanism is introduced to form a new IJS. The simulation results of standard test function show that the new algorithm has the characteristics of faster convergence and higher accuracy. The new algorithm was used to optimize the input layer weight of the ELM, and the pattern recognition model of IJS-ELM was established. The model performance was tested by XJTU-SY bearing experimental data set of Xi'an Jiaotong University. The results show that the new model is superior to JS-ELM and ELM in multi-classification performance. Finally, the new model is applied to the fault diagnosis of RV reducer. The results show that the proposed EEMD-IJS-ELM fault diagnosis model has higher accuracy and stability than other models.","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":"70247544","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 the present paper, by the complex method, the meromorphic solutions of the higher order ordinary differential equation $ w^{(5)}+aw^{''}+bw^2-cw+d = 0 $ are investigated, where $ a, b, c, d $ are constant complex numbers, and $ b neq0 $. Furthermore, by Theorem 1.1, we built elliptic and multiple-valued solutions for the higher order ordinary differential equations $ u^{(6)}-u^{(5)}+u'^2-2u'u+u^2+2u'-2u+1 = 0 $ and $ u^{(6)}-u^{(5)}+au^{'''}-au''+bu'^2-2bu'u+bu^2-cu'+cu+d = 0 $. At the end, we give some new meromorphic solutions for two higher-order KdV-like equations.
本文用复形方法研究了一类高阶常微分方程$ w^{(5)}+aw^{"}+bw^2-cw+d = 0 $的亚纯解，其中$ a, b, c, d $为常复数，$ b neq0 $。进一步，利用1.1定理，构造了高阶常微分方程$ u^{(6)}-u^{(5)}+u'^2-2u'u+u^2+2u'-2u+1 = 0 $和$ u^{(6)}-u^{(5)}+au^{'}-au' +bu'^2-2bu'u+bu^2-cu'+cu+d = 0 $的椭圆解和多值解。最后给出了两个高阶类kdv方程的一些新的亚纯解。
{"title":"Elliptic and multiple-valued solutions of some higher order ordinary differential equations","authors":"Guoqiang Dang","doi":"10.3934/era.2023302","DOIUrl":"https://doi.org/10.3934/era.2023302","url":null,"abstract":"In the present paper, by the complex method, the meromorphic solutions of the higher order ordinary differential equation $ w^{(5)}+aw^{''}+bw^2-cw+d = 0 $ are investigated, where $ a, b, c, d $ are constant complex numbers, and $ b neq0 $. Furthermore, by Theorem 1.1, we built elliptic and multiple-valued solutions for the higher order ordinary differential equations $ u^{(6)}-u^{(5)}+u'^2-2u'u+u^2+2u'-2u+1 = 0 $ and $ u^{(6)}-u^{(5)}+au^{'''}-au''+bu'^2-2bu'u+bu^2-cu'+cu+d = 0 $. At the end, we give some new meromorphic solutions for two higher-order KdV-like equations.","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":"70247977","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}
Lei Ma, Weiyu Wang, Yaozong Zhang, Yu Shi, Zhenghua Huang, Hanyu Hong
Recent advancements in network and multimedia technologies have facilitated the distribution and sharing of digital videos over the Internet. These long videos contain very complex contents. Additionally, it is very challenging to use as few frames as possible to cover the video contents without missing too much information. There are at least two ways to describe these complex videos contents with minimal frames: the keyframes extracted from the video or the video summary. The former lays stress on covering the whole video contents as much as possible. The latter emphasizes covering the video contents of interest. As a consequence, keyframes are widely used in many areas such as video segmentation and object tracking. In this paper, we propose a keyframe extraction method based on multiple features via a novel combinatorial optimization algorithm. The key frame extraction is modeled as a combinatorial optimization problem. A fast dynamic programming algorithm based on a forward non-overlapping transfer matrix in polynomial time and a 0-1 integer linear programming algorithm based on an overlapping matrix is proposed to solve our maximization problem. In order to quantitatively evaluate our approach, a long video dataset named 'Animal world' is self-constructed, and the segmentation evaluation criterions are introduced. A good result is achieved on 'Animal world' dataset and a public available Keyframe-Sydney KFSYD dataset [1].
{"title":"Multi-features combinatorial optimization for keyframe extraction","authors":"Lei Ma, Weiyu Wang, Yaozong Zhang, Yu Shi, Zhenghua Huang, Hanyu Hong","doi":"10.3934/era.2023304","DOIUrl":"https://doi.org/10.3934/era.2023304","url":null,"abstract":"Recent advancements in network and multimedia technologies have facilitated the distribution and sharing of digital videos over the Internet. These long videos contain very complex contents. Additionally, it is very challenging to use as few frames as possible to cover the video contents without missing too much information. There are at least two ways to describe these complex videos contents with minimal frames: the keyframes extracted from the video or the video summary. The former lays stress on covering the whole video contents as much as possible. The latter emphasizes covering the video contents of interest. As a consequence, keyframes are widely used in many areas such as video segmentation and object tracking. In this paper, we propose a keyframe extraction method based on multiple features via a novel combinatorial optimization algorithm. The key frame extraction is modeled as a combinatorial optimization problem. A fast dynamic programming algorithm based on a forward non-overlapping transfer matrix in polynomial time and a 0-1 integer linear programming algorithm based on an overlapping matrix is proposed to solve our maximization problem. In order to quantitatively evaluate our approach, a long video dataset named 'Animal world' is self-constructed, and the segmentation evaluation criterions are introduced. A good result is achieved on 'Animal world' dataset and a public available Keyframe-Sydney KFSYD dataset [1].","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":"70248035","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, a reaction-diffusion dual carbon model associated with Dirichlet boundary condition is proposed under the influence of economic development in China. First, we enumerate and analyse some influencing factors of carbon emission and carbon absorption, and select economic development as the influence factor of carbon emission. Second, we establish a model associated with dual carbon and analyse the existence and stability of equilibrium and the existence of bifurcations. Finally, we analyse and predict for the value of parameters. Numerical simulations are presented to support our theory results. Combined with theoretical analysis and numerical simulations, we obtain that China can achieve carbon peak before 2030. If we want to achieve carbon neutral before 2060, it requires efforts from all of parts of society. Therefore, we put forward some practical suggestions to achieve carbon neutrality and carbon peak on schedule in China for the next few decades.
{"title":"Dynamic analysis of reaction-diffusion dual carbon model considering economic development in China","authors":"Yanchuang Hou, Chunyue Wei, Yuting Ding","doi":"10.3934/era.2023126","DOIUrl":"https://doi.org/10.3934/era.2023126","url":null,"abstract":"In this paper, a reaction-diffusion dual carbon model associated with Dirichlet boundary condition is proposed under the influence of economic development in China. First, we enumerate and analyse some influencing factors of carbon emission and carbon absorption, and select economic development as the influence factor of carbon emission. Second, we establish a model associated with dual carbon and analyse the existence and stability of equilibrium and the existence of bifurcations. Finally, we analyse and predict for the value of parameters. Numerical simulations are presented to support our theory results. Combined with theoretical analysis and numerical simulations, we obtain that China can achieve carbon peak before 2030. If we want to achieve carbon neutral before 2060, it requires efforts from all of parts of society. Therefore, we put forward some practical suggestions to achieve carbon neutrality and carbon peak on schedule in China for the next few decades.","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":"70244695","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, we consider the perturbed Navier–Stokes equations around the Landau solution and investigate the global well-posedness results of the perturbed system with the small initial data in the [Formula: see text] space, where [Formula: see text].
{"title":"Local well-posedness of perturbed Navier-Stokes system around Landau solutions","authors":"Jingjing Zhang, Ting Zhang","doi":"10.3934/ERA.2021010","DOIUrl":"https://doi.org/10.3934/ERA.2021010","url":null,"abstract":"In this paper, we consider the perturbed Navier–Stokes equations around the Landau solution and investigate the global well-posedness results of the perturbed system with the small initial data in the [Formula: see text] space, where [Formula: see text].","PeriodicalId":48554,"journal":{"name":"Electronic Research Archive","volume":" ","pages":""},"PeriodicalIF":0.8,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44918836","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}
Jiayi Yu, Ye Tao, Huang Zhang, Zhibiao Wang, Wenhua Cui, Tianwei Shi
With the continuous development and progress of society, age estimation based on deep learning has gradually become a key link in human-computer interaction. Widely combined with other fields of application, this paper performs a gradient division of human fall behavior according to the age estimation of the human body, a complete priority detection of the key population, and a phased single aggregation backbone network VoVNetv4 was proposed for feature extraction. At the same time, the regional single aggregation module ROSA module was constructed to encapsulate the feature module regionally. The adaptive stage module was used for feature smoothing. Consistent predictions for each task were made using the CORAL framework as a classifier and tasks were divided in binary. At the same time, a gradient two-node fall detection framework combined with age estimation was designed. The detection was divided into a primary node and a secondary node. In the first-level node, the age estimation algorithm based on VoVNetv4 was used to classify the population of different age groups. A face tracking algorithm was constructed by combining the key point matrices of humans, and the body processed by OpenPose with the central coordinates of the human face. In the secondary node, human age gradient information was used to detect human falls based on the AT-MLP model. The experimental results show that compared with Resnet-34, the MAE value of the proposed method decreased by 0.41. Compared with curriculum learning and the CORAL-CNN method, MAE value decreased by 0.17 relative to the RMSE value. Compared with other methods, the method in this paper was significantly lower, with a biggest drop of 0.51.
{"title":"Age estimation algorithm based on deep learning and its application in fall detection","authors":"Jiayi Yu, Ye Tao, Huang Zhang, Zhibiao Wang, Wenhua Cui, Tianwei Shi","doi":"10.3934/era.2023251","DOIUrl":"https://doi.org/10.3934/era.2023251","url":null,"abstract":"With the continuous development and progress of society, age estimation based on deep learning has gradually become a key link in human-computer interaction. Widely combined with other fields of application, this paper performs a gradient division of human fall behavior according to the age estimation of the human body, a complete priority detection of the key population, and a phased single aggregation backbone network VoVNetv4 was proposed for feature extraction. At the same time, the regional single aggregation module ROSA module was constructed to encapsulate the feature module regionally. The adaptive stage module was used for feature smoothing. Consistent predictions for each task were made using the CORAL framework as a classifier and tasks were divided in binary. At the same time, a gradient two-node fall detection framework combined with age estimation was designed. The detection was divided into a primary node and a secondary node. In the first-level node, the age estimation algorithm based on VoVNetv4 was used to classify the population of different age groups. A face tracking algorithm was constructed by combining the key point matrices of humans, and the body processed by OpenPose with the central coordinates of the human face. In the secondary node, human age gradient information was used to detect human falls based on the AT-MLP model. The experimental results show that compared with Resnet-34, the MAE value of the proposed method decreased by 0.41. Compared with curriculum learning and the CORAL-CNN method, MAE value decreased by 0.17 relative to the RMSE value. Compared with other methods, the method in this paper was significantly lower, with a biggest drop of 0.51.","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":"70247555","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}
Liner companies have responded to escalating trade conflicts and the impact of the COVID-19 pandemic by forming alliances and implementing streamlined approaches to manage empty containers, which has strengthened the resilience of their supply chains. Meanwhile, shippers have grown more sensitive during these turbulent times. Motivated by the market situation, we investigate a liner alliance shipping network design problem considering the choice inertia of shippers and empty container relocation. To address this problem, we propose a bilevel programming model. The upper model aims to maximize the alliance's profit by optimizing the alliance's shipping network and fleet design scheme. The lower model focuses on optimizing the slot allocation scheme and the empty container relocation scheme. To ensure the sustainable operation of the alliance, we develop an inverse optimization model to allocate profits among alliance members. Furthermore, we design a differential evolution metaheuristic algorithm to solve the model. To validate the effectiveness of the proposed model and algorithm, numerical experiments are conducted using actual shipping data from the Asia-Western Europe shipping route. The results confirm the validity of the proposed model and algorithm, which can serve as a crucial decision-making reference for the daily operations of a liner shipping alliance.
{"title":"Liner alliance shipping network design model with shippers' choice inertia and empty container relocation","authors":"Xu Xin, Xiaoli Wang, Zhang Tao, Haichao Chen, Qian Guo, Shaorui Zhou","doi":"10.3934/era.2023280","DOIUrl":"https://doi.org/10.3934/era.2023280","url":null,"abstract":"Liner companies have responded to escalating trade conflicts and the impact of the COVID-19 pandemic by forming alliances and implementing streamlined approaches to manage empty containers, which has strengthened the resilience of their supply chains. Meanwhile, shippers have grown more sensitive during these turbulent times. Motivated by the market situation, we investigate a liner alliance shipping network design problem considering the choice inertia of shippers and empty container relocation. To address this problem, we propose a bilevel programming model. The upper model aims to maximize the alliance's profit by optimizing the alliance's shipping network and fleet design scheme. The lower model focuses on optimizing the slot allocation scheme and the empty container relocation scheme. To ensure the sustainable operation of the alliance, we develop an inverse optimization model to allocate profits among alliance members. Furthermore, we design a differential evolution metaheuristic algorithm to solve the model. To validate the effectiveness of the proposed model and algorithm, numerical experiments are conducted using actual shipping data from the Asia-Western Europe shipping route. The results confirm the validity of the proposed model and algorithm, which can serve as a crucial decision-making reference for the daily operations of a liner shipping alliance.","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":"70247216","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 mean value problems of exponential sums play a very important role in the research of analytic number theory, and many famous number theory problems are closely related to them. The main purpose of this paper is using some elementary methods and the number of the solutions of the congruence equations to study the calculating problem of some fourth power means of two-term exponential sums, and give exact calculating formulae and asymptotic formula for them.
{"title":"On two-term exponential sums and their mean values","authors":"Jianghua Li, Zepeng Zhang, Tianyu Pan","doi":"10.3934/era.2023282","DOIUrl":"https://doi.org/10.3934/era.2023282","url":null,"abstract":"The mean value problems of exponential sums play a very important role in the research of analytic number theory, and many famous number theory problems are closely related to them. The main purpose of this paper is using some elementary methods and the number of the solutions of the congruence equations to study the calculating problem of some fourth power means of two-term exponential sums, and give exact calculating formulae and asymptotic formula for them.","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":"70247268","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}
Jun Guo, Yanchao Shi, Weihua Luo, Yanzhao Cheng, Shengye Wang
The issues of exponential projective synchronization and adaptive exponential projective synchronization are analyzed for quaternion-valued memristor-based neural networks (QVMNNs) with time delays. Different from the results of existing decomposition techniques, a direct analytical approach is used to discuss the projection synchronization problem. First, in the framework of measurable selection and differential inclusion, the QVMNNs is transformed into a system with parametric uncertainty. Next, the sign function related to quaternion is introduced. Different proper control schemes are designed and several criteria for ascertaining exponential projective synchronization and adaptive exponential projective synchronization are derived based on Lyapunov theory and the properties of sign function. Furthermore, several corollaries about global projective synchronization are proposed. Finally, the reliability and validity of our results are substantiated by two numerical examples and its corresponding simulation.
{"title":"Exponential projective synchronization analysis for quaternion-valued memristor-based neural networks with time delays","authors":"Jun Guo, Yanchao Shi, Weihua Luo, Yanzhao Cheng, Shengye Wang","doi":"10.3934/era.2023285","DOIUrl":"https://doi.org/10.3934/era.2023285","url":null,"abstract":"The issues of exponential projective synchronization and adaptive exponential projective synchronization are analyzed for quaternion-valued memristor-based neural networks (QVMNNs) with time delays. Different from the results of existing decomposition techniques, a direct analytical approach is used to discuss the projection synchronization problem. First, in the framework of measurable selection and differential inclusion, the QVMNNs is transformed into a system with parametric uncertainty. Next, the sign function related to quaternion is introduced. Different proper control schemes are designed and several criteria for ascertaining exponential projective synchronization and adaptive exponential projective synchronization are derived based on Lyapunov theory and the properties of sign function. Furthermore, several corollaries about global projective synchronization are proposed. Finally, the reliability and validity of our results are substantiated by two numerical examples and its corresponding simulation.","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":"70247876","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
扫码关注我们
求助内容：
应助结果提醒方式：