首页 > 最新文献

自动化学报最新文献

英文 中文
Extension of SGMF Using Gaussian Sum Approximation for Nonlinear/Non-Gaussian Model and Its Application in Multipath Estimation: Extension of SGMF Using Gaussian Sum Approximation for Nonlinear/Non-Gaussian Model and Its Application in Multipath Estimation 非线性/非高斯模型高斯和近似的SGMF扩展及其在多径估计中的应用:非线性/非高斯模型高斯和近似的SGMF扩展及其在多径估计中的应用
Q2 Computer Science
自动化学报
Pub Date : 2014-04-17 DOI: 10.3724/SP.J.1004.2013.00001
Jie Chen, Lan Cheng, Minggang Gan
{"title":"Extension of SGMF Using Gaussian Sum Approximation for Nonlinear/Non-Gaussian Model and Its Application in Multipath Estimation: Extension of SGMF Using Gaussian Sum Approximation for Nonlinear/Non-Gaussian Model and Its Application in Multipath Estimation","authors":"Jie Chen, Lan Cheng, Minggang Gan","doi":"10.3724/SP.J.1004.2013.00001","DOIUrl":"https://doi.org/10.3724/SP.J.1004.2013.00001","url":null,"abstract":"","PeriodicalId":35798,"journal":{"name":"自动化学报","volume":"39 1","pages":"1-10"},"PeriodicalIF":0.0,"publicationDate":"2014-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70157655","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-scale Graph-matching Based Kernel for Character Recognition from Natural Scenes 基于多尺度图匹配的自然场景字符识别核
Q2 Computer Science
自动化学报
Pub Date : 2014-04-01 DOI: 10.1016/S1874-1029(14)60006-9
Cun-Zhao SHI , Chun-Heng WANG , Bai-Hua XIAO , Yang ZHANG , Song GAO

Recognizing characters extracted from natural scene images is quite challenging due to the high degree of intraclass variation. In this paper, we propose a multi-scale graph-matching based kernel for scene character recognition. In order to capture the inherently distinctive structures of characters, each image is represented by several graphs associated with multi-scale image grids. The similarity between two images is thus defined as the optimum energy by matching two graphs (images), which finds the best match for each node in the graph while also preserving the spatial consistency across adjacent nodes. The computed similarity is suitable to construct a kernel for support vector machine (SVM). Multiple kernels acquired by matching graphs with multi-scale grids are combined so that the final kernel is more robust. Experimental results on challenging Chars74k and ICDAR03-CH datasets show that the proposed method performs better than the state of the art methods.

自然场景图像中提取的特征由于类内变化很大，识别难度很大。本文提出了一种基于多尺度图匹配的场景字符识别核。为了捕获字符固有的独特结构，每个图像由多个与多尺度图像网格相关联的图表示。两幅图像之间的相似度被定义为通过匹配两幅图(图像)的最优能量，在保持相邻节点之间空间一致性的同时，找到图中每个节点的最佳匹配。计算得到的相似度适合于构造支持向量机的核。将多尺度网格图匹配得到的多个核结合起来，使最终核具有更强的鲁棒性。在挑战性Chars74k和ICDAR03-CH数据集上的实验结果表明，该方法优于现有方法。
{"title":"Multi-scale Graph-matching Based Kernel for Character Recognition from Natural Scenes","authors":"Cun-Zhao SHI ,&nbsp;Chun-Heng WANG ,&nbsp;Bai-Hua XIAO ,&nbsp;Yang ZHANG ,&nbsp;Song GAO","doi":"10.1016/S1874-1029(14)60006-9","DOIUrl":"10.1016/S1874-1029(14)60006-9","url":null,"abstract":"<div><p>Recognizing characters extracted from natural scene images is quite challenging due to the high degree of intraclass variation. In this paper, we propose a multi-scale graph-matching based kernel for scene character recognition. In order to capture the inherently distinctive structures of characters, each image is represented by several graphs associated with multi-scale image grids. The similarity between two images is thus defined as the optimum energy by matching two graphs (images), which finds the best match for each node in the graph while also preserving the spatial consistency across adjacent nodes. The computed similarity is suitable to construct a kernel for support vector machine (SVM). Multiple kernels acquired by matching graphs with multi-scale grids are combined so that the final kernel is more robust. Experimental results on challenging Chars74k and ICDAR03-CH datasets show that the proposed method performs better than the state of the art methods.</p></div>","PeriodicalId":35798,"journal":{"name":"自动化学报","volume":"40 4","pages":"Pages 751-756"},"PeriodicalIF":0.0,"publicationDate":"2014-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1874-1029(14)60006-9","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"56927815","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
Data Driven Hierarchical Serial Scene Classification Framework 数据驱动的层次序列场景分类框架
Q2 Computer Science
自动化学报
Pub Date : 2014-04-01 DOI: 10.1016/S1874-1029(14)60008-2
Wen-Gang FENG

Scene classification is a complicated task, because it includes much content and it is difficult to capture its distribution. A novel hierarchical serial scene classification framework is presented in this paper. At first, we use hierarchical feature to present both the global scene and local patches containing specific objects. Hierarchy is presented by space pyramid match, and our own codebook is built by two different types of words. Secondly, we train the visual words by generative and discriminative methods respectively based on space pyramid match, which could obtain the local patch labels efficiently. Then, we use a neural network to simulate the human decision process, which leads to the final scene category from local labels. Experiments show that the hierarchical serial scene image representation and classification model obtains superior results with respect to accuracy.

场景分类是一项复杂的任务，因为它包含了很多内容，而且很难捕捉到它们的分布。提出了一种新的分层序列场景分类框架。首先，我们使用分层特征来表示包含特定对象的全局场景和局部补丁。层次结构是通过空间金字塔匹配来表示的，我们自己的密码本是由两种不同类型的单词组成的。其次，在空间金字塔匹配的基础上，分别采用生成和判别两种方法对视觉词进行训练，有效地获得局部贴片标签;然后，我们使用神经网络来模拟人类的决策过程，从而从局部标签中得出最终的场景类别。实验表明，该分级序列场景图像表示与分类模型在准确率方面取得了较好的效果。
{"title":"Data Driven Hierarchical Serial Scene Classification Framework","authors":"Wen-Gang FENG","doi":"10.1016/S1874-1029(14)60008-2","DOIUrl":"10.1016/S1874-1029(14)60008-2","url":null,"abstract":"<div><p>Scene classification is a complicated task, because it includes much content and it is difficult to capture its distribution. A novel hierarchical serial scene classification framework is presented in this paper. At first, we use hierarchical feature to present both the global scene and local patches containing specific objects. Hierarchy is presented by space pyramid match, and our own codebook is built by two different types of words. Secondly, we train the visual words by generative and discriminative methods respectively based on space pyramid match, which could obtain the local patch labels efficiently. Then, we use a neural network to simulate the human decision process, which leads to the final scene category from local labels. Experiments show that the hierarchical serial scene image representation and classification model obtains superior results with respect to accuracy.</p></div>","PeriodicalId":35798,"journal":{"name":"自动化学报","volume":"40 4","pages":"Pages 763-770"},"PeriodicalIF":0.0,"publicationDate":"2014-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1874-1029(14)60008-2","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"56927834","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
Fast Algorithm for Nonsubsampled Contourlet Transform 非下采样Contourlet变换快速算法
Q2 Computer Science
自动化学报
Pub Date : 2014-04-01 DOI: 10.1016/S1874-1029(14)60007-0
Chun-Man YAN , Bao-Long GUO , Meng YI

The multiscale geometric analysis (MGA) has been recognized as an effective strategy for image processing. As one of the discrete tools of MGA, the nonsubsampled contourlet transform (NSCT) has been widely used for image denoising, image fusion, image enhancement, feature extraction and so on. However, the processing performance is limited due to its high redundancy, and leading to an intensive computational efficiency. Therefore, its fast algorithm is desired in practice. In this paper, we adopt an optimized directional filter bank (DFB) and embed it into the NSCT to significantly accelerate the computational speed while keeping slight loss of the reconstructed performance. Experimental results show that the reconstructed image quality can satisfy the human visual system. Moreover, the improved NSCT has a speed about several times than that of the traditional one. Experimental results on image denoising also validate the feasibility and efficiency of the proposed method.

多尺度几何分析(MGA)是一种有效的图像处理方法。非下采样contourlet变换(NSCT)作为MGA的离散化工具之一，在图像去噪、图像融合、图像增强、特征提取等方面得到了广泛的应用。然而，由于其高冗余性，限制了处理性能，导致了大量的计算效率。因此，在实际应用中需要快速的算法。在本文中，我们采用了一种优化的方向滤波器组(DFB)并将其嵌入到NSCT中，在保持重构性能轻微损失的同时显著加快了计算速度。实验结果表明，重构后的图像质量能够满足人眼视觉系统的要求。此外，改进的NSCT的速度是传统NSCT的几倍左右。图像去噪的实验结果也验证了该方法的可行性和有效性。
{"title":"Fast Algorithm for Nonsubsampled Contourlet Transform","authors":"Chun-Man YAN ,&nbsp;Bao-Long GUO ,&nbsp;Meng YI","doi":"10.1016/S1874-1029(14)60007-0","DOIUrl":"10.1016/S1874-1029(14)60007-0","url":null,"abstract":"<div><p>The multiscale geometric analysis (MGA) has been recognized as an effective strategy for image processing. As one of the discrete tools of MGA, the nonsubsampled contourlet transform (NSCT) has been widely used for image denoising, image fusion, image enhancement, feature extraction and so on. However, the processing performance is limited due to its high redundancy, and leading to an intensive computational efficiency. Therefore, its fast algorithm is desired in practice. In this paper, we adopt an optimized directional filter bank (DFB) and embed it into the NSCT to significantly accelerate the computational speed while keeping slight loss of the reconstructed performance. Experimental results show that the reconstructed image quality can satisfy the human visual system. Moreover, the improved NSCT has a speed about several times than that of the traditional one. Experimental results on image denoising also validate the feasibility and efficiency of the proposed method.</p></div>","PeriodicalId":35798,"journal":{"name":"自动化学报","volume":"40 4","pages":"Pages 757-762"},"PeriodicalIF":0.0,"publicationDate":"2014-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S1874-1029(14)60007-0","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"56927827","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}
引用次数: 14
Control of Genetic Regulatory Networks: Opportunities and Challenges: Control of Genetic Regulatory Networks: Opportunities and Challenges 遗传调控网络的控制:机遇与挑战:遗传调控网络的控制:机遇与挑战
Q2 Computer Science
自动化学报
Pub Date : 2014-03-28 DOI: 10.3724/SP.J.1004.2013.01969
Pei-ju Wang, Jinxing Lv
{"title":"Control of Genetic Regulatory Networks: Opportunities and Challenges: Control of Genetic Regulatory Networks: Opportunities and Challenges","authors":"Pei-ju Wang, Jinxing Lv","doi":"10.3724/SP.J.1004.2013.01969","DOIUrl":"https://doi.org/10.3724/SP.J.1004.2013.01969","url":null,"abstract":"","PeriodicalId":35798,"journal":{"name":"自动化学报","volume":"39 1","pages":"1969-1979"},"PeriodicalIF":0.0,"publicationDate":"2014-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70161880","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}
引用次数: 18
Research on Differential Constraints-based Planning Algorithm for Autonomous-driving Vehicles: Research on Differential Constraints-based Planning Algorithm for Autonomous-driving Vehicles 基于差分约束的自动驾驶车辆规划算法研究基于差分约束的自动驾驶车辆规划算法研究
Q2 Computer Science
自动化学报
Pub Date : 2014-03-28 DOI: 10.3724/SP.J.1004.2013.02012
Y. Jiang, Jian-wei Gong, Guang-ming Xiong, Huiyan Chen
{"title":"Research on Differential Constraints-based Planning Algorithm for Autonomous-driving Vehicles: Research on Differential Constraints-based Planning Algorithm for Autonomous-driving Vehicles","authors":"Y. Jiang, Jian-wei Gong, Guang-ming Xiong, Huiyan Chen","doi":"10.3724/SP.J.1004.2013.02012","DOIUrl":"https://doi.org/10.3724/SP.J.1004.2013.02012","url":null,"abstract":"","PeriodicalId":35798,"journal":{"name":"自动化学报","volume":"39 1","pages":"2012-2020"},"PeriodicalIF":0.0,"publicationDate":"2014-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70161473","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}
引用次数: 10
Alternating Direction Method for Salt-and-pepper Denoising: Alternating Direction Method for Salt-and-pepper Denoising 椒盐去噪的交替方向法:椒盐去噪的交替方向法
Q2 Computer Science
自动化学报
Pub Date : 2014-03-28 DOI: 10.3724/SP.J.1004.2013.02071
Q. Xue, Chengyi Yang, Huaxiang Wang
{"title":"Alternating Direction Method for Salt-and-pepper Denoising: Alternating Direction Method for Salt-and-pepper Denoising","authors":"Q. Xue, Chengyi Yang, Huaxiang Wang","doi":"10.3724/SP.J.1004.2013.02071","DOIUrl":"https://doi.org/10.3724/SP.J.1004.2013.02071","url":null,"abstract":"","PeriodicalId":35798,"journal":{"name":"自动化学报","volume":"39 1","pages":"2071-2076"},"PeriodicalIF":0.0,"publicationDate":"2014-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70161924","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
Comparison of Two Methods to Implement Backward Swimming for a Carangiform Robotic Fish: Comparison of Two Methods to Implement Backward Swimming for a Carangiform Robotic Fish 囊状机器鱼向后游泳的两种实现方法的比较:囊状机器鱼向后游泳的两种实现方法的比较
Q2 Computer Science
自动化学报
Pub Date : 2014-03-28 DOI: 10.3724/SP.J.1004.2013.02032
Wu Zheng-xing, Yu Junzhi, Min Tan
{"title":"Comparison of Two Methods to Implement Backward Swimming for a Carangiform Robotic Fish: Comparison of Two Methods to Implement Backward Swimming for a Carangiform Robotic Fish","authors":"Wu Zheng-xing, Yu Junzhi, Min Tan","doi":"10.3724/SP.J.1004.2013.02032","DOIUrl":"https://doi.org/10.3724/SP.J.1004.2013.02032","url":null,"abstract":"","PeriodicalId":35798,"journal":{"name":"自动化学报","volume":"39 1","pages":"2032-2042"},"PeriodicalIF":0.0,"publicationDate":"2014-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70161546","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
Rescheduling with Release Time to Minimize Sum of Waiting Time Considering Waiting Constraint of Original Loads 考虑原负载等待约束的带释放时间的最小等待时间重调度
Q2 Computer Science
自动化学报
Pub Date : 2014-03-28 DOI: 10.3724/SP.J.1004.2013.02100
Yan-Dong Guo, Wang Qing, Huang Min
In this paper, we consider the rescheduling problem to minimize the sum of waiting times of rework jobs and the original loads with release time on a single machine, and the waiting time of each original load is constrained by a value. The problem of rescheduling for reworks on a single machine (RRSM) is formulated and proved to be NP-hard. A dynamic insert heuristic (DIH) algorithm of polynomial-time is designed and proved with three properties. With respect to two special cases of the identical processing time of rework jobs or the machine without idle times in the original schedule, the DIH algorithm can obtain an optimal solution. A discrimination condition is proved for the optimal solution and efiectiveness of the DIH algorithm is explained by cases with regard to general RRSM problems.
本文考虑重调度问题，以最小化单机上的返工作业与具有释放时间的原始负载的等待时间总和，并且每个原始负载的等待时间都有一个值约束。提出了单机返工的重调度问题，并证明了该问题具有np困难。设计了一种多项式时间的动态插入启发式(DIH)算法，并证明了它具有三个性质。对于返工作业加工时间相同或原计划中机器无空闲时间的两种特殊情况，DIH算法可以得到最优解。对于一般的RRSM问题，证明了最优解的判别条件，并通过实例说明了DIH算法的有效性。
{"title":"Rescheduling with Release Time to Minimize Sum of Waiting Time Considering Waiting Constraint of Original Loads","authors":"Yan-Dong Guo, Wang Qing, Huang Min","doi":"10.3724/SP.J.1004.2013.02100","DOIUrl":"https://doi.org/10.3724/SP.J.1004.2013.02100","url":null,"abstract":"In this paper, we consider the rescheduling problem to minimize the sum of waiting times of rework jobs and the original loads with release time on a single machine, and the waiting time of each original load is constrained by a value. The problem of rescheduling for reworks on a single machine (RRSM) is formulated and proved to be NP-hard. A dynamic insert heuristic (DIH) algorithm of polynomial-time is designed and proved with three properties. With respect to two special cases of the identical processing time of rework jobs or the machine without idle times in the original schedule, the DIH algorithm can obtain an optimal solution. A discrimination condition is proved for the optimal solution and efiectiveness of the DIH algorithm is explained by cases with regard to general RRSM problems.","PeriodicalId":35798,"journal":{"name":"自动化学报","volume":"1 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2014-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70162138","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
On the Relationship between the Synchronous State and the Solution of an Isolated Node in a Complex Network: On the Relationship between the Synchronous State and the Solution of an Isolated Node in a Complex Network 复杂网络中孤立节点的同步状态与解的关系——复杂网络中孤立节点的同步状态与解的关系
Q2 Computer Science
自动化学报
Pub Date : 2014-03-28 DOI: 10.3724/SP.J.1004.2013.02111
Juan Chen, Jun-an Lu, Jin Zhou
{"title":"On the Relationship between the Synchronous State and the Solution of an Isolated Node in a Complex Network: On the Relationship between the Synchronous State and the Solution of an Isolated Node in a Complex Network","authors":"Juan Chen, Jun-an Lu, Jin Zhou","doi":"10.3724/SP.J.1004.2013.02111","DOIUrl":"https://doi.org/10.3724/SP.J.1004.2013.02111","url":null,"abstract":"","PeriodicalId":35798,"journal":{"name":"自动化学报","volume":"39 1","pages":"2111-2120"},"PeriodicalIF":0.0,"publicationDate":"2014-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"70162175","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}
引用次数: 4
首页 上一页 下一页 尾页
类型
全部 化学•材料 生命科学 医学 物理 工程技术 环境•农林 材料科学 地球科学 法学 管理学 化学 环境科学与生态学 计算机科学 教育学 经济学 农林科学 人文科学 生物学 数学 物理与天体物理 心理学 综合性期刊 其他 工业工程 理学 历史学 农学 文学 信息工程
数据库
全部 ACS Publications Elsevier ieeexplore Springer The Royal Society of Chemistry Wiley
期刊
自动化学报
全部 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