Pub Date : 2022-04-01DOI: 10.1016/j.jocs.2022.101594
A. Gudivada, G. Sudha
{"title":"STQCA-FFT: A fast fourier transform architecture using stack-type QCA approach with power and delay reduction","authors":"A. Gudivada, G. Sudha","doi":"10.1016/j.jocs.2022.101594","DOIUrl":"https://doi.org/10.1016/j.jocs.2022.101594","url":null,"abstract":"","PeriodicalId":14601,"journal":{"name":"J. Comput. Sci.","volume":"31 1","pages":"101594"},"PeriodicalIF":0.0,"publicationDate":"2022-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90994971","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 : 2022-03-23DOI: 10.48550/arXiv.2203.12373
Quanling Deng, P. Behnoudfar, V. Calo
Explicit time-marching schemes are popular for solving time-dependent partial differential equations; one of the biggest challenges these methods suffer is increasing the critical time-marching step size that guarantees numerical stability. In general, there are two ways to increase the critical step size. One is to reduce the stiffness of the spatially discretized system, while the other is to design time-marching schemes with larger stability regions. In this paper, we focus on the recently proposed explicit generalized-$alpha$ method for second-order hyperbolic equations and increase the critical step size by reducing the stiffness of the isogeometric-discretized system. In particular, we apply boundary penalization to lessen the system's stiffness. For $p$-th order $C^{p-1}$ isogeometric elements, we show numerically that the critical step size increases by a factor of $sqrt{frac{p^2-3p+6}{4}}$, which indicates the advantages of using the proposed method, especially for high-order elements. Various examples in one, two, and three dimensions validate the performance of the proposed technique.
{"title":"A boundary-penalized isogeometric analysis for second-order hyperbolic equations","authors":"Quanling Deng, P. Behnoudfar, V. Calo","doi":"10.48550/arXiv.2203.12373","DOIUrl":"https://doi.org/10.48550/arXiv.2203.12373","url":null,"abstract":"Explicit time-marching schemes are popular for solving time-dependent partial differential equations; one of the biggest challenges these methods suffer is increasing the critical time-marching step size that guarantees numerical stability. In general, there are two ways to increase the critical step size. One is to reduce the stiffness of the spatially discretized system, while the other is to design time-marching schemes with larger stability regions. In this paper, we focus on the recently proposed explicit generalized-$alpha$ method for second-order hyperbolic equations and increase the critical step size by reducing the stiffness of the isogeometric-discretized system. In particular, we apply boundary penalization to lessen the system's stiffness. For $p$-th order $C^{p-1}$ isogeometric elements, we show numerically that the critical step size increases by a factor of $sqrt{frac{p^2-3p+6}{4}}$, which indicates the advantages of using the proposed method, especially for high-order elements. Various examples in one, two, and three dimensions validate the performance of the proposed technique.","PeriodicalId":14601,"journal":{"name":"J. Comput. Sci.","volume":"64 1","pages":"101861"},"PeriodicalIF":0.0,"publicationDate":"2022-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78274994","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 : 2022-02-01DOI: 10.1016/j.jocs.2022.101572
Julian Cascitti, Stefan Niebler, André Müller, B. Schmidt
{"title":"RNACache: A scalable approach to rapid transcriptomic read mapping using locality sensitive hashing","authors":"Julian Cascitti, Stefan Niebler, André Müller, B. Schmidt","doi":"10.1016/j.jocs.2022.101572","DOIUrl":"https://doi.org/10.1016/j.jocs.2022.101572","url":null,"abstract":"","PeriodicalId":14601,"journal":{"name":"J. Comput. Sci.","volume":"45 1","pages":"101572"},"PeriodicalIF":0.0,"publicationDate":"2022-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72947795","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 : 2022-02-01DOI: 10.1016/j.jocs.2022.101600
S. Mitra, S. Acharyya
{"title":"Perturbation and Repository based Diversified Cuckoo Search in reconstruction of Gene Regulatory Network: A new Cuckoo Search approach","authors":"S. Mitra, S. Acharyya","doi":"10.1016/j.jocs.2022.101600","DOIUrl":"https://doi.org/10.1016/j.jocs.2022.101600","url":null,"abstract":"","PeriodicalId":14601,"journal":{"name":"J. Comput. Sci.","volume":"24 1","pages":"101600"},"PeriodicalIF":0.0,"publicationDate":"2022-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79699220","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 : 2022-02-01DOI: 10.1016/j.jocs.2022.101603
P. Lualdi, R. Sturm, Tjark Siefkes
{"title":"Exploration-oriented sampling strategies for global surrogate modeling: A comparison between one-stage and adaptive methods","authors":"P. Lualdi, R. Sturm, Tjark Siefkes","doi":"10.1016/j.jocs.2022.101603","DOIUrl":"https://doi.org/10.1016/j.jocs.2022.101603","url":null,"abstract":"","PeriodicalId":14601,"journal":{"name":"J. Comput. Sci.","volume":"08 1","pages":"101603"},"PeriodicalIF":0.0,"publicationDate":"2022-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85978936","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 : 2022-02-01DOI: 10.1016/j.jocs.2022.101606
S. Mishra, S. Singh, Ajay Mahaputra Kumar, Bhaskar Biswas
{"title":"MNERLP-MUL: Merged node and edge relevance based link prediction in multiplex networks","authors":"S. Mishra, S. Singh, Ajay Mahaputra Kumar, Bhaskar Biswas","doi":"10.1016/j.jocs.2022.101606","DOIUrl":"https://doi.org/10.1016/j.jocs.2022.101606","url":null,"abstract":"","PeriodicalId":14601,"journal":{"name":"J. Comput. Sci.","volume":"35 1","pages":"101606"},"PeriodicalIF":0.0,"publicationDate":"2022-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89981017","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 : 2022-02-01DOI: 10.1016/j.jocs.2022.101597
Gürcan Yavuz
{"title":"Diversified Position Update Equation-Based SSA with Refreshing-Gap Strategy for global optimization","authors":"Gürcan Yavuz","doi":"10.1016/j.jocs.2022.101597","DOIUrl":"https://doi.org/10.1016/j.jocs.2022.101597","url":null,"abstract":"","PeriodicalId":14601,"journal":{"name":"J. Comput. Sci.","volume":"6 1","pages":"101597"},"PeriodicalIF":0.0,"publicationDate":"2022-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80970113","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 : 2022-02-01DOI: 10.1016/j.jocs.2022.101637
Bandita Sahu, Prajit Kumar Das, M. R. Kabat
{"title":"Multi-robot cooperation and path planning for stick transporting using improved Q-learning and democratic robotics PSO","authors":"Bandita Sahu, Prajit Kumar Das, M. R. Kabat","doi":"10.1016/j.jocs.2022.101637","DOIUrl":"https://doi.org/10.1016/j.jocs.2022.101637","url":null,"abstract":"","PeriodicalId":14601,"journal":{"name":"J. Comput. Sci.","volume":"31 1","pages":"101637"},"PeriodicalIF":0.0,"publicationDate":"2022-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74783868","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 : 2022-02-01DOI: 10.1016/j.jocs.2022.101589
J. Clempner
{"title":"Algorithmic-gradient approach for the Price of Anarchy and Stability for incomplete information","authors":"J. Clempner","doi":"10.1016/j.jocs.2022.101589","DOIUrl":"https://doi.org/10.1016/j.jocs.2022.101589","url":null,"abstract":"","PeriodicalId":14601,"journal":{"name":"J. Comput. Sci.","volume":"51 1","pages":"101589"},"PeriodicalIF":0.0,"publicationDate":"2022-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73326005","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 : 2022-01-05DOI: 10.21203/rs.3.rs-28683/v2
Ritam Guha, K. Ghosh, S. Bera, Ram Sarkar, S. Mirjalili
This paper proposes a binary adaptation of the recently proposed meta-heuristic, Equilibrium Optimizer (EO), called Discrete EO (DEO) to solve binary optimization problems. A U-shaped transfer function has been used to map the continuous values of EO into the binary domain. To further improve the exploitation capability of DEO, Simulated Annealing (SA) has been used as a local search procedure and the combination has been named as DEOSA. The proposed DEOSA algorithm has been applied over 18 well-known UCI datasets and compared with a wide range of algorithms. The results have been statistically validated using Wilcoxon rank-sum test. In order to test the scalability and robustness of DEOSA, it has been additionally tested over 7 high-dimensional Microarray datasets and 25 binary Knapsack problems. The results clearly demonstrate the superiority and merits of DEOSA when solving binary optimization problems.
{"title":"Discrete equilibrium optimizer combined with simulated annealing for feature selection","authors":"Ritam Guha, K. Ghosh, S. Bera, Ram Sarkar, S. Mirjalili","doi":"10.21203/rs.3.rs-28683/v2","DOIUrl":"https://doi.org/10.21203/rs.3.rs-28683/v2","url":null,"abstract":"\u0000 This paper proposes a binary adaptation of the recently proposed meta-heuristic, Equilibrium Optimizer (EO), called Discrete EO (DEO) to solve binary optimization problems. A U-shaped transfer function has been used to map the continuous values of EO into the binary domain. To further improve the exploitation capability of DEO, Simulated Annealing (SA) has been used as a local search procedure and the combination has been named as DEOSA. The proposed DEOSA algorithm has been applied over 18 well-known UCI datasets and compared with a wide range of algorithms. The results have been statistically validated using Wilcoxon rank-sum test. In order to test the scalability and robustness of DEOSA, it has been additionally tested over 7 high-dimensional Microarray datasets and 25 binary Knapsack problems. The results clearly demonstrate the superiority and merits of DEOSA when solving binary optimization problems.","PeriodicalId":14601,"journal":{"name":"J. Comput. Sci.","volume":"12 1","pages":"101942"},"PeriodicalIF":0.0,"publicationDate":"2022-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87707956","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
扫码关注我们
求助内容：
应助结果提醒方式：