{"title":"On $ p $-Laplacian Kirchhoff-Schrödinger-Poisson type systems with critical growth on the Heisenberg group","authors":"Shujie Bai, Yueqiang Song, Dušan D. Repovš","doi":"10.3934/era.2023292","DOIUrl":"https://doi.org/10.3934/era.2023292","url":null,"abstract":"In this article, we investigate the Kirchhoff-Schrödinger-Poisson type systems on the Heisenberg group of the following form:\u0000\u0000 begin{document}$ begin{equation*} left{ begin{array}{lll} {-(a+bint_{Omega}|nabla_{H} u|^{p}dxi)Delta_{H, p}u-muphi |u|^{p-2}u} = lambda |u|^{q-2}u+|u|^{Q^{ast}-2}u &mbox{in} Omega, -Delta_{H}phi = |u|^{p} &mbox{in} Omega, u = phi = 0 &mbox{on} partialOmega, end{array} right. end{equation*} $end{document} \u0000where $ a, b $ are positive real numbers, $ Omegasubset mathbb{H}^N $ is a bounded region with smooth boundary, $ 1 < p < Q $, $ Q = 2N + 2 $ is the homogeneous dimension of the Heisenberg group $ mathbb{H}^N $, $ Q^{ast} = frac{pQ}{Q-p} $, $ qin(2p, Q^{ast}) $ and $ Delta_{H, p}u = mbox{div}(|nabla_{H} u|^{p-2}nabla_{H} u) $ is the $ p $-horizontal Laplacian. Under some appropriate conditions for the parameters $ mu $ and $ lambda $, we establish existence and multiplicity results for the system above. To some extent, we generalize the results of An and Liu (Israel J. Math., 2020) and Liu et al. (Adv. Nonlinear Anal., 2022).","PeriodicalId":48554,"journal":{"name":"Electronic Research Archive","volume":" ","pages":""},"PeriodicalIF":0.8,"publicationDate":"2023-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45149796","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}
{"title":"Fredholm inversion around a singularity: Application to autoregressive time series in Banach space","authors":"Won-Ki Seo","doi":"10.3934/era.2023252","DOIUrl":"https://doi.org/10.3934/era.2023252","url":null,"abstract":"This paper considers inverting a holomorphic Fredholm operator pencil. Specifically, we provide necessary and sufficient conditions for the inverse of a holomorphic Fredholm operator pencil to have a simple pole and a second order pole. Based on these results, a closed-form expression of the Laurent expansion of the inverse around an isolated singularity is obtained in each case. As an application, we also obtain a suitable extension of the Granger-Johansen representation theorem for random sequences taking values in a separable Banach space. Due to our closed-form expression of the inverse, we may fully characterize solutions to a given autoregressive law of motion except a term that depends on initial values.","PeriodicalId":48554,"journal":{"name":"Electronic Research Archive","volume":"1 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2023-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43636274","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}
Sang Jo Yun, Sangbeom Park, Jin-Woo Park, Jongkyum Kwon
{"title":"Some identities of degenerate multi-poly-Changhee polynomials and numbers","authors":"Sang Jo Yun, Sangbeom Park, Jin-Woo Park, Jongkyum Kwon","doi":"10.3934/era.2023367","DOIUrl":"https://doi.org/10.3934/era.2023367","url":null,"abstract":"<abstract><p>Recently, many researchers studied the degenerate multi-special polynomials as degenerate versions of the multi-special polynomials and obtained some identities and properties of the those polynomials. The aim of this paper was to introduce the degenerate multi-poly-Changhee polynomials arising from multiple logarithms and investigate some interesting identities and properties of these polynomials that determine the relationship between multi-poly-Changhee polynomials, the Stirling numbers of the second kind, degenerate Stirling numbers of the first kind and falling factorial sequences. In addition, we investigated the phenomenon of scattering the zeros of these polynomials.</p></abstract>","PeriodicalId":48554,"journal":{"name":"Electronic Research Archive","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135660438","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}
{"title":"<i>F-LSTM</i>: Federated learning-based LSTM framework for cryptocurrency price prediction","authors":"Nihar Patel, Nakul Vasani, Nilesh Kumar Jadav, Rajesh Gupta, Sudeep Tanwar, Zdzislaw Polkowski, Fayez Alqahtani, Amr Gafar","doi":"10.3934/era.2023330","DOIUrl":"https://doi.org/10.3934/era.2023330","url":null,"abstract":"<abstract><p>In this paper, a distributed machine-learning strategy, i.e., federated learning (FL), is used to enable the artificial intelligence (AI) model to be trained on dispersed data sources. The paper is specifically meant to forecast cryptocurrency prices, where a long short-term memory (LSTM)-based FL network is used. The proposed framework, i.e., <italic>F-LSTM</italic> utilizes FL, due to which different devices are trained on distributed databases that protect the user privacy. Sensitive data is protected by staying private and secure by sharing only model parameters (weights) with the central server. To assess the effectiveness of <italic>F-LSTM</italic>, we ran different empirical simulations. Our findings demonstrate that <italic>F-LSTM</italic> outperforms conventional approaches and machine learning techniques by achieving a loss minimal of $ 2.3 times 10^{-4} $. Furthermore, the <italic>F-LSTM</italic> uses substantially less memory and roughly half the CPU compared to a solely centralized approach. In comparison to a centralized model, the <italic>F-LSTM</italic> requires significantly less time for training and computing. The use of both FL and LSTM networks is responsible for the higher performance of our suggested model (<italic>F-LSTM</italic>). In terms of data privacy and accuracy, <italic>F-LSTM</italic> addresses the shortcomings of conventional approaches and machine learning models, and it has the potential to transform the field of cryptocurrency price prediction.</p></abstract>","PeriodicalId":48554,"journal":{"name":"Electronic Research Archive","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136257154","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}
Antonio Hernando, Eugenio Roanes-Lozano, José Luis Galán-García, Gabriel Aguilera-Venegas
{"title":"Decision making in railway interlocking systems based on calculating the remainder of dividing a polynomial by a set of polynomials","authors":"Antonio Hernando, Eugenio Roanes-Lozano, José Luis Galán-García, Gabriel Aguilera-Venegas","doi":"10.3934/era.2023313","DOIUrl":"https://doi.org/10.3934/era.2023313","url":null,"abstract":"<abstract><p>Decision-making in a railway station regarding the compatibility of the positions of the switches of the turnouts and the indications (proceed/stop) of the railway colour light signals is a safety-critical issue that is considered very labor-intensive. Different authors have proposed alternative solutions to automate its supervision, which is performed by the so-called railway interlocking systems. The classic railway interlocking systems are route-based and their compatibility is predetermined (usually by human experts): only some chosen routes are simultaneously allowed. Some modern railway interlocking systems are geographical and make decisions on the fly, but are unsuitable if the station is very large and the number of trains is high. In this paper, we present a completely new algebraic model for decision-making in railway interlocking systems, based on other computer algebra techniques, that bypasses the disadvantages of the approaches mentioned above (its performance does not depend on the number of trains in the railway station and can be used in large railway stations). The main goal of this work is to provide a mathematical solution to the interlocking problems. We prove that our approach solves it in linear time. Although our approach is interesting from a theoretical perspective, it has a significant limitation: it can hardly be adopted in an actual interlocking implementation, mainly due to the heavy certification requirements for this kind of safety-critical application. Nevertheless, the results may be useful for simulations that do not require certification credit.</p></abstract>","PeriodicalId":48554,"journal":{"name":"Electronic Research Archive","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135498114","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}
{"title":"Stochastic optimization model for ship inspection planning under uncertainty in maritime transportation","authors":"Ran Yan, Ying Yang, Yuquan Du","doi":"10.3934/era.2023006","DOIUrl":"https://doi.org/10.3934/era.2023006","url":null,"abstract":"Maritime transportation plays a significant role in international trade and global supply chains. Ship navigation safety is the foundation of operating maritime business smoothly. Recently, more and more attention has been paid to marine environmental protection. To enhance maritime safety and reduce pollution in the marine environment, various regulations and conventions are proposed by international organizations and local governments. One of the most efficient ways of ensuring that the related requirements are complied with by ships is ship inspection by port state control (PSC). In the procedure of ship inspection, a critical issue for the port state is how to select ships of higher risk for inspection and how to optimally allocate the limited inspection resources to these ships. In this study, we adopt prediction and optimization approaches to address the above issues. We first predict the number of ship deficiencies based on a k nearest neighbor (kNN) model. Then, we propose three optimization models which aim for a trade-off between the reward for detected deficiencies and the human resource cost of ship inspection. Specifically, we first follow the predict-then-optimize framework and develop a deterministic optimization model. We also establish two stochastic optimization models where the distribution of ship deficiency number is estimated by the predictive prescription method and the global prescriptive analysis method, respectively. Furthermore, we conduct a case study using inspection data at the Hong Kong port to compare the performances of the three optimization models, from which we conclude that the predictive prescription model is more efficient and effective for this problem.","PeriodicalId":48554,"journal":{"name":"Electronic Research Archive","volume":"33 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70243576","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}
{"title":"A priori bounds and existence of smooth solutions to a $ L_p $ Aleksandrov problem for Codazzi tensor with log-convex measure","authors":"Zhengmao Chen","doi":"10.3934/era.2023042","DOIUrl":"https://doi.org/10.3934/era.2023042","url":null,"abstract":"In the present paper, we prove the existence of smooth solutions to a $ L_p $ Aleksandrov problem for Codazzi tensor with a log-convex measure in compact Riemannian manifolds $ (M, g) $ with positive constant sectional curvature under suitable conditions. Our proof is based on the solvability of a Monge-Ampère equation on $ (M, g) $ via the method of continuity whose crucial factor is the a priori bounds of smooth solutions to the Monge-Ampère equation mentioned above. It is worth mentioning that our result can be seen as an extension of the classical $ L_p $ Aleksandrov problem in Euclidian space to the frame of Riemannian manifolds with weighted measures and that our result can also be seen as some attempts to get some new results on geometric analysis for Codazzi tensor.","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":"70243967","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}
{"title":"Regress 3D human pose from 2D skeleton with kinematics knowledge","authors":"Longkui Jiang, Yuru Wang, Weijia Li","doi":"10.3934/era.2023075","DOIUrl":"https://doi.org/10.3934/era.2023075","url":null,"abstract":"3D human pose estimation is a hot topic in the field of computer vision. It provides data support for tasks such as pose recognition, human tracking and action recognition. Therefore, it is widely applied in the fields of advanced human-computer interaction, intelligent monitoring and so on. Estimating 3D human pose from a single 2D image is an ill-posed problem and is likely to cause low prediction accuracy, due to the problems of self-occlusion and depth ambiguity. This paper developed two types of human kinematics to improve the estimation accuracy. First, taking the 2D human body skeleton sequence obtained by the 2D human body pose detector as input, a temporal convolutional network is proposed to develop the movement periodicity in temporal domain. Second, geometrical prior knowledge is introduced into the model to constrain the estimated pose to fit the general kinematics knowledge. The experiments are tested on Human3.6M and MPII (Max Planck Institut Informatik) Human Pose (MPI-INF-3DHP) datasets, and the proposed model shows better generalization ability compared with the baseline and the state-of-the-art 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":"70244123","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}
{"title":"An improved fixed-time stabilization problem of delayed coupled memristor-based neural networks with pinning control and indefinite derivative approach","authors":"Chao Yang, J. Wu, Zhengyang Qiao","doi":"10.3934/era.2023123","DOIUrl":"https://doi.org/10.3934/era.2023123","url":null,"abstract":"In this brief, we propose a class of generalized memristor-based neural networks with nonlinear coupling. Based on the set-valued mapping theory, novel Lyapunov indefinite derivative and Memristor theory, the coupled memristor-based neural networks (CMNNs) can achieve fixed-time stabilization (FTS) by designing a proper pinning controller, which randomly controls a small number of neuron nodes. Different from the traditional Lyapunov method, this paper uses the implementation method of indefinite derivative to deal with the non-autonomous neural network system with nonlinear coupling topology between different neurons. The system can obtain stabilization in a fixed time and requires fewer conditions. Moreover, the fixed stable setting time estimation of the system is given through a few conditions, which can eliminate the dependence on the initial value. Finally, we give two numerical examples to verify the correctness of our results.","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":"70245110","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}
{"title":"Existence and multiplicity of positive solutions for one-dimensional $ p $-Laplacian problem with sign-changing weight","authors":"Liangying Miao, Man Xu, Zhiqian He","doi":"10.3934/era.2023156","DOIUrl":"https://doi.org/10.3934/era.2023156","url":null,"abstract":"In this paper, we show the positive solutions set for one-dimensional $ p $-Laplacian problem with sign-changing weight contains a reversed $ S $-shaped continuum. By figuring the shape of unbounded continuum of positive solutions, we identify the interval of bifurcation parameter in which the $ p $-Laplacian problem has one or two or three positive solutions according to the asymptotic behavior of nonlinear term at 0 and $ infty $. The proof of the main result is based upon bifurcation technique.","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":"70245256","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}