首页 > 最新文献

Data Science and Engineering最新文献

英文 中文
Spatio-Temporal Representation Learning with Social Tie for Personalized POI Recommendation 基于社会关联的时空表征学习用于个性化POI推荐
IF 4.2 2区 计算机科学 Q1 Computer Science Pub Date : 2022-01-31 DOI: 10.1007/s41019-022-00180-w
Shaojie Dai, Yanwei Yu, H. Fan, Junyu Dong
{"title":"Spatio-Temporal Representation Learning with Social Tie for Personalized POI Recommendation","authors":"Shaojie Dai, Yanwei Yu, H. Fan, Junyu Dong","doi":"10.1007/s41019-022-00180-w","DOIUrl":"https://doi.org/10.1007/s41019-022-00180-w","url":null,"abstract":"","PeriodicalId":52220,"journal":{"name":"Data Science and Engineering","volume":null,"pages":null},"PeriodicalIF":4.2,"publicationDate":"2022-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80537542","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 25
Toward Entity Alignment in the Open World: An Unsupervised Approach with Confidence Modeling 开放世界中的实体对齐:一种无监督的置信度建模方法
IF 4.2 2区 计算机科学 Q1 Computer Science Pub Date : 2022-01-29 DOI: 10.1007/s41019-022-00178-4
Xiang Zhao, Weixin Zeng, Jiuyang Tang, Xinyi Li, Minnan Luo, Qinghua Zheng
{"title":"Toward Entity Alignment in the Open World: An Unsupervised Approach with Confidence Modeling","authors":"Xiang Zhao, Weixin Zeng, Jiuyang Tang, Xinyi Li, Minnan Luo, Qinghua Zheng","doi":"10.1007/s41019-022-00178-4","DOIUrl":"https://doi.org/10.1007/s41019-022-00178-4","url":null,"abstract":"","PeriodicalId":52220,"journal":{"name":"Data Science and Engineering","volume":null,"pages":null},"PeriodicalIF":4.2,"publicationDate":"2022-01-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72880255","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Link Prediction on Complex Networks: An Experimental Survey. 复杂网络的链路预测:实验研究。
IF 4.2 2区 计算机科学 Q1 Computer Science Pub Date : 2022-01-01 Epub Date: 2022-06-21 DOI: 10.1007/s41019-022-00188-2
Haixia Wu, Chunyao Song, Yao Ge, Tingjian Ge

Complex networks have been used widely to model a large number of relationships. The outbreak of COVID-19 has had a huge impact on various complex networks in the real world, for example global trade networks, air transport networks, and even social networks, known as racial equality issues caused by the spread of the epidemic. Link prediction plays an important role in complex network analysis in that it can find missing links or predict the links which will arise in the future in the network by analyzing the existing network structures. Therefore, it is extremely important to study the link prediction problem on complex networks. There are a variety of techniques for link prediction based on the topology of the network and the properties of entities. In this work, a new taxonomy is proposed to divide the link prediction methods into five categories and a comprehensive overview of these methods is provided. The network embedding-based methods, especially graph neural network-based methods, which have attracted increasing attention in recent years, have been creatively investigated as well. Moreover, we analyze thirty-six datasets and divide them into seven types of networks according to their topological features shown in real networks and perform comprehensive experiments on these networks. We further analyze the results of experiments in detail, aiming to discover the most suitable approach for each kind of network.

复杂网络已被广泛用于模拟大量的关系。新冠肺炎疫情对现实世界的各种复杂网络产生了巨大影响,例如全球贸易网络、航空运输网络,甚至社会网络,这就是因疫情蔓延而引发的种族平等问题。链路预测在复杂网络分析中起着重要的作用,它可以通过分析现有的网络结构来发现网络中缺失的链路或预测网络中未来将出现的链路。因此,研究复杂网络上的链路预测问题就显得尤为重要。基于网络拓扑结构和实体属性的链路预测技术多种多样。本文提出了一种新的分类方法,将链接预测方法分为五类,并对这些方法进行了综述。近年来备受关注的基于网络嵌入的方法,特别是基于图神经网络的方法,也得到了创造性的研究。此外,我们分析了36个数据集,并根据其在真实网络中显示的拓扑特征将其分为7种类型的网络,并在这些网络上进行了全面的实验。我们进一步对实验结果进行了详细的分析,旨在找到最适合每种网络的方法。
{"title":"Link Prediction on Complex Networks: An Experimental Survey.","authors":"Haixia Wu,&nbsp;Chunyao Song,&nbsp;Yao Ge,&nbsp;Tingjian Ge","doi":"10.1007/s41019-022-00188-2","DOIUrl":"https://doi.org/10.1007/s41019-022-00188-2","url":null,"abstract":"<p><p>Complex networks have been used widely to model a large number of relationships. The outbreak of COVID-19 has had a huge impact on various complex networks in the real world, for example global trade networks, air transport networks, and even social networks, known as racial equality issues caused by the spread of the epidemic. Link prediction plays an important role in complex network analysis in that it can find missing links or predict the links which will arise in the future in the network by analyzing the existing network structures. Therefore, it is extremely important to study the link prediction problem on complex networks. There are a variety of techniques for link prediction based on the topology of the network and the properties of entities. In this work, a new taxonomy is proposed to divide the link prediction methods into five categories and a comprehensive overview of these methods is provided. The network embedding-based methods, especially graph neural network-based methods, which have attracted increasing attention in recent years, have been creatively investigated as well. Moreover, we analyze thirty-six datasets and divide them into seven types of networks according to their topological features shown in real networks and perform comprehensive experiments on these networks. We further analyze the results of experiments in detail, aiming to discover the most suitable approach for each kind of network.</p>","PeriodicalId":52220,"journal":{"name":"Data Science and Engineering","volume":null,"pages":null},"PeriodicalIF":4.2,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9211798/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"40398440","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
Visual Data Analysis with Task-Based Recommendations. 基于任务的建议的可视化数据分析。
IF 4.2 2区 计算机科学 Q1 Computer Science Pub Date : 2022-01-01 Epub Date: 2022-09-13 DOI: 10.1007/s41019-022-00195-3
Leixian Shen, Enya Shen, Zhiwei Tai, Yihao Xu, Jiaxiang Dong, Jianmin Wang

General visualization recommendation systems typically make design decisions for the dataset automatically. However, most of them can only prune meaningless visualizations but fail to recommend targeted results. This paper contributes TaskVis, a task-oriented visualization recommendation system that allows users to select their tasks precisely on the interface. We first summarize a task base with 18 classical analytic tasks by a survey both in academia and industry. On this basis, we maintain a rule base, which extends empirical wisdom with our targeted modeling of the analytic tasks. Then, our rule-based approach enumerates all the candidate visualizations through answer set programming. After that, the generated charts can be ranked by four ranking schemes. Furthermore, we introduce a task-based combination recommendation strategy, leveraging a set of visualizations to give a brief view of the dataset collaboratively. Finally, we evaluate TaskVis through a series of use cases and a user study.

一般的可视化推荐系统通常会自动为数据集做出设计决策。然而,他们中的大多数只能修剪无意义的可视化,而不能推荐有针对性的结果。本文贡献了TaskVis,一个面向任务的可视化推荐系统,允许用户在界面上精确地选择他们的任务。本文首先通过对学术界和工业界的调查,总结了一个包含18个经典分析任务的任务库。在此基础上,我们维护了一个规则库,它通过我们对分析任务的目标建模扩展了经验智慧。然后,我们基于规则的方法通过答案集编程枚举所有候选可视化。之后,生成的图表可以通过四种排名方案进行排名。此外,我们引入了一种基于任务的组合推荐策略,利用一组可视化来协作地给出数据集的简要视图。最后,我们通过一系列用例和用户研究来评估TaskVis。
{"title":"Visual Data Analysis with Task-Based Recommendations.","authors":"Leixian Shen,&nbsp;Enya Shen,&nbsp;Zhiwei Tai,&nbsp;Yihao Xu,&nbsp;Jiaxiang Dong,&nbsp;Jianmin Wang","doi":"10.1007/s41019-022-00195-3","DOIUrl":"https://doi.org/10.1007/s41019-022-00195-3","url":null,"abstract":"<p><p>General visualization recommendation systems typically make design decisions for the dataset automatically. However, most of them can only prune meaningless visualizations but fail to recommend targeted results. This paper contributes TaskVis, a task-oriented visualization recommendation system that allows users to select their tasks precisely on the interface. We first summarize a task base with 18 classical analytic tasks by a survey both in academia and industry. On this basis, we maintain a rule base, which extends empirical wisdom with our targeted modeling of the analytic tasks. Then, our rule-based approach enumerates all the candidate visualizations through answer set programming. After that, the generated charts can be ranked by four ranking schemes. Furthermore, we introduce a task-based combination recommendation strategy, leveraging a set of visualizations to give a brief view of the dataset collaboratively. Finally, we evaluate TaskVis through a series of use cases and a user study.</p>","PeriodicalId":52220,"journal":{"name":"Data Science and Engineering","volume":null,"pages":null},"PeriodicalIF":4.2,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9470074/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"40364003","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Dimensionality Reduction in Surrogate Modeling: A Review of Combined Methods. 代理模型的降维:综合方法综述。
IF 4.2 2区 计算机科学 Q1 Computer Science Pub Date : 2022-01-01 Epub Date: 2022-08-21 DOI: 10.1007/s41019-022-00193-5
Chun Kit Jeffery Hou, Kamran Behdinan

Surrogate modeling has been popularized as an alternative to full-scale models in complex engineering processes such as manufacturing and computer-assisted engineering. The modeling demand exponentially increases with complexity and number of system parameters, which consequently requires higher-dimensional engineering solving techniques. This is known as the curse of dimensionality. Surrogate models are commonly used to replace costly computational simulations and modeling of complex geometries. However, an ongoing challenge is to reduce execution and memory consumption of high-complexity processes, which often exhibit nonlinear phenomena. Dimensionality reduction algorithms have been employed for feature extraction, selection, and elimination for simplifying surrogate models of high-dimensional problems. By applying dimensionality reduction to surrogate models, less computation is required to generate surrogate model parts while retaining sufficient representation accuracy of the full process. This paper aims to review the current literature on dimensionality reduction integrated with surrogate modeling methods. A review of the current state-of-the-art dimensionality reduction and surrogate modeling methods is introduced with a discussion of their mathematical implications, applications, and limitations. Finally, current studies that combine the two topics are discussed and avenues of further research are presented.

在复杂的工程过程中,如制造和计算机辅助工程中,代理模型作为全尺寸模型的替代方法已经得到了推广。建模需求随着系统参数的复杂性和数量呈指数增长,因此需要更高维度的工程求解技术。这就是众所周知的维度诅咒。代理模型通常用于取代昂贵的计算模拟和复杂几何形状的建模。然而,一个持续的挑战是减少高复杂性进程的执行和内存消耗,这些进程经常表现出非线性现象。降维算法已被用于特征提取、选择和消除,以简化高维问题的代理模型。通过对代理模型应用降维,生成代理模型部件所需的计算更少,同时保持整个过程的足够表示精度。本文旨在综述目前关于降维与代理建模方法集成的文献。对当前最先进的降维和代理建模方法进行了回顾,并讨论了它们的数学含义、应用和局限性。最后,讨论了结合这两个主题的当前研究,并提出了进一步研究的途径。
{"title":"Dimensionality Reduction in Surrogate Modeling: A Review of Combined Methods.","authors":"Chun Kit Jeffery Hou,&nbsp;Kamran Behdinan","doi":"10.1007/s41019-022-00193-5","DOIUrl":"https://doi.org/10.1007/s41019-022-00193-5","url":null,"abstract":"<p><p>Surrogate modeling has been popularized as an alternative to full-scale models in complex engineering processes such as manufacturing and computer-assisted engineering. The modeling demand exponentially increases with complexity and number of system parameters, which consequently requires higher-dimensional engineering solving techniques. This is known as the curse of dimensionality. Surrogate models are commonly used to replace costly computational simulations and modeling of complex geometries. However, an ongoing challenge is to reduce execution and memory consumption of high-complexity processes, which often exhibit nonlinear phenomena. Dimensionality reduction algorithms have been employed for feature extraction, selection, and elimination for simplifying surrogate models of high-dimensional problems. By applying dimensionality reduction to surrogate models, less computation is required to generate surrogate model parts while retaining sufficient representation accuracy of the full process. This paper aims to review the current literature on dimensionality reduction integrated with surrogate modeling methods. A review of the current state-of-the-art dimensionality reduction and surrogate modeling methods is introduced with a discussion of their mathematical implications, applications, and limitations. Finally, current studies that combine the two topics are discussed and avenues of further research are presented.</p>","PeriodicalId":52220,"journal":{"name":"Data Science and Engineering","volume":null,"pages":null},"PeriodicalIF":4.2,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9633505/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"40672089","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 12
A Unification of Heterogeneous Data Sources into a Graph Model in E-commerce 电子商务中异构数据源的图模型统一
IF 4.2 2区 计算机科学 Q1 Computer Science Pub Date : 2021-12-18 DOI: 10.1007/s41019-021-00174-0
Sonal Tuteja, Rajeev Kumar
{"title":"A Unification of Heterogeneous Data Sources into a Graph Model in E-commerce","authors":"Sonal Tuteja, Rajeev Kumar","doi":"10.1007/s41019-021-00174-0","DOIUrl":"https://doi.org/10.1007/s41019-021-00174-0","url":null,"abstract":"","PeriodicalId":52220,"journal":{"name":"Data Science and Engineering","volume":null,"pages":null},"PeriodicalIF":4.2,"publicationDate":"2021-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74689820","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Efficient Indexing of Top-k Entities in Systems of Engagement with Extensions for Geo-tagged Entities 地理标记实体扩展接合系统中Top-k实体的高效索引
IF 4.2 2区 计算机科学 Q1 Computer Science Pub Date : 2021-10-11 DOI: 10.1007/s41019-021-00173-1
Anirban Mondal, Ayaan Kakkar, Nilesh Padhariya, M. Mohania
{"title":"Efficient Indexing of Top-k Entities in Systems of Engagement with Extensions for Geo-tagged Entities","authors":"Anirban Mondal, Ayaan Kakkar, Nilesh Padhariya, M. Mohania","doi":"10.1007/s41019-021-00173-1","DOIUrl":"https://doi.org/10.1007/s41019-021-00173-1","url":null,"abstract":"","PeriodicalId":52220,"journal":{"name":"Data Science and Engineering","volume":null,"pages":null},"PeriodicalIF":4.2,"publicationDate":"2021-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85447212","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Context-Based Resilience in Cyber-Physical Production System 信息物理生产系统中基于情境的弹性
IF 4.2 2区 计算机科学 Q1 Computer Science Pub Date : 2021-10-11 DOI: 10.1007/s41019-021-00172-2
Ada Bagozi, D. Bianchini, V. D. Antonellis
{"title":"Context-Based Resilience in Cyber-Physical Production System","authors":"Ada Bagozi, D. Bianchini, V. D. Antonellis","doi":"10.1007/s41019-021-00172-2","DOIUrl":"https://doi.org/10.1007/s41019-021-00172-2","url":null,"abstract":"","PeriodicalId":52220,"journal":{"name":"Data Science and Engineering","volume":null,"pages":null},"PeriodicalIF":4.2,"publicationDate":"2021-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78218646","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
A Crowd-Powered Task Generation Method for Study of Struggling Search 一种研究挣扎搜索的群体动力任务生成方法
IF 4.2 2区 计算机科学 Q1 Computer Science Pub Date : 2021-09-09 DOI: 10.1007/s41019-021-00171-3
Luyan Xu, Xuan Zhou
{"title":"A Crowd-Powered Task Generation Method for Study of Struggling Search","authors":"Luyan Xu, Xuan Zhou","doi":"10.1007/s41019-021-00171-3","DOIUrl":"https://doi.org/10.1007/s41019-021-00171-3","url":null,"abstract":"","PeriodicalId":52220,"journal":{"name":"Data Science and Engineering","volume":null,"pages":null},"PeriodicalIF":4.2,"publicationDate":"2021-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89827396","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
FairLOF: Fairness in Outlier Detection FairLOF:异常值检测的公平性
IF 4.2 2区 计算机科学 Q1 Computer Science Pub Date : 2021-08-29 DOI: 10.1007/s41019-021-00169-x
D. P., Savitha Sam Abraham
{"title":"FairLOF: Fairness in Outlier Detection","authors":"D. P., Savitha Sam Abraham","doi":"10.1007/s41019-021-00169-x","DOIUrl":"https://doi.org/10.1007/s41019-021-00169-x","url":null,"abstract":"","PeriodicalId":52220,"journal":{"name":"Data Science and Engineering","volume":null,"pages":null},"PeriodicalIF":4.2,"publicationDate":"2021-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80500546","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
期刊
Data Science and Engineering
全部 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