发布求助
文献互助 智能选刊 最新文献

Asian Journal of Mathematics and Computer Research最新文献

筛选
英文 中文
The Reduction Transformation of the Generalized Variable-coefficient KdV Equation 广义变系数KdV方程的约简变换
Asian Journal of Mathematics and Computer Research Pub Date : 2023-08-05 DOI: 10.56557/ajomcor/2023/v30i38333
Yuqing Chen, Shaowei Liu
{"title":"The Reduction Transformation of the Generalized Variable-coefficient KdV Equation","authors":"Yuqing Chen, Shaowei Liu","doi":"10.56557/ajomcor/2023/v30i38333","DOIUrl":"https://doi.org/10.56557/ajomcor/2023/v30i38333","url":null,"abstract":"In this manuscript, we have studied the reduction transformation of the generalized variable-coefficient Korteweg-de Vries(KdV) equation by the modifed Clarkson-Kruskal(CK) direct method, and have established the connection between the generalized variable-coefficient KdV equation and the constant- coefficient KdV equation. After complicated calculations, a new transformation is obtained, which transforms the generalized one-dimensional KdV equation with variable-coefficients into the corresponding KdV equation with constant-coefficients. As we know, the new transformation has not been studied in current literature. Based on the transformation, the solution of variable-coefficient KdV equation can be obtained directly through the constant-coefficient KdV equation, and it is helpful to explore the similarity reduction and exact solution of variable-coefficient KdV equation. Furthermore, a special example is given to verify the correctness of the transformation we have proposed.","PeriodicalId":200824,"journal":{"name":"Asian Journal of Mathematics and Computer Research","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-08-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115210931","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Study of a Projective Ricci Semi-symmetric Nearly Kaehler Manifold 射影Ricci半对称近Kaehler流形的研究
Asian Journal of Mathematics and Computer Research Pub Date : 2023-07-29 DOI: 10.56557/ajomcor/2023/v30i38324
B. B. Chaturvedi, Kunj Bihari Kaushik
{"title":"Study of a Projective Ricci Semi-symmetric Nearly Kaehler Manifold","authors":"B. B. Chaturvedi, Kunj Bihari Kaushik","doi":"10.56557/ajomcor/2023/v30i38324","DOIUrl":"https://doi.org/10.56557/ajomcor/2023/v30i38324","url":null,"abstract":"We inaugurate a new curvature properties of projective curvature tensor in nearly Kaehler manifold. We defined projective Ricci semi-symmetric quasi-Einstein nearly Kaehler manifold, Projective Ricci semisymmetric generalised quasi-Einstein nearly Kaehler manifold and a Projective Ricci semi-symmetric pseudo generalised quasi-Einstein nearly Kaehler manifold and also found some results in the manifold.","PeriodicalId":200824,"journal":{"name":"Asian Journal of Mathematics and Computer Research","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129334497","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Target Tracking Based on Radon Transform Data Appearance Modeling 基于Radon变换数据外观建模的目标跟踪
Asian Journal of Mathematics and Computer Research Pub Date : 2023-07-12 DOI: 10.56557/ajomcor/2023/v30i38309
Lian Yang
{"title":"Target Tracking Based on Radon Transform Data Appearance Modeling","authors":"Lian Yang","doi":"10.56557/ajomcor/2023/v30i38309","DOIUrl":"https://doi.org/10.56557/ajomcor/2023/v30i38309","url":null,"abstract":"This article mainly focuses on an important challenge in target tracking in complex environments the real-time performance of algorithm operation. A new target appearance model based on Radon transform data is studied, and it is introduced into the correlation filtering framework for filtering template training. A fast tracking algorithm and target scale update scheme based on correlation filtering are proposed. The experimental results show that the tracking algorithm proposed in this paper has better robustness and real-time performance compared to current mainstream tracking algorithms, providing a new technical approach for research related to object detection and tracking. The tracking algorithm proposed in this article can also be seen as a framework, where the projected object can not only be the grayscale of the original pixel, but also include multi-channel color values, HOG, and other attributes.","PeriodicalId":200824,"journal":{"name":"Asian Journal of Mathematics and Computer Research","volume":"49 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-07-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125374766","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Dynamic Behavior of a Delayed Competitive-Cooperative Model 时滞竞争-合作模型的动态行为
Asian Journal of Mathematics and Computer Research Pub Date : 2023-07-11 DOI: 10.56557/ajomcor/2023/v30i38307
C. Feng
{"title":"Dynamic Behavior of a Delayed Competitive-Cooperative Model","authors":"C. Feng","doi":"10.56557/ajomcor/2023/v30i38307","DOIUrl":"https://doi.org/10.56557/ajomcor/2023/v30i38307","url":null,"abstract":"This paper extends a three-species competitive-cooperative model appeared in the literature to a system not only included discrete delays, but also included distributed delays. The instability of the solutions is concerned. Computer simulation is provided to verify the criteria.","PeriodicalId":200824,"journal":{"name":"Asian Journal of Mathematics and Computer Research","volume":"119 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132429246","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Stability Analysis of Modified General Version of Gauss-type Proximal Point Method for Solving Generalized Equations Using Metrically Regular Mapping 利用度量正则映射求解广义方程的改进一般版高斯型近点法的稳定性分析
Asian Journal of Mathematics and Computer Research Pub Date : 2023-07-04 DOI: 10.56557/ajomcor/2023/v30i28294
Md. Asraful Alom, Md. Zaidur Rahman
{"title":"Stability Analysis of Modified General Version of Gauss-type Proximal Point Method for Solving Generalized Equations Using Metrically Regular Mapping","authors":"Md. Asraful Alom, Md. Zaidur Rahman","doi":"10.56557/ajomcor/2023/v30i28294","DOIUrl":"https://doi.org/10.56557/ajomcor/2023/v30i28294","url":null,"abstract":"A modified general version of Gauss-type proximal point algorithm (GGPPA) is presented in this article for solving the parameterized generalized equation y ∈ F(x), where y is a parameter and a set-valued mapping F: X ⇉ 2Y is acting between two different Banach spaces X and Y. We demonstrate the existence of any sequence produced by the modified GGPPA by taking certain presumptions into account, and we use metrically regular mapping to demonstrate the uniformity of semi-local and local convergence findings. Finally, we present a numerical experiment to verify the uniformity of semi-local convergence result.","PeriodicalId":200824,"journal":{"name":"Asian Journal of Mathematics and Computer Research","volume":"210 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115973000","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Comparative Analysis of Multimedia Compression Algorithms 多媒体压缩算法的比较分析
Asian Journal of Mathematics and Computer Research Pub Date : 2023-06-08 DOI: 10.56557/ajomcor/2023/v30i28265
Godwin Awuah Amoah, Esthella Rahama Abdul Wahab
{"title":"Comparative Analysis of Multimedia Compression Algorithms","authors":"Godwin Awuah Amoah, Esthella Rahama Abdul Wahab","doi":"10.56557/ajomcor/2023/v30i28265","DOIUrl":"https://doi.org/10.56557/ajomcor/2023/v30i28265","url":null,"abstract":"Data compression reduces the amount of bits needed to encode information, conserving expensive resources like disc space and transmission bandwidth. By using data compression, an information block's real size is kept as little as possible. The compression process consists of two steps: encoding, which uses fewer bits to compress a message, and decoding, which uses the compressed representation to roughly resemble or replicate the original message. The two main types of data compression are lossless compression and lossy approaches. The Huffman, Lempel-Ziv, and Run Length encoding techniques were all examined in this research, along with three other commonly used compression techniques. According to the research, Run Length Encoding was the best method for reducing the size of text, web pages, images, and sound.","PeriodicalId":200824,"journal":{"name":"Asian Journal of Mathematics and Computer Research","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117112918","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The Cubic Rank Transmuted Inverse Exponential Distribution 三次秩变换逆指数分布
Asian Journal of Mathematics and Computer Research Pub Date : 2023-06-06 DOI: 10.56557/ajomcor/2023/v30i28262
N. P. Akpan, O. R. Uwaeme
{"title":"The Cubic Rank Transmuted Inverse Exponential Distribution","authors":"N. P. Akpan, O. R. Uwaeme","doi":"10.56557/ajomcor/2023/v30i28262","DOIUrl":"https://doi.org/10.56557/ajomcor/2023/v30i28262","url":null,"abstract":"This paper uses the recently proposed cubic rank transmutation technique to develop and propose a new distribution in the transmutation family called the Cubic Rank Transmuted Inverse Exponential distribution (CRTIE). Important mathematical properties of the new distribution including Quantile function, and Reliability analysis were derived. The estimates of the parameters of the new distribution were also derived.","PeriodicalId":200824,"journal":{"name":"Asian Journal of Mathematics and Computer Research","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115706157","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Liouville Type Results For Polyharmonic Inequalities with Nonlocal Terms 具有非局部项的多谐不等式的Liouville型结果
Asian Journal of Mathematics and Computer Research Pub Date : 2023-05-10 DOI: 10.56557/ajomcor/2023/v30i28236
Bei Wang
{"title":"Liouville Type Results For Polyharmonic Inequalities with Nonlocal Terms","authors":"Bei Wang","doi":"10.56557/ajomcor/2023/v30i28236","DOIUrl":"https://doi.org/10.56557/ajomcor/2023/v30i28236","url":null,"abstract":"In this note, we study the polyharmonic inequalities system[(-Delta)^m u_i geq sum_{j=1}^n e_{i j}left(Psi_{i j}(|x|) * u_j^{p_{i j}}right) u_i^{q_{i j}} quad text { in }{ }^N, quad i=1,2, cdots, n, ]where (N geq 1) and (m geq 1) are integers, (p_{i j} geq 1, q_{i j}>0). (Delta^m) denotes the m-polyharmonic operator. The operator (*) denotes the convolution and (Psi_{i j}) is a function that has certain properties. (left(e_{i j}right)) is the adjacency matrix. By poly-superharmonic propery of u and some estimates, we get a Liouville type result of (0.1), which generalize the recent results on these inequalities.","PeriodicalId":200824,"journal":{"name":"Asian Journal of Mathematics and Computer Research","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126798517","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Estimating the Obstructed Portion of the Night Sky Using Digital Image Processing 利用数字图像处理估计夜空的被遮挡部分
Asian Journal of Mathematics and Computer Research Pub Date : 2023-05-05 DOI: 10.56557/ajomcor/2023/v30i28232
Felipe Alexandre da Silva, Vinicius Daniel dos Reis de Castro, Marcos William da Silva Oliveira, L. A. Caritá, Irapuan Rodrigues, Francisco Carlos Rocha Fernandes
{"title":"Estimating the Obstructed Portion of the Night Sky Using Digital Image Processing","authors":"Felipe Alexandre da Silva, Vinicius Daniel dos Reis de Castro, Marcos William da Silva Oliveira, L. A. Caritá, Irapuan Rodrigues, Francisco Carlos Rocha Fernandes","doi":"10.56557/ajomcor/2023/v30i28232","DOIUrl":"https://doi.org/10.56557/ajomcor/2023/v30i28232","url":null,"abstract":"Determining the portion obscured by clouds in the night sky recorded in an image from a meteor monitoring station can be useful to help in the discussion and analysis of studies in this area. Thereby, this work presents a proposal to quantitatively measure the proportion of the night sky covered by clouds from images of meteor records. The images used are from EXOSS database, particularly from the UVP1 and UVP2 stations. Two approaches were elaborated: the first one computes the proportion of pixels in clouds over the total number of pixels, the second approach calculates another percentage value by using image processing techniques and applying an equalization method. An application was created to perform the calculations in an automated way. The program displays an enhanced image and the two calculated percentages and can be used for specialists as a tool to guide their choice of coverage values. The results showed that the second approach proves to be better for “many” and “few” clouds; furthermore, the first approach proves to be better in low cloud density images.","PeriodicalId":200824,"journal":{"name":"Asian Journal of Mathematics and Computer Research","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121073850","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Relationship between Secure Decision Points and Arbitrary Polygon Positions in Malicious Models 恶意模型中安全决策点与任意多边形位置的关系
Asian Journal of Mathematics and Computer Research Pub Date : 2023-04-08 DOI: 10.56557/ajomcor/2023/v30i18191
Xueli Yan
{"title":"Relationship between Secure Decision Points and Arbitrary Polygon Positions in Malicious Models","authors":"Xueli Yan","doi":"10.56557/ajomcor/2023/v30i18191","DOIUrl":"https://doi.org/10.56557/ajomcor/2023/v30i18191","url":null,"abstract":"The problem of determining the position relationship between points and polygons is very extensive in practical applications. However, the existing solutions are only applicable to the case of convex polygons, and no solutions are given for arbitrary polygons. In addition, most of the existing schemes are carried out under the semi-honest model, and cannot resist the active attack of malicious adversaries. In order to solve these problems, this paper uses Paillier's encryption scheme, the idea of zero-knowledge proof to design a decision protocol to protect the position relationship between points and arbitrary polygons, which can not only prevent the deceptive behavior of malicious adversaries, but also extend the application from convex polygons to arbitrary polygons. A simulation example is used to prove that this paper is safe and efficient under the malicious model.","PeriodicalId":200824,"journal":{"name":"Asian Journal of Mathematics and Computer Research","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-04-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130098512","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信