首页 > 最新文献

Moscow University Computational Mathematics and Cybernetics最新文献

英文 中文
Inverse Problem for a Nonlinear Model of Population Dynamics with the Age Structure of Individuals and Overpopulation 具有个体年龄结构和人口过剩的人口动态非线性模型的逆问题
Pub Date : 2024-03-01 DOI: 10.3103/s0278641924010072

Abstract

The authors consider the inverse problem of restoring the coefficient in a nonlinear equation of a dynamic model of a homogeneous biological population of organisms structured according to age. The model allows for the dependence of parameters of the vital activity of individuals on the population size. Some coefficients of the model are nonlocal and have an integral structure. Conditions for the uniqueness of the solution of the inverse problem are established.

摘要 作者考虑了恢复按年龄划分的同质生物种群动态模型非线性方程中系数的逆问题。该模型允许个体生命活动参数依赖于种群数量。模型的某些系数是非局部的,具有积分结构。建立了逆问题解的唯一性条件。
{"title":"Inverse Problem for a Nonlinear Model of Population Dynamics with the Age Structure of Individuals and Overpopulation","authors":"","doi":"10.3103/s0278641924010072","DOIUrl":"https://doi.org/10.3103/s0278641924010072","url":null,"abstract":"<span> <h3>Abstract</h3> <p>The authors consider the inverse problem of restoring the coefficient in a nonlinear equation of a dynamic model of a homogeneous biological population of organisms structured according to age. The model allows for the dependence of parameters of the vital activity of individuals on the population size. Some coefficients of the model are nonlocal and have an integral structure. Conditions for the uniqueness of the solution of the inverse problem are established.</p> </span>","PeriodicalId":501582,"journal":{"name":"Moscow University Computational Mathematics and Cybernetics","volume":"27 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140601442","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
Model for Protecting Objects from Multiple Impacts 保护物体免受多重撞击的模型
Pub Date : 2024-03-01 DOI: 10.3103/s0278641924010047

Abstract

An attack–defense model is considered in which the attack can deliver several strikes on defense points to maximize the damage. A way of creating a solution to a zero-sum game in mixed strategies is developed.

摘要 本文考虑了一种攻击-防御模型,在该模型中,攻击方可以对防御点进行多次打击,以最大限度地造成破坏。本文提出了一种在混合策略中建立零和博弈解的方法。
{"title":"Model for Protecting Objects from Multiple Impacts","authors":"","doi":"10.3103/s0278641924010047","DOIUrl":"https://doi.org/10.3103/s0278641924010047","url":null,"abstract":"<span> <h3>Abstract</h3> <p>An attack–defense model is considered in which the attack can deliver several strikes on defense points to maximize the damage. A way of creating a solution to a zero-sum game in mixed strategies is developed.</p> </span>","PeriodicalId":501582,"journal":{"name":"Moscow University Computational Mathematics and Cybernetics","volume":"54 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140601527","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
Identifying the Capacity of a Social Network 识别社交网络的能力
Pub Date : 2024-03-01 DOI: 10.3103/s0278641924010084

Abstract

The diffusive logistic model of information dissemination in a social network is considered in the form of a one-dimensional nonstationary parabolic equation. The problem of parametric identification is posed as an extremum problem for searching the parameter in the form of a spatially distributed social network capacity. Gradient means of optimization are applied. The results demonstrate uniform convergence to an exact solution in the approach with a controllable descent direction.

摘要 以一维非稳态抛物线方程的形式考虑了社会网络中信息传播的扩散逻辑模型。将参数识别问题作为一个极值问题,以搜索空间分布的社会网络容量形式的参数。应用了梯度优化方法。结果表明,在可控下降方向的方法中,精确解的收敛性是一致的。
{"title":"Identifying the Capacity of a Social Network","authors":"","doi":"10.3103/s0278641924010084","DOIUrl":"https://doi.org/10.3103/s0278641924010084","url":null,"abstract":"<span> <h3>Abstract</h3> <p>The diffusive logistic model of information dissemination in a social network is considered in the form of a one-dimensional nonstationary parabolic equation. The problem of parametric identification is posed as an extremum problem for searching the parameter in the form of a spatially distributed social network capacity. Gradient means of optimization are applied. The results demonstrate uniform convergence to an exact solution in the approach with a controllable descent direction.</p> </span>","PeriodicalId":501582,"journal":{"name":"Moscow University Computational Mathematics and Cybernetics","volume":"68 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140601853","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
Splitting Schemes with Additive Representation of the Operator at the Time Derivative 在时间导数上用加法表示算子的拆分方案
Pub Date : 2024-03-01 DOI: 10.3103/s0278641924010096

Abstract

Additive (splitting) schemes are used to contruct effective computational algorithms for approximately solving initial-boundary value problems for nonstationary partial differential equations. Splitting schemes are normally used when the main operator of a problem has an additive representation. Problems where the operator at the time derivative of a solution is split are also of interest. For first-order evolution equations, we propose splitting schemes based on transforming the original equation to an equivalent system of equations.

摘要 加性(分裂)方案用于构建有效的计算算法,以近似求解非稳态偏微分方程的初始边界值问题。当问题的主算子具有加性表示时,通常会使用拆分方案。解的时间导数算子被拆分的问题也值得关注。对于一阶演化方程,我们提出了基于将原始方程转换为等效方程组的拆分方案。
{"title":"Splitting Schemes with Additive Representation of the Operator at the Time Derivative","authors":"","doi":"10.3103/s0278641924010096","DOIUrl":"https://doi.org/10.3103/s0278641924010096","url":null,"abstract":"<span> <h3>Abstract</h3> <p>Additive (splitting) schemes are used to contruct effective computational algorithms for approximately solving initial-boundary value problems for nonstationary partial differential equations. Splitting schemes are normally used when the main operator of a problem has an additive representation. Problems where the operator at the time derivative of a solution is split are also of interest. For first-order evolution equations, we propose splitting schemes based on transforming the original equation to an equivalent system of equations.</p> </span>","PeriodicalId":501582,"journal":{"name":"Moscow University Computational Mathematics and Cybernetics","volume":"100 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140601850","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
Generative Intelligence Systems for Image Synthesis: Scenarios for Their Use and Related Tasks 用于图像合成的生成智能系统:使用场景及相关任务
Pub Date : 2024-03-01 DOI: 10.3103/s0278641924010060

Abstract

The authors discuss generative intelligence systems for image synthesis, describes one (DALL (cdot) E 2) in detail, and provide familiar examples of the use of such systems. The advisability of preparing such a review lies in the current situation in the field of generative intelligence, many inflated expectations and fears, and a practical lack of descriptions and analyses of scenarios for their use in business. This review will be useful to anyone who wishes to understand the real capabilities and limitations of such systems.

摘要 作者讨论了用于图像合成的生成智能系统,详细描述了其中一个系统(DALL (cdot) E 2),并提供了使用此类系统的熟悉实例。编写这样一篇综述是明智之举,因为目前在生成智能领域存在着许多夸大的期望和恐惧,而且实际上缺乏对其在商业中的应用场景的描述和分析。这篇综述将对任何希望了解此类系统的实际能力和局限性的人有所帮助。
{"title":"Generative Intelligence Systems for Image Synthesis: Scenarios for Their Use and Related Tasks","authors":"","doi":"10.3103/s0278641924010060","DOIUrl":"https://doi.org/10.3103/s0278641924010060","url":null,"abstract":"<span> <h3>Abstract</h3> <p>The authors discuss generative intelligence systems for image synthesis, describes one (DALL<span> <span>(cdot)</span> </span>E 2) in detail, and provide familiar examples of the use of such systems. The advisability of preparing such a review lies in the current situation in the field of generative intelligence, many inflated expectations and fears, and a practical lack of descriptions and analyses of scenarios for their use in business. This review will be useful to anyone who wishes to understand the real capabilities and limitations of such systems.</p> </span>","PeriodicalId":501582,"journal":{"name":"Moscow University Computational Mathematics and Cybernetics","volume":"55 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140601535","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
Transitioning between Different Representations of Interval Controlled Systems 在区间受控系统的不同表示之间转换
Pub Date : 2024-02-04 DOI: 10.3103/s0278641923040106
E. I. Atamas’

Abstract

A description is given of algorithms for converting linear controlled systems with interval parameters from a state-space representation to a representation in the form of transfer functions and vice versa. Results are accompanied by computational examples demonstrating the capabilities and limitations of the proposed approach.

摘要 介绍了将带区间参数的线性受控系统从状态空间表示法转换为传递函数表示法的算法,反之亦然。结果附有计算实例,展示了所提方法的能力和局限性。
{"title":"Transitioning between Different Representations of Interval Controlled Systems","authors":"E. I. Atamas’","doi":"10.3103/s0278641923040106","DOIUrl":"https://doi.org/10.3103/s0278641923040106","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>A description is given of algorithms for converting linear controlled systems with interval parameters from a state-space representation to a representation in the form of transfer functions and <i>vice versa</i>. Results are accompanied by computational examples demonstrating the capabilities and limitations of the proposed approach.</p>","PeriodicalId":501582,"journal":{"name":"Moscow University Computational Mathematics and Cybernetics","volume":"11 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139679706","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
Verifying Hypotheses of Drug Bioequivalence 验证药物生物等效性假设
Pub Date : 2024-02-04 DOI: 10.3103/s0278641923040143
M. A. Dranitsyna, T. V. Zakharova, P. V. Panov

Abstract

The problem of testing pharmaceuticals on their bioequivalence is considered. Investigations of drug bioequivalence are the basis for reproducing drugs that confirm their efficiency and safety. The main way of verifying drug bioequivalence is to conduct two one-sided Schuirmann tests. Two one-sided tests have been used for many years and proven their validity for proving equivalent bioavailability, but in some situations (missing data, the necessity of considering not only the aggregate metrics but also the shape of the concentration–time curve) there is a need to establish more accurately the differences between the concentration–time curves. The authors present a new criterion that is more sensitive to the differences between characteristics that affect drug bioavailability and reduce the risk for patients. In should be noted that the new criterion generalizes the Schuirmann criterion and preserves its useful properties.

摘要 本文探讨了药物的生物等效性测试问题。对药物生物等效性的研究是再现药物并确认其有效性和安全性的基础。验证药物生物等效性的主要方法是进行两次单侧舒尔曼试验。两个单侧试验已使用多年,证明了其在证明等效生物利用度方面的有效性,但在某些情况下(数据缺失、不仅需要考虑总量指标,还需要考虑浓度-时间曲线的形状),需要更准确地确定浓度-时间曲线之间的差异。作者提出的新标准对影响药物生物利用度和降低患者风险的特征之间的差异更为敏感。应该指出的是,新标准概括了舒尔曼标准,并保留了其有用的特性。
{"title":"Verifying Hypotheses of Drug Bioequivalence","authors":"M. A. Dranitsyna, T. V. Zakharova, P. V. Panov","doi":"10.3103/s0278641923040143","DOIUrl":"https://doi.org/10.3103/s0278641923040143","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>The problem of testing pharmaceuticals on their bioequivalence is considered. Investigations of drug bioequivalence are the basis for reproducing drugs that confirm their efficiency and safety. The main way of verifying drug bioequivalence is to conduct two one-sided Schuirmann tests. Two one-sided tests have been used for many years and proven their validity for proving equivalent bioavailability, but in some situations (missing data, the necessity of considering not only the aggregate metrics but also the shape of the concentration–time curve) there is a need to establish more accurately the differences between the concentration–time curves. The authors present a new criterion that is more sensitive to the differences between characteristics that affect drug bioavailability and reduce the risk for patients. In should be noted that the new criterion generalizes the Schuirmann criterion and preserves its useful properties.</p>","PeriodicalId":501582,"journal":{"name":"Moscow University Computational Mathematics and Cybernetics","volume":"18 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139679881","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
A Hadamard Product of Linear Codes: Algebraic Properties and Algorithms for Calculating It 线性编码的哈达玛积:代数特性和计算算法
Pub Date : 2024-02-04 DOI: 10.3103/s0278641923040179
I. V. Chizhov

Abstract

A study is performed of the algebraic properties of the Hadamard product (Schur product, component-wise product) of linear error-correcting codes. The complexity of constructing a product basis using known multiplier bases is discussed. The concept is introduced of quotient, quasi-quotient, and maximal inclusion quasi-quotient obtained from the Hadamard division of one linear code by another. An explicit form of the maximum Hadamard division quasi-quotient is established. A criterion is proved for the existence of a given code of an inverse code in a semiring formed by linear codes of length (n) with the operations of sum and product of Hadamard codes. The explicit form of codes that have a reverse code in this semiring is described.

摘要 研究了线性纠错码的哈达玛乘积(舒尔乘积,分量-明智乘积)的代数性质。讨论了使用已知乘法基构建积基的复杂性。引入了从一种线性编码对另一种线性编码的哈达玛除法中获得的商、准商和最大包含准商的概念。建立了最大哈达玛除法准商的明确形式。证明了在一个由长度为 (n) 的线性编码与哈达玛编码的和与积运算形成的配系中存在给定编码的逆编码的标准。描述了在这个配系中具有反码的编码的显式。
{"title":"A Hadamard Product of Linear Codes: Algebraic Properties and Algorithms for Calculating It","authors":"I. V. Chizhov","doi":"10.3103/s0278641923040179","DOIUrl":"https://doi.org/10.3103/s0278641923040179","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>A study is performed of the algebraic properties of the Hadamard product (Schur product, component-wise product) of linear error-correcting codes. The complexity of constructing a product basis using known multiplier bases is discussed. The concept is introduced of quotient, quasi-quotient, and maximal inclusion quasi-quotient obtained from the Hadamard division of one linear code by another. An explicit form of the maximum Hadamard division quasi-quotient is established. A criterion is proved for the existence of a given code of an inverse code in a semiring formed by linear codes of length <span>(n)</span> with the operations of sum and product of Hadamard codes. The explicit form of codes that have a reverse code in this semiring is described.</p>","PeriodicalId":501582,"journal":{"name":"Moscow University Computational Mathematics and Cybernetics","volume":"16 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139679994","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
A Lower Bound for Bilinear Complexity of Matrix Multiplication over a Finite Field 有限域上矩阵乘法的双线性复杂度下限
Pub Date : 2024-02-04 DOI: 10.3103/s0278641923040155
A. A. Nazarov

Abstract

An improved lower bound is found for the bilinear complexity of the multiplication of arbitrary matrices over finite fields.

摘要 为有限域上任意矩阵乘法的双线性复杂度找到了一个改进的下限。
{"title":"A Lower Bound for Bilinear Complexity of Matrix Multiplication over a Finite Field","authors":"A. A. Nazarov","doi":"10.3103/s0278641923040155","DOIUrl":"https://doi.org/10.3103/s0278641923040155","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>An improved lower bound is found for the bilinear complexity of the multiplication of arbitrary matrices over finite fields.</p>","PeriodicalId":501582,"journal":{"name":"Moscow University Computational Mathematics and Cybernetics","volume":"15 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139679879","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
Intelligent Technologies for the Segmentation and Classification of Microbiological Photographic Images 微生物摄影图像的分割和分类智能技术
Pub Date : 2024-02-04 DOI: 10.3103/s0278641923040131
O. E. Gorokhov, M. A. Kazachuk, I. S. Lazukhin, I. V. Mashechkin, L. L. Pankrat’eva, I. S. Popov

Abstract

The need to detect pathogenic microorganisms in the human body as quickly as possible is an important problem in medicine. One of today’s most common approaches of solving it is based on sowing biological material on nutrient media and then observing the growth of colonies. This technique has certain disadvantages associated mainly with the human factor, which can lead to errors in the final diagnosis. The aim of this work was to develop technologies for the intelligent processing of data from microbiological analyses based on photographic images of Petri dishes. This would reduce dependence on the human factor and improve key indicators of data processing. Results show that the developed heuristic and neural network approaches of detecting and classifying colonies of microorganisms are superior to those of existing ptocedures. They allow the automation of key stages of microbiological examination and thus can be applied in practice.

摘要 尽快检测出人体内的病原微生物是医学界面临的一个重要问题。当今最常见的解决方法之一是将生物材料播种在营养培养基上,然后观察菌落的生长情况。这种技术有一定的缺点,主要与人为因素有关,可能导致最终诊断错误。这项工作的目的是开发基于培养皿照片图像的微生物分析数据智能处理技术。这将减少对人为因素的依赖,并改进数据处理的关键指标。结果表明,所开发的用于检测和分类微生物菌落的启发式和神经网络方法优于现有的方法。这些方法可以实现微生物检查关键阶段的自动化,因此可以在实践中应用。
{"title":"Intelligent Technologies for the Segmentation and Classification of Microbiological Photographic Images","authors":"O. E. Gorokhov, M. A. Kazachuk, I. S. Lazukhin, I. V. Mashechkin, L. L. Pankrat’eva, I. S. Popov","doi":"10.3103/s0278641923040131","DOIUrl":"https://doi.org/10.3103/s0278641923040131","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>The need to detect pathogenic microorganisms in the human body as quickly as possible is an important problem in medicine. One of today’s most common approaches of solving it is based on sowing biological material on nutrient media and then observing the growth of colonies. This technique has certain disadvantages associated mainly with the human factor, which can lead to errors in the final diagnosis. The aim of this work was to develop technologies for the intelligent processing of data from microbiological analyses based on photographic images of Petri dishes. This would reduce dependence on the human factor and improve key indicators of data processing. Results show that the developed heuristic and neural network approaches of detecting and classifying colonies of microorganisms are superior to those of existing ptocedures. They allow the automation of key stages of microbiological examination and thus can be applied in practice.</p>","PeriodicalId":501582,"journal":{"name":"Moscow University Computational Mathematics and Cybernetics","volume":"22 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139679660","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
期刊
Moscow University Computational Mathematics and Cybernetics
全部 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