{"title":"Maximal, equilibrium, and coincidence points for majorized type correspondences","authors":"D. O’Regan","doi":"10.22436/jmcs.032.01.06","DOIUrl":"https://doi.org/10.22436/jmcs.032.01.06","url":null,"abstract":"","PeriodicalId":45497,"journal":{"name":"Journal of Mathematics and Computer Science-JMCS","volume":" ","pages":""},"PeriodicalIF":2.5,"publicationDate":"2023-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48958063","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}
Pub Date : 2023-07-11DOI: 10.11648/j.mcs.20230803.11
V. Nikam, S. Dhande
: Several data compression algorithms are investigated in this study. Data compression is commonly utilized in the community. Because data compression allows us to conserve storage space, it can also assist to speed up data transport from one point to another. It is vital to have a compression tool on hand when compressing from one person to another. This method can be used to make data smaller. In addition to text data, images and video may be saved. Lossy and non-lossy compressions are the two types of compression techniques. Compression (lossless) and compression (lossy) which is, nevertheless, the most widely used? It is necessary to conduct lossless compression. Huffman, Shannon Fano, and other lossless compression techniques, as well as Tunstall, Lempel, Ziv Welch, and run-length encoding, are all instances of runlength encoding. This article explains how a compression strategy works and which approach is most typically used in data compression. A form of compression is text compression. The consequences of this process may be seen in the compressed file size, which is less than the original file. In this article, many data compression techniques are surveyed, including those developed by Shannon, Fano, and Huffman. Data compression seeks to increase active data density by minimizing redundant information in data that is stored or sent. Storage and distributed systems are two domains where data compression is crucial. Information theory ideas are thoroughly examined in relation to the objectives and assessment of data compression techniques. The algorithms that are presented are subjected to a framework that is created for the evaluation and comparison of approaches.
{"title":"A Historical Perspective on Approaches to Data Compression","authors":"V. Nikam, S. Dhande","doi":"10.11648/j.mcs.20230803.11","DOIUrl":"https://doi.org/10.11648/j.mcs.20230803.11","url":null,"abstract":": Several data compression algorithms are investigated in this study. Data compression is commonly utilized in the community. Because data compression allows us to conserve storage space, it can also assist to speed up data transport from one point to another. It is vital to have a compression tool on hand when compressing from one person to another. This method can be used to make data smaller. In addition to text data, images and video may be saved. Lossy and non-lossy compressions are the two types of compression techniques. Compression (lossless) and compression (lossy) which is, nevertheless, the most widely used? It is necessary to conduct lossless compression. Huffman, Shannon Fano, and other lossless compression techniques, as well as Tunstall, Lempel, Ziv Welch, and run-length encoding, are all instances of runlength encoding. This article explains how a compression strategy works and which approach is most typically used in data compression. A form of compression is text compression. The consequences of this process may be seen in the compressed file size, which is less than the original file. In this article, many data compression techniques are surveyed, including those developed by Shannon, Fano, and Huffman. Data compression seeks to increase active data density by minimizing redundant information in data that is stored or sent. Storage and distributed systems are two domains where data compression is crucial. Information theory ideas are thoroughly examined in relation to the objectives and assessment of data compression techniques. The algorithms that are presented are subjected to a framework that is created for the evaluation and comparison of approaches.","PeriodicalId":45497,"journal":{"name":"Journal of Mathematics and Computer Science-JMCS","volume":"61 1","pages":""},"PeriodicalIF":2.5,"publicationDate":"2023-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77678202","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}
{"title":"Hybrid differential inclusion with nonlocal, infinite-point or Riemann-Stieltjes integral boundary conditions","authors":"S. Al-Issa, I. Kaddoura, H. Hamze","doi":"10.22436/jmcs.032.01.03","DOIUrl":"https://doi.org/10.22436/jmcs.032.01.03","url":null,"abstract":"","PeriodicalId":45497,"journal":{"name":"Journal of Mathematics and Computer Science-JMCS","volume":" ","pages":""},"PeriodicalIF":2.5,"publicationDate":"2023-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48330435","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}
In this paper, we establish some new nonlinear integral inequalities with delay in two independent variables which generalize some known inequalities recently obtained. These results can be used as handy tools to study the boundedness of solutions of Volterra integral equations. An application is given to illustrate how our results can be applied to study the boundedness of the solutions of certain Volterra equations
{"title":"A class of nonlinear delay integral inequalities for two-variable functions and their applications in Volterra integral equations","authors":"S. Kriket, A. Boudeliou","doi":"10.22436/jmcs.032.01.01","DOIUrl":"https://doi.org/10.22436/jmcs.032.01.01","url":null,"abstract":"In this paper, we establish some new nonlinear integral inequalities with delay in two independent variables which generalize some known inequalities recently obtained. These results can be used as handy tools to study the boundedness of solutions of Volterra integral equations. An application is given to illustrate how our results can be applied to study the boundedness of the solutions of certain Volterra equations","PeriodicalId":45497,"journal":{"name":"Journal of Mathematics and Computer Science-JMCS","volume":"1 1","pages":""},"PeriodicalIF":2.5,"publicationDate":"2023-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41325939","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}
{"title":"On the existence for impulsive fuzzy nonlinear integro-differential equations with nonlocal condition","authors":"N. H. M. Qumami, R. S. Jain, B. S. Reddy","doi":"10.22436/jmcs.032.01.02","DOIUrl":"https://doi.org/10.22436/jmcs.032.01.02","url":null,"abstract":"","PeriodicalId":45497,"journal":{"name":"Journal of Mathematics and Computer Science-JMCS","volume":" ","pages":""},"PeriodicalIF":2.5,"publicationDate":"2023-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42737915","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}
{"title":"Dynamics of a mathematical model of oncolytic virotherapy with tumor-Virus interaction","authors":"A. Abu-Rqayiq, H. Alayed","doi":"10.22436/jmcs.031.04.08","DOIUrl":"https://doi.org/10.22436/jmcs.031.04.08","url":null,"abstract":"","PeriodicalId":45497,"journal":{"name":"Journal of Mathematics and Computer Science-JMCS","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135691280","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}
With the aid of the q -binomial coefficients and utilizing the convolution, we define a new q -convolution operator that helps us introduce two new families of bi-univalent functions. These classes are connected by subordination with a function G m , n . We give upper bounds for the coefficients estimate | a j | ( j = 2,3 ) of the functions that belong to these families, followed by some special cases. Moreover, we found estimates for the Fekete-Szeg¨o inequality for both of these families, followed by simple particular results. We emphasize that the defined convolution q -difference operator generalizes some other operators given by several authors. As an application of this study, Fekete-Szeg¨o inequalities for these classes of functions defined by Pascal distribution are investigated.
{"title":"Bi-univalent functions of order ζ connected with ( m , n ) -Lucas polynomials","authors":"S. H. Hadi, M. Darus, Teodor Bulboac˘a","doi":"10.22436/jmcs.031.04.06","DOIUrl":"https://doi.org/10.22436/jmcs.031.04.06","url":null,"abstract":"With the aid of the q -binomial coefficients and utilizing the convolution, we define a new q -convolution operator that helps us introduce two new families of bi-univalent functions. These classes are connected by subordination with a function G m , n . We give upper bounds for the coefficients estimate | a j | ( j = 2,3 ) of the functions that belong to these families, followed by some special cases. Moreover, we found estimates for the Fekete-Szeg¨o inequality for both of these families, followed by simple particular results. We emphasize that the defined convolution q -difference operator generalizes some other operators given by several authors. As an application of this study, Fekete-Szeg¨o inequalities for these classes of functions defined by Pascal distribution are investigated.","PeriodicalId":45497,"journal":{"name":"Journal of Mathematics and Computer Science-JMCS","volume":" ","pages":""},"PeriodicalIF":2.5,"publicationDate":"2023-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45623620","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}
Ch. Polhinkong, K. Ngenkokkruad, R. Chinram, P. Julatha, Aiyared Iampan
The goal of this study is to introduce the concept of a new type of the hybrid algebra between Abelian groups and UP (BCC)-algebras: UP (BCC)-modules. We introduce the concept of fuzzy UP (BCC)-submodules of UP (BCC)-modules and provide properties and find the necessary and sufficient conditions for this concept. We define fuzzy sets in UP (BCC)-modules of many forms, supplying their properties and their relation to fuzzy UP (BCC)-submodules. We also define and study the fuzzy UP (BCC)-submodule generated by a set of fuzzy sets in UP (BCC)-modules, as well as provide for their properties and their relation to fuzzy UP (BCC)-submodules. Finally, we apply the concept of fuzzy UP (BCC)-ideals of UP (BCC)-algebras while providing properties and find the results of the composition and the product between fuzzy UP (BCC)-ideals and fuzzy UP (BCC)-submodules.
{"title":"A new type of the hybrid algebra between Abelian groups and UP (BCC)-algebras: UP (BCC)-modules","authors":"Ch. Polhinkong, K. Ngenkokkruad, R. Chinram, P. Julatha, Aiyared Iampan","doi":"10.22436/jmcs.031.04.05","DOIUrl":"https://doi.org/10.22436/jmcs.031.04.05","url":null,"abstract":"The goal of this study is to introduce the concept of a new type of the hybrid algebra between Abelian groups and UP (BCC)-algebras: UP (BCC)-modules. We introduce the concept of fuzzy UP (BCC)-submodules of UP (BCC)-modules and provide properties and find the necessary and sufficient conditions for this concept. We define fuzzy sets in UP (BCC)-modules of many forms, supplying their properties and their relation to fuzzy UP (BCC)-submodules. We also define and study the fuzzy UP (BCC)-submodule generated by a set of fuzzy sets in UP (BCC)-modules, as well as provide for their properties and their relation to fuzzy UP (BCC)-submodules. Finally, we apply the concept of fuzzy UP (BCC)-ideals of UP (BCC)-algebras while providing properties and find the results of the composition and the product between fuzzy UP (BCC)-ideals and fuzzy UP (BCC)-submodules.","PeriodicalId":45497,"journal":{"name":"Journal of Mathematics and Computer Science-JMCS","volume":" ","pages":""},"PeriodicalIF":2.5,"publicationDate":"2023-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41603941","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}
{"title":"Numerical approximation of p -dimensional stochastic Volterra integral equation using Walsh function","authors":"P. Paikaray, S. Beuria, N. Parida","doi":"10.22436/jmcs.031.04.07","DOIUrl":"https://doi.org/10.22436/jmcs.031.04.07","url":null,"abstract":"","PeriodicalId":45497,"journal":{"name":"Journal of Mathematics and Computer Science-JMCS","volume":" ","pages":""},"PeriodicalIF":2.5,"publicationDate":"2023-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47747694","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}
A. L. Ozioko, Remigius Okeke Aja, S. Abang, W. Atokolo, Q. O. Ahman, G. Mbah
{"title":"The dynamics of Nipah virus (NiV) transmission and analysis","authors":"A. L. Ozioko, Remigius Okeke Aja, S. Abang, W. Atokolo, Q. O. Ahman, G. Mbah","doi":"10.22436/jmcs.031.04.03","DOIUrl":"https://doi.org/10.22436/jmcs.031.04.03","url":null,"abstract":"","PeriodicalId":45497,"journal":{"name":"Journal of Mathematics and Computer Science-JMCS","volume":" ","pages":""},"PeriodicalIF":2.5,"publicationDate":"2023-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44466343","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：