Journal of Computer and Systems Sciences International最新文献

英文中文

Modification of the Hopfield Neural Network Model for Solving the Problem of Optimal Task Allocation in a Group of Mobile Robots 修改 Hopfield 神经网络模型以解决移动机器人群中的最佳任务分配问题

IF 0.6 4区计算机科学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE

Journal of Computer and Systems Sciences International

Pub Date : 2024-08-18 DOI: 10.1134/s1064230724700254

O. V. Darintsev, A. B. Migranov

Abstract

In the context of group interaction among mobile robots, there arises the challenge of task distribution within the group, taking into consideration the robots' characteristics and the working environment. This study aims to modify the Hopfield neural network and develop methodologies for its application in solving the task allocation problem for an arbitrary number of tasks within a group of mobile robots. To achieve this, the Hopfield neural network is represented as a graph. An algorithm is presented, demonstrating the transition from the initial problem to the Traveling Salesman Problem (TSP). The application of the Hopfield model to the task distribution problem in a group of robots is described, together with the development of an optimization function calculation algorithm. An assessment is conducted to evaluate the impact of neural network parameters on the quality and speed of solving the optimization problem. By comparing it with other heuristic methods (genetic and ant colony algorithms (ACAs), the domains of application for the modified algorithm are determined.

摘要在移动机器人群体交互的背景下，考虑到机器人的特性和工作环境，在群体内分配任务是一项挑战。本研究旨在修改 Hopfield 神经网络，并开发其应用方法，以解决移动机器人群内任意数量任务的任务分配问题。为此，Hopfield 神经网络被表示为一个图。介绍了一种算法，演示了从初始问题到旅行推销员问题（TSP）的过渡。介绍了 Hopfield 模型在一组机器人任务分配问题中的应用，以及优化函数计算算法的开发。通过评估神经网络参数对解决优化问题的质量和速度的影响。通过与其他启发式方法（遗传算法和蚁群算法）进行比较，确定了改进算法的应用领域。

{"title":"Modification of the Hopfield Neural Network Model for Solving the Problem of Optimal Task Allocation in a Group of Mobile Robots","authors":"O. V. Darintsev, A. B. Migranov","doi":"10.1134/s1064230724700254","DOIUrl":"https://doi.org/10.1134/s1064230724700254","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>In the context of group interaction among mobile robots, there arises the challenge of task distribution within the group, taking into consideration the robots' characteristics and the working environment. This study aims to modify the Hopfield neural network and develop methodologies for its application in solving the task allocation problem for an arbitrary number of tasks within a group of mobile robots. To achieve this, the Hopfield neural network is represented as a graph. An algorithm is presented, demonstrating the transition from the initial problem to the Traveling Salesman Problem (TSP). The application of the Hopfield model to the task distribution problem in a group of robots is described, together with the development of an optimization function calculation algorithm. An assessment is conducted to evaluate the impact of neural network parameters on the quality and speed of solving the optimization problem. By comparing it with other heuristic methods (genetic and ant colony algorithms (ACAs), the domains of application for the modified algorithm are determined.</p>","PeriodicalId":50223,"journal":{"name":"Journal of Computer and Systems Sciences International","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2024-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142200087","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Implementation of a System of Incompletely Specified Boolean Functions in a Circuit of Two-Input Gates by Means of Bi-Decomposition 用双分解法在双输入门电路中实现不完全指定布尔函数系统

IF 0.6 4区计算机科学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE

Journal of Computer and Systems Sciences International

Pub Date : 2024-08-18 DOI: 10.1134/s1064230724700205

Yu. V. Pottosin

Abstract

The problem of bi-decomposition of a Boolean function is to represent a given Boolean function as a logic algebra operation over two Boolean functions. A method based on bi-decomposition of Boolean functions is suggested to implement systems of incompletely specified (partial) Boolean functions in the basis of two-input gates. This basis can be the basis of NOR gates, NAND gates or the basis of AND and OR gates with accessible input complements. The used method for bi-decomposition is reduced to the search for weighted two-block cover of a complete bipartite weighted graph with complete bipartite subgraphs (bi-cliques). The graph represents differences between the rows of Boolean matrices that specify the given system of partial Boolean functions. The system is given by two Boolean matrices, one of which represents the domain of Boolean space where the values of the given functions are specified, and the other—the values of the functions on the elements of the domain. Every bi-clique in the obtained cover is assigned in a certain way with а set of variables that are the arguments of the functions. This set is the weight of the bi-clique. Every one of those bi-cliques defines a Boolean function whose arguments are the variables assigned to it. The functions obtained in such a way constitute the required decomposition. The process of synthesis of a combinational circuit consists in successive application of bi-decomposition to the obtained functions. The method for two-block covering the orthogonality graph of rows of ternary matrices is described.

摘要布尔函数的双分解问题是将给定的布尔函数表示为两个布尔函数的逻辑代数运算。本文提出了一种基于布尔函数双分解的方法，用于在双输入门的基础上实现不完全指定（部分）布尔函数系统。这种基础可以是 NOR 门、NAND 门或具有可访问输入补码的 AND 和 OR 门的基础。所使用的双分解方法简化为在一个完整的双栅格加权图中寻找具有完整双栅格子图（双栅格）的加权双块覆盖。该图表示布尔矩阵各行之间的差异，这些布尔矩阵指定了给定的部分布尔函数系统。该系统由两个布尔矩阵给出，其中一个矩阵表示布尔空间的域，在该域中指定了给定函数的值，另一个矩阵表示域元素上的函数值。在所得到的覆盖中，每个双层矩阵都以某种方式分配了作为函数参数的 а 组变量。这组变量就是双壳的权重。每个双阙都定义了一个布尔函数，其参数就是分配给它的变量。以这种方式获得的函数构成了所需的分解。组合电路的合成过程包括对获得的函数连续应用双分解。本文介绍了对三元矩阵行的正交图进行两块覆盖的方法。

{"title":"Implementation of a System of Incompletely Specified Boolean Functions in a Circuit of Two-Input Gates by Means of Bi-Decomposition","authors":"Yu. V. Pottosin","doi":"10.1134/s1064230724700205","DOIUrl":"https://doi.org/10.1134/s1064230724700205","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>The problem of bi-decomposition of a Boolean function is to represent a given Boolean function as a logic algebra operation over two Boolean functions. A method based on bi-decomposition of Boolean functions is suggested to implement systems of incompletely specified (partial) Boolean functions in the basis of two-input gates. This basis can be the basis of NOR gates, NAND gates or the basis of AND and OR gates with accessible input complements. The used method for bi-decomposition is reduced to the search for weighted two-block cover of a complete bipartite weighted graph with complete bipartite subgraphs (bi-cliques). The graph represents differences between the rows of Boolean matrices that specify the given system of partial Boolean functions. The system is given by two Boolean matrices, one of which represents the domain of Boolean space where the values of the given functions are specified, and the other—the values of the functions on the elements of the domain. Every bi-clique in the obtained cover is assigned in a certain way with а set of variables that are the arguments of the functions. This set is the weight of the bi-clique. Every one of those bi-cliques defines a Boolean function whose arguments are the variables assigned to it. The functions obtained in such a way constitute the required decomposition. The process of synthesis of a combinational circuit consists in successive application of bi-decomposition to the obtained functions. The method for two-block covering the orthogonality graph of rows of ternary matrices is described.</p>","PeriodicalId":50223,"journal":{"name":"Journal of Computer and Systems Sciences International","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2024-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142225747","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Optimal Finite-Dimensional Controller of a Stochastic Differential Object’s State by Its Output. II. Stochastic Measurements and Separation Theorem 通过输出实现随机微分对象状态的最优有限维控制器。II.随机测量与分离定理

IF 0.6 4区计算机科学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE

Journal of Computer and Systems Sciences International

Pub Date : 2024-08-13 DOI: 10.1134/s1064230724700059

E. A. Rudenko

Abstract

Consideration is continued of the problem of the inertial control law by the output synthesis of a continuous nonlinear stochastic object, which is optimal on average and on a finite time interval, and works with the desired speed. An algorithm for synthesizing the optimal structure of a dynamic controller of a selected finite order, obtained in the first part of the article for the case of accurate measurements of the control object’s state variables part, is presented. Its application is demonstrated in detail for the case when the state variables of the control object are measured with random errors. Using the example of a linear-quadratic-Gaussian problem, it is shown that the proposed controller of the corresponding order also satisfies the well-known separation theorem.

摘要通过对连续非线性随机对象的输出合成，继续考虑惯性控制法问题，该法在有限时间间隔内平均最优，并以所需速度工作。文章第一部分介绍了在精确测量控制对象状态变量部分的情况下，合成选定有限阶动态控制器最优结构的算法。本文还详细演示了在控制对象的状态变量测量存在随机误差的情况下的应用。以线性二次高斯问题为例，说明所提出的相应阶次的控制器也满足著名的分离定理。

引用次数: 0

Explainable Artificial Intelligence in Deep Learning Neural Nets-Based Digital Images Analysis 基于深度学习神经网络的数字图像分析中的可解释人工智能

IF 0.6 4区计算机科学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE

Journal of Computer and Systems Sciences International

Pub Date : 2024-08-13 DOI: 10.1134/s1064230724700138

A. N. Averkin, E. N. Volkov, S. A. Yarushev

Abstract

This review shows the capabilities of artificial intelligence (AI) in the analysis of digital images in the field of medicine using convolutional neural networks of deep learning (DL). A new generation of AI systems is described with an explanation of decision-making algorithms to the user—explainable artificial intelligence (XAI). The taxonomy of the methods of explanation and the description of the methods themselves are given. The need to use XAI in classification tasks is substantiated on the example of ophthalmic diseases. The components of DL methods used in the reviewed works (neural network architecture, accuracy, characteristics of data sets) and XAI (methods of explanation, criteria for the accuracy of explanation) are studied. As an example, the problem of recognizing two of the most commonly diagnosed eye diseases is considered: diabetic retinopathy and glaucoma by artificial neural networks.

摘要本综述展示了人工智能（AI）在医学领域利用深度学习（DL）卷积神经网络分析数字图像的能力。通过对用户可解释人工智能（XAI）决策算法的解释，介绍了新一代人工智能系统。给出了解释方法的分类和方法本身的描述。以眼科疾病为例，证明了在分类任务中使用 XAI 的必要性。对综述作品中使用的 DL 方法（神经网络架构、准确性、数据集特征）和 XAI（解释方法、解释准确性标准）的组成部分进行了研究。以人工神经网络识别糖尿病视网膜病变和青光眼这两种最常见的眼科疾病为例进行了分析。

引用次数: 0

Stochastic Models for the Time Complexity of Computing Tasks: I. Development Principles, Statistical Data Mining, and Identification Problems 计算任务时间复杂性的随机模型：I. 开发原则、统计数据挖掘和识别问题

IF 0.6 4区计算机科学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE

Journal of Computer and Systems Sciences International

Pub Date : 2024-08-13 DOI: 10.1134/s1064230724700035

A. V. Borisov, A. V. Ivanov

Abstract

This paper contains the first part of a study on the design of mathematical models for the execution time of user tasks on virtual calculating nodes. It is assumed that the execution time is a random value with the mean and variance depending on the node resources, task parameters, and the current characteristics of the node state. We discover the key features of the mean and variance functions and specify some of their particular cases. Both the mean and variance functions depend on the unknown parameters, and the design of the stochastic model for time complexity leads to parameter identification in the form of the generalized maximum likelihood estimates under heterogeneous statistical information. This paper also contains recommendations concerning the gathering and subsequent use of this information: the node testbed preparation, stress test planning, and processing of the data obtained. Specific illustrating examples of the proposed mathematical model will be presented in the subsequent parts of the study.

摘要本文是虚拟计算节点上用户任务执行时间数学模型设计研究的第一部分。假设执行时间是一个随机值，其均值和方差取决于节点资源、任务参数和节点状态的当前特征。我们发现了均值和方差函数的主要特征，并具体说明了它们的一些特殊情况。均值和方差函数都取决于未知参数，时间复杂性随机模型的设计导致了在异质统计信息下以广义最大似然估计的形式进行参数识别。本文还就这些信息的收集和后续使用提出了建议：节点测试平台准备、压力测试规划和所获数据的处理。本研究的后续部分将介绍拟议数学模型的具体示例。

{"title":"Stochastic Models for the Time Complexity of Computing Tasks: I. Development Principles, Statistical Data Mining, and Identification Problems","authors":"A. V. Borisov, A. V. Ivanov","doi":"10.1134/s1064230724700035","DOIUrl":"https://doi.org/10.1134/s1064230724700035","url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>This paper contains the first part of a study on the design of mathematical models for the execution time of user tasks on virtual calculating nodes. It is assumed that the execution time is a random value with the mean and variance depending on the node resources, task parameters, and the current characteristics of the node state. We discover the key features of the mean and variance functions and specify some of their particular cases. Both the mean and variance functions depend on the unknown parameters, and the design of the stochastic model for time complexity leads to parameter identification in the form of the generalized maximum likelihood estimates under heterogeneous statistical information. This paper also contains recommendations concerning the gathering and subsequent use of this information: the node testbed preparation, stress test planning, and processing of the data obtained. Specific illustrating examples of the proposed mathematical model will be presented in the subsequent parts of the study.</p>","PeriodicalId":50223,"journal":{"name":"Journal of Computer and Systems Sciences International","volume":null,"pages":null},"PeriodicalIF":0.6,"publicationDate":"2024-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142225777","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

On the Partial Stability in the Probability of Nonlinear Stochastic Functional-Differential Systems with Aftereffect (Delay) 论有后效（延迟）的非线性随机函数-微分系统概率的部分稳定性

IF 0.6 4区计算机科学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE

Journal of Computer and Systems Sciences International

Pub Date : 2024-08-13 DOI: 10.1134/s1064230724700011

V. I. Vorotnikov, Yu. G. Martyshenko

Abstract

A system of nonlinear functional-differential equations with aftereffect (delay) subjected to random processes of “white” noise is considered. It is assumed that the system admits a partial (with respect to some part of the state variables) zero equilibrium position. The problem of the stability in the probability of the given equilibrium position is posed, and stability is considered not for all variables but for some of the variables that determine this equilibrium position. For the solution of this problem, a stochastic version of the method of Lyapunov–Krasovskii functionals is used with the appropriated specification of the requirements for the functionals. In order to expand the capabilities of the method used, it is also proposed to correct the domain of the functional space in which auxiliary Lyapunov–Krasovskii functionals are constructed. The conditions for partial stability of this type are obtained. Examples are given that show the features of the proposed approach.

摘要本文考虑了一个受 "白 "噪声随机过程影响的带后效（延迟）的非线性函数-微分方程系统。假定系统存在部分（关于部分状态变量）零平衡位置。提出的问题是给定平衡位置概率的稳定性，考虑的不是所有变量的稳定性，而是决定该平衡位置的部分变量的稳定性。为了解决这个问题，使用了随机版的 Lyapunov-Krasovskii 函数方法，并对函数的要求做了适当的规定。为了扩展所使用方法的能力，还建议修正构建辅助 Lyapunov-Krasovskii 函数的函数空间域。我们获得了这种类型的部分稳定性条件。举例说明了所提方法的特点。

引用次数: 0

Modeling the Dynamics of a Catamaran Driven by a Savonius Rotor and a Propeller 萨沃尼乌斯转子和螺旋桨驱动双体船的动力学建模

IF 0.6 4区计算机科学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE

Journal of Computer and Systems Sciences International

Pub Date : 2024-08-13 DOI: 10.1134/s1064230724700114

M. A. Garbuz, L. A. Klimina, V. A. Samsonov

Abstract

The dynamics of a catamaran with a Savonius rotor and a propeller installed on it are considered. Under the action of a stationary wind flow the rotor rotates and drives the propeller, which creates thrust. The angle of the catamaran’s course relative to the wind flow is considered as the control. The control task is to move the center of mass of the hull from the starting point to the given endpoint located strictly upstream of the wind. The possibility of straight-line motion against the wind is shown. The dependence of the average velocity in the stationary mode of movement against the wind on the radii of the Savonius rotor and propeller is analyzed.

摘要研究了安装有萨沃尼乌斯转子和螺旋桨的双体船的动力学。在静止风流的作用下，转子旋转并带动螺旋桨，从而产生推力。双体船的航向相对于风流的角度被视为控制因素。控制任务是将船体的质心从起点移动到严格位于风上游的给定终点。图中显示了逆风直线运动的可能性。分析了逆风静止运动模式下的平均速度与萨沃尼乌斯转子和螺旋桨半径的关系。

引用次数: 0

Aggregation of Multidimensional Conservative Systems with Oscillations 具有振荡的多维守恒系统的聚合

IF 0.6 4区计算机科学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE

Journal of Computer and Systems Sciences International

Pub Date : 2024-08-13 DOI: 10.1134/s1064230724700023

I. N. Barabanov, V. N. Tkhai

Abstract

We consider the set of multidimensional conservative systems that admits a family of single-frequency oscillations when taken as a unified system. The problem of aggregation of a set of systems into a coupled system with an attractive cycle close to the oscillation of uncoupled systems is solved. Weak universal coupling controls are applied. Previously, the problem was solved for identical reversible systems with one degree of freedom.

摘要我们考虑了一组多维保守系统，当把它们作为一个统一的系统时，它们会产生一系列单频振荡。解决了将一组系统聚合成一个耦合系统的问题，该耦合系统具有接近于非耦合系统振荡的吸引周期。应用了弱通用耦合控制。在此之前，该问题是针对具有一个自由度的相同可逆系统解决的。

引用次数: 0

Scheduling Calculations for a Multiprocessor System in Real Time 多处理器系统的实时调度计算

IF 0.6 4区计算机科学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE

Journal of Computer and Systems Sciences International

Pub Date : 2024-08-13 DOI: 10.1134/s1064230724700102

M. G. Furugyan

Abstract

The problem of scheduling computations in a multiprocessor system is considered for the case when, at some time instants, requests for the execution of job packages with known characteristics are received. Interrupts and switching from one processor to another are allowed. In the first formulation, the composition of all complexes and the characteristics of tasks are known in advance. In the second setting, this information becomes known only at the time of each request. It is required to determine whether there is an admissible schedule for the total set of jobs and build it in the case of a positive answer. A setting is studied in which, in addition to processors, there is a nonrenewable resource. A polynomial algorithm for solving the problem is developed, based on the construction of a network flow model and the search for the maximum flow.

摘要针对在某些时刻收到执行具有已知特征的作业包的请求的情况，考虑了多处理器系统中的计算调度问题。允许中断和从一个处理器切换到另一个处理器。在第一种情况下，所有复合系统的组成和任务的特征都是事先已知的。在第二种情况下，只有在每次请求时才会知道这些信息。这就要求确定是否存在一个适用于所有工作集的可行计划，并在得到肯定答案的情况下制定该计划。研究了除处理器外还存在不可再生资源的情况。在构建网络流模型和搜索最大流的基础上，开发了一种多项式算法来解决这个问题。

引用次数: 0

Amplitude Control of Systems’ Oscillations with Friction 带摩擦力的系统振荡幅度控制

IF 0.6 4区计算机科学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE

Journal of Computer and Systems Sciences International

Pub Date : 2024-08-13 DOI: 10.1134/s1064230724700060

Yu. F. Golubev

Abstract

A method of searching for the optimal control of the amplitude of one-dimensional oscillations in the vicinity of the equilibrium position is generalized to the case of a scleronomic multidimensional mechanical system with friction. The oscillatory degree of freedom of the system does not lend itself to direct control. Its movement is influenced by other, directly controlled degrees of freedom, whose coordinates are selected as control functions. The number of control functions can include both positional and cyclic coordinates. The method does not use conjugate variables in the sense of L.S. Pontryagin’s maximum principle and does not increase the dimension of the original system of differential equations of motion. The effectiveness of the proposed method is demonstrated using examples of specific oscillatory mechanical models about a pendulum with a support sliding along a cycloid with dry and viscous friction, as well as a six-legged robot from an emergency supine position.

摘要将寻找平衡位置附近一维振荡振幅最佳控制的方法推广到具有摩擦力的硬化多维机械系统。该系统的振荡自由度不适合直接控制。它的运动受其他直接控制自由度的影响，这些自由度的坐标被选作控制函数。控制函数的数量可以包括位置坐标和循环坐标。该方法不使用 L.S. Pontryagin 最大原则意义上的共轭变量，也不会增加原始运动微分方程系统的维度。我们用具体的摆锤摆动机械模型、沿摆线滑动的带干摩擦和粘性摩擦的支撑物，以及从紧急仰卧位置出发的六足机器人的例子，证明了所提方法的有效性。

引用次数: 0

首页上一页

下一页尾页

类型

全部化学•材料生命科学医学物理工程技术环境•农林材料科学地球科学法学管理学化学环境科学与生态学计算机科学教育学经济学农林科学人文科学生物学数学物理与天体物理心理学综合性期刊其他工业工程理学历史学农学文学信息工程

数据库

全部 ACS Publications Elsevier ieeexplore Springer The Royal Society of Chemistry Wiley

期刊

Journal of Computer and Systems Sciences International

全部 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.

﹀