Pub Date : 2023-11-17DOI: 10.1142/s0129626423400157
Maria Teresa Signes-Pont, Joan Boters-Pitarch, Julian Szymanski, H. Mora-Mora
A formal approach to modeling the expansion of natural events is presented in this paper. Since the mathematical, statistical or computational methods used are not relevant for development, a modular framework is carried out that guides from the external observation down to the innermost level of the variables that have to appear in the future mathematical-computational formalization. As an example we analyze the expansion of Covid-19. We perform a qualitative estimation of the impact of the causes on the delays of the spread and an analysis of the parameters.
{"title":"A Formal Approach to Model the Expansion of Natural Events: The Case of Infectious Diseases","authors":"Maria Teresa Signes-Pont, Joan Boters-Pitarch, Julian Szymanski, H. Mora-Mora","doi":"10.1142/s0129626423400157","DOIUrl":"https://doi.org/10.1142/s0129626423400157","url":null,"abstract":"A formal approach to modeling the expansion of natural events is presented in this paper. Since the mathematical, statistical or computational methods used are not relevant for development, a modular framework is carried out that guides from the external observation down to the innermost level of the variables that have to appear in the future mathematical-computational formalization. As an example we analyze the expansion of Covid-19. We perform a qualitative estimation of the impact of the causes on the delays of the spread and an analysis of the parameters.","PeriodicalId":44742,"journal":{"name":"Parallel Processing Letters","volume":"23 4 1","pages":""},"PeriodicalIF":0.4,"publicationDate":"2023-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139263890","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-11-17DOI: 10.1142/s0129626423400169
Qingfang Ye, Fengwei Li
A nanotube is a nanometer–scale tube-like structure, it is a kind of nanoparticle, and may be large enough to serve as a pipe through which other nanoparticles can be channeled, or, depending on the material, may be used as an electrical conductor or an electrical insulator. For computing the structural information of nanotubes, the graph entropies have become the information theoretic quantities. The graph entropy measure has attracted the research community due to its potential application in discrete mathematics, biology, and chemistry. In this paper, our contribution is to explore graph entropies for structures of some nanotubes based on novel information function, which is the number of different degree vertices along with the number of edges between various degree vertices. More precisely, we computed entropies of some classes of nanotubes such as titania nanotube TNT[Formula: see text], TNT[Formula: see text] and carbon nanotubes HAC[Formula: see text] by making a relation of degree-based topological indices with the help of information function.
{"title":"On Entropy Measures of Some Titania and Carbon Nanotubes","authors":"Qingfang Ye, Fengwei Li","doi":"10.1142/s0129626423400169","DOIUrl":"https://doi.org/10.1142/s0129626423400169","url":null,"abstract":"A nanotube is a nanometer–scale tube-like structure, it is a kind of nanoparticle, and may be large enough to serve as a pipe through which other nanoparticles can be channeled, or, depending on the material, may be used as an electrical conductor or an electrical insulator. For computing the structural information of nanotubes, the graph entropies have become the information theoretic quantities. The graph entropy measure has attracted the research community due to its potential application in discrete mathematics, biology, and chemistry. In this paper, our contribution is to explore graph entropies for structures of some nanotubes based on novel information function, which is the number of different degree vertices along with the number of edges between various degree vertices. More precisely, we computed entropies of some classes of nanotubes such as titania nanotube TNT[Formula: see text], TNT[Formula: see text] and carbon nanotubes HAC[Formula: see text] by making a relation of degree-based topological indices with the help of information function.","PeriodicalId":44742,"journal":{"name":"Parallel Processing Letters","volume":"26 1","pages":""},"PeriodicalIF":0.4,"publicationDate":"2023-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139264618","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-11-15DOI: 10.1142/s0129626423400145
Roberto Salazar
A crucial problem of machine learning is the management of unclean probabilistic databases. We approach this problem by applying recent results and methods from quantum information to detect a specific class of database corruption. We present a quantifier of the global corruption of the probabilistic database and show its relationship with detection protocols based on generalized Bell inequalities. Furthermore, we show a relation between the noise generating the corruption and information encoded in the database schema. Finally, we discuss how our work indicates a way to export quantum information results to study noise in probabilistic databases.
{"title":"Quantum-inspired Probabilistic Database Corruption Detection","authors":"Roberto Salazar","doi":"10.1142/s0129626423400145","DOIUrl":"https://doi.org/10.1142/s0129626423400145","url":null,"abstract":"A crucial problem of machine learning is the management of unclean probabilistic databases. We approach this problem by applying recent results and methods from quantum information to detect a specific class of database corruption. We present a quantifier of the global corruption of the probabilistic database and show its relationship with detection protocols based on generalized Bell inequalities. Furthermore, we show a relation between the noise generating the corruption and information encoded in the database schema. Finally, we discuss how our work indicates a way to export quantum information results to study noise in probabilistic databases.","PeriodicalId":44742,"journal":{"name":"Parallel Processing Letters","volume":"67 4","pages":""},"PeriodicalIF":0.4,"publicationDate":"2023-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139275927","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-11-07DOI: 10.1142/s0129626423400133
Barbara Fryc, Zofia Matusiewicz
The paper presents a new Petri Net model: BFPN. Balanced Fuzzy Petri Nets make it possible to model processes that consider gain and loss calculations at the same time. Many business processes need to consider the ability to model a scarcity or loss situation. Balanced fuzzy sets and relations allow a complete visualization and interpretation of the processes.
{"title":"Balanced Fuzzy Petri Nets","authors":"Barbara Fryc, Zofia Matusiewicz","doi":"10.1142/s0129626423400133","DOIUrl":"https://doi.org/10.1142/s0129626423400133","url":null,"abstract":"The paper presents a new Petri Net model: BFPN. Balanced Fuzzy Petri Nets make it possible to model processes that consider gain and loss calculations at the same time. Many business processes need to consider the ability to model a scarcity or loss situation. Balanced fuzzy sets and relations allow a complete visualization and interpretation of the processes.","PeriodicalId":44742,"journal":{"name":"Parallel Processing Letters","volume":"107 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135545462","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-10-25DOI: 10.1142/s0129626423400108
Tomoko Sakiyama, Masao Okawara
In this paper, we investigate the influence of memory errors on a random walk model (the direction-comparison (DC) model), which was developed by the authors. In the DC model, a walker sometimes alters its directional rule, which is dependent on the directional inconsistency between the current direction and the past movement direction. Here, we introduced two different types of memory errors into the DC model: the recall error and the direction error. We found that the DC model was not influenced by a former type of error, suggesting that our model could be robust against some kinds of errors.
{"title":"A Lévy Walk Model not Affected by the Memory Error","authors":"Tomoko Sakiyama, Masao Okawara","doi":"10.1142/s0129626423400108","DOIUrl":"https://doi.org/10.1142/s0129626423400108","url":null,"abstract":"In this paper, we investigate the influence of memory errors on a random walk model (the direction-comparison (DC) model), which was developed by the authors. In the DC model, a walker sometimes alters its directional rule, which is dependent on the directional inconsistency between the current direction and the past movement direction. Here, we introduced two different types of memory errors into the DC model: the recall error and the direction error. We found that the DC model was not influenced by a former type of error, suggesting that our model could be robust against some kinds of errors.","PeriodicalId":44742,"journal":{"name":"Parallel Processing Letters","volume":"13 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135113973","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-10-25DOI: 10.1142/s0129626423400121
Subhash Kak
This paper investigates the dimensionality of genetic information from the perspective of optimal representation. Recently it has been shown that optimal coding of information is in terms of the noninteger dimension of e, which is accompanied by the property of scale invariance. Since Nature is optimal, we should see this dimension reflected in the organization of the genetic code. With this as background, this paper investigates the problem of the logic behind the nature of the assignment of codons to amino acids, for they take different values that range from 1 to 6. It is shown that the non-uniformity of this assignment, which goes against mathematical coding theory that demands a near uniform assignment, is consistent with noninteger dimensions. The reason why the codon assignment for different amino acids varies is because uniformity is a requirement for optimality only in a standard vector space, and is not so in the noninteger dimensional space. It is noteworthy that there are 20 different covering regions in an e-dimensional information space, which is equal to the number of amino acids. The problem of the visualization of data that originates in an e-dimensional space but examined in a 3-dimensional vector space is also discussed. It is shown that the assignment of the codons to the amino acids is fractal-like that is well modeled by the Zipf distribution which is a power law. It is remarkable that the Zipf distribution that holds for the letter frequencies of words in a natural language also applies to the rank order of triplets in the code for amino acids.
{"title":"The Dimensionality of Genetic Information","authors":"Subhash Kak","doi":"10.1142/s0129626423400121","DOIUrl":"https://doi.org/10.1142/s0129626423400121","url":null,"abstract":"This paper investigates the dimensionality of genetic information from the perspective of optimal representation. Recently it has been shown that optimal coding of information is in terms of the noninteger dimension of e, which is accompanied by the property of scale invariance. Since Nature is optimal, we should see this dimension reflected in the organization of the genetic code. With this as background, this paper investigates the problem of the logic behind the nature of the assignment of codons to amino acids, for they take different values that range from 1 to 6. It is shown that the non-uniformity of this assignment, which goes against mathematical coding theory that demands a near uniform assignment, is consistent with noninteger dimensions. The reason why the codon assignment for different amino acids varies is because uniformity is a requirement for optimality only in a standard vector space, and is not so in the noninteger dimensional space. It is noteworthy that there are 20 different covering regions in an e-dimensional information space, which is equal to the number of amino acids. The problem of the visualization of data that originates in an e-dimensional space but examined in a 3-dimensional vector space is also discussed. It is shown that the assignment of the codons to the amino acids is fractal-like that is well modeled by the Zipf distribution which is a power law. It is remarkable that the Zipf distribution that holds for the letter frequencies of words in a natural language also applies to the rank order of triplets in the code for amino acids.","PeriodicalId":44742,"journal":{"name":"Parallel Processing Letters","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135113211","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-10-25DOI: 10.1142/s012962642340011x
Subhash Kak
Linear fractals associated with weights are investigated. Such fractals are important from a conservation law perspective that is relevant in a variety of physical systems such as materials science, sand dune fractals, barred galaxies, as well as in temporal processes like in the electroencephalogram (EEG). The weight associated with fractals is an additional feature that may be associated with distributions consistent with the ubiquitous power law and the first digit phenomenon. These distributions form a bridge to processes and applications in natural, biological, and engineering systems and, therefore, open up the possibility of the application of linear weighted fractals to these subjects. Two linear fractal algorithms that are near optimal in the information theoretic sense are described. A mechanism for the emergence of these fractals is proposed: it is the indistinguishability amongst the particles in the evolution and transformation of physical systems. Since the fractal approach is an established method of signal processing and coding, the newly proposed weighted fractals have the potential to lead to new useful algorithms.
{"title":"Linear Fractals with Weights","authors":"Subhash Kak","doi":"10.1142/s012962642340011x","DOIUrl":"https://doi.org/10.1142/s012962642340011x","url":null,"abstract":"Linear fractals associated with weights are investigated. Such fractals are important from a conservation law perspective that is relevant in a variety of physical systems such as materials science, sand dune fractals, barred galaxies, as well as in temporal processes like in the electroencephalogram (EEG). The weight associated with fractals is an additional feature that may be associated with distributions consistent with the ubiquitous power law and the first digit phenomenon. These distributions form a bridge to processes and applications in natural, biological, and engineering systems and, therefore, open up the possibility of the application of linear weighted fractals to these subjects. Two linear fractal algorithms that are near optimal in the information theoretic sense are described. A mechanism for the emergence of these fractals is proposed: it is the indistinguishability amongst the particles in the evolution and transformation of physical systems. Since the fractal approach is an established method of signal processing and coding, the newly proposed weighted fractals have the potential to lead to new useful algorithms.","PeriodicalId":44742,"journal":{"name":"Parallel Processing Letters","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135113964","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-10-17DOI: 10.1142/s0129626423020012
Andrew Schumann, Jerzy Król
In the paper, processes of self-organization in nature are considered as computational processes. At the same time, it is emphasized that various computational paradigms for the study of complex patterns are possible: reaction-diffusion computing, collision-based computing, swarm computing, quantum information, fuzzy balanced sets, fractals, nonlinear systems. These approaches allow complex patterns not only to be simulated, but also programmed.
{"title":"Novel Computational Approaches to the Universe","authors":"Andrew Schumann, Jerzy Król","doi":"10.1142/s0129626423020012","DOIUrl":"https://doi.org/10.1142/s0129626423020012","url":null,"abstract":"In the paper, processes of self-organization in nature are considered as computational processes. At the same time, it is emphasized that various computational paradigms for the study of complex patterns are possible: reaction-diffusion computing, collision-based computing, swarm computing, quantum information, fuzzy balanced sets, fractals, nonlinear systems. These approaches allow complex patterns not only to be simulated, but also programmed.","PeriodicalId":44742,"journal":{"name":"Parallel Processing Letters","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136037955","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-08-31DOI: 10.1142/s012962642350007x
Nengjin Zhuo, Shumin Zhang, Chengfu Ye, Yalan Li
The diagnosability is very important in multiple-processor systems. Ding et al. proposed the non-inclusive diagnosability of systems in 2020. Compared to previous diagnosability, non-inclusive diagnosability requires all faulty sets to be non-inclusive. In this paper, we show the non-inclusive diagnosability of alternating group graphs under the PMC model and the MM* model for [Formula: see text].
{"title":"Non-Inclusive Diagnosability of Alternating Group Graphs","authors":"Nengjin Zhuo, Shumin Zhang, Chengfu Ye, Yalan Li","doi":"10.1142/s012962642350007x","DOIUrl":"https://doi.org/10.1142/s012962642350007x","url":null,"abstract":"The diagnosability is very important in multiple-processor systems. Ding et al. proposed the non-inclusive diagnosability of systems in 2020. Compared to previous diagnosability, non-inclusive diagnosability requires all faulty sets to be non-inclusive. In this paper, we show the non-inclusive diagnosability of alternating group graphs under the PMC model and the MM* model for [Formula: see text].","PeriodicalId":44742,"journal":{"name":"Parallel Processing Letters","volume":" ","pages":""},"PeriodicalIF":0.4,"publicationDate":"2023-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44209078","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-08-08DOI: 10.1142/s0129626423400091
Hao Zhang, Huahui Yu, Limin Wang, Sainan Guo
In this paper, we discuss several cost-sharing methods for cover-set games, for example, approximately budget-balanced, in the core, and/or strategyproof. Different from the traditional set cover game, in cover-set game, the elements stand for services, and each agent is both a service provider and receiver. In this study, for unselfish agents, we design a cost allocation method that can recover no less than [Formula: see text] fraction of the total cost, where [Formula: see text] and [Formula: see text] is the maximum number of receiving services among all agents. In addition, for agents who are selfish service providers with privately known valuations, we present a strategyproof charging mechanism, further, the total cost is no more than [Formula: see text] times that of an optimal solution.
{"title":"Cost Allocation and Strategyproof Mechanism for Cover-set Games","authors":"Hao Zhang, Huahui Yu, Limin Wang, Sainan Guo","doi":"10.1142/s0129626423400091","DOIUrl":"https://doi.org/10.1142/s0129626423400091","url":null,"abstract":"In this paper, we discuss several cost-sharing methods for cover-set games, for example, approximately budget-balanced, in the core, and/or strategyproof. Different from the traditional set cover game, in cover-set game, the elements stand for services, and each agent is both a service provider and receiver. In this study, for unselfish agents, we design a cost allocation method that can recover no less than [Formula: see text] fraction of the total cost, where [Formula: see text] and [Formula: see text] is the maximum number of receiving services among all agents. In addition, for agents who are selfish service providers with privately known valuations, we present a strategyproof charging mechanism, further, the total cost is no more than [Formula: see text] times that of an optimal solution.","PeriodicalId":44742,"journal":{"name":"Parallel Processing Letters","volume":" ","pages":""},"PeriodicalIF":0.4,"publicationDate":"2023-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46079544","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
扫码关注我们
求助内容：
应助结果提醒方式：