发布求助
文献互助 智能选刊 最新文献

J. Comput. Sci.最新文献

筛选
英文 中文
STQCA-FFT: A fast fourier transform architecture using stack-type QCA approach with power and delay reduction STQCA-FFT:一种使用堆栈型QCA方法的快速傅里叶变换体系结构，具有降低功耗和延迟的特点
J. Comput. Sci. Pub Date : 2022-04-01 DOI: 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}
引用次数: 1
A boundary-penalized isogeometric analysis for second-order hyperbolic equations 二阶双曲型方程的边界罚等几何分析
J. Comput. Sci. Pub Date : 2022-03-23 DOI: 10.48550/arXiv.2203.12373
Quanling Deng, P. Behnoudfar, V. Calo
{"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}
引用次数: 1
RNACache: A scalable approach to rapid transcriptomic read mapping using locality sensitive hashing RNACache:一种使用位置敏感散列的可扩展的快速转录组读映射方法
J. Comput. Sci. Pub Date : 2022-02-01 DOI: 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}
引用次数: 0
Perturbation and Repository based Diversified Cuckoo Search in reconstruction of Gene Regulatory Network: A new Cuckoo Search approach 基于微扰和库的基因调控网络重构中的多样化布谷鸟搜索:一种新的布谷鸟搜索方法
J. Comput. Sci. Pub Date : 2022-02-01 DOI: 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}
引用次数: 1
Exploration-oriented sampling strategies for global surrogate modeling: A comparison between one-stage and adaptive methods 面向探索的全球代理建模抽样策略:单阶段和自适应方法的比较
J. Comput. Sci. Pub Date : 2022-02-01 DOI: 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}
引用次数: 2
MNERLP-MUL: Merged node and edge relevance based link prediction in multiplex networks MNERLP-MUL:多路网络中基于合并节点和边缘关联的链路预测
J. Comput. Sci. Pub Date : 2022-02-01 DOI: 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}
引用次数: 9
Diversified Position Update Equation-Based SSA with Refreshing-Gap Strategy for global optimization 基于多元位置更新方程的SSA全局优化
J. Comput. Sci. Pub Date : 2022-02-01 DOI: 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}
引用次数: 2
Multi-robot cooperation and path planning for stick transporting using improved Q-learning and democratic robotics PSO 基于改进q -学习和民主机器人粒子群算法的多机器人协作与木棍运输路径规划
J. Comput. Sci. Pub Date : 2022-02-01 DOI: 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}
引用次数: 8
Algorithmic-gradient approach for the Price of Anarchy and Stability for incomplete information 不完全信息下无政府状态代价与稳定性的算法梯度法
J. Comput. Sci. Pub Date : 2022-02-01 DOI: 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}
引用次数: 1
Discrete equilibrium optimizer combined with simulated annealing for feature selection 离散均衡优化与模拟退火相结合的特征选择
J. Comput. Sci. Pub Date : 2022-01-05 DOI: 10.21203/rs.3.rs-28683/v2
Ritam Guha, K. Ghosh, S. Bera, Ram Sarkar, S. Mirjalili
{"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}
引用次数: 11
首页 上一页 下一页 尾页
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学术官方微信