International Journal of Computer Mathematics: Computer Systems Theory最新文献

筛选
英文 中文
Temporal Data Modeling and Integrity Constraints in Relational Databases 关系数据库中的时态数据建模和完整性约束
IF 0.8
International Journal of Computer Mathematics: Computer Systems Theory Pub Date : 2024-01-02 DOI: 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}
引用次数: 0
Star structure fault tolerance of Bicube networks 双立方网络的星形结构容错
IF 0.8
International Journal of Computer Mathematics: Computer Systems Theory Pub Date : 2024-01-02 DOI: 10.1080/23799927.2023.2301379
Lulu Yang, Shuming Zhou, Qifan Zhang
{"title":"Star structure fault tolerance of Bicube networks","authors":"Lulu Yang, Shuming Zhou, Qifan Zhang","doi":"10.1080/23799927.2023.2301379","DOIUrl":"https://doi.org/10.1080/23799927.2023.2301379","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":"139390110","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
Eccentricity based Topological indices of Hexagonal Network 基于偏心率的六边形网络拓扑指标
International Journal of Computer Mathematics: Computer Systems Theory Pub Date : 2023-11-06 DOI: 10.1080/23799927.2023.2279204
S Deepika, P. Arathi
{"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}
引用次数: 0
Some empirical and theoretical attributes of random multi-hooking networks 随机多钩网络的一些经验和理论属性
International Journal of Computer Mathematics: Computer Systems Theory Pub Date : 2023-11-02 DOI: 10.1080/23799927.2023.2278098
Kiran R. Bhutani, Ravi Kalpathy, Hosam Mahmoud, Achuna Ofonedu
{"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}
引用次数: 0
The regular edge connectivity of regular networks 规则网络的规则边缘连通性
International Journal of Computer Mathematics: Computer Systems Theory Pub Date : 2023-10-17 DOI: 10.1080/23799927.2023.2260349
Caixi Xue, Shuming Zhou, Hong Zhang, Qifan Zhang
{"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}
引用次数: 0
Unbalanced multi-drawing urn with random addition matrix II 随机加法矩阵的不平衡多拉缸ⅱ
International Journal of Computer Mathematics: Computer Systems Theory Pub Date : 2023-10-12 DOI: 10.1080/23799927.2023.2262433
Rafik Aguech, Wissem Jedidi, Olfa Selmi
{"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}
引用次数: 0
Tight toughness, isolated toughness and binding number bounds for the path-cycle factors 路径周期因子的紧密韧性、孤立韧性和结合数界限
IF 0.8
International Journal of Computer Mathematics: Computer Systems Theory Pub Date : 2023-10-02 DOI: 10.1080/23799927.2023.2278109
Weizhen Chen, Suonan Renqian, Qingcuo Ren, Xin Li
{"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}
引用次数: 0
A novel attack on McEliece's cryptosystem 对麦克利埃斯密码系统的新攻击
IF 0.8
International Journal of Computer Mathematics: Computer Systems Theory Pub Date : 2023-07-03 DOI: 10.1080/23799927.2023.2229278
Henry Gray, Christopher Battarbee, S. F. Shahandashti, Delaram Kahrobaei
{"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}
引用次数: 0
A fast and efficient teaching-learning-based optimization algorithm for large-scale multi-objective optimization problems 一种快速高效的基于教-学的大规模多目标优化问题优化算法
IF 0.8
International Journal of Computer Mathematics: Computer Systems Theory Pub Date : 2023-07-03 DOI: 10.1080/23799927.2023.2227147
Wafa Aouadj, Rachid Seghir
{"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}
引用次数: 0
Recursive definition and two edge-disjoint Hamiltonian cycles of bubble-sort star graphs 泡状星图的递归定义和两条边不相交哈密顿环
IF 0.8
International Journal of Computer Mathematics: Computer Systems Theory Pub Date : 2023-06-25 DOI: 10.1080/23799927.2023.2225049
Dongqin Cheng
{"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}
引用次数: 1
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学术官方微信