首页 > 最新文献

JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY最新文献

英文 中文
Structure of skew cyclic codes over 斜循环码的结构
IF 1.4 Q1 Mathematics Pub Date : 2022-05-24 DOI: 10.1080/09720529.2022.2026624
H. Islam, O. Prakash
{"title":"Structure of skew cyclic codes over","authors":"H. Islam, O. Prakash","doi":"10.1080/09720529.2022.2026624","DOIUrl":"https://doi.org/10.1080/09720529.2022.2026624","url":null,"abstract":"","PeriodicalId":46563,"journal":{"name":"JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY","volume":null,"pages":null},"PeriodicalIF":1.4,"publicationDate":"2022-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42165051","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
Generalized (α, β)-derivations in 3-prime near-rings 3-素数近环中的广义(α,β)-导子
IF 1.4 Q1 Mathematics Pub Date : 2022-05-24 DOI: 10.1080/09720529.2021.1985801
A. Boua, A. Abdelwanis
{"title":"Generalized (α, β)-derivations in 3-prime near-rings","authors":"A. Boua, A. Abdelwanis","doi":"10.1080/09720529.2021.1985801","DOIUrl":"https://doi.org/10.1080/09720529.2021.1985801","url":null,"abstract":"","PeriodicalId":46563,"journal":{"name":"JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY","volume":null,"pages":null},"PeriodicalIF":1.4,"publicationDate":"2022-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47073994","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
Hyper and multiple f-index of nano star dendrimers 纳米星形树状大分子的超和多重f指数
IF 1.4 Q1 Mathematics Pub Date : 2022-05-24 DOI: 10.1080/09720529.2021.1923923
S. Ghobadi, M. Ghods, M. Ghorbaninejad
{"title":"Hyper and multiple f-index of nano star dendrimers","authors":"S. Ghobadi, M. Ghods, M. Ghorbaninejad","doi":"10.1080/09720529.2021.1923923","DOIUrl":"https://doi.org/10.1080/09720529.2021.1923923","url":null,"abstract":"","PeriodicalId":46563,"journal":{"name":"JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY","volume":null,"pages":null},"PeriodicalIF":1.4,"publicationDate":"2022-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46681447","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
Commutativity degree of chains of finite groups 有限群链的交换度
IF 1.4 Q1 Mathematics Pub Date : 2022-05-24 DOI: 10.1080/09720529.2021.1974647
H. Darabi, M. Imanparast
{"title":"Commutativity degree of chains of finite groups","authors":"H. Darabi, M. Imanparast","doi":"10.1080/09720529.2021.1974647","DOIUrl":"https://doi.org/10.1080/09720529.2021.1974647","url":null,"abstract":"","PeriodicalId":46563,"journal":{"name":"JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY","volume":null,"pages":null},"PeriodicalIF":1.4,"publicationDate":"2022-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42147487","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
Information cryptography using cellular automata and digital image processing 利用元胞自动机和数字图像处理的信息密码学
IF 1.4 Q1 Mathematics Pub Date : 2022-05-19 DOI: 10.1080/09720529.2022.2072437
Anil Kumar, Sandeep Sharma
Abstract In the recent era, security of the data and information is a very big challenge. The society is also facing a lot of challenges to preserve the security of information. The proposed research explores an asymmetric key encryption and decryption method by processing an image. The keys are extracted from the image by selecting a window from the image. The proposed research includes the concepts of cellular automata to increasing strength of the method. The cellular automata technique suggests proposed keys to encode and decode the information by analyzing image pixels intensity.
摘要在当今时代,数据和信息的安全是一个非常大的挑战。社会在维护信息安全方面也面临着许多挑战。提出的研究探索了一种通过处理图像的非对称密钥加密和解密方法。通过从图像中选择一个窗口,可以从图像中提取关键帧。所提出的研究包括元胞自动机的概念,以提高方法的强度。细胞自动机技术通过分析图像像素强度,提出了对信息进行编码和解码的关键。
{"title":"Information cryptography using cellular automata and digital image processing","authors":"Anil Kumar, Sandeep Sharma","doi":"10.1080/09720529.2022.2072437","DOIUrl":"https://doi.org/10.1080/09720529.2022.2072437","url":null,"abstract":"Abstract In the recent era, security of the data and information is a very big challenge. The society is also facing a lot of challenges to preserve the security of information. The proposed research explores an asymmetric key encryption and decryption method by processing an image. The keys are extracted from the image by selecting a window from the image. The proposed research includes the concepts of cellular automata to increasing strength of the method. The cellular automata technique suggests proposed keys to encode and decode the information by analyzing image pixels intensity.","PeriodicalId":46563,"journal":{"name":"JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY","volume":null,"pages":null},"PeriodicalIF":1.4,"publicationDate":"2022-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45599765","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
Efficient resource allocation scheme for D2D enabled vehicular networks in secured 5G communication 安全5G通信中D2D车载网络的高效资源分配方案
IF 1.4 Q1 Mathematics Pub Date : 2022-05-19 DOI: 10.1080/09720529.2022.2068605
Amit Rathee, Y. Chaba
Abstract D2D communications are regarded as one of the important technology in the 5th generation network. Due to the lack of spectrum resources, resource allocation has some uphill challenges. In this paper, we execute spectrum distribution and power allocation to attain the maximum efficiency for the resource allocation scheme in wireless channels. We try to maximize the ergodic capacity for both V2V and V2I connections while keeping reliability for every V2I link. Hybrid algorithms approach that turnout ideal resource allocation for D2D are proposed. The presentation of channels is established by MATLAB Simulation.
摘要D2D通信是第五代网络中的重要技术之一。由于频谱资源的缺乏,资源分配面临着严峻的挑战。本文通过频谱分配和功率分配来实现无线信道资源分配方案的最大效率。我们试图最大化V2V和V2I连接的遍历容量,同时保持每个V2I链路的可靠性。提出了一种实现D2D理想资源分配的混合算法。通过MATLAB仿真建立了通道的表示形式。
{"title":"Efficient resource allocation scheme for D2D enabled vehicular networks in secured 5G communication","authors":"Amit Rathee, Y. Chaba","doi":"10.1080/09720529.2022.2068605","DOIUrl":"https://doi.org/10.1080/09720529.2022.2068605","url":null,"abstract":"Abstract D2D communications are regarded as one of the important technology in the 5th generation network. Due to the lack of spectrum resources, resource allocation has some uphill challenges. In this paper, we execute spectrum distribution and power allocation to attain the maximum efficiency for the resource allocation scheme in wireless channels. We try to maximize the ergodic capacity for both V2V and V2I connections while keeping reliability for every V2I link. Hybrid algorithms approach that turnout ideal resource allocation for D2D are proposed. The presentation of channels is established by MATLAB Simulation.","PeriodicalId":46563,"journal":{"name":"JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY","volume":null,"pages":null},"PeriodicalIF":1.4,"publicationDate":"2022-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48543554","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
Analysis of routing and security issues in OLSR protocol for video streaming over MANET MANET视频流OLSR协议的路由和安全问题分析
IF 1.4 Q1 Mathematics Pub Date : 2022-05-19 DOI: 10.1080/09720529.2022.2072439
Ravi Shanker Sharma, B. Keswani, Dinesh Goyal
Abstract Mobile ad-hoc networks (MANETs) are autonomous, self-organizing networks without infrastructure support. The nodes in MANET network are dynamic and these nodes create creates a topological map through exchange of routing information defined by some set of rules called routing protocols which are further classified as proactive, reactive and hybrid. OLSR is proactive type of protocol which is widely used in MANET. The basic principal of OLSR is based on selection of Multipoint Relays (MPR) through flooding mechanism. There have been many enhancements in OLSR routing protocol to improve routing and security issues. But there is still a very vital scope for enhancement in OLSR to overcome these issues. In this paper, we review the different enhancements in OLSR and attempt to find out different routing and security challenges that can be further enhanced in OLSR for video streaming over MANET
摘要移动自组织网络(MANET)是一种没有基础设施支持的自主、自组织网络。MANET网络中的节点是动态的,这些节点通过交换路由信息来创建拓扑图,路由信息由一组称为路由协议的规则定义,这些规则被进一步分为主动、被动和混合。OLSR是一种在MANET中广泛使用的主动式协议。OLSR的基本原理是基于通过洪泛机制选择多点继电器(MPR)。OLSR路由协议中有许多增强功能,以改进路由和安全问题。但是,为了克服这些问题,OLSR仍有非常重要的改进空间。在本文中,我们回顾了OLSR中的不同增强,并试图找出不同的路由和安全挑战,这些挑战可以在OLSR中进一步增强,用于MANET上的视频流
{"title":"Analysis of routing and security issues in OLSR protocol for video streaming over MANET","authors":"Ravi Shanker Sharma, B. Keswani, Dinesh Goyal","doi":"10.1080/09720529.2022.2072439","DOIUrl":"https://doi.org/10.1080/09720529.2022.2072439","url":null,"abstract":"Abstract Mobile ad-hoc networks (MANETs) are autonomous, self-organizing networks without infrastructure support. The nodes in MANET network are dynamic and these nodes create creates a topological map through exchange of routing information defined by some set of rules called routing protocols which are further classified as proactive, reactive and hybrid. OLSR is proactive type of protocol which is widely used in MANET. The basic principal of OLSR is based on selection of Multipoint Relays (MPR) through flooding mechanism. There have been many enhancements in OLSR routing protocol to improve routing and security issues. But there is still a very vital scope for enhancement in OLSR to overcome these issues. In this paper, we review the different enhancements in OLSR and attempt to find out different routing and security challenges that can be further enhanced in OLSR for video streaming over MANET","PeriodicalId":46563,"journal":{"name":"JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY","volume":null,"pages":null},"PeriodicalIF":1.4,"publicationDate":"2022-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41638747","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
An enhanced digital forensic investigation framework for XSS attack 增强的跨站攻击数字取证调查框架
IF 1.4 Q1 Mathematics Pub Date : 2022-05-19 DOI: 10.1080/09720529.2022.2072424
Saurabh Kumar, S. Pathak, Jagendra Singh
Abstract Cyber crimes and frauds are growing at a rapid rate and the law practitioners require proper methodology to collect the digital evidences. When the criminals use digital platform in order to commit the crime, forensic examiners apply practical frameworks and methods to collect digital evidences. The digital forensics method entails analyzing network traffic in order to detect and investigate intrusions. For cyber crime investigation, various models with merits and demerits have been offered. This study examines the characteristics of existing digital forensic investigation models and analyses some of the challenges surrounding digital forensic research.
摘要网络犯罪和网络欺诈正在快速增长,法律从业者需要正确的方法来收集数字证据。当犯罪分子利用数字平台进行犯罪活动时,司法鉴定人员运用实用的框架和方法来收集数字证据。数字取证方法需要分析网络流量,以检测和调查入侵。对于网络犯罪侦查,各种模式各有优缺点。本研究考察了现有数字法医调查模型的特点,并分析了围绕数字法医研究的一些挑战。
{"title":"An enhanced digital forensic investigation framework for XSS attack","authors":"Saurabh Kumar, S. Pathak, Jagendra Singh","doi":"10.1080/09720529.2022.2072424","DOIUrl":"https://doi.org/10.1080/09720529.2022.2072424","url":null,"abstract":"Abstract Cyber crimes and frauds are growing at a rapid rate and the law practitioners require proper methodology to collect the digital evidences. When the criminals use digital platform in order to commit the crime, forensic examiners apply practical frameworks and methods to collect digital evidences. The digital forensics method entails analyzing network traffic in order to detect and investigate intrusions. For cyber crime investigation, various models with merits and demerits have been offered. This study examines the characteristics of existing digital forensic investigation models and analyses some of the challenges surrounding digital forensic research.","PeriodicalId":46563,"journal":{"name":"JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY","volume":null,"pages":null},"PeriodicalIF":1.4,"publicationDate":"2022-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46217745","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
Data management framework for IoT edge-cloud architecture for resource-constrained IoT application 面向资源受限物联网应用的数据管理框架——边缘云架构
IF 1.4 Q1 Mathematics Pub Date : 2022-05-19 DOI: 10.1080/09720529.2022.2075086
G. Sharma, N. Hemrajani, Satyajeet Sharma, Aditya Upadhyay, Y. Bhardwaj, Ashutosh Kumar
Abstract There has never been a time when the volume and complexity of data travelling through modern networks have increased rapidly, but the Internet of Things has played a significant role in this rise. This will result in a significant increase in traffic directed to data centres for processing. This increase in traffic directly impacts the response time of IoT devices, which may be undesirable in sensitive environments such as hospitals. We want to look at a modern computing paradigm known as Edge Computing, which brings some of the analytical and processing resources, that cloud platforms now have, to the point where data is generated, reducing the amount of data generated. This information must be communicated to the network, and the system’s response time must be improved.
通过现代网络传输的数据量和复杂性从未像现在这样迅速增加,但物联网在这一增长中发挥了重要作用。这将导致指向数据中心进行处理的流量显著增加。流量的增加直接影响物联网设备的响应时间,这在医院等敏感环境中可能是不可取的。我们想看看一种被称为边缘计算的现代计算范式,它将云平台现在拥有的一些分析和处理资源带到生成数据的地方,从而减少生成的数据量。这些信息必须传达给网络,并且必须提高系统的响应时间。
{"title":"Data management framework for IoT edge-cloud architecture for resource-constrained IoT application","authors":"G. Sharma, N. Hemrajani, Satyajeet Sharma, Aditya Upadhyay, Y. Bhardwaj, Ashutosh Kumar","doi":"10.1080/09720529.2022.2075086","DOIUrl":"https://doi.org/10.1080/09720529.2022.2075086","url":null,"abstract":"Abstract There has never been a time when the volume and complexity of data travelling through modern networks have increased rapidly, but the Internet of Things has played a significant role in this rise. This will result in a significant increase in traffic directed to data centres for processing. This increase in traffic directly impacts the response time of IoT devices, which may be undesirable in sensitive environments such as hospitals. We want to look at a modern computing paradigm known as Edge Computing, which brings some of the analytical and processing resources, that cloud platforms now have, to the point where data is generated, reducing the amount of data generated. This information must be communicated to the network, and the system’s response time must be improved.","PeriodicalId":46563,"journal":{"name":"JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY","volume":null,"pages":null},"PeriodicalIF":1.4,"publicationDate":"2022-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44611616","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
Vector space modelling-based intelligent binary image encryption for secure communication 基于向量空间建模的安全通信智能二值图像加密
IF 1.4 Q1 Mathematics Pub Date : 2022-05-19 DOI: 10.1080/09720529.2022.2075090
V. Dankan Gowda, Avinash Sharma, M. Nagabushanam, H. G. Govardhana Reddy, K. Raghavendra
Abstract In this research work, a secured routing technique is developed based on the LEACH algorithm. Many secure routing algorithms were proposed in the past by modifying the LEACH algorithm with trust management techniques, key generation, and distribution technique and intrusion detection algorithms. Most present solutions are unable to address the issue of modifying and intercepting assaults. To tackle this problem, a new secured routing algorithm is developed in this work that divides the image and messages into sub-components, represent them in a matrix format and add them to get a steganographic image which is encrypted using a suitable encryption algorithm selected by the rule system developed in this research work. Moreover, intelligent agents are incorporated in all the sensor nodes in the network to communicate the encrypted images to the neighbor nodes more reliably.
摘要在本研究工作中,开发了一种基于LEACH算法的安全路由技术。过去,通过使用信任管理技术、密钥生成和分发技术以及入侵检测算法对LEACH算法进行修改,提出了许多安全路由算法。目前的大多数解决方案都无法解决修改和拦截攻击的问题。为了解决这个问题,本工作开发了一种新的安全路由算法,该算法将图像和消息划分为子组件,以矩阵格式表示它们,并将它们相加以获得隐写图像,该隐写图像使用本研究工作中开发的规则系统选择的适当加密算法进行加密。此外,智能代理被结合在网络中的所有传感器节点中,以更可靠地将加密的图像传送到相邻节点。
{"title":"Vector space modelling-based intelligent binary image encryption for secure communication","authors":"V. Dankan Gowda, Avinash Sharma, M. Nagabushanam, H. G. Govardhana Reddy, K. Raghavendra","doi":"10.1080/09720529.2022.2075090","DOIUrl":"https://doi.org/10.1080/09720529.2022.2075090","url":null,"abstract":"Abstract In this research work, a secured routing technique is developed based on the LEACH algorithm. Many secure routing algorithms were proposed in the past by modifying the LEACH algorithm with trust management techniques, key generation, and distribution technique and intrusion detection algorithms. Most present solutions are unable to address the issue of modifying and intercepting assaults. To tackle this problem, a new secured routing algorithm is developed in this work that divides the image and messages into sub-components, represent them in a matrix format and add them to get a steganographic image which is encrypted using a suitable encryption algorithm selected by the rule system developed in this research work. Moreover, intelligent agents are incorporated in all the sensor nodes in the network to communicate the encrypted images to the neighbor nodes more reliably.","PeriodicalId":46563,"journal":{"name":"JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY","volume":null,"pages":null},"PeriodicalIF":1.4,"publicationDate":"2022-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41413108","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}
引用次数: 6
期刊
JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY
全部 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