首页 > 最新文献

Journal of Computational Science最新文献

英文 中文
A novel density based community detection algorithm and its application in detecting potential biomarkers of ESCC 基于密度的新型群落检测算法及其在检测 ESCC 潜在生物标记物中的应用
IF 3.1 3区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2024-06-24 DOI: 10.1016/j.jocs.2024.102344
Bikash Baruah , Manash P. Dutta , Subhasish Banerjee , Dhruba K. Bhattacharyya

The development of statistically and biologically competent Community Detection Algorithm (CDA) is essential for extracting hidden information from massive biological datasets. This study introduces a novel community index as well as a CDA based on the newly introduced community index. To validate the effectiveness and robustness of the communities identified by the proposed CDA, we compare with six sets of communities identified by well-known CDAs, namely, FastGreedy, infomap, labelProp, leadingEigen, louvain, and walktrap. It is observed that the proposed algorithm outperforms its competing algorithms in terms of several prominent statistical and biological measures. We implement the hardware coding with Verilog, which surprisingly reduces the computation time by 20% compared to R programming while extracting the communities. Next, the communities identified by the proposed algorithm are used for topological and biological analysis with reference to the elite genes, obtained from Genecards, to identify potential biomarkers of Esophageal Squamous Cell Carcinoma (ESCC). Finally, we discover that the genes F2RL3, CALM1, LPAR1, ARPC2, and CLDN7 carry significantly high topological and biological relevance of previously established ESCC elite genes. Further the established wet lab results also substantiate our claims. Hence, we affirm the aforesaid genes, as ESCC potential biomarkers.

要从海量生物数据集中提取隐藏信息,就必须开发具有统计学和生物学能力的群落检测算法(CDA)。本研究引入了一种新的群落指数以及基于新引入的群落指数的群落检测算法。为了验证所提出的社群识别算法的有效性和鲁棒性,我们将其与著名的社群识别算法(即 FastGreedy、infomap、labelProp、leadingEigen、louvain 和 walktrap)所识别的六组社群进行了比较。结果表明,所提出的算法在几个重要的统计和生物指标方面都优于同类算法。我们用 Verilog 实现了硬件编码,在提取群落时,与 R 编程相比,计算时间竟然减少了 20%。接下来,我们参考从 Genecards 中获得的精英基因,利用所提算法识别出的群落进行拓扑和生物学分析,以确定食管鳞状细胞癌(ESCC)的潜在生物标记物。最后,我们发现 F2RL3、CALM1、LPAR1、ARPC2 和 CLDN7 等基因在拓扑学和生物学方面与之前建立的 ESCC 精英基因具有显著的相关性。此外,已建立的湿实验室结果也证实了我们的说法。因此,我们肯定上述基因是 ESCC 潜在的生物标记物。
{"title":"A novel density based community detection algorithm and its application in detecting potential biomarkers of ESCC","authors":"Bikash Baruah ,&nbsp;Manash P. Dutta ,&nbsp;Subhasish Banerjee ,&nbsp;Dhruba K. Bhattacharyya","doi":"10.1016/j.jocs.2024.102344","DOIUrl":"https://doi.org/10.1016/j.jocs.2024.102344","url":null,"abstract":"<div><p>The development of statistically and biologically competent Community Detection Algorithm (CDA) is essential for extracting hidden information from massive biological datasets. This study introduces a novel community index as well as a CDA based on the newly introduced community index. To validate the effectiveness and robustness of the communities identified by the proposed CDA, we compare with six sets of communities identified by well-known CDAs, namely, FastGreedy, infomap, labelProp, leadingEigen, louvain, and walktrap. It is observed that the proposed algorithm outperforms its competing algorithms in terms of several prominent statistical and biological measures. We implement the hardware coding with Verilog, which surprisingly reduces the computation time by 20% compared to R programming while extracting the communities. Next, the communities identified by the proposed algorithm are used for topological and biological analysis with reference to the elite genes, obtained from Genecards, to identify potential biomarkers of Esophageal Squamous Cell Carcinoma (ESCC). Finally, we discover that the genes F2RL3, CALM1, LPAR1, ARPC2, and CLDN7 carry significantly high topological and biological relevance of previously established ESCC elite genes. Further the established wet lab results also substantiate our claims. Hence, we affirm the aforesaid genes, as ESCC potential biomarkers.</p></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":null,"pages":null},"PeriodicalIF":3.1,"publicationDate":"2024-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141542606","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
SymNOM-GED: Symmetric neighbor outlier mining in gene expression datasets SymNOM-GED:基因表达数据集中的对称邻域异常值挖掘
IF 3.1 3区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2024-06-23 DOI: 10.1016/j.jocs.2024.102365
Bikash Baruah , Manash P. Dutta , Subhasish Banerjee , Dhruba K. Bhattacharyya

The accurate detection of outliers in gene expression datasets plays a crucial role in the unraveling of intricate biological processes. This research introduces "SymNOM-GED," an innovative algorithm for outlier mining in gene expression datasets, with a focus on Esophageal Squamous Cell Carcinoma (ESCC). SymNOM-GED leverages symmetric neighbor to effectively identify outliers by considering local and global gene expression patterns. Extensive experiments demonstrate that SymNOM-GED outperforms existing algorithms in terms of accuracy, robustness, and scalability. The algorithm's performance is validated using clustering coefficient, graph density, and modularity, confirming its superiority. SymNOM-GED's precise and reliable outlier detection capabilities contribute significantly to bioinformatics research, offering insights into gene expression patterns in diverse biological contexts.

准确检测基因表达数据集中的异常值对揭示错综复杂的生物过程起着至关重要的作用。本研究介绍了 "SymNOM-GED",这是一种在基因表达数据集中挖掘异常值的创新算法,重点关注食管鳞状细胞癌(ESCC)。SymNOM-GED 利用对称邻接法,通过考虑局部和全局基因表达模式,有效地识别异常值。大量实验证明,SymNOM-GED 在准确性、鲁棒性和可扩展性方面都优于现有算法。该算法的性能通过聚类系数、图密度和模块性得到了验证,证实了其优越性。SymNOM-GED 精确可靠的离群点检测能力为生物信息学研究做出了重大贡献,为深入了解不同生物背景下的基因表达模式提供了依据。
{"title":"SymNOM-GED: Symmetric neighbor outlier mining in gene expression datasets","authors":"Bikash Baruah ,&nbsp;Manash P. Dutta ,&nbsp;Subhasish Banerjee ,&nbsp;Dhruba K. Bhattacharyya","doi":"10.1016/j.jocs.2024.102365","DOIUrl":"https://doi.org/10.1016/j.jocs.2024.102365","url":null,"abstract":"<div><p>The accurate detection of outliers in gene expression datasets plays a crucial role in the unraveling of intricate biological processes. This research introduces \"SymNOM-GED,\" an innovative algorithm for outlier mining in gene expression datasets, with a focus on Esophageal Squamous Cell Carcinoma (ESCC). SymNOM-GED leverages symmetric neighbor to effectively identify outliers by considering local and global gene expression patterns. Extensive experiments demonstrate that SymNOM-GED outperforms existing algorithms in terms of accuracy, robustness, and scalability. The algorithm's performance is validated using clustering coefficient, graph density, and modularity, confirming its superiority. SymNOM-GED's precise and reliable outlier detection capabilities contribute significantly to bioinformatics research, offering insights into gene expression patterns in diverse biological contexts.</p></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":null,"pages":null},"PeriodicalIF":3.1,"publicationDate":"2024-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141482409","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
ITS4Tsunamis: An Intelligent Transportation System for tsunami emergencies ITS4Tsunamis:海啸应急智能交通系统
IF 3.1 3区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2024-06-22 DOI: 10.1016/j.jocs.2024.102360
Gregorio Díaz , Hermenegilda Macià , Enrique Brazález , Juan Boubeta-Puig , M. Carmen Ruiz , Valentín Valero

Natural disasters, such as tsunamis and earthquakes, may affect gravely on human lives, infrastructure, and economy. Negative effects of these situations can be minimized with the help of technology. In this paper we propose ITS4Tsunamis, an Intelligent Transportation System (ITS) that combines different technologies to help emergency management agencies to provide safe routes for their emergency vehicles. In the case of a tsunami emergency, these agencies must consider different aspects when moving with their vehicles, such as the road state and the vehicle features. Technologies such as Complex Event Processing (CEP) can be used to gather and process the information provided by a collection of sensors and assess the corresponding emergency level. In addition, we introduce uncertainty as a key element when determining the road-status, since this factor is uncertain by itself, and is based on the flood level and the number and size of obstacles in the roads. Fuzzy Logic (FL) is then used to deal with uncertainty and help authorities to evaluate the road accessibility. Safe routes are obtained using Colored Petri Nets (CPNs), a graphical formalism that allows us to analyze concurrent systems. This approach has been applied to Cádiz, a city in the southwest of Spain, which is close to an active tectonic rift. This work is an extended version of the conference paper by Díaz et al. (2023) [1].

海啸和地震等自然灾害可能对人类生命、基础设施和经济造成严重影响。在技术的帮助下,这些情况的负面影响可以降到最低。本文提出的 ITS4Tsunamis 是一种智能交通系统(ITS),它结合了各种技术,帮助应急管理机构为其应急车辆提供安全路线。在海啸紧急情况下,这些机构的车辆在行驶时必须考虑不同方面的因素,如道路状况和车辆特征。复杂事件处理(CEP)等技术可用于收集和处理传感器集合提供的信息,并评估相应的紧急程度。此外,在确定道路状态时,我们引入了不确定性作为关键因素,因为这一因素本身就是不确定的,它是基于洪水位以及道路上障碍物的数量和大小。因此,模糊逻辑(FL)被用来处理不确定性,并帮助当局评估道路的可达性。使用彩色 Petri 网 (CPN) 可以获得安全路线,这是一种图形形式,允许我们分析并发系统。这种方法已应用于西班牙西南部城市加的斯,该市靠近活跃的构造裂缝。本作品是 Díaz 等人的会议论文(2023 年)[1] 的扩展版本。
{"title":"ITS4Tsunamis: An Intelligent Transportation System for tsunami emergencies","authors":"Gregorio Díaz ,&nbsp;Hermenegilda Macià ,&nbsp;Enrique Brazález ,&nbsp;Juan Boubeta-Puig ,&nbsp;M. Carmen Ruiz ,&nbsp;Valentín Valero","doi":"10.1016/j.jocs.2024.102360","DOIUrl":"https://doi.org/10.1016/j.jocs.2024.102360","url":null,"abstract":"<div><p>Natural disasters, such as tsunamis and earthquakes, may affect gravely on human lives, infrastructure, and economy. Negative effects of these situations can be minimized with the help of technology. In this paper we propose ITS4Tsunamis, an Intelligent Transportation System (ITS) that combines different technologies to help emergency management agencies to provide safe routes for their emergency vehicles. In the case of a tsunami emergency, these agencies must consider different aspects when moving with their vehicles, such as the road state and the vehicle features. Technologies such as Complex Event Processing (CEP) can be used to gather and process the information provided by a collection of sensors and assess the corresponding emergency level. In addition, we introduce uncertainty as a key element when determining the road-status, since this factor is uncertain by itself, and is based on the flood level and the number and size of obstacles in the roads. Fuzzy Logic (FL) is then used to deal with uncertainty and help authorities to evaluate the road accessibility. Safe routes are obtained using Colored Petri Nets (CPNs), a graphical formalism that allows us to analyze concurrent systems. This approach has been applied to Cádiz, a city in the southwest of Spain, which is close to an active tectonic rift. This work is an extended version of the conference paper by Díaz et al. (2023) <span>[1]</span>.</p></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":null,"pages":null},"PeriodicalIF":3.1,"publicationDate":"2024-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S1877750324001534/pdfft?md5=db12dc70ac84023a59c348281946ce07&pid=1-s2.0-S1877750324001534-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141483377","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
New efficient four-stage implicit trigonometrically fitted modified RKN for second-order ODEs 针对二阶 ODE 的新型高效四级隐式三角拟合修正 RKN
IF 3.1 3区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2024-06-22 DOI: 10.1016/j.jocs.2024.102370
Bingzhen Chen , Yuna Zhao , Wenjuan Zhai

The construction of implicit RKN is investigated in this paper. We finally obtain four four-stages implicit integrators by considering the symmetric, symplectic, and trigonometric fitting conditions. For the new obtained methods, we analyze their global convergence and stability property. And we carry out numerical experiments on some commonly considered problems in the literature. In view of the numerical experiments, we observe that the new methods outperform several efficient RKN methods in terms of accuracy and efficiency.

本文研究了隐式 RKN 的构造。通过考虑对称、对称和三角拟合条件,我们最终得到了四个四级隐式积分器。对于新得到的方法,我们分析了它们的全局收敛性和稳定性。我们还对一些文献中常见的问题进行了数值实验。通过数值实验,我们发现新方法在精度和效率上都优于几种高效的 RKN 方法。
{"title":"New efficient four-stage implicit trigonometrically fitted modified RKN for second-order ODEs","authors":"Bingzhen Chen ,&nbsp;Yuna Zhao ,&nbsp;Wenjuan Zhai","doi":"10.1016/j.jocs.2024.102370","DOIUrl":"https://doi.org/10.1016/j.jocs.2024.102370","url":null,"abstract":"<div><p>The construction of implicit RKN is investigated in this paper. We finally obtain four four-stages implicit integrators by considering the symmetric, symplectic, and trigonometric fitting conditions. For the new obtained methods, we analyze their global convergence and stability property. And we carry out numerical experiments on some commonly considered problems in the literature. In view of the numerical experiments, we observe that the new methods outperform several efficient RKN methods in terms of accuracy and efficiency.</p></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":null,"pages":null},"PeriodicalIF":3.1,"publicationDate":"2024-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141482407","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Explaining the impact of parameter combinations in agent-based models 解释基于代理的模型中参数组合的影响
IF 3.1 3区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2024-06-21 DOI: 10.1016/j.jocs.2024.102342
Megan Olsen , D. Richard Kuhn , M.S. Raunak

Simulation is a useful and effective way to analyze and study complex, real-world systems, allowing researchers, practitioners, and decision makers to make sense of the inner working of a system involving many factors, often resulting in some sort of emergent behavior. The number of parameter value combinations grows exponentially and it quickly becomes infeasible to test them all or even to explore a suitable subset. How does one then efficiently identify the parameter value combinations that matter for a particular simulation study, and determine their impact on the result? In addition, is it possible to train a machine learning model to predict the outcome of an agent-based model (ABM) with a systematically chosen small subset of parameter value combinations, such that the result could be predicted without running the ABM? We use covering arrays to create t-way (t = 2, 3, etc.) combinations of parameter values to significantly reduce an ABM’s parameter value exploration space, which is supported by our prior work. In our ICCS 2023 paper (Olsen et al., 2023) we built on that work by applying it to Wilensky’s Heatbugs model and training a random forest machine learning model to predict simulation results by using the covering arrays to select our training and test data. Our results show that a 2-way covering array provides sufficient training data to train our random forest to predict three different simulation outcomes. Our process of using covering arrays to decrease parameter space to then predict ABM results using machine learning is successful. In this paper that extends the ICCS 2023 paper (Olsen et al., 2023), we analyze the role of parameter combinations and parameter values in determining model output via combination frequency difference (CFD) analysis and Shapley values. CFD has not previously been applied to agent-based models; we provide a process for using this approach and compare and contrast with Shapley values and random forest feature importance.

模拟是分析和研究现实世界中复杂系统的一种有用而有效的方法,它使研究人员、从业人员和决策者能够了解涉及多种因素的系统的内部运作,通常会产生某种突发行为。参数值组合的数量呈指数级增长,要对它们全部进行测试,甚至探索一个合适的子集,很快就变得不可行。那么,如何有效地确定对特定模拟研究至关重要的参数值组合,并确定它们对结果的影响?此外,是否有可能训练一个机器学习模型,用系统选择的一小部分参数值组合来预测基于代理的模型(ABM)的结果,从而在不运行 ABM 的情况下预测结果?我们使用覆盖数组创建 t 路(t = 2、3 等)参数值组合,以显著缩小 ABM 的参数值探索空间,这一点得到了我们之前工作的支持。在我们的 ICCS 2023 论文(Olsen 等人,2023 年)中,我们以这项工作为基础,将其应用于 Wilensky 的 Heatbugs 模型,并训练了一个随机森林机器学习模型,通过使用覆盖阵列选择训练和测试数据来预测模拟结果。我们的结果表明,双向覆盖阵列提供了足够的训练数据,可以训练我们的随机森林预测三种不同的模拟结果。我们利用覆盖阵列缩小参数空间,然后利用机器学习预测 ABM 结果的过程是成功的。本文是对 ICCS 2023 论文(Olsen 等人,2023 年)的扩展,我们通过组合频率差(CFD)分析和 Shapley 值分析了参数组合和参数值在决定模型输出中的作用。CFD 以前从未应用于基于代理的模型;我们提供了使用这种方法的流程,并与 Shapley 值和随机森林特征重要性进行了比较和对比。
{"title":"Explaining the impact of parameter combinations in agent-based models","authors":"Megan Olsen ,&nbsp;D. Richard Kuhn ,&nbsp;M.S. Raunak","doi":"10.1016/j.jocs.2024.102342","DOIUrl":"https://doi.org/10.1016/j.jocs.2024.102342","url":null,"abstract":"<div><p>Simulation is a useful and effective way to analyze and study complex, real-world systems, allowing researchers, practitioners, and decision makers to make sense of the inner working of a system involving many factors, often resulting in some sort of emergent behavior. The number of parameter value combinations grows exponentially and it quickly becomes infeasible to test them all or even to explore a suitable subset. How does one then efficiently identify the parameter value combinations that matter for a particular simulation study, and determine their impact on the result? In addition, is it possible to train a machine learning model to predict the outcome of an agent-based model (ABM) with a systematically chosen small subset of parameter value combinations, such that the result could be predicted without running the ABM? We use covering arrays to create <span><math><mi>t</mi></math></span>-way (<span><math><mi>t</mi></math></span> = 2, 3, etc.) combinations of parameter values to significantly reduce an ABM’s parameter value exploration space, which is supported by our prior work. In our ICCS 2023 paper (Olsen et al., 2023) we built on that work by applying it to Wilensky’s Heatbugs model and training a random forest machine learning model to predict simulation results by using the covering arrays to select our training and test data. Our results show that a 2-way covering array provides sufficient training data to train our random forest to predict three different simulation outcomes. Our process of using covering arrays to decrease parameter space to then predict ABM results using machine learning is successful. In this paper that extends the ICCS 2023 paper (Olsen et al., 2023), we analyze the role of parameter combinations and parameter values in determining model output via combination frequency difference (CFD) analysis and Shapley values. CFD has not previously been applied to agent-based models; we provide a process for using this approach and compare and contrast with Shapley values and random forest feature importance.</p></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":null,"pages":null},"PeriodicalIF":3.1,"publicationDate":"2024-06-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141582679","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Development of a multi-layer canopy model for E3SM Land Model with support for heterogeneous computing 为 E3SM 土地模型开发支持异构计算的多层冠层模型
IF 3.1 3区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2024-06-19 DOI: 10.1016/j.jocs.2024.102366
Gautam Bisht , William J. Riley , Richard Tran Mills

The vertical structure of vegetation canopies creates micro-climates. However, the land components of most Earth System Models, including the Energy Exascale Earth System Model (E3SM), typically neglect vertical canopy structure by using a single layer big-leaf representation to simulate water, CO2, and energy exchanges between the land and the atmosphere. In this study, we developed a Multi-Layer Canopy Model for the E3SM Land Model to resolve the micro-climate created by vegetation canopies. The model developed in this study re-implements the CLM-ml_v1 to support heterogeneous computing architectures consisting of CPUs and GPUs and includes three additional optimization-based stomatal conductance models. The use of Portable, Extensible Toolkit for Scientific Computation provides a speedup of 25–50 times on a GPU relative to a CPU. The numerical implementation of the model was verified against CLM-ml_v1 for a month-long simulation using data from the Ameriflux US-University of Michigan Biological Station site. Model structural uncertainty was explored by performing control simulations for five stomatal conductance models that exclude and include the control of plant hydrodynamics (PHD) on photosynthesis. The bias in simulated sensible and latent heat fluxes was lower when PHD was accounted for in the model. Additionally, six idealized simulations were performed to study the impact of three environmental variables (i.e. air temperature, atmospheric CO2, and soil moisture) on canopy processes (i.e. net CO2 assimilation, leaf temperature, and leaf water potential). Increasing air temperature reduced net CO2 assimilation and increased air temperature. Net CO2 assimilation increased at higher atmospheric CO2, while decreasing soil moisture resulted in lower leaf water potential.

植被冠层的垂直结构创造了微气候。然而,包括能源超大规模地球系统模式(ESM)在内的大多数地球系统模式的陆地部分通常忽略垂直冠层结构,使用单层大叶表示法来模拟陆地与大气之间的水、二氧化碳和能量交换。在这项研究中,我们为 E3SM 陆地模型开发了多层冠层模型,以解决植被冠层造成的微气候问题。本研究开发的模型重新实现了 CLM-ml_v1,以支持由 CPU 和 GPU 组成的异构计算架构,并包括三个额外的基于优化的气孔导度模型。使用可移植、可扩展的科学计算工具包,GPU 的计算速度比 CPU 快 25-50 倍。利用 Ameriflux 美国-密歇根大学生物站的数据,对模型的数值实施与 CLM-ml_v1 进行了为期一个月的模拟验证。通过对五个气孔导度模型进行控制模拟,探索了模型结构的不确定性,这些模型排除和包括了植物流体力学(PHD)对光合作用的控制。在模型中考虑 PHD 时,模拟的显热和潜热通量偏差较小。此外,还进行了六次理想化模拟,研究三个环境变量(即气温、大气二氧化碳和土壤湿度)对冠层过程(即二氧化碳净同化、叶片温度和叶片水势)的影响。气温升高会降低二氧化碳净同化量,气温升高则会增加二氧化碳净同化量。大气二氧化碳含量越高,二氧化碳净同化量越大,而土壤水分减少则导致叶片水势降低。
{"title":"Development of a multi-layer canopy model for E3SM Land Model with support for heterogeneous computing","authors":"Gautam Bisht ,&nbsp;William J. Riley ,&nbsp;Richard Tran Mills","doi":"10.1016/j.jocs.2024.102366","DOIUrl":"https://doi.org/10.1016/j.jocs.2024.102366","url":null,"abstract":"<div><p>The vertical structure of vegetation canopies creates micro-climates. However, the land components of most Earth System Models, including the Energy Exascale Earth System Model (E3SM), typically neglect vertical canopy structure by using a single layer big-leaf representation to simulate water, CO<span><math><msub><mrow></mrow><mrow><mn>2</mn></mrow></msub></math></span>, and energy exchanges between the land and the atmosphere. In this study, we developed a Multi-Layer Canopy Model for the E3SM Land Model to resolve the micro-climate created by vegetation canopies. The model developed in this study re-implements the CLM-ml_v1 to support heterogeneous computing architectures consisting of CPUs and GPUs and includes three additional optimization-based stomatal conductance models. The use of Portable, Extensible Toolkit for Scientific Computation provides a speedup of 25–50 times on a GPU relative to a CPU. The numerical implementation of the model was verified against CLM-ml_v1 for a month-long simulation using data from the Ameriflux US-University of Michigan Biological Station site. Model structural uncertainty was explored by performing control simulations for five stomatal conductance models that exclude and include the control of plant hydrodynamics (PHD) on photosynthesis. The bias in simulated sensible and latent heat fluxes was lower when PHD was accounted for in the model. Additionally, six idealized simulations were performed to study the impact of three environmental variables (i.e. air temperature, atmospheric CO<span><math><msub><mrow></mrow><mrow><mn>2</mn></mrow></msub></math></span>, and soil moisture) on canopy processes (i.e. net CO<span><math><msub><mrow></mrow><mrow><mn>2</mn></mrow></msub></math></span> assimilation, leaf temperature, and leaf water potential). Increasing air temperature reduced net CO<span><math><msub><mrow></mrow><mrow><mn>2</mn></mrow></msub></math></span> assimilation and increased air temperature. Net CO<span><math><msub><mrow></mrow><mrow><mn>2</mn></mrow></msub></math></span> assimilation increased at higher atmospheric CO<span><math><msub><mrow></mrow><mrow><mn>2</mn></mrow></msub></math></span>, while decreasing soil moisture resulted in lower leaf water potential.</p></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":null,"pages":null},"PeriodicalIF":3.1,"publicationDate":"2024-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141542608","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Imitation learning for aerobatic maneuvering in fixed-wing aircraft 固定翼飞机特技飞行的模仿学习
IF 3.1 3区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2024-06-19 DOI: 10.1016/j.jocs.2024.102343
Henrique Freitas , Rui Camacho , Daniel Castro Silva

This study focuses on the task of developing automated models for complex aerobatic aircraft maneuvers. The approach employed here utilizes Behavioral Cloning, a technique in which human pilots supply a series of sample maneuvers. These maneuvers serve as training data for a Machine Learning algorithm, enabling the system to generate control models for each maneuver. The optimal instances for each maneuver were chosen based on a set of objective evaluation criteria. By utilizing these selected sets of examples, resilient models were developed, capable of reproducing the maneuvers performed by the human pilots who supplied the examples. In certain instances, these models even exhibited superior performance compared to the pilots themselves, a phenomenon referred to as the “clean-up effect”. We also explore the application of transfer learning to adapt the developed controllers to various airplane models, revealing compelling evidence that transfer learning is effective for refining them for targeted aircraft. A comprehensive set of intricate maneuvers was executed through a meta-controller capable of orchestrating the fundamental maneuvers acquired through imitation. This undertaking yielded promising outcomes, demonstrating the proficiency of several Machine Learning models in successfully executing highly intricate aircraft maneuvers. This paper is an extended version of the previously ICCS 2023 published conference paper [1] .

本研究的重点是开发复杂特技飞行动作的自动模型。本研究采用的方法是行为克隆(Behavioral Cloning),这是一种由人类飞行员提供一系列动作样本的技术。这些动作作为机器学习算法的训练数据,使系统能够为每个动作生成控制模型。每个操纵的最佳实例都是根据一套客观评估标准选出的。通过利用这些选定的示例集,开发出了弹性模型,能够再现提供示例的人类飞行员所做的机动动作。在某些情况下,这些模型的性能甚至优于飞行员本身,这种现象被称为 "净化效应"。我们还探索了应用迁移学习使开发的控制器适应各种飞机型号的方法,发现了令人信服的证据,证明迁移学习能有效地针对目标飞机改进控制器。我们通过元控制器执行了一整套复杂的机动动作,元控制器能够协调通过模仿获得的基本动作。这项工作取得了可喜的成果,证明了几个机器学习模型在成功执行高度复杂的飞机操纵方面的熟练程度。本文是之前在 ICCS 2023 会议上发表的论文 [1] 的扩展版本。
{"title":"Imitation learning for aerobatic maneuvering in fixed-wing aircraft","authors":"Henrique Freitas ,&nbsp;Rui Camacho ,&nbsp;Daniel Castro Silva","doi":"10.1016/j.jocs.2024.102343","DOIUrl":"https://doi.org/10.1016/j.jocs.2024.102343","url":null,"abstract":"<div><p>This study focuses on the task of developing automated models for complex aerobatic aircraft maneuvers. The approach employed here utilizes Behavioral Cloning, a technique in which human pilots supply a series of sample maneuvers. These maneuvers serve as training data for a Machine Learning algorithm, enabling the system to generate control models for each maneuver. The optimal instances for each maneuver were chosen based on a set of objective evaluation criteria. By utilizing these selected sets of examples, resilient models were developed, capable of reproducing the maneuvers performed by the human pilots who supplied the examples. In certain instances, these models even exhibited superior performance compared to the pilots themselves, a phenomenon referred to as the “clean-up effect”. We also explore the application of transfer learning to adapt the developed controllers to various airplane models, revealing compelling evidence that transfer learning is effective for refining them for targeted aircraft. A comprehensive set of intricate maneuvers was executed through a meta-controller capable of orchestrating the fundamental maneuvers acquired through imitation. This undertaking yielded promising outcomes, demonstrating the proficiency of several Machine Learning models in successfully executing highly intricate aircraft maneuvers. This paper is an extended version of the previously ICCS 2023 published conference paper <span>[1]</span> .</p></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":null,"pages":null},"PeriodicalIF":3.1,"publicationDate":"2024-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S1877750324001364/pdfft?md5=7fa6041b40fe09711d530c4a9d50fe52&pid=1-s2.0-S1877750324001364-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141482405","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Deep attention network for identifying ligand-protein binding sites 识别配体与蛋白质结合位点的深度注意力网络
IF 3.1 3区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2024-06-19 DOI: 10.1016/j.jocs.2024.102368
Fatemeh Nazem , Reza Rasti , Afshin Fassihi , Alireza Mehri Dehnavi , Fahimeh Ghasemi

One of the critical aspects of structure-based drug design is to choose important druggable binding sites in the protein's crystallography structures. As experimental processes are costly and time-consuming, computational drug design using machine learning algorithms is recommended. Over recent years, deep learning methods have been utilized in a wide variety of research applications such as binding site prediction. In this study, a new combination of attention blocks in the 3D U-Net model based on semantic segmentation methods is used to improve localization of pocket prediction. The attention blocks are tuned to find which point and channel of features should be emphasized along spatial and channel axes. Our model's performance is evaluated through extensive experiments on several datasets from different sources, and the results are compared to the most recent deep learning-based models. The results indicate the proposed attention model (Att-UNet) can predict binding sites accurately, i.e. the overlap of the predicted pocket using the proposed method with the true binding site shows statistically significant improvement when compared to other state-of-the-art models. The attention blocks may help the model focus on the target structure by suppressing features in irrelevant regions.

基于结构的药物设计的关键之一是在蛋白质晶体学结构中选择重要的药物结合位点。由于实验过程成本高、耗时长,因此推荐使用机器学习算法进行计算药物设计。近年来,深度学习方法已被广泛应用于结合位点预测等研究领域。在本研究中,基于语义分割方法的三维 U-Net 模型中的注意力区块的新组合被用于改善口袋预测的定位。对注意力模块进行了调整,以确定应沿空间轴和通道轴强调哪一点和哪一通道的特征。我们在不同来源的多个数据集上进行了大量实验,评估了模型的性能,并将结果与最新的基于深度学习的模型进行了比较。结果表明,所提出的注意力模型(Att-UNet)能够准确预测结合位点,即与其他最先进的模型相比,使用所提出的方法预测的口袋与真实结合位点的重叠度在统计学上有显著提高。注意力区块可以抑制无关区域的特征,从而帮助模型聚焦于目标结构。
{"title":"Deep attention network for identifying ligand-protein binding sites","authors":"Fatemeh Nazem ,&nbsp;Reza Rasti ,&nbsp;Afshin Fassihi ,&nbsp;Alireza Mehri Dehnavi ,&nbsp;Fahimeh Ghasemi","doi":"10.1016/j.jocs.2024.102368","DOIUrl":"https://doi.org/10.1016/j.jocs.2024.102368","url":null,"abstract":"<div><p>One of the critical aspects of structure-based drug design is to choose important druggable binding sites in the protein's crystallography structures. As experimental processes are costly and time-consuming, computational drug design using machine learning algorithms is recommended. Over recent years, deep learning methods have been utilized in a wide variety of research applications such as binding site prediction. In this study, a new combination of attention blocks in the 3D U-Net model based on semantic segmentation methods is used to improve localization of pocket prediction. The attention blocks are tuned to find which point and channel of features should be emphasized along spatial and channel axes. Our model's performance is evaluated through extensive experiments on several datasets from different sources, and the results are compared to the most recent deep learning-based models. The results indicate the proposed attention model (Att-UNet) can predict binding sites accurately, i.e. the overlap of the predicted pocket using the proposed method with the true binding site shows statistically significant improvement when compared to other state-of-the-art models. The attention blocks may help the model focus on the target structure by suppressing features in irrelevant regions.</p></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":null,"pages":null},"PeriodicalIF":3.1,"publicationDate":"2024-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141482406","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Research on decomposition-based multi-objective evolutionary algorithm with dynamic weight vector 基于分解的动态权重向量多目标进化算法研究
IF 3.1 3区 计算机科学 Q1 Mathematics Pub Date : 2024-06-18 DOI: 10.1016/j.jocs.2024.102361
Jiale Zhao , Xiangdang Huang , Tian Li , Huanhuan Yu , Hansheng Fei , Qiuling Yang

In recent years, multi-objective evolutionary algorithm based on decomposition has gradually attracted people's interest. However, this algorithm has some problems. For example, the diversity of the algorithm is poor, and the convergence and diversity of the algorithm are unbalanced. In addition, users don't always care about the entire Pareto front. Sometimes they may only be interested in specific areas of entire Pareto front. Based on the above problems, this paper proposes a decomposition-based multi-objective evolutionary algorithm with dynamic weight vector (MOEA/D-DWV). Firstly, a weight vector generation model with uniform distribution or preference distribution is proposed. Users can decide which type of weight vector to generate according to their own wishes. Then, two combination evolution operators are proposed to better balance the convergence and diversity of the algorithm. Finally, a dynamic adjustment strategy of weight vector is proposed. This strategy can adjust the distribution of weight vector adaptively according to the distribution of solutions in the objective space, so that the population can be uniformly distributed in the objective space as much as possible. MOEA/D-DWV algorithm is compared with 9 advanced multi-objective evolutionary algorithms. The comparison results show that MOEA/D-DWV algorithm is more competitive.

Data availability

Data will be made available on request.

近年来,基于分解的多目标进化算法逐渐引起了人们的兴趣。然而,这种算法也存在一些问题。例如,算法的多样性较差,算法的收敛性和多样性不平衡。此外,用户并不总是关心整个帕累托前沿。有时,他们可能只对整个帕累托前沿的特定区域感兴趣。基于上述问题,本文提出了一种基于分解的动态权重向量多目标进化算法(MOEA/D-DWV)。首先,本文提出了一种具有均匀分布或偏好分布的权重向量生成模型。用户可以根据自己的意愿决定生成哪种类型的权重向量。然后,提出了两种组合进化算子,以更好地平衡算法的收敛性和多样性。最后,提出了权重向量的动态调整策略。该策略可以根据解在目标空间中的分布情况,自适应地调整权向量的分布,从而使种群尽可能均匀地分布在目标空间中。MOEA/D-DWV 算法与 9 种先进的多目标进化算法进行了比较。比较结果表明,MOEA/D-DWV 算法更具竞争力。
{"title":"Research on decomposition-based multi-objective evolutionary algorithm with dynamic weight vector","authors":"Jiale Zhao ,&nbsp;Xiangdang Huang ,&nbsp;Tian Li ,&nbsp;Huanhuan Yu ,&nbsp;Hansheng Fei ,&nbsp;Qiuling Yang","doi":"10.1016/j.jocs.2024.102361","DOIUrl":"https://doi.org/10.1016/j.jocs.2024.102361","url":null,"abstract":"<div><p>In recent years, multi-objective evolutionary algorithm based on decomposition has gradually attracted people's interest. However, this algorithm has some problems. For example, the diversity of the algorithm is poor, and the convergence and diversity of the algorithm are unbalanced. In addition, users don't always care about the entire Pareto front. Sometimes they may only be interested in specific areas of entire Pareto front. Based on the above problems, this paper proposes a decomposition-based multi-objective evolutionary algorithm with dynamic weight vector (MOEA/D-DWV). Firstly, a weight vector generation model with uniform distribution or preference distribution is proposed. Users can decide which type of weight vector to generate according to their own wishes. Then, two combination evolution operators are proposed to better balance the convergence and diversity of the algorithm. Finally, a dynamic adjustment strategy of weight vector is proposed. This strategy can adjust the distribution of weight vector adaptively according to the distribution of solutions in the objective space, so that the population can be uniformly distributed in the objective space as much as possible. MOEA/D-DWV algorithm is compared with 9 advanced multi-objective evolutionary algorithms. The comparison results show that MOEA/D-DWV algorithm is more competitive.</p></div><div><h3>Data availability</h3><p>Data will be made available on request.</p></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":null,"pages":null},"PeriodicalIF":3.1,"publicationDate":"2024-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141434396","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Characterizing pedestrian contact interaction trajectories to understand spreading risk in human crowds 描述行人接触互动轨迹,了解人群中的扩散风险
IF 3.1 3区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2024-06-17 DOI: 10.1016/j.jocs.2024.102358
Jaeyoung Kwak , Michael H. Lees , Wentong Cai

A spreading process can be observed when particular information, substances, or diseases spread through a population over time in social and biological systems. It is widely believed that contact interactions among individual entities play an essential role in the spreading process. Although contact interactions are often influenced by geometrical conditions, little attention has been paid to understand their effects, especially on contact duration among pedestrians. To examine how the pedestrian flow setups affect contact duration distribution, we have analyzed trajectories of pedestrians in contact interactions collected from pedestrian flow experiments of uni-, bi- and multi-directional setups. Based on turning angle entropy and efficiency, we have classified the type of motion observed in the contact interactions. We have found that the majority of contact interactions in the unidirectional flow setup can be categorized as confined motion, hinting at the possibility of long-lived contact duration. However, ballistic motion is more frequently observed in the other flow conditions, yielding frequent, brief contact interactions. Our results demonstrate that observing more confined motions is likely associated with the increase of parallel contact interactions regardless of pedestrian flow setups. This study highlights that the confined motions tend to yield longer contact duration, suggesting that the infectious disease transmission risk would be considerable even for low transmissibility. These results have important implications for crowd management in the context of minimizing spreading risk.

This work is an extended version of Kwak et al. (2023) presented at the 2023 International Conference on Computational Science (ICCS).

在社会和生物系统中,当特定信息、物质或疾病随着时间的推移在人群中传播时,就可以观察到传播过程。人们普遍认为,个体间的接触互动在传播过程中起着至关重要的作用。虽然接触互动通常会受到几何条件的影响,但人们很少关注这些条件的影响,尤其是对行人之间接触持续时间的影响。为了研究行人流设置如何影响接触持续时间分布,我们分析了单向、双向和多向设置的行人流实验中收集到的行人接触互动轨迹。根据转角熵和效率,我们对接触互动中观察到的运动类型进行了分类。我们发现,在单向流动设置中,大多数接触互动可归类为封闭运动,这暗示了接触持续时间较长的可能性。然而,在其他流动条件下,弹道运动更为常见,从而产生频繁而短暂的接触相互作用。我们的研究结果表明,无论行人流设置如何,观察到更多的封闭运动可能与平行接触相互作用的增加有关。这项研究强调,受限的运动往往会产生较长的接触时间,这表明即使传播率较低,传染病的传播风险也会相当大。这些结果对人群管理中的传播风险最小化具有重要意义。这项工作是 Kwak 等人(2023 年)在 2023 年国际计算科学大会(ICCS)上发表的论文的扩展版本。
{"title":"Characterizing pedestrian contact interaction trajectories to understand spreading risk in human crowds","authors":"Jaeyoung Kwak ,&nbsp;Michael H. Lees ,&nbsp;Wentong Cai","doi":"10.1016/j.jocs.2024.102358","DOIUrl":"https://doi.org/10.1016/j.jocs.2024.102358","url":null,"abstract":"<div><p>A spreading process can be observed when particular information, substances, or diseases spread through a population over time in social and biological systems. It is widely believed that contact interactions among individual entities play an essential role in the spreading process. Although contact interactions are often influenced by geometrical conditions, little attention has been paid to understand their effects, especially on contact duration among pedestrians. To examine how the pedestrian flow setups affect contact duration distribution, we have analyzed trajectories of pedestrians in contact interactions collected from pedestrian flow experiments of uni-, bi- and multi-directional setups. Based on turning angle entropy and efficiency, we have classified the type of motion observed in the contact interactions. We have found that the majority of contact interactions in the unidirectional flow setup can be categorized as confined motion, hinting at the possibility of long-lived contact duration. However, ballistic motion is more frequently observed in the other flow conditions, yielding frequent, brief contact interactions. Our results demonstrate that observing more confined motions is likely associated with the increase of parallel contact interactions regardless of pedestrian flow setups. This study highlights that the confined motions tend to yield longer contact duration, suggesting that the infectious disease transmission risk would be considerable even for low transmissibility. These results have important implications for crowd management in the context of minimizing spreading risk.</p><p>This work is an extended version of Kwak et al. (2023) presented at the 2023 International Conference on Computational Science (ICCS).</p></div>","PeriodicalId":48907,"journal":{"name":"Journal of Computational Science","volume":null,"pages":null},"PeriodicalIF":3.1,"publicationDate":"2024-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141482408","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Journal of Computational Science
全部 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