首页 > 最新文献

South Afr. Comput. J.最新文献

英文 中文
Taylor Sun Flower Optimization-Based Compressive Sensing for Image Compression and Recovery 基于Taylor Sun Flower优化的图像压缩和恢复压缩感知
Pub Date : 2023-05-17 DOI: 10.1093/comjnl/bxab202
R. Sekar, G. Ravi
Sekar R and Ravi G author a paper called Taylor Sun Flower Optimization-Based Compressive Sensing for Image Compression and Recovery, which appears in the The Computer Journal (Volume 66, issue 4, April 2023)
Sekar R和Ravi G撰写了一篇题为“基于Taylor Sun Flower优化的图像压缩和恢复压缩感知”的论文,发表在《计算机杂志》(第66卷第4期,2023年4月)上。
{"title":"Taylor Sun Flower Optimization-Based Compressive Sensing for Image Compression and Recovery","authors":"R. Sekar, G. Ravi","doi":"10.1093/comjnl/bxab202","DOIUrl":"https://doi.org/10.1093/comjnl/bxab202","url":null,"abstract":"\u0000 Sekar R and Ravi G author a paper called Taylor Sun Flower Optimization-Based Compressive Sensing for Image Compression and Recovery, which appears in the The Computer Journal (Volume 66, issue 4, April 2023)","PeriodicalId":21872,"journal":{"name":"South Afr. Comput. J.","volume":"10 1","pages":"873-887"},"PeriodicalIF":0.0,"publicationDate":"2023-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86218036","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
Special Issue on Failed Approaches and Insightful Losses in Cryptology - Foreword 关于密码学中失败的方法和深刻的损失的特刊-前言
Pub Date : 2023-05-05 DOI: 10.1093/comjnl/bxac191
T. Ashur, C. Mitchell
{"title":"Special Issue on Failed Approaches and Insightful Losses in Cryptology - Foreword","authors":"T. Ashur, C. Mitchell","doi":"10.1093/comjnl/bxac191","DOIUrl":"https://doi.org/10.1093/comjnl/bxac191","url":null,"abstract":"","PeriodicalId":21872,"journal":{"name":"South Afr. Comput. J.","volume":"12 1","pages":"1311"},"PeriodicalIF":0.0,"publicationDate":"2023-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84180133","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
Role of Machine Learning on Key Extraction for Data Privacy Preservation of Health Care Sectors in IoT Environment 机器学习在物联网环境下医疗保健部门数据隐私保护密钥提取中的作用
Pub Date : 2023-03-14 DOI: 10.1093/comjnl/bxad016
P. N. Kathavate
Privacy and security in the medical field are major aspects to consider in the current era. This is due to the huge necessity for data among providers, payers and patients, respectively. Recently, more researchers are making their contributions in this field under different aspects. But, there need more enhancements concerning security. In this circumstance, this paper intends to propose a new IoT-dependent health care privacy preservation model with the impact of the machine learning algorithm. Here, the information or data from IoT devices is subjected to the proposed sanitization process via generating the optimal key. In this work, the utility of the machine learning model is the greatest gateway to generating optimal keys as it is already trained with the neural network. Moreover, identifying the optimal key is the greatest crisis, which is done by a new Improved Dragonfly Algorithm algorithm. Thereby, the sanitization process works, and finally, the sanitized data are uploaded to IoT. The data restoration is the inverse process of sanitization, which gives the original data. Finally, the performance of the proposed work is validated over state-of-the-art models in terms of sanitization and restoration analysis.
医疗领域的隐私和安全是当今时代需要考虑的主要方面。这是由于提供者、支付者和患者分别对数据的巨大需求。近年来,越来越多的研究者从不同的角度对这一领域做出了自己的贡献。但是,在安全性方面还需要更多的增强。在这种情况下,本文拟提出一种新的基于物联网的医疗保健隐私保护模型,并结合机器学习算法的影响。在这里,来自物联网设备的信息或数据通过生成最佳密钥受到提议的消毒过程的影响。在这项工作中,机器学习模型的效用是生成最优键的最大途径,因为它已经被神经网络训练过了。其中,最优密钥的识别是最大的危机,这是由一种新的改进蜻蜓算法来完成的。因此,清理过程工作,最后,清理后的数据被上传到物联网。数据恢复是卫生处理的逆过程,即恢复原始数据。最后,在消毒和恢复分析方面,通过最先进的模型验证了所提出工作的性能。
{"title":"Role of Machine Learning on Key Extraction for Data Privacy Preservation of Health Care Sectors in IoT Environment","authors":"P. N. Kathavate","doi":"10.1093/comjnl/bxad016","DOIUrl":"https://doi.org/10.1093/comjnl/bxad016","url":null,"abstract":"\u0000 Privacy and security in the medical field are major aspects to consider in the current era. This is due to the huge necessity for data among providers, payers and patients, respectively. Recently, more researchers are making their contributions in this field under different aspects. But, there need more enhancements concerning security. In this circumstance, this paper intends to propose a new IoT-dependent health care privacy preservation model with the impact of the machine learning algorithm. Here, the information or data from IoT devices is subjected to the proposed sanitization process via generating the optimal key. In this work, the utility of the machine learning model is the greatest gateway to generating optimal keys as it is already trained with the neural network. Moreover, identifying the optimal key is the greatest crisis, which is done by a new Improved Dragonfly Algorithm algorithm. Thereby, the sanitization process works, and finally, the sanitized data are uploaded to IoT. The data restoration is the inverse process of sanitization, which gives the original data. Finally, the performance of the proposed work is validated over state-of-the-art models in terms of sanitization and restoration analysis.","PeriodicalId":21872,"journal":{"name":"South Afr. Comput. J.","volume":"45 1","pages":"1549-1562"},"PeriodicalIF":0.0,"publicationDate":"2023-03-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82864408","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
Incorrectly Generated RSA Keys: How I Learned To Stop Worrying And Recover Lost Plaintexts 错误生成的RSA密钥:我如何学会停止担心和恢复丢失的明文
Pub Date : 2023-01-22 DOI: 10.1093/comjnl/bxac199
D. Shumow
When generating primes $p$ and $q$ for an RSA key, the algorithm specifies that if $p-1$ and $q-1$ must be relatively prime to the public exponent $e$. If this is not done, then the decryption exponent is not well defined. However, what if a software bug allows the generation of public parameters $N$ and $e$ of an RSA key with this property and then it is subsequently used for encryption? Though this may seem like a purely academic question, a software bug in a preview release of the Windows 10 operating system makes this question of more than purely theoretical. Without a well defined decryption exponent, plaintexts encrypted to such keys will be undecryptable thus potentially losing user data, a serious software defect. Though the decryption exponent is no longer well defined, it is in fact possible to recover the a small number of potential plaintexts, if the prime factors $p$ and $q$ of the public modulus $N$ are known. This paper presents an analysis of what steps fail in the RSA algorithm and derives a plaintext recovery algorithm. The runtime of this algorithm is $O(e)$ making it practical to use, and it has been implemented in python.
当为RSA密钥生成质数$p$和$q$时,该算法指定如果$p-1$和$q-1$必须相对于公共指数$e$为质数。如果没有这样做,则解密指数没有很好地定义。但是,如果软件错误允许生成具有此属性的RSA密钥的公共参数$N$和$e$,然后将其用于加密,该怎么办?虽然这看起来像是一个纯粹的学术问题,但Windows 10操作系统预览版中的一个软件漏洞使这个问题不仅仅是纯粹的理论问题。如果没有定义良好的解密指数,加密到此类密钥的明文将无法解密,因此可能会丢失用户数据,这是一个严重的软件缺陷。虽然解密指数不再被很好地定义,但如果已知公共模数N$的素数因子$p$和$q$,则实际上有可能恢复少量潜在的明文。本文分析了RSA算法中失败的步骤,并推导出一种明文恢复算法。该算法的运行时间为$O(e)$,使其易于使用,并且已在python中实现。
{"title":"Incorrectly Generated RSA Keys: How I Learned To Stop Worrying And Recover Lost Plaintexts","authors":"D. Shumow","doi":"10.1093/comjnl/bxac199","DOIUrl":"https://doi.org/10.1093/comjnl/bxac199","url":null,"abstract":"\u0000 When generating primes $p$ and $q$ for an RSA key, the algorithm specifies that if $p-1$ and $q-1$ must be relatively prime to the public exponent $e$. If this is not done, then the decryption exponent is not well defined. However, what if a software bug allows the generation of public parameters $N$ and $e$ of an RSA key with this property and then it is subsequently used for encryption? Though this may seem like a purely academic question, a software bug in a preview release of the Windows 10 operating system makes this question of more than purely theoretical. Without a well defined decryption exponent, plaintexts encrypted to such keys will be undecryptable thus potentially losing user data, a serious software defect. Though the decryption exponent is no longer well defined, it is in fact possible to recover the a small number of potential plaintexts, if the prime factors $p$ and $q$ of the public modulus $N$ are known. This paper presents an analysis of what steps fail in the RSA algorithm and derives a plaintext recovery algorithm. The runtime of this algorithm is $O(e)$ making it practical to use, and it has been implemented in python.","PeriodicalId":21872,"journal":{"name":"South Afr. Comput. J.","volume":"31 1","pages":"1342-1349"},"PeriodicalIF":0.0,"publicationDate":"2023-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77359452","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 Self-Stabilizing Distributed Algorithm for the Generalized Dominating Set Problem With Safe Convergence 安全收敛广义控制集问题的一种自稳定分布算法
Pub Date : 2023-01-01 DOI: 10.1093/comjnl/bxac021
Hisaki Kobayashi, Y. Sudo, H. Kakugawa, T. Masuzawa
{"title":"A Self-Stabilizing Distributed Algorithm for the Generalized Dominating Set Problem With Safe Convergence","authors":"Hisaki Kobayashi, Y. Sudo, H. Kakugawa, T. Masuzawa","doi":"10.1093/comjnl/bxac021","DOIUrl":"https://doi.org/10.1093/comjnl/bxac021","url":null,"abstract":"","PeriodicalId":21872,"journal":{"name":"South Afr. Comput. J.","volume":"17 1","pages":"1452-1476"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75477431","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
Improvement of MADRL Equilibrium Based on Pareto Optimization 基于Pareto优化的MADRL均衡改进
Pub Date : 2023-01-01 DOI: 10.1093/comjnl/bxac027
Zhiruo Zhao, Lei Cao, Xi-liang Chen, Jun Lai, Legui Zhang
{"title":"Improvement of MADRL Equilibrium Based on Pareto Optimization","authors":"Zhiruo Zhao, Lei Cao, Xi-liang Chen, Jun Lai, Legui Zhang","doi":"10.1093/comjnl/bxac027","DOIUrl":"https://doi.org/10.1093/comjnl/bxac027","url":null,"abstract":"","PeriodicalId":21872,"journal":{"name":"South Afr. Comput. J.","volume":"66 1","pages":"1573-1585"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78423213","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
An Improved Hill Climbing Algorithm for Graph Partitioning 图划分的一种改进爬坡算法
Pub Date : 2023-01-01 DOI: 10.1093/comjnl/bxac039
He Li, Yanna Liu, Shu-Huei Yang, Yishuai Lin, Yezhou Yang, Jaesoo Yoo
{"title":"An Improved Hill Climbing Algorithm for Graph Partitioning","authors":"He Li, Yanna Liu, Shu-Huei Yang, Yishuai Lin, Yezhou Yang, Jaesoo Yoo","doi":"10.1093/comjnl/bxac039","DOIUrl":"https://doi.org/10.1093/comjnl/bxac039","url":null,"abstract":"","PeriodicalId":21872,"journal":{"name":"South Afr. Comput. J.","volume":"25 1","pages":"1761-1776"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81587964","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
F2SO: An Energy Efficient Cluster Based Routing Protocol Using Fuzzy Firebug Swarm Optimization Algorithm in WSN 基于模糊Firebug群优化算法的无线传感器网络节能聚类路由协议
Pub Date : 2023-01-01 DOI: 10.1093/comjnl/bxac002
K. Suresh, S. Mole, A. Joseph Selva Kumar
{"title":"F2SO: An Energy Efficient Cluster Based Routing Protocol Using Fuzzy Firebug Swarm Optimization Algorithm in WSN","authors":"K. Suresh, S. Mole, A. Joseph Selva Kumar","doi":"10.1093/comjnl/bxac002","DOIUrl":"https://doi.org/10.1093/comjnl/bxac002","url":null,"abstract":"","PeriodicalId":21872,"journal":{"name":"South Afr. Comput. J.","volume":"258 1","pages":"1126-1138"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78458010","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
Indistinguishable Leakage-Resilient Circuit Compiler 不可区分的防泄漏电路编译器
Pub Date : 2023-01-01 DOI: 10.1093/comjnl/bxac036
Shiyou Xu, Jian Wang, Liangliang Wang
{"title":"Indistinguishable Leakage-Resilient Circuit Compiler","authors":"Shiyou Xu, Jian Wang, Liangliang Wang","doi":"10.1093/comjnl/bxac036","DOIUrl":"https://doi.org/10.1093/comjnl/bxac036","url":null,"abstract":"","PeriodicalId":21872,"journal":{"name":"South Afr. Comput. J.","volume":"21 1","pages":"1717-1732"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77502301","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
Decentralized Data Flows for the Functional Scalability of Service-Oriented IoT Systems 面向服务的物联网系统功能可扩展性的分散数据流
Pub Date : 2023-01-01 DOI: 10.1093/comjnl/bxac023
Damian Arellanes, K. Lau, R. Sakellariou
Horizontal and vertical scalability have been widely studied in the context of computational resources. However, with the exponential growth in the number of connected objects, functional scalability (in terms of the size of software systems) is rapidly becoming a central challenge for building efficient service-oriented IoT systems that generate huge volumes of data continuously. As systems scale up, a centralised approach for moving data between services becomes infeasible because it leads to a single performance bottleneck. A distributed approach avoids such a bottleneck but it incurs additional network traffic as data streams pass through multiple mediators. Decentralised data exchange is the only solution for realising totally efficient IoT systems, since it avoids a single performance bottleneck and dramatically minimises network traffic. In this paper, we present a functionally scalable approach that separates data and control for the realisation of decentralised data flows in service-oriented IoT systems. Our approach is evaluated empirically, and the results show that it scales well with the size of IoT systems by substantially reducing both the number of data flows and network traffic in comparison with distributed data flows.
在计算资源的背景下,水平和垂直可扩展性已经得到了广泛的研究。然而,随着连接对象数量的指数级增长,功能可扩展性(就软件系统的规模而言)正迅速成为构建高效的面向服务的物联网系统的核心挑战,这些系统可以持续生成大量数据。随着系统的扩展,在服务之间移动数据的集中式方法变得不可行,因为它会导致单个性能瓶颈。分布式方法避免了这种瓶颈,但由于数据流要经过多个中介,它会产生额外的网络流量。分散的数据交换是实现完全高效的物联网系统的唯一解决方案,因为它避免了单一的性能瓶颈,并极大地减少了网络流量。在本文中,我们提出了一种功能可扩展的方法,将数据和控制分离,以实现面向服务的物联网系统中的分散数据流。我们的方法经过经验评估,结果表明,与分布式数据流相比,通过大幅减少数据流和网络流量的数量,它可以很好地扩展物联网系统的规模。
{"title":"Decentralized Data Flows for the Functional Scalability of Service-Oriented IoT Systems","authors":"Damian Arellanes, K. Lau, R. Sakellariou","doi":"10.1093/comjnl/bxac023","DOIUrl":"https://doi.org/10.1093/comjnl/bxac023","url":null,"abstract":"Horizontal and vertical scalability have been widely studied in the context of computational resources. However, with the exponential growth in the number of connected objects, functional scalability (in terms of the size of software systems) is rapidly becoming a central challenge for building efficient service-oriented IoT systems that generate huge volumes of data continuously. As systems scale up, a centralised approach for moving data between services becomes infeasible because it leads to a single performance bottleneck. A distributed approach avoids such a bottleneck but it incurs additional network traffic as data streams pass through multiple mediators. Decentralised data exchange is the only solution for realising totally efficient IoT systems, since it avoids a single performance bottleneck and dramatically minimises network traffic. In this paper, we present a functionally scalable approach that separates data and control for the realisation of decentralised data flows in service-oriented IoT systems. Our approach is evaluated empirically, and the results show that it scales well with the size of IoT systems by substantially reducing both the number of data flows and network traffic in comparison with distributed data flows.","PeriodicalId":21872,"journal":{"name":"South Afr. Comput. J.","volume":"8 1","pages":"1477-1506"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81298707","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
期刊
South Afr. Comput. J.
全部 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