Pub Date : 2020-10-01DOI: 10.1080/23799927.2020.1815856
O. Arogundade, S. I. Olotu, O. Abayomi-Alli, S. Misra, A. M. Ikotun
Use case has embedded potentials that enable the diversity in its adoption to addressing other issues in software engineering. This objective of this paper is to gathered and classified use case researches carried out over the years and defines the state-of-art. We identified and analysed 62 relevant articles with deep insights into six different initiatives. The publications included 29 journal articles, 18 conference articles, 3 reports, 5 book chapters, 5 workshops and 2 symposiums. This study deduced that as many as 15 different extensions are proposed from use case ranging from formal descriptions to subjective methodology. Use case has evolved from initial functional requirement elicitation to a more formal and extensive structure. There are fewer publications in cloud computing and use case-based systems. This study contributed to the use case body of knowledge by assessing the extended initiatives and giving an overview of the challenges that are not yet resolved.
{"title":"A study of existing use case extensions and experience: a systematic review","authors":"O. Arogundade, S. I. Olotu, O. Abayomi-Alli, S. Misra, A. M. Ikotun","doi":"10.1080/23799927.2020.1815856","DOIUrl":"https://doi.org/10.1080/23799927.2020.1815856","url":null,"abstract":"Use case has embedded potentials that enable the diversity in its adoption to addressing other issues in software engineering. This objective of this paper is to gathered and classified use case researches carried out over the years and defines the state-of-art. We identified and analysed 62 relevant articles with deep insights into six different initiatives. The publications included 29 journal articles, 18 conference articles, 3 reports, 5 book chapters, 5 workshops and 2 symposiums. This study deduced that as many as 15 different extensions are proposed from use case ranging from formal descriptions to subjective methodology. Use case has evolved from initial functional requirement elicitation to a more formal and extensive structure. There are fewer publications in cloud computing and use case-based systems. This study contributed to the use case body of knowledge by assessing the extended initiatives and giving an overview of the challenges that are not yet resolved.","PeriodicalId":37216,"journal":{"name":"International Journal of Computer Mathematics: Computer Systems Theory","volume":"21 1","pages":"263 - 281"},"PeriodicalIF":0.8,"publicationDate":"2020-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87132675","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 : 2020-10-01DOI: 10.1080/23799927.2020.1814418
Jie-Fu Huang, S. Hsieh
In this paper, we propose a recursive algorithm and a parallel algorithm for constructing independent spanning trees in ANn. The main ideas of the recursive algorithm are to construct large trees from small trees, use triangle breadth-first search (TBFS) to build a frame of an IST, and use breadth-first search (BFS) to link the rest of the nodes. The main ideas of the parallel algorithm are to build frames through TBFS in parallel, and to use the specific rules to link the rest of the nodes in parallel. We prove the correctness of both algorithms for constructing ISTs in AN n . Both algorithms are accurate; furthermore, the parallel algorithm is more ecient than the recursive algorithm. (An extended abstract of this paper appeared in: Jie-Fu Huang and Sun-Yuan Hsieh ‘Two methods for constructing independent spanning trees in alternating group networks’ Proceedings of International Conference on Creative Lifestyle Computing (ICCLC), 2020.)
{"title":"Recursive and parallel constructions of independent spanning trees in alternating group networks","authors":"Jie-Fu Huang, S. Hsieh","doi":"10.1080/23799927.2020.1814418","DOIUrl":"https://doi.org/10.1080/23799927.2020.1814418","url":null,"abstract":"In this paper, we propose a recursive algorithm and a parallel algorithm for constructing independent spanning trees in ANn. The main ideas of the recursive algorithm are to construct large trees from small trees, use triangle breadth-first search (TBFS) to build a frame of an IST, and use breadth-first search (BFS) to link the rest of the nodes. The main ideas of the parallel algorithm are to build frames through TBFS in parallel, and to use the specific rules to link the rest of the nodes in parallel. We prove the correctness of both algorithms for constructing ISTs in AN n . Both algorithms are accurate; furthermore, the parallel algorithm is more ecient than the recursive algorithm. (An extended abstract of this paper appeared in: Jie-Fu Huang and Sun-Yuan Hsieh ‘Two methods for constructing independent spanning trees in alternating group networks’ Proceedings of International Conference on Creative Lifestyle Computing (ICCLC), 2020.)","PeriodicalId":37216,"journal":{"name":"International Journal of Computer Mathematics: Computer Systems Theory","volume":"5 1","pages":"234 - 262"},"PeriodicalIF":0.8,"publicationDate":"2020-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81943199","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 : 2020-10-01DOI: 10.1080/23799927.2020.1807606
R. Kuppan, L. Shobana, I. Cangül
The encryption and decryption is based upon the type of cryptographic scheme being employed and also in some form of key. It is most closely associated with the development and creation of the mathematical algorithms used to encrypt and decrypt messages. The combination of graph labelling techniques together with cryptography to encrypt and decrypt the numbers has been already an ongoing aspect of research. In this paper, the concept of face antimagic labelling is used for a strong face of duplication of all vertices by the edges of a tree to encrypt and decrypt 13 secret numbers.
{"title":"Encrypting and decrypting algorithms using strong face graph of a tree","authors":"R. Kuppan, L. Shobana, I. Cangül","doi":"10.1080/23799927.2020.1807606","DOIUrl":"https://doi.org/10.1080/23799927.2020.1807606","url":null,"abstract":"The encryption and decryption is based upon the type of cryptographic scheme being employed and also in some form of key. It is most closely associated with the development and creation of the mathematical algorithms used to encrypt and decrypt messages. The combination of graph labelling techniques together with cryptography to encrypt and decrypt the numbers has been already an ongoing aspect of research. In this paper, the concept of face antimagic labelling is used for a strong face of duplication of all vertices by the edges of a tree to encrypt and decrypt 13 secret numbers.","PeriodicalId":37216,"journal":{"name":"International Journal of Computer Mathematics: Computer Systems Theory","volume":"14 1","pages":"225 - 233"},"PeriodicalIF":0.8,"publicationDate":"2020-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78770343","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 : 2020-09-24DOI: 10.1080/23799927.2020.1822446
Samuel Dobson, S. Galbraith, Jason Legrow, Y. Ti, Lukas Zobernig
We present a polynomial-time adaptive attack on the 2-SIDH protocol. The 2-SIDH protocol is a special instance of the countermeasure proposed by Azarderakhsh, Jao and Leonardi to perform isogeny-based key exchange with static keys in the presence of an adaptive attack. This countermeasure has also been recently explicitly proposed by Kayacan. Our attack extends the adaptive attack by Galbraith, Petit, Shani and Ti (GPST) to recover a static secret key using malformed points. The extension of GPST is non-trivial and requires learning additional information. In particular, the attack needs to recover intermediate elliptic curves in the isogeny path, and points on them. We also discuss how to extend the attack to k-SIDH when k>2 and explain that the attack complexity is exponential in k.
{"title":"An adaptive attack on 2-SIDH","authors":"Samuel Dobson, S. Galbraith, Jason Legrow, Y. Ti, Lukas Zobernig","doi":"10.1080/23799927.2020.1822446","DOIUrl":"https://doi.org/10.1080/23799927.2020.1822446","url":null,"abstract":"We present a polynomial-time adaptive attack on the 2-SIDH protocol. The 2-SIDH protocol is a special instance of the countermeasure proposed by Azarderakhsh, Jao and Leonardi to perform isogeny-based key exchange with static keys in the presence of an adaptive attack. This countermeasure has also been recently explicitly proposed by Kayacan. Our attack extends the adaptive attack by Galbraith, Petit, Shani and Ti (GPST) to recover a static secret key using malformed points. The extension of GPST is non-trivial and requires learning additional information. In particular, the attack needs to recover intermediate elliptic curves in the isogeny path, and points on them. We also discuss how to extend the attack to k-SIDH when k>2 and explain that the attack complexity is exponential in k.","PeriodicalId":37216,"journal":{"name":"International Journal of Computer Mathematics: Computer Systems Theory","volume":"20 1","pages":"282 - 299"},"PeriodicalIF":0.8,"publicationDate":"2020-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90007046","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 : 2020-07-14DOI: 10.1080/23799927.2020.1831612
Mohammad Reza Zarrabi, N. M. Charkari
We investigate a practical variant of the well-known polygonal visibility path (watchman) problem. For a polygon P, a minimum link visibility path is a polygonal visibility path in P that has the minimum number of links. The problem of finding a minimum link visibility path is NP-hard for simple polygons. If the link-length (number of links) of a minimum link visibility path (tour) is Opt for a simple polygon P with n vertices, we provide an algorithm with runtime that produces polygonal visibility paths (or tours) of link-length at most (or ), where k is a parameter dependent on P, is an output sensitive parameter and γ is the approximation factor of an time approximation algorithm for the geometric travelling salesman problem (path or tour version).
{"title":"On approximations to minimum link visibility paths in simple polygons","authors":"Mohammad Reza Zarrabi, N. M. Charkari","doi":"10.1080/23799927.2020.1831612","DOIUrl":"https://doi.org/10.1080/23799927.2020.1831612","url":null,"abstract":"We investigate a practical variant of the well-known polygonal visibility path (watchman) problem. For a polygon P, a minimum link visibility path is a polygonal visibility path in P that has the minimum number of links. The problem of finding a minimum link visibility path is NP-hard for simple polygons. If the link-length (number of links) of a minimum link visibility path (tour) is Opt for a simple polygon P with n vertices, we provide an algorithm with runtime that produces polygonal visibility paths (or tours) of link-length at most (or ), where k is a parameter dependent on P, is an output sensitive parameter and γ is the approximation factor of an time approximation algorithm for the geometric travelling salesman problem (path or tour version).","PeriodicalId":37216,"journal":{"name":"International Journal of Computer Mathematics: Computer Systems Theory","volume":"37 1","pages":"300 - 307"},"PeriodicalIF":0.8,"publicationDate":"2020-07-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80005909","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 : 2020-07-02DOI: 10.1080/23799927.2020.1803972
Chun-Nan Hung, Mohamad Abdallah, Jui-I Weng, Tzu-Liang Kung
ABSTRACT Pancylicity was introduced by Bondy in 1971. A graph G with vertex set and edge set is pancyclic if it contains cycles of lengths l, for . This concept has been extended to edge-pancyclicity. If every edge of G is in a cycle of every length, G is edge-pancyclic. If every edge lies on cycles of all lengths ranging from k to , G is k-edge-pancyclic. In this paper, we prove that the n-dimensional pancake graph is 7-edge-pancyclic.
{"title":"Edge-pancyclicity of pancake graph","authors":"Chun-Nan Hung, Mohamad Abdallah, Jui-I Weng, Tzu-Liang Kung","doi":"10.1080/23799927.2020.1803972","DOIUrl":"https://doi.org/10.1080/23799927.2020.1803972","url":null,"abstract":"ABSTRACT Pancylicity was introduced by Bondy in 1971. A graph G with vertex set and edge set is pancyclic if it contains cycles of lengths l, for . This concept has been extended to edge-pancyclicity. If every edge of G is in a cycle of every length, G is edge-pancyclic. If every edge lies on cycles of all lengths ranging from k to , G is k-edge-pancyclic. In this paper, we prove that the n-dimensional pancake graph is 7-edge-pancyclic.","PeriodicalId":37216,"journal":{"name":"International Journal of Computer Mathematics: Computer Systems Theory","volume":"49 1","pages":"125 - 133"},"PeriodicalIF":0.8,"publicationDate":"2020-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74208104","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 : 2020-07-02DOI: 10.1080/23799927.2020.1797883
S. K. Samanta, B. Bank
This paper investigates an infinite waiting space single-server queueing system in which customers arrive according to a batch Markovian arrival process. The server serves the customers in batches of maximum size ‘b’ with a minimum threshold value ‘a’. The service time of each batch follows R-type distribution, where R-type distribution represents a class of distributions whose Laplace-Stieltjes transform is rational or approximated rational function, which is independent of service batch size and the arrival process. We determine the queue-length distribution at departure epoch in terms of roots of the associated characteristic equation of the vector probability generating function. To show the strength and advantage of roots method, we also provide a comprehensive analysis of the queue-length distribution at departure epoch using the matrix-analytic method (MAM). To determine the queue-length distribution at random epoch, we obtain a relation between the queue-length distributions at departure and random epochs using the supplementary variable technique with remaining service time of a batch in service as the supplementary variable. We also derive the queue-length distributions at pre-arrival epoch of an arrived batch and post-arrival epoch of a random customer of an arrived batch. Some numerical results are demonstrated for different service-time distributions to show the key performance measures of the system.
{"title":"Analysis of stationary queue-length distributions of the BMAP/R(a,b)/1 queue","authors":"S. K. Samanta, B. Bank","doi":"10.1080/23799927.2020.1797883","DOIUrl":"https://doi.org/10.1080/23799927.2020.1797883","url":null,"abstract":"This paper investigates an infinite waiting space single-server queueing system in which customers arrive according to a batch Markovian arrival process. The server serves the customers in batches of maximum size ‘b’ with a minimum threshold value ‘a’. The service time of each batch follows R-type distribution, where R-type distribution represents a class of distributions whose Laplace-Stieltjes transform is rational or approximated rational function, which is independent of service batch size and the arrival process. We determine the queue-length distribution at departure epoch in terms of roots of the associated characteristic equation of the vector probability generating function. To show the strength and advantage of roots method, we also provide a comprehensive analysis of the queue-length distribution at departure epoch using the matrix-analytic method (MAM). To determine the queue-length distribution at random epoch, we obtain a relation between the queue-length distributions at departure and random epochs using the supplementary variable technique with remaining service time of a batch in service as the supplementary variable. We also derive the queue-length distributions at pre-arrival epoch of an arrived batch and post-arrival epoch of a random customer of an arrived batch. Some numerical results are demonstrated for different service-time distributions to show the key performance measures of the system.","PeriodicalId":37216,"journal":{"name":"International Journal of Computer Mathematics: Computer Systems Theory","volume":"43 1","pages":"198 - 223"},"PeriodicalIF":0.8,"publicationDate":"2020-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87214834","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 : 2020-07-02DOI: 10.1080/23799927.2020.1792998
S. Pradhan
Discrete-time queues have increasingly diverse spectrum of applications in the modern packet-basedcommunication systems. Due to the wide range of applicability of such queues, we analyze a discrete-time queue with group-arrival and batch-service, where transmission time depends on the batch-size. The arrival occurs according tothe batch Bernoulli process and service is provided according to the random serving capacity rule. First, we obtain the bivariate probability generating function of the joint distribution of queue and server content at post transmission epoch. After the determination of unknown probabilities, the complete joint distribution has been extracted. We also acquire the probability distribution at random and pre-arrival epochs. An approximation of the tail distribution is also discussed so that it will be useful to improve the cell loss ratio. Some assorted numerical examples are incorporated to validate the analytic procedure and results.
{"title":"A discrete-time batch transmission channel with random serving capacity under batch-size-dependent service:","authors":"S. Pradhan","doi":"10.1080/23799927.2020.1792998","DOIUrl":"https://doi.org/10.1080/23799927.2020.1792998","url":null,"abstract":"Discrete-time queues have increasingly diverse spectrum of applications in the modern packet-basedcommunication systems. Due to the wide range of applicability of such queues, we analyze a discrete-time queue with group-arrival and batch-service, where transmission time depends on the batch-size. The arrival occurs according tothe batch Bernoulli process and service is provided according to the random serving capacity rule. First, we obtain the bivariate probability generating function of the joint distribution of queue and server content at post transmission epoch. After the determination of unknown probabilities, the complete joint distribution has been extracted. We also acquire the probability distribution at random and pre-arrival epochs. An approximation of the tail distribution is also discussed so that it will be useful to improve the cell loss ratio. Some assorted numerical examples are incorporated to validate the analytic procedure and results.","PeriodicalId":37216,"journal":{"name":"International Journal of Computer Mathematics: Computer Systems Theory","volume":"388 1","pages":"175 - 197"},"PeriodicalIF":0.8,"publicationDate":"2020-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84994118","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 : 2020-06-23DOI: 10.1080/23799927.2020.1779820
Sean Bailey, David E. Brown
Given a bipartite graph , the bipartite dot product representation of G is a function and a positive threshold t such that for any and , if and only if . The minimum k such that a bipartite dot product representation exists for G is the bipartite dot product dimension of G, denoted . We will show that such representations exist for all bipartite graphs as well as give an upper bound for the bipartite dot product dimension of any graph. We will also characterize the bipartite graphs of bipartite dot product dimension 1 by their forbidden subgraphs.
{"title":"Bipartite dot product graphs","authors":"Sean Bailey, David E. Brown","doi":"10.1080/23799927.2020.1779820","DOIUrl":"https://doi.org/10.1080/23799927.2020.1779820","url":null,"abstract":"Given a bipartite graph , the bipartite dot product representation of G is a function and a positive threshold t such that for any and , if and only if . The minimum k such that a bipartite dot product representation exists for G is the bipartite dot product dimension of G, denoted . We will show that such representations exist for all bipartite graphs as well as give an upper bound for the bipartite dot product dimension of any graph. We will also characterize the bipartite graphs of bipartite dot product dimension 1 by their forbidden subgraphs.","PeriodicalId":37216,"journal":{"name":"International Journal of Computer Mathematics: Computer Systems Theory","volume":"67 1","pages":"148 - 158"},"PeriodicalIF":0.8,"publicationDate":"2020-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89872726","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 : 2020-06-04DOI: 10.1080/23799927.2020.1771427
Chuan-Min Lee
In this paper, we propose two linear-time algorithms. One is for computing a weak elimination ordering of a bipartite distance-hereditary graph, and the other one is an alternative algorithm to solve the total R-domination problem for any chordal bipartite graph with a weak elimination ordering. Our two linear-time algorithms lead to a unified approach to several variations of total domination problems for bipartite distance-hereditary graphs. We also show that tthe total 3-domatic partition problem is NP-complete for planar graphs of maximum degree 9 and planar bipartite graphs of maximum degree 12, and show that the 4-domatic partition problem for planar graphs of maximum degree d is polynomial-time reducible to the total 4-domatic partition problem for planar graphs of maximum degree d + 1.
{"title":"The complexity of total k-domatic partition and total R-domination on graphs with weak elimination orderings","authors":"Chuan-Min Lee","doi":"10.1080/23799927.2020.1771427","DOIUrl":"https://doi.org/10.1080/23799927.2020.1771427","url":null,"abstract":"In this paper, we propose two linear-time algorithms. One is for computing a weak elimination ordering of a bipartite distance-hereditary graph, and the other one is an alternative algorithm to solve the total R-domination problem for any chordal bipartite graph with a weak elimination ordering. Our two linear-time algorithms lead to a unified approach to several variations of total domination problems for bipartite distance-hereditary graphs. We also show that tthe total 3-domatic partition problem is NP-complete for planar graphs of maximum degree 9 and planar bipartite graphs of maximum degree 12, and show that the 4-domatic partition problem for planar graphs of maximum degree d is polynomial-time reducible to the total 4-domatic partition problem for planar graphs of maximum degree d + 1.","PeriodicalId":37216,"journal":{"name":"International Journal of Computer Mathematics: Computer Systems Theory","volume":"44 1","pages":"134 - 147"},"PeriodicalIF":0.8,"publicationDate":"2020-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78632293","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
扫码关注我们
求助内容：
应助结果提醒方式：