Pub Date : 2024-01-02DOI: 10.1080/23799927.2023.2300083
A. Tansel
{"title":"Temporal Data Modeling and Integrity Constraints in Relational Databases","authors":"A. Tansel","doi":"10.1080/23799927.2023.2300083","DOIUrl":"https://doi.org/10.1080/23799927.2023.2300083","url":null,"abstract":"","PeriodicalId":37216,"journal":{"name":"International Journal of Computer Mathematics: Computer Systems Theory","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2024-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139389811","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-06DOI: 10.1080/23799927.2023.2279204
S Deepika, P. Arathi
AbstractChemical graph theory acts as a tool for converting the molecular information to a numerical parameter. Topological indices are numeric quantities that related with physio-chemical properties of chemical compounds. Distance and Degree based topological indices and Counting related polynomials are three prominent and extensively researched classes of topological indices. In all these categories, distance based topological descriptors have significant impact in chemical graph theory. In this paper, the “Total eccentricity index ζ(G), Geometric-arithmetic index GA4(G), Eccentricity based Zagreb indices M1∗(G),M1∗∗(G) and M2∗(G), Average eccentricity index avec(G), and Atom-bond connectivity index ABC5(G)” of hexagonal networks are computed.Keywords: Total eccentricity indexGeometric arithmetic indexEccentricity version of Zagreb indicesAverage eccentricity indexAtom bond connectivity index and hexagonal networkKeywords: Mathematics Subject Classification (2000): 05C12, 05C90, 92E10, 05C92, 05C09DisclaimerAs a service to authors and researchers we are providing this version of an accepted manuscript (AM). Copyediting, typesetting, and review of the resulting proofs will be undertaken on this manuscript before final publication of the Version of Record (VoR). During production and pre-press, errors may be discovered which could affect the content, and all legal disclaimers that apply to the journal relate to these versions also. FundingThe authors declare that no funds, grants, or other support were received during the preparation of this manuscript.Data availabilityData sharing not applicable to this article as no datasets were generated or analyzed during the current study.Conflicts of interestThe authors have no relevant financial or non-financial interests to disclose.
{"title":"Eccentricity based Topological indices of Hexagonal Network","authors":"S Deepika, P. Arathi","doi":"10.1080/23799927.2023.2279204","DOIUrl":"https://doi.org/10.1080/23799927.2023.2279204","url":null,"abstract":"AbstractChemical graph theory acts as a tool for converting the molecular information to a numerical parameter. Topological indices are numeric quantities that related with physio-chemical properties of chemical compounds. Distance and Degree based topological indices and Counting related polynomials are three prominent and extensively researched classes of topological indices. In all these categories, distance based topological descriptors have significant impact in chemical graph theory. In this paper, the “Total eccentricity index ζ(G), Geometric-arithmetic index GA4(G), Eccentricity based Zagreb indices M1∗(G),M1∗∗(G) and M2∗(G), Average eccentricity index avec(G), and Atom-bond connectivity index ABC5(G)” of hexagonal networks are computed.Keywords: Total eccentricity indexGeometric arithmetic indexEccentricity version of Zagreb indicesAverage eccentricity indexAtom bond connectivity index and hexagonal networkKeywords: Mathematics Subject Classification (2000): 05C12, 05C90, 92E10, 05C92, 05C09DisclaimerAs a service to authors and researchers we are providing this version of an accepted manuscript (AM). Copyediting, typesetting, and review of the resulting proofs will be undertaken on this manuscript before final publication of the Version of Record (VoR). During production and pre-press, errors may be discovered which could affect the content, and all legal disclaimers that apply to the journal relate to these versions also. FundingThe authors declare that no funds, grants, or other support were received during the preparation of this manuscript.Data availabilityData sharing not applicable to this article as no datasets were generated or analyzed during the current study.Conflicts of interestThe authors have no relevant financial or non-financial interests to disclose.","PeriodicalId":37216,"journal":{"name":"International Journal of Computer Mathematics: Computer Systems Theory","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135636468","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-02DOI: 10.1080/23799927.2023.2278098
Kiran R. Bhutani, Ravi Kalpathy, Hosam Mahmoud, Achuna Ofonedu
AbstractMulti-hooking networks are a broad class of random hooking networks introduced in [8] wherein multiple copies of a seed are hooked at each step, and the number of copies follows a predetermined building sequence of numbers. For motivation, we provide two examples: one from chemistry and one from electrical engineering. We explore the empirical and theoretical local degree distribution of a specific node during its temporal evolution. We ask what will happen to the degree of a specific node at step n that first appeared in the network at step j. We conducted an experimental study to identify some cases with Gaussian asymptotic distributions, which we then proved. Additionally, we investigate the distance in the network through the lens of the average Wiener index for which we obtain a theoretical result for any building sequence and explore its empirical distribution for certain classes of building sequences that have systematic growth.Keywords: Networksrandom graphsdegree profileWiener indexrecurrenceasymptotic analysisAMS subject classifications:: Primary: 05C82Secondary: 05C1260C0560F0590B15DisclaimerAs a service to authors and researchers we are providing this version of an accepted manuscript (AM). Copyediting, typesetting, and review of the resulting proofs will be undertaken on this manuscript before final publication of the Version of Record (VoR). During production and pre-press, errors may be discovered which could affect the content, and all legal disclaimers that apply to the journal relate to these versions also. AcknowledgmentsThe authors would like to thank Dominic Abela for developing and designing the initial prototype of an interactive application.Data availability statementThe data that support the findings of this study are available from the corresponding author upon reasonable request.Notes1 MapleTM is a trademark of Waterloo Maple Inc.2 Note that this theorem does not require the regularity conditions needed in theorem 1; the building sequence is entirely arbitrary.
【摘要】多钩子网络是[8]中引入的一类广泛的随机钩子网络，其中在每一步都钩住一个种子的多个副本，并且副本的数量遵循预定的构建序列。为了激励，我们提供两个例子:一个来自化学，一个来自电气工程。我们探索了特定节点在时间演化过程中的经验和理论局部度分布。我们的问题是，在步骤n的特定节点在步骤j的网络中首次出现的程度会发生什么。我们进行了一项实验研究，以确定高斯渐近分布的一些情况，然后我们证明了这一点。此外，我们通过平均维纳指数的透镜来研究网络中的距离，我们获得了任何建筑序列的理论结果，并探索了具有系统增长的某些类别的建筑序列的经验分布。关键词:网络随机图度谱wiener索引递归性分析ams主题分类:初级:0582次级:051260c0560f0590b15免责声明作为对作者和研究人员的服务，我们提供此版本的接受稿件(AM)。在最终出版版本记录(VoR)之前，将对该手稿进行编辑、排版和审查。在制作和印前，可能会发现可能影响内容的错误，所有适用于期刊的法律免责声明也与这些版本有关。作者要感谢Dominic Abela开发和设计了交互式应用程序的初始原型。数据可得性声明支持本研究结果的数据可根据通讯作者的合理要求获得。注1 MapleTM是Waterloo Maple inc .的商标。注:此定理不需要定理1所需要的正则性条件;建筑顺序完全是任意的。
{"title":"Some empirical and theoretical attributes of random multi-hooking networks","authors":"Kiran R. Bhutani, Ravi Kalpathy, Hosam Mahmoud, Achuna Ofonedu","doi":"10.1080/23799927.2023.2278098","DOIUrl":"https://doi.org/10.1080/23799927.2023.2278098","url":null,"abstract":"AbstractMulti-hooking networks are a broad class of random hooking networks introduced in [8] wherein multiple copies of a seed are hooked at each step, and the number of copies follows a predetermined building sequence of numbers. For motivation, we provide two examples: one from chemistry and one from electrical engineering. We explore the empirical and theoretical local degree distribution of a specific node during its temporal evolution. We ask what will happen to the degree of a specific node at step n that first appeared in the network at step j. We conducted an experimental study to identify some cases with Gaussian asymptotic distributions, which we then proved. Additionally, we investigate the distance in the network through the lens of the average Wiener index for which we obtain a theoretical result for any building sequence and explore its empirical distribution for certain classes of building sequences that have systematic growth.Keywords: Networksrandom graphsdegree profileWiener indexrecurrenceasymptotic analysisAMS subject classifications:: Primary: 05C82Secondary: 05C1260C0560F0590B15DisclaimerAs a service to authors and researchers we are providing this version of an accepted manuscript (AM). Copyediting, typesetting, and review of the resulting proofs will be undertaken on this manuscript before final publication of the Version of Record (VoR). During production and pre-press, errors may be discovered which could affect the content, and all legal disclaimers that apply to the journal relate to these versions also. AcknowledgmentsThe authors would like to thank Dominic Abela for developing and designing the initial prototype of an interactive application.Data availability statementThe data that support the findings of this study are available from the corresponding author upon reasonable request.Notes1 MapleTM is a trademark of Waterloo Maple Inc.2 Note that this theorem does not require the regularity conditions needed in theorem 1; the building sequence is entirely arbitrary.","PeriodicalId":37216,"journal":{"name":"International Journal of Computer Mathematics: Computer Systems Theory","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135972980","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.1080/23799927.2023.2260349
Caixi Xue, Shuming Zhou, Hong Zhang, Qifan Zhang
AbstractClassical connectivity is a vital metric to assess the reliability of interconnection networks, while it has defects in the defective assumption that all neighbours of one node may fail concurrently. To overcome this deficiency, many new generalizations of traditional connectivity, such as g-component (edge) connectivity, restricted (edge) connectivity, g-extra (edge) connectivity and so on, have been suggested. For any positive integer a, the a-regular edge connectivity of a connected graph G is the minimum cardinality of an edge cut, whose deletion disconnects G so that each component is a a-regular graph. In this work, we investigate the a-regular edge connectivity of some regular networks, which provides a novel idea for further exploring the reliability of networks. Finally, simulations are carried out to compare the a-regular connectivity with other types of connectivity in some regular networks. The comparison results imply that the a-regular edge connectivity has its superiority.KEYWORDS: Interconnection networksconnectivitya-regular edge connectivityregular networks Disclosure statementNo potential conflict of interest was reported by the author(s).Additional informationFundingThis work was partly supported by the National Natural Science Foundation of China [grant numbers 61977016, 61572010, and 62277010], Natural Science Foundation of Fujian Province, China [grant numbers 2020J01164 and 2017J01738]. This work was also partly supported by the China Scholarship Council [CSC number 202108350054].
{"title":"The regular edge connectivity of regular networks","authors":"Caixi Xue, Shuming Zhou, Hong Zhang, Qifan Zhang","doi":"10.1080/23799927.2023.2260349","DOIUrl":"https://doi.org/10.1080/23799927.2023.2260349","url":null,"abstract":"AbstractClassical connectivity is a vital metric to assess the reliability of interconnection networks, while it has defects in the defective assumption that all neighbours of one node may fail concurrently. To overcome this deficiency, many new generalizations of traditional connectivity, such as g-component (edge) connectivity, restricted (edge) connectivity, g-extra (edge) connectivity and so on, have been suggested. For any positive integer a, the a-regular edge connectivity of a connected graph G is the minimum cardinality of an edge cut, whose deletion disconnects G so that each component is a a-regular graph. In this work, we investigate the a-regular edge connectivity of some regular networks, which provides a novel idea for further exploring the reliability of networks. Finally, simulations are carried out to compare the a-regular connectivity with other types of connectivity in some regular networks. The comparison results imply that the a-regular edge connectivity has its superiority.KEYWORDS: Interconnection networksconnectivitya-regular edge connectivityregular networks Disclosure statementNo potential conflict of interest was reported by the author(s).Additional informationFundingThis work was partly supported by the National Natural Science Foundation of China [grant numbers 61977016, 61572010, and 62277010], Natural Science Foundation of Fujian Province, China [grant numbers 2020J01164 and 2017J01738]. This work was also partly supported by the China Scholarship Council [CSC number 202108350054].","PeriodicalId":37216,"journal":{"name":"International Journal of Computer Mathematics: Computer Systems Theory","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136033652","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-12DOI: 10.1080/23799927.2023.2262433
Rafik Aguech, Wissem Jedidi, Olfa Selmi
AbstractIn this paper, we give some results about a multi-drawing urn with random addition matrix. The process that we study is described as: at stage n≥1, we pick out at random m balls, say k white balls and m−k black balls. We inspect the colours and then we return the balls, according to a predefined replacement matrix, together with (m−k)Xn white balls and kYn black balls. Here, we extend the classical assumption that the random variables (Xn,Yn) are bounded and i.i.d. We prove a strong law of large numbers and a central limit theorem on the proportion of white balls for the total number of balls after n draws under the following more general assumptions: (i) a finite second-order moment condition in the i.i.d. case; (ii) regular variation type for the first and second moments in the independent case.Keywords: Central limit theoremmartingaleregular variationunbalanced urnstochastic algorithmstrong law of large numbers AcknowledgementsThe authors would like to extend their sincere appreciation to the Deanship of Scientific Research at King Saud University for funding their Research group No. (RG-1441-317).Disclosure statementNo potential conflict of interest was reported by the author(s).Additional informationFundingThis work was supported by the Deanship of Scientific Research at King Saud University for funding their Research group No. (RG-1441-317).
{"title":"Unbalanced multi-drawing urn with random addition matrix II","authors":"Rafik Aguech, Wissem Jedidi, Olfa Selmi","doi":"10.1080/23799927.2023.2262433","DOIUrl":"https://doi.org/10.1080/23799927.2023.2262433","url":null,"abstract":"AbstractIn this paper, we give some results about a multi-drawing urn with random addition matrix. The process that we study is described as: at stage n≥1, we pick out at random m balls, say k white balls and m−k black balls. We inspect the colours and then we return the balls, according to a predefined replacement matrix, together with (m−k)Xn white balls and kYn black balls. Here, we extend the classical assumption that the random variables (Xn,Yn) are bounded and i.i.d. We prove a strong law of large numbers and a central limit theorem on the proportion of white balls for the total number of balls after n draws under the following more general assumptions: (i) a finite second-order moment condition in the i.i.d. case; (ii) regular variation type for the first and second moments in the independent case.Keywords: Central limit theoremmartingaleregular variationunbalanced urnstochastic algorithmstrong law of large numbers AcknowledgementsThe authors would like to extend their sincere appreciation to the Deanship of Scientific Research at King Saud University for funding their Research group No. (RG-1441-317).Disclosure statementNo potential conflict of interest was reported by the author(s).Additional informationFundingThis work was supported by the Deanship of Scientific Research at King Saud University for funding their Research group No. (RG-1441-317).","PeriodicalId":37216,"journal":{"name":"International Journal of Computer Mathematics: Computer Systems Theory","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135923149","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-02DOI: 10.1080/23799927.2023.2278109
Weizhen Chen, Suonan Renqian, Qingcuo Ren, Xin Li
In this paper, a sufficient condition with regard to tight toughness, isolated toughness and binding number bounds to guarantee the existence of the $ {K_{2}, C_{n}:ngeq 3} $ {K2,Cn:n≥3}-factor and $ {P_{2}, P_{3}} $ {P2,P3}-factor for any graph is obtained.
{"title":"Tight toughness, isolated toughness and binding number bounds for the path-cycle factors","authors":"Weizhen Chen, Suonan Renqian, Qingcuo Ren, Xin Li","doi":"10.1080/23799927.2023.2278109","DOIUrl":"https://doi.org/10.1080/23799927.2023.2278109","url":null,"abstract":"In this paper, a sufficient condition with regard to tight toughness, isolated toughness and binding number bounds to guarantee the existence of the $ {K_{2}, C_{n}:ngeq 3} $ {K2,Cn:n≥3}-factor and $ {P_{2}, P_{3}} $ {P2,P3}-factor for any graph is obtained.","PeriodicalId":37216,"journal":{"name":"International Journal of Computer Mathematics: Computer Systems Theory","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2023-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139324556","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-03DOI: 10.1080/23799927.2023.2229278
Henry Gray, Christopher Battarbee, S. F. Shahandashti, Delaram Kahrobaei
This report proposes a new and novel attack on McEliece's cryptosystem that improves on the probability of attacks formerly proposed by Stern, and Lee and Brickell. Modern day encryption standards have been long since proven insecure to quantum attack, and quantum-resistant cryptosystems are now at the forefront of research. Since 2016, the National Institute of Standards and Technology (NIST) has presided over a public competition to establish new standards for public-key encryption that will secure our data in the post-quantum world. Now in its final round, one of the remaining candidates is McEliece's cryptosystem, a code-based cryptosystem proposed in 1978 by Robert J. McEliece. With a few minor alterations since its conception, McEliece's cryptosystem has, so far, proven resistant to quantum attacks, making it an ideal finalist candidate. The cryptosystem has not, however, escaped the attention of attack and, over the last four decades, a variety of algorithms have been proposed with the intention of exploiting it to recover the plaintext. This paper initially provides an overview of McEliece's cryptosystem and two existing attacks proposed by Stern, and Lee and Brickell in the 1980s. Observations are made on the shared probabilistic nature of Stern's algorithm, and Lee and Brickell's attack. It is noted that the first step of both algorithms involves the random selection of a subset of n indexes. In Stern's algorithm, n−k of n columns in a matrix H are chosen at random and, in Lee and Brickell's attack, k of n bits of the ciphertext are selected, also at random. This relationship is exploited to compound the two attacks and propose a new, novel attack. The complexity and probability of the new attack are discussed and an analysis is conducted to compare it against both Stern's algorithm and Lee and Brickell's attack. This analysis suggests that the probability of successful attack comes close to combining those of the two original attacks. Furthermore, the results suggest that the novel attack can successfully recover a message faster than Stern's algorithm. Improvements to the attack are suggested, concluding that further study should be conducted into fully analysing it and its implications on the security of McEliece's cryptosystem.
本报告提出了一种针对McEliece密码系统的新攻击方法，该方法提高了Stern、Lee和Brickell先前提出的攻击概率。现代加密标准早已被证明对量子攻击不安全，而抗量子密码系统现在处于研究的前沿。自2016年以来，美国国家标准与技术研究院(NIST)主持了一项公开竞赛，旨在建立新的公钥加密标准，以在后量子世界中保护我们的数据。现在进入最后一轮，剩下的候选人之一是McEliece的密码系统，这是1978年由Robert J. McEliece提出的基于代码的密码系统。McEliece的密码系统自构想以来进行了一些小的修改，到目前为止，它已经被证明可以抵抗量子攻击，使其成为理想的决赛候选人。然而，密码系统并没有逃过攻击的注意，在过去的四十年里，各种各样的算法被提出，目的是利用它来恢复明文。本文首先概述了McEliece的密码系统以及Stern、Lee和Brickell在20世纪80年代提出的两种现有攻击。对Stern算法和Lee和Brickell攻击的共同概率性质进行了观察。值得注意的是，这两种算法的第一步都涉及到n个索引子集的随机选择。在Stern的算法中，矩阵H的n列中的n - k列是随机选择的，而在Lee和Brickell的攻击中，密文的k位也是随机选择的。这种关系被用来混合两种攻击，并提出一种新的、新颖的攻击。讨论了新攻击的复杂性和概率，并将其与Stern的算法和Lee和Brickell的攻击进行了比较分析。这一分析表明，成功攻击的概率接近于两次原始攻击的总和。此外，结果表明，这种新的攻击可以比Stern的算法更快地成功恢复信息。建议对攻击进行改进，并得出结论，应该进行进一步的研究，以充分分析它及其对McEliece密码系统安全性的影响。
{"title":"A novel attack on McEliece's cryptosystem","authors":"Henry Gray, Christopher Battarbee, S. F. Shahandashti, Delaram Kahrobaei","doi":"10.1080/23799927.2023.2229278","DOIUrl":"https://doi.org/10.1080/23799927.2023.2229278","url":null,"abstract":"This report proposes a new and novel attack on McEliece's cryptosystem that improves on the probability of attacks formerly proposed by Stern, and Lee and Brickell. Modern day encryption standards have been long since proven insecure to quantum attack, and quantum-resistant cryptosystems are now at the forefront of research. Since 2016, the National Institute of Standards and Technology (NIST) has presided over a public competition to establish new standards for public-key encryption that will secure our data in the post-quantum world. Now in its final round, one of the remaining candidates is McEliece's cryptosystem, a code-based cryptosystem proposed in 1978 by Robert J. McEliece. With a few minor alterations since its conception, McEliece's cryptosystem has, so far, proven resistant to quantum attacks, making it an ideal finalist candidate. The cryptosystem has not, however, escaped the attention of attack and, over the last four decades, a variety of algorithms have been proposed with the intention of exploiting it to recover the plaintext. This paper initially provides an overview of McEliece's cryptosystem and two existing attacks proposed by Stern, and Lee and Brickell in the 1980s. Observations are made on the shared probabilistic nature of Stern's algorithm, and Lee and Brickell's attack. It is noted that the first step of both algorithms involves the random selection of a subset of n indexes. In Stern's algorithm, n−k of n columns in a matrix H are chosen at random and, in Lee and Brickell's attack, k of n bits of the ciphertext are selected, also at random. This relationship is exploited to compound the two attacks and propose a new, novel attack. The complexity and probability of the new attack are discussed and an analysis is conducted to compare it against both Stern's algorithm and Lee and Brickell's attack. This analysis suggests that the probability of successful attack comes close to combining those of the two original attacks. Furthermore, the results suggest that the novel attack can successfully recover a message faster than Stern's algorithm. Improvements to the attack are suggested, concluding that further study should be conducted into fully analysing it and its implications on the security of McEliece's cryptosystem.","PeriodicalId":37216,"journal":{"name":"International Journal of Computer Mathematics: Computer Systems Theory","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2023-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80805495","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-03DOI: 10.1080/23799927.2023.2227147
Wafa Aouadj, Rachid Seghir
ABSTRACT Multi-objective optimization problems with large-scale decision variables, known as LSMOPs, are characterized by their large-scale search space and multiple conflicting objectives to be optimized. They have been involved in many emergent real-world applications, such as feature and instance selection, data clustering, adversarial attack, vehicle routing problem, and others. In this work, we propose a new teaching-learning-based optimization algorithm to effectively tackle large-scale multi-objective optimization problems. The proposed approach ensures both the diversity of solutions, requested for high dimensionality of LSMOPs, and the balance between the exploitation and exploration during the optimization process. The experimental studies conducted on 54 instances of a large-scale multi-objective optimization problems test suite and the comparisons against well-known and state-of-the-art algorithms have shown the superiority of the proposed algorithm in terms of Pareto front approximation and computation time by using limited evaluation budget.
{"title":"A fast and efficient teaching-learning-based optimization algorithm for large-scale multi-objective optimization problems","authors":"Wafa Aouadj, Rachid Seghir","doi":"10.1080/23799927.2023.2227147","DOIUrl":"https://doi.org/10.1080/23799927.2023.2227147","url":null,"abstract":"ABSTRACT Multi-objective optimization problems with large-scale decision variables, known as LSMOPs, are characterized by their large-scale search space and multiple conflicting objectives to be optimized. They have been involved in many emergent real-world applications, such as feature and instance selection, data clustering, adversarial attack, vehicle routing problem, and others. In this work, we propose a new teaching-learning-based optimization algorithm to effectively tackle large-scale multi-objective optimization problems. The proposed approach ensures both the diversity of solutions, requested for high dimensionality of LSMOPs, and the balance between the exploitation and exploration during the optimization process. The experimental studies conducted on 54 instances of a large-scale multi-objective optimization problems test suite and the comparisons against well-known and state-of-the-art algorithms have shown the superiority of the proposed algorithm in terms of Pareto front approximation and computation time by using limited evaluation budget.","PeriodicalId":37216,"journal":{"name":"International Journal of Computer Mathematics: Computer Systems Theory","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2023-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83283780","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-06-25DOI: 10.1080/23799927.2023.2225049
Dongqin Cheng
The bubble-sort star graph is an interconnection network for multiprocessor systems. Recursive structure is important for interconnection networks, since it can reduce the complex cases into simple cases, and it can keep good properties independent of dimensions. Many algorithms use the idea of recursive construction. Edge-disjoint Hamiltonian cycles not only provide the basis of all-to-all broadcasting algorithm for networks but also provide a replaceable Hamiltonian cycle for transmission when the other Hamiltonian cycle contains faulty edges in an interconnection network. In this paper, we propose the recursive definition of bubble-sort star graphs. Then as an application, we obtain two edge-disjoint Hamiltonian cycles of bubble-sort star graphs.
{"title":"Recursive definition and two edge-disjoint Hamiltonian cycles of bubble-sort star graphs","authors":"Dongqin Cheng","doi":"10.1080/23799927.2023.2225049","DOIUrl":"https://doi.org/10.1080/23799927.2023.2225049","url":null,"abstract":"The bubble-sort star graph is an interconnection network for multiprocessor systems. Recursive structure is important for interconnection networks, since it can reduce the complex cases into simple cases, and it can keep good properties independent of dimensions. Many algorithms use the idea of recursive construction. Edge-disjoint Hamiltonian cycles not only provide the basis of all-to-all broadcasting algorithm for networks but also provide a replaceable Hamiltonian cycle for transmission when the other Hamiltonian cycle contains faulty edges in an interconnection network. In this paper, we propose the recursive definition of bubble-sort star graphs. Then as an application, we obtain two edge-disjoint Hamiltonian cycles of bubble-sort star graphs.","PeriodicalId":37216,"journal":{"name":"International Journal of Computer Mathematics: Computer Systems Theory","volume":null,"pages":null},"PeriodicalIF":0.8,"publicationDate":"2023-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85585404","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
扫码关注我们
求助内容：
应助结果提醒方式：