首页 > 最新文献

Journal of Quantum Computing最新文献

英文 中文
Improved Prediction and Understanding of Glass-Forming Ability Based on Random Forest Algorithm 基于随机森林算法的玻璃成形能力改进预测与理解
Pub Date : 1900-01-01 DOI: 10.32604/jqc.2021.016651
Chen Su, Xiaoyu Li, Mengru Li, Qinsheng Zhu, Hao-ming Fu, Shan Yang
: As an ideal material, bulk metallic glass (MG) has a wide range of applications because of its unique properties such as structural, functional and biomedical materials. However, it is difficult to predict the glass-forming ability (GFA) even given the criteria in theory and this problem greatly limits the application of bulk MG in industrial field. In this work, the proposed model uses the random forest classification method which is one of machine learning methods to solve the GFA prediction for binary metallic alloys. Compared with the previous SVM algorithm models of all features combinations, this new model is successfully constructed based on the random forest classification method with a new combination of features and it obtains better prediction results. Simultaneously, it further shows the degree of feature parameters influence on GFA. Finally, a normalized evaluation indicator of binary alloy for machine learning model performance is put forward for the first time. The result shows that the application of machine learning in MGs is valuable.
大块金属玻璃(MG)作为一种理想的材料,因其具有结构材料、功能材料和生物医学材料等独特的性能,具有广泛的应用前景。然而,即使给出了理论上的标准,也很难预测其玻璃形成能力,这一问题极大地限制了块状MG在工业领域的应用。本文提出的模型采用机器学习方法之一的随机森林分类方法来求解二元金属合金的GFA预测。与以往所有特征组合的SVM算法模型相比,该模型基于新的特征组合的随机森林分类方法成功构建,获得了更好的预测结果。同时进一步说明了特征参数对GFA的影响程度。最后,首次提出二元合金机器学习模型性能的归一化评价指标。结果表明,机器学习在MGs中的应用是有价值的。
{"title":"Improved Prediction and Understanding of Glass-Forming Ability Based on Random Forest Algorithm","authors":"Chen Su, Xiaoyu Li, Mengru Li, Qinsheng Zhu, Hao-ming Fu, Shan Yang","doi":"10.32604/jqc.2021.016651","DOIUrl":"https://doi.org/10.32604/jqc.2021.016651","url":null,"abstract":": As an ideal material, bulk metallic glass (MG) has a wide range of applications because of its unique properties such as structural, functional and biomedical materials. However, it is difficult to predict the glass-forming ability (GFA) even given the criteria in theory and this problem greatly limits the application of bulk MG in industrial field. In this work, the proposed model uses the random forest classification method which is one of machine learning methods to solve the GFA prediction for binary metallic alloys. Compared with the previous SVM algorithm models of all features combinations, this new model is successfully constructed based on the random forest classification method with a new combination of features and it obtains better prediction results. Simultaneously, it further shows the degree of feature parameters influence on GFA. Finally, a normalized evaluation indicator of binary alloy for machine learning model performance is put forward for the first time. The result shows that the application of machine learning in MGs is valuable.","PeriodicalId":284655,"journal":{"name":"Journal of Quantum Computing","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121481452","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
Research on Improving Teaching Quality and Optimizing Teaching Scheme Based on Deep Learning in Chinese Literature Scene 基于深度学习的中文文学场景教学质量提升与教学方案优化研究
Pub Date : 1900-01-01 DOI: 10.32604/jqc.2022.039795
Yali Wang
{"title":"Research on Improving Teaching Quality and Optimizing Teaching Scheme Based on Deep Learning in Chinese Literature Scene","authors":"Yali Wang","doi":"10.32604/jqc.2022.039795","DOIUrl":"https://doi.org/10.32604/jqc.2022.039795","url":null,"abstract":"","PeriodicalId":284655,"journal":{"name":"Journal of Quantum Computing","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127782338","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
Interpretation of the Entangled States 纠缠态的解释
Pub Date : 1900-01-01 DOI: 10.32604/JQC.2020.014734
D. Khokhlov
An interpretation of the entangled states is considered. Two-photon states of photon A on path a and photon B on path b with polarizations H, V are constructed. Two synchronized photons, 1 and 2, can take the paths a and b, with equal probability 50%. In the bases a, b and H, V, the states of the photons form the product states. In the basis 1, 2, the states of the photons form the entangled state. The states of the photons in the bases 1, 2; a, b; H, V are inseparable. The correlation of the photons due to the entanglement in the basis 1, 2 can be seen in the bases a, b and H, V. The interference term in the approach under consideration and in the standard approach is the same thus providing for the same correlation.
考虑了纠缠态的一种解释。构造了光子A在路径A上和光子B在路径B上偏振为H、V的双光子态。两个同步的光子,1和2,可以选择路径a和路径b,概率是50%。在碱基a b和H V中,光子的态形成了产物态。在基1,2中,光子的状态形成纠缠态。光子在碱基1,2中的状态;a、b;H, V是不可分的。由于纠缠在基1,2中的光子的相关性可以在基a, b和H, v中看到。所考虑的方法和标准方法中的干涉项是相同的,因此提供了相同的相关性。
{"title":"Interpretation of the Entangled States","authors":"D. Khokhlov","doi":"10.32604/JQC.2020.014734","DOIUrl":"https://doi.org/10.32604/JQC.2020.014734","url":null,"abstract":"An interpretation of the entangled states is considered. Two-photon states of photon A on path a and photon B on path b with polarizations H, V are constructed. Two synchronized photons, 1 and 2, can take the paths a and b, with equal probability 50%. In the bases a, b and H, V, the states of the photons form the product states. In the basis 1, 2, the states of the photons form the entangled state. The states of the photons in the bases 1, 2; a, b; H, V are inseparable. The correlation of the photons due to the entanglement in the basis 1, 2 can be seen in the bases a, b and H, V. The interference term in the approach under consideration and in the standard approach is the same thus providing for the same correlation.","PeriodicalId":284655,"journal":{"name":"Journal of Quantum Computing","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116661749","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
Quantum Blockchain: A Decentralized, Encrypted and Distributed Database Based on Quantum Mechanics 量子区块链:基于量子力学的去中心化、加密和分布式数据库
Pub Date : 1900-01-01 DOI: 10.32604/jqc.2019.06715
Chun-Tang Li, Yinsong Xu, Jiahao Tang, Wenjie Liu
Quantum blockchain can be understood as a decentralized, encrypted and distributed database based on quantum computation and quantum information theory. Once the data is recorded in the quantum blockchain, it will not be maliciously tampered with. In recent years, the development of quantum computation and quantum information theory makes more and more researchers focus on the research of quantum blockchain. In this paper, we review the developments in the field of quantum blockchain, and briefly analyze its advantages compared with the classical blockchain. The construction and the framework of the quantum blockchain are introduced. Then we introduce the method of applying quantum technology to a certain part of the general blockchain. In addition, the advantages of quantum blockchain compared with classical blockchain and its development prospects are summarized.
量子区块链可以理解为基于量子计算和量子信息理论的去中心化、加密化和分布式数据库。一旦数据被记录在量子区块链中,它就不会被恶意篡改。近年来,随着量子计算和量子信息理论的发展,量子bb0的研究受到越来越多研究者的关注。本文综述了量子区块链领域的研究进展,并简要分析了其与经典区块链相比的优势。介绍了量子区块链的结构和结构。然后介绍了将量子技术应用于一般区块链的某一部分的方法。此外,还总结了量子区块链与经典区块链相比的优点及其发展前景。
{"title":"Quantum Blockchain: A Decentralized, Encrypted and Distributed Database Based on Quantum Mechanics","authors":"Chun-Tang Li, Yinsong Xu, Jiahao Tang, Wenjie Liu","doi":"10.32604/jqc.2019.06715","DOIUrl":"https://doi.org/10.32604/jqc.2019.06715","url":null,"abstract":"Quantum blockchain can be understood as a decentralized, encrypted and distributed database based on quantum computation and quantum information theory. Once the data is recorded in the quantum blockchain, it will not be maliciously tampered with. In recent years, the development of quantum computation and quantum information theory makes more and more researchers focus on the research of quantum blockchain. In this paper, we review the developments in the field of quantum blockchain, and briefly analyze its advantages compared with the classical blockchain. The construction and the framework of the quantum blockchain are introduced. Then we introduce the method of applying quantum technology to a certain part of the general blockchain. In addition, the advantages of quantum blockchain compared with classical blockchain and its development prospects are summarized.","PeriodicalId":284655,"journal":{"name":"Journal of Quantum Computing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126677618","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}
引用次数: 20
Analysis and Prediction of Regional Electricity Consumption Based on BP Neural Network 基于BP神经网络的区域用电量分析与预测
Pub Date : 1900-01-01 DOI: 10.32604/jqc.2019.09232
Ping-ping Xia, Aihua Xu, Tonghui Lian
: Electricity consumption forecasting is one of the most important tasks for power system workers, and plays an important role in regional power systems. Due to the difference in the trend of power load and the past in the new normal, the influencing factors are more diversified, which makes it more difficult to predict the current electricity consumption. In this paper, the grey system theory and BP neural network are combined to predict the annual electricity consumption in Jiangsu. According to the historical data of annual electricity consumption and the six factors affecting electricity consumption, the gray correlation analysis method is used to screen the important factors, and three factors with large correlation degree are selected as the input parameters of BP neural network. The power forecasting model uses nearly 18 years of data to train and validate the model. The results show that the gray correlation analysis and BP neural network method have higher accuracy in power consumption prediction, and the calculation is more convenient than traditional methods.
电力用电量预测是电力系统工作人员的重要工作之一,在区域电力系统中起着重要的作用。由于新常态下电力负荷趋势与以往有所不同,影响因素更加多样化,增加了当前用电量预测的难度。本文将灰色系统理论与BP神经网络相结合,对江苏省年用电量进行预测。根据年用电量历史数据和影响用电量的6个因素,采用灰色关联分析法筛选重要因素,选取关联度较大的3个因素作为BP神经网络的输入参数。电力预测模型使用近18年的数据对模型进行训练和验证。结果表明,灰色关联分析和BP神经网络方法在电力消耗预测中具有较高的准确性,且计算比传统方法更方便。
{"title":"Analysis and Prediction of Regional Electricity Consumption Based on BP Neural Network","authors":"Ping-ping Xia, Aihua Xu, Tonghui Lian","doi":"10.32604/jqc.2019.09232","DOIUrl":"https://doi.org/10.32604/jqc.2019.09232","url":null,"abstract":": Electricity consumption forecasting is one of the most important tasks for power system workers, and plays an important role in regional power systems. Due to the difference in the trend of power load and the past in the new normal, the influencing factors are more diversified, which makes it more difficult to predict the current electricity consumption. In this paper, the grey system theory and BP neural network are combined to predict the annual electricity consumption in Jiangsu. According to the historical data of annual electricity consumption and the six factors affecting electricity consumption, the gray correlation analysis method is used to screen the important factors, and three factors with large correlation degree are selected as the input parameters of BP neural network. The power forecasting model uses nearly 18 years of data to train and validate the model. The results show that the gray correlation analysis and BP neural network method have higher accuracy in power consumption prediction, and the calculation is more convenient than traditional methods.","PeriodicalId":284655,"journal":{"name":"Journal of Quantum Computing","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122788495","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 Database-Driven Algorithm for Building Top-k Service-Based Systems 构建基于Top-k服务的系统的数据库驱动算法
Pub Date : 1900-01-01 DOI: 10.32604/JQC.2020.015402
Dandan Peng, Le Sun
The purpose of this work aims is to automatically build top-k (the number of suggested results) light weight service based systems (LitSBSs) on the basis of user-given keywords. Compared with our previous work, we use a score (oscore) to evaluate the keyword matching degree and QoS performance of a service so that we could find top-k LitSBSs with both high keyword matching degree and great QoS performance at the same time. In addition, to guarantee the quality of found top-k LitSBSs and improve the time efficiency, we redesign the database-driven algorithm (LitDB). We add the step of referential services selecting into the process of the LitDB, which could prioritize services with high quality (high keyword matching degree and great QoS performance). We design comprehensive experiments to demonstrate the great time performance of LitDB.
这项工作的目的是基于用户给出的关键字自动构建top-k(建议结果的数量)轻量级服务系统(LitSBSs)。与我们之前的工作相比,我们使用分数(oscore)来评估服务的关键字匹配度和QoS性能,从而找到同时具有高关键字匹配度和高QoS性能的top-k litsbs。此外,为了保证发现的top-k litsdb的质量和提高时间效率,我们重新设计了数据库驱动算法(LitDB)。我们在LitDB的过程中增加了参考服务选择的步骤,可以优先考虑高质量(关键字匹配度高、QoS性能好)的服务。我们设计了全面的实验来证明LitDB具有良好的时间性能。
{"title":"A Database-Driven Algorithm for Building Top-k Service-Based Systems","authors":"Dandan Peng, Le Sun","doi":"10.32604/JQC.2020.015402","DOIUrl":"https://doi.org/10.32604/JQC.2020.015402","url":null,"abstract":"The purpose of this work aims is to automatically build top-k (the number of suggested results) light weight service based systems (LitSBSs) on the basis of user-given keywords. Compared with our previous work, we use a score (oscore) to evaluate the keyword matching degree and QoS performance of a service so that we could find top-k LitSBSs with both high keyword matching degree and great QoS performance at the same time. In addition, to guarantee the quality of found top-k LitSBSs and improve the time efficiency, we redesign the database-driven algorithm (LitDB). We add the step of referential services selecting into the process of the LitDB, which could prioritize services with high quality (high keyword matching degree and great QoS performance). We design comprehensive experiments to demonstrate the great time performance of LitDB.","PeriodicalId":284655,"journal":{"name":"Journal of Quantum Computing","volume":"98 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133264913","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
Quantum Algorithm for Appointment Scheduling 预约调度的量子算法
Pub Date : 1900-01-01 DOI: 10.32604/jqc.2019.07412
Wenbin Yu, Yinsong Xu, Wenjie Liu, A. Liu, B. Zheng
{"title":"Quantum Algorithm for Appointment Scheduling","authors":"Wenbin Yu, Yinsong Xu, Wenjie Liu, A. Liu, B. Zheng","doi":"10.32604/jqc.2019.07412","DOIUrl":"https://doi.org/10.32604/jqc.2019.07412","url":null,"abstract":"","PeriodicalId":284655,"journal":{"name":"Journal of Quantum Computing","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132365712","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
Research and Analysis of WSN Node Location in Highway Traffic Based on Priority 基于优先级的公路交通WSN节点定位研究与分析
Pub Date : 1900-01-01 DOI: 10.32604/jqc.2020.09153
Congrong Tang
{"title":"Research and Analysis of WSN Node Location in Highway Traffic Based on Priority","authors":"Congrong Tang","doi":"10.32604/jqc.2020.09153","DOIUrl":"https://doi.org/10.32604/jqc.2020.09153","url":null,"abstract":"","PeriodicalId":284655,"journal":{"name":"Journal of Quantum Computing","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123961226","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}
引用次数: 3
Near Term Hybrid Quantum Computing Solution to the Matrix Riccati Equations 矩阵Riccati方程的近期混合量子计算解
Pub Date : 1900-01-01 DOI: 10.32604/jqc.2022.036706
Augusto Gonz醠ez Bonorino, M. Ndiaye, C. DeCusatis
{"title":"Near Term Hybrid Quantum Computing Solution to the Matrix Riccati Equations","authors":"Augusto Gonz醠ez Bonorino, M. Ndiaye, C. DeCusatis","doi":"10.32604/jqc.2022.036706","DOIUrl":"https://doi.org/10.32604/jqc.2022.036706","url":null,"abstract":"","PeriodicalId":284655,"journal":{"name":"Journal of Quantum Computing","volume":"os-36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127774947","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
New Quantum Color Codes Based on Hyperbolic Geometry 基于双曲几何的新量子色码
Pub Date : 1900-01-01 DOI: 10.32604/jqc.2022.033712
A. Naghipour, Duc Manh Nguyen
{"title":"New Quantum Color Codes Based on Hyperbolic Geometry","authors":"A. Naghipour, Duc Manh Nguyen","doi":"10.32604/jqc.2022.033712","DOIUrl":"https://doi.org/10.32604/jqc.2022.033712","url":null,"abstract":"","PeriodicalId":284655,"journal":{"name":"Journal of Quantum Computing","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130150902","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
期刊
Journal of Quantum Computing
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1