首页 > 最新文献

International Journal of Wavelets Multiresolution and Information Processing最新文献

英文 中文
Effective Face Recognition with Hybrid Distance-Key Frame Selection Using TBO-Ensemble Model 基于tbo集成模型的混合距离-关键帧选择人脸识别
4区 计算机科学 Q2 Mathematics Pub Date : 2023-10-17 DOI: 10.1142/s0219691323500443
Jitendra Chandrakant Musale, Anujkumar Singh, Swati Shirke
The enormous amount of data contained in the video image has grown rapidly along with surveillance, greatly outpacing the capacity of human resources to handle it effectively. Smart surveillance retrieval is an essential component of any modern video surveillance system, considerably boosting the effectiveness, precision, and interoperability of the system. The use of face recognition and other cutting-edge technology in the security surveillance system is rapidly rising. Therefore, in this article, the distributed deep convolutional neural network (DCNN) and distributed deep BiLSTM is proposed to efficiently detect the face from the video. One of the major contributions involved in this research relies on the key frame selection, where four unique distance measurement techniques are fused, and is named hybrid distance- key frame selection. The Tri birds optimization (TBO) technique selects the best solution from a large number of solutions for the ensemble model classifier engaged in face recognition. The ensemble model classifier incorporates various hyper-parameters that are optimally trained. Multiple test videos with 401 and 802 test videos are used as the input for the TBO-ensemble model that attains 97% accuracy, 98.33% precision, recall, and f-measure for epoch 50 and the 500 number of retrievals, respectively.
视频图像中包含的大量数据随着监控的发展而迅速增长,大大超过了人力资源有效处理的能力。智能监控检索是任何现代视频监控系统的重要组成部分,大大提高了系统的有效性、精度和互操作性。人脸识别等尖端技术在安防监控系统中的应用正在迅速上升。因此,本文提出了分布式深度卷积神经网络(DCNN)和分布式深度BiLSTM来从视频中有效地检测人脸。关键帧选择是本研究的主要贡献之一,它融合了四种独特的距离测量技术,称为混合距离-关键帧选择。三鸟优化(TBO)技术从大量的解决方案中选择最优的集成模型分类器用于人脸识别。集成模型分类器集成了各种经过最佳训练的超参数。使用401和802个测试视频的多个测试视频作为TBO-ensemble模型的输入,该模型在epoch 50和检索次数500时分别达到97%的准确率、98.33%的精度、召回率和f-measure。
{"title":"Effective Face Recognition with Hybrid Distance-Key Frame Selection Using TBO-Ensemble Model","authors":"Jitendra Chandrakant Musale, Anujkumar Singh, Swati Shirke","doi":"10.1142/s0219691323500443","DOIUrl":"https://doi.org/10.1142/s0219691323500443","url":null,"abstract":"The enormous amount of data contained in the video image has grown rapidly along with surveillance, greatly outpacing the capacity of human resources to handle it effectively. Smart surveillance retrieval is an essential component of any modern video surveillance system, considerably boosting the effectiveness, precision, and interoperability of the system. The use of face recognition and other cutting-edge technology in the security surveillance system is rapidly rising. Therefore, in this article, the distributed deep convolutional neural network (DCNN) and distributed deep BiLSTM is proposed to efficiently detect the face from the video. One of the major contributions involved in this research relies on the key frame selection, where four unique distance measurement techniques are fused, and is named hybrid distance- key frame selection. The Tri birds optimization (TBO) technique selects the best solution from a large number of solutions for the ensemble model classifier engaged in face recognition. The ensemble model classifier incorporates various hyper-parameters that are optimally trained. Multiple test videos with 401 and 802 test videos are used as the input for the TBO-ensemble model that attains 97% accuracy, 98.33% precision, recall, and f-measure for epoch 50 and the 500 number of retrievals, respectively.","PeriodicalId":50282,"journal":{"name":"International Journal of Wavelets Multiresolution and Information Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135944597","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Community Detection: Concepts, Algorithms, Evaluation and Challenges 社区检测:概念、算法、评估和挑战
4区 计算机科学 Q2 Mathematics Pub Date : 2023-10-12 DOI: 10.1142/s0219691323500534
Song Qu, Guan Yuan, Hui Xu, Yanmei Zhang, Mingqing Tang, Mu Zhu
{"title":"Community Detection: Concepts, Algorithms, Evaluation and Challenges","authors":"Song Qu, Guan Yuan, Hui Xu, Yanmei Zhang, Mingqing Tang, Mu Zhu","doi":"10.1142/s0219691323500534","DOIUrl":"https://doi.org/10.1142/s0219691323500534","url":null,"abstract":"","PeriodicalId":50282,"journal":{"name":"International Journal of Wavelets Multiresolution and Information Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136013887","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Sparse Series Solutions of Random Boundary and Initial Value Problems 随机边界与初值问题的稀疏级数解
4区 计算机科学 Q2 Mathematics Pub Date : 2023-10-12 DOI: 10.1142/s0219691323500509
Fang Yang, Min Chen, Pengtao Li, Wei Qu, Jiecheng Chen, Tao Qian
{"title":"Sparse Series Solutions of Random Boundary and Initial Value Problems","authors":"Fang Yang, Min Chen, Pengtao Li, Wei Qu, Jiecheng Chen, Tao Qian","doi":"10.1142/s0219691323500509","DOIUrl":"https://doi.org/10.1142/s0219691323500509","url":null,"abstract":"","PeriodicalId":50282,"journal":{"name":"International Journal of Wavelets Multiresolution and Information Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136014721","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Automatic SARS-CoV-2 Segmentation in Electron Microscopy Based on Few-shot Learning 基于少镜头学习的SARS-CoV-2电子显微镜自动分割
4区 计算机科学 Q2 Mathematics Pub Date : 2023-10-07 DOI: 10.1142/s0219691323500479
Chi Xiao, Xiaoyu Xia, Shunhao Xu, Qilin Huang, Hao Xiao, Jingdong Song
Due to the advantages of direct visualization and high resolution, transmission electron microscopy (TEM) technology has been widely used in the morphological identification of viruses. With the development of artificial intelligence (AI), there have been some studies on automated TEM virus identification using deep learning. However, to achieve effective virus identification results, a large number of high-quality labeled images are required for network training. In this work, we propose an automatic virus segmentation method based on few-shot learning. We use the Chikungunya virus, Parapoxvirus and Marburg virus, etc. to construct a pre-training virus dataset and train an attention U-Net-like network with an encoder module, relationship module, attention module and decoding module to realize severe acute respiratory syndrome coronavirus type 2 (SARS-CoV-2) segmentation using few-shot learning. The experiment shows that the proposed few-shot learning methods yield 0.900 Dice and 0.828 Jaccard in 1-shot, 0.903 Dice and 0.832 Jaccard in 5-shot, which demonstrates the effectiveness of our method and outperforms other promising methods. Our fully automated method contributes to the development of medical virology by providing virologists with a low-cost and accurate approach to identify SARS-CoV-2 in TEM.
透射电子显微镜(TEM)技术由于具有直观、分辨率高的优点,在病毒形态鉴定中得到了广泛的应用。随着人工智能(AI)的发展,利用深度学习技术进行TEM病毒自动识别的研究已经开始。然而,为了获得有效的病毒识别结果,需要大量高质量的标记图像进行网络训练。在这项工作中,我们提出了一种基于few-shot学习的病毒自动分割方法。我们利用基孔肯雅病毒、副痘病毒和马尔堡病毒等构建预训练病毒数据集,训练具有编码器模块、关系模块、注意力模块和解码模块的注意力u - net样网络,利用少次学习实现SARS-CoV-2的分割。实验表明,提出的少镜头学习方法在1次射击中产生0.900 Dice和0.828 Jaccard,在5次射击中产生0.903 Dice和0.832 Jaccard,证明了我们的方法的有效性,并且优于其他有前途的方法。我们的全自动方法为病毒学家提供了一种低成本、准确的方法来识别TEM中的SARS-CoV-2,有助于医学病毒学的发展。
{"title":"Automatic SARS-CoV-2 Segmentation in Electron Microscopy Based on Few-shot Learning","authors":"Chi Xiao, Xiaoyu Xia, Shunhao Xu, Qilin Huang, Hao Xiao, Jingdong Song","doi":"10.1142/s0219691323500479","DOIUrl":"https://doi.org/10.1142/s0219691323500479","url":null,"abstract":"Due to the advantages of direct visualization and high resolution, transmission electron microscopy (TEM) technology has been widely used in the morphological identification of viruses. With the development of artificial intelligence (AI), there have been some studies on automated TEM virus identification using deep learning. However, to achieve effective virus identification results, a large number of high-quality labeled images are required for network training. In this work, we propose an automatic virus segmentation method based on few-shot learning. We use the Chikungunya virus, Parapoxvirus and Marburg virus, etc. to construct a pre-training virus dataset and train an attention U-Net-like network with an encoder module, relationship module, attention module and decoding module to realize severe acute respiratory syndrome coronavirus type 2 (SARS-CoV-2) segmentation using few-shot learning. The experiment shows that the proposed few-shot learning methods yield 0.900 Dice and 0.828 Jaccard in 1-shot, 0.903 Dice and 0.832 Jaccard in 5-shot, which demonstrates the effectiveness of our method and outperforms other promising methods. Our fully automated method contributes to the development of medical virology by providing virologists with a low-cost and accurate approach to identify SARS-CoV-2 in TEM.","PeriodicalId":50282,"journal":{"name":"International Journal of Wavelets Multiresolution and Information Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135251916","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Lower Bound Estimation for A Family of High-dimensional Sparse Covariance Matrices 一类高维稀疏协方差矩阵的下界估计
4区 计算机科学 Q2 Mathematics Pub Date : 2023-09-23 DOI: 10.1142/s0219691323500455
Huimin Li, Youming Liu
Lower bound estimation plays an important role for establishing the minimax risk. A key step in lower bound estimation is deriving a lower bound of the affinity between two probability measures. This paper provides a simple method to estimate the affinity between mixture probability measures. Then we apply the lower bound of the affinity to establish the minimax lower bound for a family of sparse covariance matrices, which contains Cai–Ren–Zhou’s theorem in [T. Cai, Z. Ren and H. Zhou, Estimating structured high-dimensional covariance and precision matrices: Optimal rates and adaptive estimation, Electron. J. Stat. 10(1) (2016) 1–59] as a special example.
下界估计对于最大最小风险的确定起着重要的作用。下界估计的一个关键步骤是推导两个概率测度之间的亲和力的下界。本文提供了一种估计混合概率测度间亲和力的简单方法。在此基础上,利用亲和力的下界建立了一类稀疏协方差矩阵的极大极小下界,该矩阵包含[T]中的周蔡仁定理。J. Stat. 10(1)(2016) 1 - 59]作为特例。
{"title":"Lower Bound Estimation for A Family of High-dimensional Sparse Covariance Matrices","authors":"Huimin Li, Youming Liu","doi":"10.1142/s0219691323500455","DOIUrl":"https://doi.org/10.1142/s0219691323500455","url":null,"abstract":"Lower bound estimation plays an important role for establishing the minimax risk. A key step in lower bound estimation is deriving a lower bound of the affinity between two probability measures. This paper provides a simple method to estimate the affinity between mixture probability measures. Then we apply the lower bound of the affinity to establish the minimax lower bound for a family of sparse covariance matrices, which contains Cai–Ren–Zhou’s theorem in [T. Cai, Z. Ren and H. Zhou, Estimating structured high-dimensional covariance and precision matrices: Optimal rates and adaptive estimation, Electron. J. Stat. 10(1) (2016) 1–59] as a special example.","PeriodicalId":50282,"journal":{"name":"International Journal of Wavelets Multiresolution and Information Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135959567","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Back-Propagating Errors Through Artificial Neural Networks for Variable Selection 基于人工神经网络的变量选择反向传播误差
4区 计算机科学 Q2 Mathematics Pub Date : 2023-09-13 DOI: 10.1142/s0219691323500467
Junying Hu, Peiju Chang, Fang Du, Rongrong Fei, Kai Sun, Jiangshe Zhang, Hai Zhang
{"title":"Back-Propagating Errors Through Artificial Neural Networks for Variable Selection","authors":"Junying Hu, Peiju Chang, Fang Du, Rongrong Fei, Kai Sun, Jiangshe Zhang, Hai Zhang","doi":"10.1142/s0219691323500467","DOIUrl":"https://doi.org/10.1142/s0219691323500467","url":null,"abstract":"","PeriodicalId":50282,"journal":{"name":"International Journal of Wavelets Multiresolution and Information Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135689717","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
IntelligentFaceNet: Designing a Multi-Cascaded Attentive and Adaptive Deep Learning Network for Facial Recognition using Heuristic Approach 智能脸网:使用启发式方法设计用于面部识别的多级联关注和自适应深度学习网络
4区 计算机科学 Q2 Mathematics Pub Date : 2023-09-08 DOI: 10.1142/s0219691323500431
Giriprasad Manoharan
{"title":"IntelligentFaceNet: Designing a Multi-Cascaded Attentive and Adaptive Deep Learning Network for Facial Recognition using Heuristic Approach","authors":"Giriprasad Manoharan","doi":"10.1142/s0219691323500431","DOIUrl":"https://doi.org/10.1142/s0219691323500431","url":null,"abstract":"","PeriodicalId":50282,"journal":{"name":"International Journal of Wavelets Multiresolution and Information Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136363005","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The Plancherel Formula of Fourier Integral Operators: the Case of Sp(1, 1) 傅里叶积分算子的Plancherel公式:Sp(1,1)的情形
IF 1.4 4区 计算机科学 Q2 Mathematics Pub Date : 2023-08-10 DOI: 10.1142/s021969132350042x
Xiaoke Jia, Xingya Fan
{"title":"The Plancherel Formula of Fourier Integral Operators: the Case of Sp(1, 1)","authors":"Xiaoke Jia, Xingya Fan","doi":"10.1142/s021969132350042x","DOIUrl":"https://doi.org/10.1142/s021969132350042x","url":null,"abstract":"","PeriodicalId":50282,"journal":{"name":"International Journal of Wavelets Multiresolution and Information Processing","volume":null,"pages":null},"PeriodicalIF":1.4,"publicationDate":"2023-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43274424","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Double graphs regularized multi-view subspace clustering 双图正则化多视图子空间聚类
4区 计算机科学 Q2 Mathematics Pub Date : 2023-08-04 DOI: 10.1142/s0219691323500327
Longlong Chen, Yulong Wang, Youheng Liu, Yutao Hu, Libin Wang, Huiwu Luo, Yuan Yan Tang
In recent years, there has been an increasing interest in multi-view subspace clustering (MSC). However, existing MSC methods fail to take full advantage of the local geometric structure in each manifold throughout the data flow, which is essential for clustering. To remedy this drawback, in this paper, a novel Double Graphs Regularized Multi-view Subspace Clustering (DGRMSC) method is proposed, which aims to harness both global and local structural information of multi-view data in a unified framework. Specifically, DGRMSC first learns a latent representation to exploit the global complementary information of multiple views. Based on the learned latent representation, we learn a self-representation to explore its global cluster structure. Further, Double Graphs Regularization (DGR) is performed on both latent representation and self-representation to take advantage of their local manifold structures simultaneously. Then, we design an iterative algorithm to solve the optimization problem effectively. Comprehensive experiments on several popular multi-view datasets demonstrate the effectiveness of the proposed method.
近年来,人们对多视图子空间聚类(MSC)越来越感兴趣。然而,现有的MSC方法未能充分利用数据流中每个流形的局部几何结构,而这是聚类所必需的。为了弥补这一缺陷,本文提出了一种新的双图正则化多视图子空间聚类方法(DGRMSC),该方法旨在在统一的框架内利用多视图数据的全局和局部结构信息。具体来说,DGRMSC首先学习一个潜在表示来利用多个视图的全局互补信息。在学习到的潜在表征的基础上,我们学习了一个自我表征来探索它的全局簇结构。在此基础上,对潜在表示和自表示同时进行双图正则化(Double graph Regularization, DGR),以充分利用它们的局部流形结构。然后,我们设计了一个迭代算法来有效地解决优化问题。在几种常用的多视图数据集上的综合实验证明了该方法的有效性。
{"title":"Double graphs regularized multi-view subspace clustering","authors":"Longlong Chen, Yulong Wang, Youheng Liu, Yutao Hu, Libin Wang, Huiwu Luo, Yuan Yan Tang","doi":"10.1142/s0219691323500327","DOIUrl":"https://doi.org/10.1142/s0219691323500327","url":null,"abstract":"In recent years, there has been an increasing interest in multi-view subspace clustering (MSC). However, existing MSC methods fail to take full advantage of the local geometric structure in each manifold throughout the data flow, which is essential for clustering. To remedy this drawback, in this paper, a novel Double Graphs Regularized Multi-view Subspace Clustering (DGRMSC) method is proposed, which aims to harness both global and local structural information of multi-view data in a unified framework. Specifically, DGRMSC first learns a latent representation to exploit the global complementary information of multiple views. Based on the learned latent representation, we learn a self-representation to explore its global cluster structure. Further, Double Graphs Regularization (DGR) is performed on both latent representation and self-representation to take advantage of their local manifold structures simultaneously. Then, we design an iterative algorithm to solve the optimization problem effectively. Comprehensive experiments on several popular multi-view datasets demonstrate the effectiveness of the proposed method.","PeriodicalId":50282,"journal":{"name":"International Journal of Wavelets Multiresolution and Information Processing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136119846","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Dual Wavelet Frame Packets with Non-square Iterative Matrices 具有非平方迭代矩阵的对偶小波帧包
IF 1.4 4区 计算机科学 Q2 Mathematics Pub Date : 2023-08-04 DOI: 10.1142/s0219691323500418
Zhihua Zhang
{"title":"Dual Wavelet Frame Packets with Non-square Iterative Matrices","authors":"Zhihua Zhang","doi":"10.1142/s0219691323500418","DOIUrl":"https://doi.org/10.1142/s0219691323500418","url":null,"abstract":"","PeriodicalId":50282,"journal":{"name":"International Journal of Wavelets Multiresolution and Information Processing","volume":null,"pages":null},"PeriodicalIF":1.4,"publicationDate":"2023-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42399993","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
International Journal of Wavelets Multiresolution and Information Processing
全部 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