Xirong Xu, Huifeng Zhang, Ziming Wang, Qiang Zhang, P. Zhang
{"title":"(n - 2)-Fault-Tolerant Edge-Pancyclicity of Crossed Cubes CQn","authors":"Xirong Xu, Huifeng Zhang, Ziming Wang, Qiang Zhang, P. Zhang","doi":"10.1142/S0129054121500167","DOIUrl":"https://doi.org/10.1142/S0129054121500167","url":null,"abstract":"As one of the most fundamental networks for parallel and distributed computation, cycle is suitable for developing simple algorithms with low communication cost. A graph G is called k-fault-toleran...","PeriodicalId":192109,"journal":{"name":"Int. J. Found. Comput. Sci.","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115872833","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":"Algorithmic Aspects of Outer-Independent Total Roman Domination in Graphs","authors":"Amit Sharma, P. V. S. Reddy","doi":"10.1142/S0129054121500180","DOIUrl":"https://doi.org/10.1142/S0129054121500180","url":null,"abstract":"For a simple, undirected graph G, a function h : V (G) →{0, 1, 2} which satisfies the following conditions is called an outer-independent total Roman dominating function (OITRDF) of G with weight h...","PeriodicalId":192109,"journal":{"name":"Int. J. Found. Comput. Sci.","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-01-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133504102","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}
Zeynep Nihan Berberler, H. Yildirim, Tolga İltüzer, İzzet Tunç
{"title":"Agglomeration-Based Node Importance Analysis in Wheel-Type Networks","authors":"Zeynep Nihan Berberler, H. Yildirim, Tolga İltüzer, İzzet Tunç","doi":"10.1142/S0129054121500210","DOIUrl":"https://doi.org/10.1142/S0129054121500210","url":null,"abstract":"Evaluating the importance of nodes for complex networks is an important part of invulnerability research. In this paper, node importance analysis is conducted in wheel-related networks by a method ...","PeriodicalId":192109,"journal":{"name":"Int. J. Found. Comput. Sci.","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126832356","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 Commutative Equivalence of Algebraic Formal Series and Languages","authors":"A. Carpi, Flavio D'Alessandro","doi":"10.1142/S0129054121500192","DOIUrl":"https://doi.org/10.1142/S0129054121500192","url":null,"abstract":"The problem of the commutative equivalence of context-free and regular languages is studied. Conditions ensuring that a context-free language of exponential growth is commutatively equivalent with a regular language are investigated.","PeriodicalId":192109,"journal":{"name":"Int. J. Found. Comput. Sci.","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126558853","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":"An Exchanged 3-Ary n-Cube Interconnection Network for Parallel Computation","authors":"Yali Lv, Cheng-Kuan Lin, Guijuan Wang","doi":"10.1142/S0129054121500131","DOIUrl":"https://doi.org/10.1142/S0129054121500131","url":null,"abstract":"The interconnetion network plays an important role in a parallel system. To avoid the edge number of the interconnect network scaling rapidly with the increase of dimension and achieve a good balan...","PeriodicalId":192109,"journal":{"name":"Int. J. Found. Comput. Sci.","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122905009","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}
Yihong Wang, Cheng-Kuan Lin, Shuming Zhou, Tao Tian
{"title":"Subgraph-based Strong Menger Connectivity of Hypercube and Exchanged Hypercube","authors":"Yihong Wang, Cheng-Kuan Lin, Shuming Zhou, Tao Tian","doi":"10.1142/S0129054121500179","DOIUrl":"https://doi.org/10.1142/S0129054121500179","url":null,"abstract":"Large scale multiprocessor systems or multicomputer systems, taking interconnection networks as underlying topologies, have been widely used in the big data era. Fault tolerance is becoming an esse...","PeriodicalId":192109,"journal":{"name":"Int. J. Found. Comput. Sci.","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-01-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132749995","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}
Holger Bock Axelsen, Martin Kutrib, Andreas Malcher, Matthias Wendlandt
{"title":"Boosting Reversible Pushdown and Queue Machines by Preprocessing","authors":"Holger Bock Axelsen, Martin Kutrib, Andreas Malcher, Matthias Wendlandt","doi":"10.1142/s0129054120420022","DOIUrl":"https://doi.org/10.1142/s0129054120420022","url":null,"abstract":"It is well known that reversible finite automata do not accept all regular languages, that reversible pushdown automata do not accept all deterministic context-free languages, and that reversible queue automata are less powerful than deterministic real-time queue automata. It is of significant interest from both a practical and theoretical point of view to close these gaps. We here extend these reversible models by a preprocessing unit which is basically a reversible injective and length-preserving finite state transducer. It turns out that preprocessing the input using such weak devices increases the computational power of reversible deterministic finite automata to the acceptance of all regular languages, whereas for reversible pushdown automata the accepted family of languages lies strictly in between the reversible deterministic context-free languages and the real-time deterministic context-free languages. For reversible queue automata the preprocessing of the input leads to machines that are stronger than real-time reversible queue automata, but less powerful than real-time deterministic (irreversible) queue automata. Moreover, it is shown that the computational power of all three types of machines is not changed by allowing the preprocessing finite state transducer to work irreversibly. Finally, we examine the closure properties of the family of languages accepted by such machines.","PeriodicalId":192109,"journal":{"name":"Int. J. Found. Comput. Sci.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123694644","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":"Synchronizing Almost-Group Automata","authors":"M. Berlinkov, C. Nicaud","doi":"10.1142/s0129054120420058","DOIUrl":"https://doi.org/10.1142/s0129054120420058","url":null,"abstract":"In this paper we address the question of synchronizing random automata in the critical settings of almost-group automata. Group automata are automata where all letters act as permutations on the set of states, and they are not synchronizing (unless they have one state). In almost-group automata, one of the letters acts as a permutation on [Formula: see text] states, and the others as permutations. We prove that this small change is enough for automata to become synchronizing with high probability. More precisely, we establish that the probability that a strongly-connected almost-group automaton is not synchronizing is [Formula: see text], for a [Formula: see text]-letter alphabet. We also present an efficient algorithm that decides whether a strongly-connected almost-group automaton is synchronizing. For a natural model of computation, we establish a [Formula: see text] worst-case lower bound for this problem ([Formula: see text] for the average case), which is almost matched by our algorithm.","PeriodicalId":192109,"journal":{"name":"Int. J. Found. Comput. Sci.","volume":"362 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115954309","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":"The Non-inclusive Diagnosability of Hypercubes under the MM* Model","authors":"Tongtong Ding, Min Xu, Qiang Zhu","doi":"10.1142/s0129054120500355","DOIUrl":"https://doi.org/10.1142/s0129054120500355","url":null,"abstract":"Diagnosability is an important factor in multiple-processor systems defined as the maximum number of faulty nodes that a system can recognize. In this paper, we propose a new form of diagnosability...","PeriodicalId":192109,"journal":{"name":"Int. J. Found. Comput. Sci.","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114897215","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":"New Constructions of Codebooks Nearly Meeting the Welch Bound","authors":"Zexia Shi, Lei Sun, Fang-Wei Fu","doi":"10.1142/s012905412050032x","DOIUrl":"https://doi.org/10.1142/s012905412050032x","url":null,"abstract":"Optimal codebooks meeting the Welch bound with equality are desirable in many areas, such as direct spread code division multiple access communications, compressed sensing and so on. However, it is...","PeriodicalId":192109,"journal":{"name":"Int. J. Found. Comput. Sci.","volume":"94 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122534150","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号
