首页 > 最新文献

Journal of Intelligent & Fuzzy Systems最新文献

英文 中文
Systematic review and meta-analysis of the screening and identification of key genes in gastric cancer using DNA microarray database 利用 DNA 微阵列数据库筛选和鉴定胃癌关键基因的系统综述和荟萃分析
IF 2 4区 计算机科学 Q1 Mathematics Pub Date : 2024-03-16 DOI: 10.3233/jifs-236416
Wenbiao Duan, Mingjin Yang, Weiliang Sun, Mingmin Xia, Hui Zhu, Chijiang Gu, Haiqiang Zhang
OBJECTIVE:A comprehensive evaluation of studies using DNA microarray datasets for screening and identifying key genes in gastric cancer is the goal of this systematic review and meta-analysis. To better understand the molecular environment associated with stomach cancer, this study aims to providea quantitative synthesis of findings. PURPOSE:Using DNA microarray databases in a systematic manner, this study aims to analyze gastric cancer (GC) screening and gene identification efforts. Through a literature review spanning 2002–2022, this research aims to identify key genes associated with GC and develop strategies for screening and prognosis based on these findings. METHODS:The following databases were searched extensively: Science Direct, NCKI, Web of Science, Springer, and PubMed. Fifteen studies met the inclusion and exclusion criteria; 10,134 tissues served as controls and 11,724 as GCs. The levels of critical genes, including COL1A1, COL1A2, THBS2, SPP1, SPARC, COL6A3, and COL3A1, were compared in normal and GC tissues. Rev Man 5.3 was used to do the meta-analysis. While applying models with fixed or random effects, 95% confidence intervals and weighted mean differences were computed. RESULTSAccording to the meta-analysis, GC tissues exhibited substantially elevated levels of important genes when contrasted with the control group. In particular, there were statistically significant increases in COL1A1 (MD = 2.43, 95% CI: 1.84–3.02), COL1A2 (MD = 2.75, 95% CI: 1.09–4.41), THBS2 (MD = 2.54, 95% CI: 1.66–3.41), SPP1 (MD = 3.64, 95% CI: 3.40–3.88), SPARC (MD = 1.57, 95% CI: 0.37–2.77), COL6A3 (MD = 2.31, 95% CI: 2.02–2.60), and COL3A1 (MD = 2.21, 95% CI: 1.59–2.82). CONCLUSIONS:The COL1A1, THBS2, SPP1, COL6A3, and COL3A1 genes were shown to have potential use in germ cell cancer screening and prognosis, according to this research. Clinical assessment and prognosis of heart failure patients may be theoretically supported by the results of this study.
目的:本系统综述和荟萃分析旨在全面评估使用DNA芯片数据集筛选和鉴定胃癌关键基因的研究。为了更好地了解与胃癌相关的分子环境,本研究旨在对研究结果进行定量综述。目的:本研究以系统的方式使用 DNA 微阵列数据库,旨在分析胃癌(GC)筛查和基因鉴定工作。通过对 2002-2022 年间的文献进行回顾,本研究旨在确定与 GC 相关的关键基因,并在此基础上制定筛查和预后策略。方法:对以下数据库进行了广泛检索:Science Direct、NCKI、Web of Science、Springer 和 PubMed。15项研究符合纳入和排除标准;10,134个组织作为对照,11,724个组织作为GCs。比较了正常组织和 GC 组织中 COL1A1、COL1A2、THBS2、SPP1、SPARC、COL6A3 和 COL3A1 等关键基因的水平。使用Rev Man 5.3进行荟萃分析。在应用固定或随机效应模型时,计算了95%置信区间和加权平均差。结果根据荟萃分析,与对照组相比,GC 组织中重要基因的水平大幅升高。尤其是 COL1A1(MD = 2.43,95% CI:1.84-3.02)、COL1A2(MD = 2.75,95% CI:1.09-4.41)、THBS2(MD = 2.54,95% CI:1.66-3.41)、SPP1(MD = 3.64,95% CI:3.40-3.88)、SPARC(MD = 1.57,95% CI:0.37-2.77)、COL6A3(MD = 2.31,95% CI:2.02-2.60)和 COL3A1(MD = 2.21,95% CI:1.59-2.82)。结论:这项研究表明,COL1A1、THBS2、SPP1、COL6A3和COL3A1基因在生殖细胞癌筛查和预后方面具有潜在用途。本研究的结果可为心力衰竭患者的临床评估和预后提供理论支持。
{"title":"Systematic review and meta-analysis of the screening and identification of key genes in gastric cancer using DNA microarray database","authors":"Wenbiao Duan, Mingjin Yang, Weiliang Sun, Mingmin Xia, Hui Zhu, Chijiang Gu, Haiqiang Zhang","doi":"10.3233/jifs-236416","DOIUrl":"https://doi.org/10.3233/jifs-236416","url":null,"abstract":"OBJECTIVE:\u0000A comprehensive evaluation of studies using DNA microarray datasets for screening and identifying key genes in gastric cancer is the goal of this systematic review and meta-analysis. To better understand the molecular environment associated with stomach cancer, this study aims to providea quantitative synthesis of findings. PURPOSE:\u0000Using DNA microarray databases in a systematic manner, this study aims to analyze gastric cancer (GC) screening and gene identification efforts. Through a literature review spanning 2002–2022, this research aims to identify key genes associated with GC and develop strategies for screening and prognosis based on these findings. METHODS:\u0000The following databases were searched extensively: Science Direct, NCKI, Web of Science, Springer, and PubMed. Fifteen studies met the inclusion and exclusion criteria; 10,134 tissues served as controls and 11,724 as GCs. The levels of critical genes, including COL1A1, COL1A2, THBS2, SPP1, SPARC, COL6A3, and COL3A1, were compared in normal and GC tissues. Rev Man 5.3 was used to do the meta-analysis. While applying models with fixed or random effects, 95% confidence intervals and weighted mean differences were computed. RESULTS\u0000According to the meta-analysis, GC tissues exhibited substantially elevated levels of important genes when contrasted with the control group. In particular, there were statistically significant increases in COL1A1 (MD = 2.43, 95% CI: 1.84–3.02), COL1A2 (MD = 2.75, 95% CI: 1.09–4.41), THBS2 (MD = 2.54, 95% CI: 1.66–3.41), SPP1 (MD = 3.64, 95% CI: 3.40–3.88), SPARC (MD = 1.57, 95% CI: 0.37–2.77), COL6A3 (MD = 2.31, 95% CI: 2.02–2.60), and COL3A1 (MD = 2.21, 95% CI: 1.59–2.82). CONCLUSIONS:\u0000The COL1A1, THBS2, SPP1, COL6A3, and COL3A1 genes were shown to have potential use in germ cell cancer screening and prognosis, according to this research. Clinical assessment and prognosis of heart failure patients may be theoretically supported by the results of this study.","PeriodicalId":54795,"journal":{"name":"Journal of Intelligent & Fuzzy Systems","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2024-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140799977","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
DBSCAN-based energy users clustering for performance enhancement of deep learning model 基于 DBSCAN 的能量用户聚类用于提升深度学习模型的性能
IF 2 4区 计算机科学 Q1 Mathematics Pub Date : 2024-03-05 DOI: 10.3233/jifs-235873
Khursheed Aurangzeb
Background:Due to rapid progress in the fields of artificial intelligence, machine learning and deep learning, the power grids are transforming into Smart Grids (SG) which are versatile, reliable, intelligent and stable. The power consumption of the energy users is varying throughout the day as well as in different days of the week. Power consumption forecasting is of vital importance for the sustainable management and operation of SG. Methodology:In this work, the aim is to apply clustering for dividing a smart residential community into several group of similar profile energy user, which will be effective for developing and training representative deep neural network (DNN) models for power load forecasting of users in respective groups. The DNN models is composed of convolutional neural network (CNN) followed by LSTM layers for feature extraction and sequence learning respectively. The DNN For experimentation, the Smart Grid Smart City (SGSC) project database is used and its energy users are grouped into various clusters. Results:The residential community is divided into four groups of customers based on the chosen criterion where Group 1, 2, 3 and 4 contains 14 percent, 22 percent, 19 percent and 45 percent users respectively. Almost half of the population (45 percent) of the considered residential community exhibits less than 23 outliers in their electricity consumption patterns. The rest of the population is divided into three groups, where specialized deep learning models developed and trained for respective groups are able to achieve higher forecasting accuracy. The results of our proposed approach will assist researchers and utility companies by requiring fewer specialized deep-learning models for accurate forecasting of users who belong to various groups of similar-profile energy consumption.
背景:由于人工智能、机器学习和深度学习领域的快速发展,电网正在向多功能、可靠、智能和稳定的智能电网(SG)转变。能源用户的用电量在一天中和一周中的不同日子里都会发生变化。用电量预测对于智能电网的可持续管理和运行至关重要。方法:在这项工作中,目的是应用聚类方法将智能住宅小区划分为几个具有相似特征的能源用户组,从而有效地开发和训练具有代表性的深度神经网络(DNN)模型,用于预测各组用户的电力负荷。DNN 模型由卷积神经网络(CNN)和 LSTM 层组成,分别用于特征提取和序列学习。DNN 在实验中使用了智能电网智慧城市(SGSC)项目数据库,并将其能源用户分为不同的群组。结果:根据所选标准,住宅社区被分为四组用户,其中第 1、2、3 和 4 组分别包含 14%、22%、19% 和 45% 的用户。近一半的居民(45%)在其用电模式中表现出少于 23 个异常值。其余用户被分为三组,在这三组中,针对各自组别开发和训练的专业深度学习模型能够实现更高的预测精度。我们提出的方法的结果将有助于研究人员和公用事业公司,只需较少的专业深度学习模型,就能对属于不同相似能源消耗群体的用户进行准确预测。
{"title":"DBSCAN-based energy users clustering for performance enhancement of deep learning model","authors":"Khursheed Aurangzeb","doi":"10.3233/jifs-235873","DOIUrl":"https://doi.org/10.3233/jifs-235873","url":null,"abstract":"Background:Due to rapid progress in the fields of artificial intelligence, machine learning and deep learning, the power grids are transforming into Smart Grids (SG) which are versatile, reliable, intelligent and stable. The power consumption of the energy users is varying throughout the day as well as in different days of the week. Power consumption forecasting is of vital importance for the sustainable management and operation of SG. Methodology:In this work, the aim is to apply clustering for dividing a smart residential community into several group of similar profile energy user, which will be effective for developing and training representative deep neural network (DNN) models for power load forecasting of users in respective groups. The DNN models is composed of convolutional neural network (CNN) followed by LSTM layers for feature extraction and sequence learning respectively. The DNN For experimentation, the Smart Grid Smart City (SGSC) project database is used and its energy users are grouped into various clusters. Results:The residential community is divided into four groups of customers based on the chosen criterion where Group 1, 2, 3 and 4 contains 14 percent, 22 percent, 19 percent and 45 percent users respectively. Almost half of the population (45 percent) of the considered residential community exhibits less than 23 outliers in their electricity consumption patterns. The rest of the population is divided into three groups, where specialized deep learning models developed and trained for respective groups are able to achieve higher forecasting accuracy. The results of our proposed approach will assist researchers and utility companies by requiring fewer specialized deep-learning models for accurate forecasting of users who belong to various groups of similar-profile energy consumption.","PeriodicalId":54795,"journal":{"name":"Journal of Intelligent & Fuzzy Systems","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2024-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140044840","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 dynamic planning algorithm in accounting information technology administration 在会计信息技术管理中实施动态规划算法
IF 2 4区 计算机科学 Q1 Mathematics Pub Date : 2024-03-05 DOI: 10.3233/jifs-234951
Yuan Gao
Accounting professionals are increasingly being encouraged to shift their focus from conventional accounting to accounting information as a result of new management strategies and ideas. Cybercrime and other attempts to exploit weaknesses in online systems have become more common in recent years. By introducing the concept of cloud computing and analyzing its logical structure, this research applies the technology and design model to the development of an Accounting Information Management System (AIMS). In accounting information technology administration, efficient resource allocation and decision-making are crucial for optimizing financial performance and strategic planning. Algorithms for dynamic planning are a useful tool in meeting these issues. To maximize efficiency in an accounting group’s allocation of resources, this study employs a dynamic planning method called value iteration. The research presented a new Bayesian optimized Restricted Boltzmann machine (BO-RBM) for acquittal IT management. The data set was first gathered and then pre-processed using z-score normalization. Then, an improved genetic algorithm was used to feature selection. After the system’s design and construction are complete, BO-RBM utilizes to both specify the cloud platform’s distributed storage mode and assess the cluster’s performance. The results show that the algorithm may boost financial performance, increase cost management, and accomplish strategic goals in the IT administration of accounting. The research in this study demonstrates that the cloud platform for handling massive amounts of data may accelerate processes and complete tasks quickly.
由于新的管理战略和理念,会计专业人员越来越多地被鼓励将工作重点从传统会计转向会计信息。近年来,网络犯罪和其他试图利用在线系统弱点的行为越来越常见。本研究通过引入云计算的概念并分析其逻辑结构,将技术和设计模型应用于会计信息管理系统(AIMS)的开发。在会计信息技术管理中,高效的资源分配和决策对于优化财务绩效和战略规划至关重要。动态规划算法是解决这些问题的有用工具。为了最大限度地提高会计集团的资源配置效率,本研究采用了一种称为价值迭代的动态规划方法。研究提出了一种新的贝叶斯优化受限玻尔兹曼机(BO-RBM),用于收购 IT 管理。首先收集数据集,然后使用 z 分数归一化进行预处理。然后,使用改进的遗传算法进行特征选择。在系统设计和构建完成后,BO-RBM 用于指定云平台的分布式存储模式和评估集群性能。研究结果表明,该算法可以提高财务绩效,加强成本管理,实现会计信息化管理的战略目标。本研究表明,处理海量数据的云平台可以加快流程,快速完成任务。
{"title":"Implementation of a dynamic planning algorithm in accounting information technology administration","authors":"Yuan Gao","doi":"10.3233/jifs-234951","DOIUrl":"https://doi.org/10.3233/jifs-234951","url":null,"abstract":"Accounting professionals are increasingly being encouraged to shift their focus from conventional accounting to accounting information as a result of new management strategies and ideas. Cybercrime and other attempts to exploit weaknesses in online systems have become more common in recent years. By introducing the concept of cloud computing and analyzing its logical structure, this research applies the technology and design model to the development of an Accounting Information Management System (AIMS). In accounting information technology administration, efficient resource allocation and decision-making are crucial for optimizing financial performance and strategic planning. Algorithms for dynamic planning are a useful tool in meeting these issues. To maximize efficiency in an accounting group’s allocation of resources, this study employs a dynamic planning method called value iteration. The research presented a new Bayesian optimized Restricted Boltzmann machine (BO-RBM) for acquittal IT management. The data set was first gathered and then pre-processed using z-score normalization. Then, an improved genetic algorithm was used to feature selection. After the system’s design and construction are complete, BO-RBM utilizes to both specify the cloud platform’s distributed storage mode and assess the cluster’s performance. The results show that the algorithm may boost financial performance, increase cost management, and accomplish strategic goals in the IT administration of accounting. The research in this study demonstrates that the cloud platform for handling massive amounts of data may accelerate processes and complete tasks quickly.","PeriodicalId":54795,"journal":{"name":"Journal of Intelligent & Fuzzy Systems","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2024-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140044847","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
Robust multi-frequency band joint dictionary learning with low-rank representation 利用低秩表示进行稳健的多频带联合字典学习
IF 2 4区 计算机科学 Q1 Mathematics Pub Date : 2024-02-20 DOI: 10.3233/jifs-233753
Huafeng Ding, Junyan Shang, Guohua Zhou
Emotional state recognition is an important part of emotional research. Compared to non-physiological signals, the electroencephalogram (EEG) signals can truly and objectively reflect a person’s emotional state. To explore the multi-frequency band emotional information and address the noise problemof EEG signals, this paper proposes a robust multi-frequency band joint dictionary learning with low-rank representation (RMBDLL). Based on the dictionary learning, the technologies of sparse and low-rank representation are jointly integrated to reveal the intrinsic connections and discriminative information of EEG multi-frequency band. RMBDLL consists of robust dictionary learning and intra-class/inter-class local constraint learning. In robust dictionary learning part, RMBDLL separates complex noise in EEG signals and establishes clean sub-dictionaries on each frequency band to improve the robustness of the model. In this case, different frequency data obtains the same encoding coefficients according to the consistency of emotional state recognition. In intra-class/inter-class local constraint learning part, RMBDLL introduces a regularization term composed of intra-class and inter-class local constraints, which are constructed from the local structural information of dictionary atoms, resulting in intra-class similarity and inter-class difference of EEG multi-frequency bands. The effectiveness of RMBDLL is verified on the SEED dataset with different noises. The experimental results show that the RMBDLL algorithm can maintain the discriminative local structure in the training samples and achieve good recognition performance on noisy EEG emotion datasets.
情绪状态识别是情绪研究的重要组成部分。与非生理信号相比,脑电图(EEG)信号能真实客观地反映人的情绪状态。为了探索多频段情绪信息并解决脑电信号的噪声问题,本文提出了一种鲁棒多频段低秩表示联合词典学习(RMBDLL)。在字典学习的基础上,将稀疏表示和低秩表示技术相结合,以揭示脑电图多频段的内在联系和鉴别信息。RMBDLL 包括鲁棒字典学习和类内/类间局部约束学习。在鲁棒字典学习部分,RMBDLL 分离脑电信号中的复杂噪声,并在每个频段上建立干净的子字典,以提高模型的鲁棒性。在这种情况下,不同频率的数据会根据情绪状态识别的一致性获得相同的编码系数。在类内/类间局部约束学习部分,RMBDLL 引入了由类内和类间局部约束组成的正则化项,这些局部约束由字典原子的局部结构信息构建而成,从而得到脑电多频段的类内相似性和类间差异。在具有不同噪声的 SEED 数据集上验证了 RMBDLL 的有效性。实验结果表明,RMBDLL 算法能在训练样本中保持局部结构的区分性,并在有噪声的脑电情绪数据集上取得良好的识别性能。
{"title":"Robust multi-frequency band joint dictionary learning with low-rank representation","authors":"Huafeng Ding, Junyan Shang, Guohua Zhou","doi":"10.3233/jifs-233753","DOIUrl":"https://doi.org/10.3233/jifs-233753","url":null,"abstract":"Emotional state recognition is an important part of emotional research. Compared to non-physiological signals, the electroencephalogram (EEG) signals can truly and objectively reflect a person’s emotional state. To explore the multi-frequency band emotional information and address the noise problemof EEG signals, this paper proposes a robust multi-frequency band joint dictionary learning with low-rank representation (RMBDLL). Based on the dictionary learning, the technologies of sparse and low-rank representation are jointly integrated to reveal the intrinsic connections and discriminative information of EEG multi-frequency band. RMBDLL consists of robust dictionary learning and intra-class/inter-class local constraint learning. In robust dictionary learning part, RMBDLL separates complex noise in EEG signals and establishes clean sub-dictionaries on each frequency band to improve the robustness of the model. In this case, different frequency data obtains the same encoding coefficients according to the consistency of emotional state recognition. In intra-class/inter-class local constraint learning part, RMBDLL introduces a regularization term composed of intra-class and inter-class local constraints, which are constructed from the local structural information of dictionary atoms, resulting in intra-class similarity and inter-class difference of EEG multi-frequency bands. The effectiveness of RMBDLL is verified on the SEED dataset with different noises. The experimental results show that the RMBDLL algorithm can maintain the discriminative local structure in the training samples and achieve good recognition performance on noisy EEG emotion datasets.","PeriodicalId":54795,"journal":{"name":"Journal of Intelligent & Fuzzy Systems","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2024-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140197203","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
Investigation on distributed scheduling with lot-streaming considering setup time based on NSGA-II in a furniture intelligent manufacturing 基于 NSGA-II 的家具智能制造中考虑设置时间的批量流分布式排产研究
IF 2 4区 计算机科学 Q1 Mathematics Pub Date : 2024-02-19 DOI: 10.3233/jifs-237378
Jinxin Wang, Zhanwen Wu, Longzhi Yang, Wei Hu, Chaojun Song, Zhaolong Zhu, Xiaolei Guo, Pingxiang Cao
Distributed flexible flowshop scheduling is getting more important in the large-scale panel furniture industry. It is vital for a higher manufacturing efficiency and economic profit. The distributed scheduling problem with lot-streaming in a flexible flow shop environment is investigated in this work. Furthermore, the actual constraints of packaging collaborative and machine setup times are considered in the proposed approach. The average order waiting time for packaging and average order delay rate is used as objectives. Non-dominated sorting method is used to handle this bi-objective optimization problem. An improved encoding method was proposed to address the large-scale orders that need to be divided into sub-lots based on genetic algorithm. The proposed approach is firstly validated by benchmark with other multi-objectives evolutionary algorithms. The results found that the proposed approach had a good convergence and diversity. Besides, the influence of the proportion of large-scale orders priority level and sub-lot size was investigated in a panel furniture manufacturing scenario. The results can be concluded that the enterprise could obtain shorter order average waiting time and delay rate when the sub-lot sizes were set as two and the order priority level was allocated in the proportion of 1:2:3:4:5.
在大型板式家具行业中,分布式柔性流水作业调度变得越来越重要。这对提高生产效率和经济利润至关重要。本研究探讨了柔性流动车间环境下的批量流分布式排产问题。此外,所提出的方法还考虑了包装协作和机器设置时间的实际约束。包装的平均订单等待时间和平均订单延迟率被用作目标。采用非支配排序法来处理这个双目标优化问题。针对需要基于遗传算法划分为子批次的大规模订单,提出了一种改进的编码方法。提出的方法首先与其他多目标进化算法进行了基准验证。结果发现,所提出的方法具有良好的收敛性和多样性。此外,在板式家具制造场景中,研究了大型订单优先级比例和子批量大小的影响。结果表明,当子批量设定为两个,订单优先级按 1:2:3:4:5 的比例分配时,企业可以获得更短的订单平均等待时间和延迟率。
{"title":"Investigation on distributed scheduling with lot-streaming considering setup time based on NSGA-II in a furniture intelligent manufacturing","authors":"Jinxin Wang, Zhanwen Wu, Longzhi Yang, Wei Hu, Chaojun Song, Zhaolong Zhu, Xiaolei Guo, Pingxiang Cao","doi":"10.3233/jifs-237378","DOIUrl":"https://doi.org/10.3233/jifs-237378","url":null,"abstract":"Distributed flexible flowshop scheduling is getting more important in the large-scale panel furniture industry. It is vital for a higher manufacturing efficiency and economic profit. The distributed scheduling problem with lot-streaming in a flexible flow shop environment is investigated in this work. Furthermore, the actual constraints of packaging collaborative and machine setup times are considered in the proposed approach. The average order waiting time for packaging and average order delay rate is used as objectives. Non-dominated sorting method is used to handle this bi-objective optimization problem. An improved encoding method was proposed to address the large-scale orders that need to be divided into sub-lots based on genetic algorithm. The proposed approach is firstly validated by benchmark with other multi-objectives evolutionary algorithms. The results found that the proposed approach had a good convergence and diversity. Besides, the influence of the proportion of large-scale orders priority level and sub-lot size was investigated in a panel furniture manufacturing scenario. The results can be concluded that the enterprise could obtain shorter order average waiting time and delay rate when the sub-lot sizes were set as two and the order priority level was allocated in the proportion of 1:2:3:4:5.","PeriodicalId":54795,"journal":{"name":"Journal of Intelligent & Fuzzy Systems","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2024-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140197206","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
A text extraction framework of financial report in traditional format with OpenCV 利用 OpenCV 对传统格式财务报告进行文本提取的框架
IF 2 4区 计算机科学 Q1 Mathematics Pub Date : 2024-02-17 DOI: 10.3233/jifs-234170
Jiaxin Wei, Jin Yang, Xinyang Liu
Due to intensified off-balance sheet disclosure by regulatory authorities, financial reports now contain a substantial amount of information beyond the financial statements. Consequently, the length of footnotes in financial reports exceeds that of the financial statements. This poses a novel challenge for regulators and users of financial reports in efficiently managing this information. Financial reports, with their clear structure, encompass abundant structured information applicable to information extraction, automatic summarization, and information retrieval. Extracting headings and paragraph content from financial reports enables the acquisition of the annual report text’s framework. This paper focuses on extracting the structural framework of annual report texts and introduces an OpenCV-based method for text framework extraction using computer vision. The proposed method employs morphological image dilation to distinguish headings from the main body of the text. Moreover, this paper combines the proposed method with a traditional, rule-based extraction method that exploits the characteristic features of numbers and symbols at the beginning of headings. This combination results in an optimized framework extraction method, producing a more concise text framework.
由于监管机构加强了资产负债表外的信息披露,财务报告现在包含了大量财务报表以外的信息。因此,财务报告脚注的长度超过了财务报表的长度。这对监管机构和财务报告用户有效管理这些信息提出了新的挑战。财务报告结构清晰,包含大量适用于信息提取、自动汇总和信息检索的结构化信息。从财务报告中提取标题和段落内容可以获取年度报告文本的框架。本文以提取年报文本的结构框架为重点,介绍了一种基于 OpenCV 的计算机视觉文本框架提取方法。该方法采用形态学图像扩张技术来区分标题和正文。此外,本文还将提出的方法与传统的基于规则的提取方法相结合,后者利用了标题开头数字和符号的特征。这种结合产生了一种优化的框架提取方法,产生了一种更简洁的文本框架。
{"title":"A text extraction framework of financial report in traditional format with OpenCV","authors":"Jiaxin Wei, Jin Yang, Xinyang Liu","doi":"10.3233/jifs-234170","DOIUrl":"https://doi.org/10.3233/jifs-234170","url":null,"abstract":"Due to intensified off-balance sheet disclosure by regulatory authorities, financial reports now contain a substantial amount of information beyond the financial statements. Consequently, the length of footnotes in financial reports exceeds that of the financial statements. This poses a novel challenge for regulators and users of financial reports in efficiently managing this information. Financial reports, with their clear structure, encompass abundant structured information applicable to information extraction, automatic summarization, and information retrieval. Extracting headings and paragraph content from financial reports enables the acquisition of the annual report text’s framework. This paper focuses on extracting the structural framework of annual report texts and introduces an OpenCV-based method for text framework extraction using computer vision. The proposed method employs morphological image dilation to distinguish headings from the main body of the text. Moreover, this paper combines the proposed method with a traditional, rule-based extraction method that exploits the characteristic features of numbers and symbols at the beginning of headings. This combination results in an optimized framework extraction method, producing a more concise text framework.","PeriodicalId":54795,"journal":{"name":"Journal of Intelligent & Fuzzy Systems","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2024-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140197067","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
Multi-attribute decision-making analysis based on the bipolar N-soft PROMETHEE method 基于双极 N 软 PROMETHEE 法的多属性决策分析
IF 2 4区 计算机科学 Q1 Mathematics Pub Date : 2024-02-17 DOI: 10.3233/jifs-236404
Xiao-Guang Zhou, Ya-Nan Chen, Jia-Xi Ji
The multi-attribute decision-making (MADM) methods can deeply mine hidden information in data and make a more reliable decision with actual needs and human cognition. For this reason, this paper proposes the bipolar N-soft PROMETHEE (preference ranking organization method for enrichment of evaluation) method. The method fully embodies the advantages of the PROMETHEE method, which can limit the unconditional compensation between attribute values and effectively reflect the priority between attribute values. Further, by introducing an attribute threshold to filter research objects, the proposed method not only dramatically reduces the amount of computation but also considers the impact of the size of the attribute value itself on decision-making. Secondly, the paper proposes the concepts of attribute praise, attribute popularity, total praise, and total popularity for the first time, fully mining information from bipolar N-soft sets, which can effectively handle situations where attribute values have different orders of magnitude. In addition, this paper presents the decision-making process of the new method, closely integrating theoretical models with real life. Finally, this paper analyses and compares the proposed method with the existing ones, further verifying the effectiveness and flexibility of the proposed method.
多属性决策(MADM)方法可以深入挖掘数据中隐藏的信息,并结合实际需求和人类认知做出更可靠的决策。为此,本文提出了双极 N 软 PROMETHEE(丰富评价的偏好排序组织法)方法。该方法充分体现了 PROMETHEE 方法的优点,可以限制属性值之间的无条件补偿,有效反映属性值之间的优先级。此外,通过引入属性阈值来筛选研究对象,该方法不仅大大减少了计算量,还考虑了属性值本身的大小对决策的影响。其次,本文首次提出了属性好评度、属性受欢迎度、总好评度和总受欢迎度的概念,充分挖掘了双极性 N 软集的信息,可以有效处理属性值具有不同数量级的情况。此外,本文还介绍了新方法的决策过程,将理论模型与实际生活紧密结合。最后,本文对所提出的方法与现有方法进行了分析和比较,进一步验证了所提出方法的有效性和灵活性。
{"title":"Multi-attribute decision-making analysis based on the bipolar N-soft PROMETHEE method","authors":"Xiao-Guang Zhou, Ya-Nan Chen, Jia-Xi Ji","doi":"10.3233/jifs-236404","DOIUrl":"https://doi.org/10.3233/jifs-236404","url":null,"abstract":"The multi-attribute decision-making (MADM) methods can deeply mine hidden information in data and make a more reliable decision with actual needs and human cognition. For this reason, this paper proposes the bipolar N-soft PROMETHEE (preference ranking organization method for enrichment of evaluation) method. The method fully embodies the advantages of the PROMETHEE method, which can limit the unconditional compensation between attribute values and effectively reflect the priority between attribute values. Further, by introducing an attribute threshold to filter research objects, the proposed method not only dramatically reduces the amount of computation but also considers the impact of the size of the attribute value itself on decision-making. Secondly, the paper proposes the concepts of attribute praise, attribute popularity, total praise, and total popularity for the first time, fully mining information from bipolar N-soft sets, which can effectively handle situations where attribute values have different orders of magnitude. In addition, this paper presents the decision-making process of the new method, closely integrating theoretical models with real life. Finally, this paper analyses and compares the proposed method with the existing ones, further verifying the effectiveness and flexibility of the proposed method.","PeriodicalId":54795,"journal":{"name":"Journal of Intelligent & Fuzzy Systems","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2024-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140197239","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
Interval-valued pre-(quasi-)grouping functions and its application in constructing interval-valued directional monotonic fuzzy implications 区间值预(准)分组函数及其在构建区间值定向单调模糊蕴涵中的应用
IF 2 4区 计算机科学 Q1 Mathematics Pub Date : 2024-02-16 DOI: 10.3233/jifs-233318
Peng Yu, Huxiong Song, Hui Liu
How to expand the variable domain and monotonicity of aggregation functions to generate new aggregation functions is an important research content in aggregation functions. In this work, the concept of interval-valued pre-(quasi-)grouping functions is given by relaxing the interval monotonicity ofinterval-valued (quasi-)grouping functions to interval directional monotonicity. Then, some basic properties of interval-valued pre-(quasi-)grouping functions and the relationship between interval-valued pre-(quasi-)grouping functions and pre-(quasi-)grouping functions are presented. Accordingly, several construction methods of interval-valued pre-(quasi-)grouping functions are proposed. Finally, the concept of (IG,IN)-interval-valued directional monotonic fuzzy implications and QL-interval-valued directional monotonic operations are introduced on the basis of interval-valued pre-(quasi-)grouping functions IG, interval-valued overlap functions IO and interval-valued fuzzy negations IN. In addition, related studies were conducted on the basic properties of (IG,IN)-interval-valued directional monotonic fuzzy implications and QL-interval-valued directional monotonic operations.
如何扩展聚合函数的变域和单调性以生成新的聚合函数,是聚合函数的一个重要研究内容。本文通过将区间值前(准)分组函数的区间单调性放宽为区间方向单调性,给出了区间值前(准)分组函数的概念。然后,介绍了区间值预(准)分组函数的一些基本性质以及区间值预(准)分组函数与预(准)分组函数之间的关系。相应地,提出了几种区间值前(准)分组函数的构造方法。最后,在区间值前(准)分组函数 IG、区间值重叠函数 IO 和区间值模糊否定 IN 的基础上,引入了 (IG,IN) -区间值定向单调模糊蕴涵和 QL -区间值定向单调运算的概念。此外,还对(IG,IN)-区间值方向单调模糊蕴涵和 QL-区间值方向单调运算的基本性质进行了相关研究。
{"title":"Interval-valued pre-(quasi-)grouping functions and its application in constructing interval-valued directional monotonic fuzzy implications","authors":"Peng Yu, Huxiong Song, Hui Liu","doi":"10.3233/jifs-233318","DOIUrl":"https://doi.org/10.3233/jifs-233318","url":null,"abstract":"How to expand the variable domain and monotonicity of aggregation functions to generate new aggregation functions is an important research content in aggregation functions. In this work, the concept of interval-valued pre-(quasi-)grouping functions is given by relaxing the interval monotonicity ofinterval-valued (quasi-)grouping functions to interval directional monotonicity. Then, some basic properties of interval-valued pre-(quasi-)grouping functions and the relationship between interval-valued pre-(quasi-)grouping functions and pre-(quasi-)grouping functions are presented. Accordingly, several construction methods of interval-valued pre-(quasi-)grouping functions are proposed. Finally, the concept of (IG,IN)\u0000-interval-valued directional monotonic fuzzy implications and QL\u0000-interval-valued directional monotonic operations are introduced on the basis of interval-valued pre-(quasi-)grouping functions IG\u0000, interval-valued overlap functions IO and interval-valued fuzzy negations IN. In addition, related studies were conducted on the basic properties of (IG,IN)\u0000-interval-valued directional monotonic fuzzy implications and QL\u0000-interval-valued directional monotonic operations.","PeriodicalId":54795,"journal":{"name":"Journal of Intelligent & Fuzzy Systems","volume":null,"pages":null},"PeriodicalIF":2.0,"publicationDate":"2024-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140197204","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
Long-term and short-term rainfall forecasting using deep neural network optimized with flamingo search optimization algorithm 利用火烈鸟搜索优化算法优化的深度神经网络进行长期和短期降雨预报
4区 计算机科学 Q1 Mathematics Pub Date : 2023-11-10 DOI: 10.3233/jifs-235798
S. Vidya, Veeraraghavan Jagannathan, T. Guhan, Jogendra Kumar
Rainfall forecasting is essential because heavy and irregular rainfall creates many impacts like destruction of crops and farms. Here, the occurrence of rainfall is highly related to atmospheric parameters. Thus, a better forecasting model is essential for an early warning that can minimize risks and manage the agricultural farms in a better way. In this manuscript, Deep Neural Network (DNN) optimized with Flamingo Search Optimization Algorithm (FSOA) is proposed for Long-term and Short-term Rainfall forecasting. Here, the rainfall data is obtained from the standard dataset as Sudheerachary India Rainfall Analysis (IRA). Moreover, the Morphological filtering and Extended Empirical wavelet transformation (MFEEWT) approach is utilized for pre-processing process. Also, the deep neural network is utilized for performing rainfall prediction and classification. Additionally, the parameters of the DNN model is optimizing by Flamingo Search Optimization Algorithm. Finally, the proposed MFEEWT-DNN- FSOA approach has effectively predict the rainfall in different locations around India. The proposed model is implemented in Python tool and the performance metrics are calculated. The proposed MFEEWT-DNN- FSOA approach has achieved 25%, 26%, 25.5% high accuracy and 35.8%, 24.7%, 15.9% lower error rate for forecasting rainfall in Cannur at Kerala than the existing Map-Reduce based Exponential Smoothing Technology for rainfall prediction (MR-EST-RP), modular artificial neural networks with support vector regression for rainfall prediction (MANN-SVR-RP), and biogeography-based extreme learning machine (BBO-ELM) (BBO-ELM-RP) methods respectively.
降雨预报是必不可少的,因为强降雨和不规则降雨会造成许多影响,比如破坏庄稼和农场。在这里,降雨的发生与大气参数高度相关。因此,一个更好的预测模型对于早期预警至关重要,可以最大限度地降低风险并更好地管理农场。本文提出了基于火烈鸟搜索优化算法(FSOA)优化的深度神经网络(DNN)用于长期和短期降雨预报。这里的降雨数据来自Sudheerachary India rainfall Analysis (IRA)的标准数据集。利用形态滤波和扩展经验小波变换(MFEEWT)方法进行预处理。同时,利用深度神经网络进行降雨预测和分类。此外,采用火烈鸟搜索优化算法对DNN模型的参数进行优化。最后,提出的MFEEWT-DNN- FSOA方法有效地预测了印度不同地点的降雨量。在Python工具中实现了所提出的模型,并计算了性能指标。MFEEWT-DNN- FSOA预测喀拉拉邦卡纳尔邦降雨的准确率分别比现有的基于Map-Reduce的指数平滑预测技术(MR-EST-RP)、支持向量回归的模块化人工神经网络(MANN-SVR-RP)和基于生物地理的极限学习机(BBO-ELM- rp)方法提高了25%、26%、25.5%,错误率分别降低了35.8%、24.7%、15.9%。
{"title":"Long-term and short-term rainfall forecasting using deep neural network optimized with flamingo search optimization algorithm","authors":"S. Vidya, Veeraraghavan Jagannathan, T. Guhan, Jogendra Kumar","doi":"10.3233/jifs-235798","DOIUrl":"https://doi.org/10.3233/jifs-235798","url":null,"abstract":"Rainfall forecasting is essential because heavy and irregular rainfall creates many impacts like destruction of crops and farms. Here, the occurrence of rainfall is highly related to atmospheric parameters. Thus, a better forecasting model is essential for an early warning that can minimize risks and manage the agricultural farms in a better way. In this manuscript, Deep Neural Network (DNN) optimized with Flamingo Search Optimization Algorithm (FSOA) is proposed for Long-term and Short-term Rainfall forecasting. Here, the rainfall data is obtained from the standard dataset as Sudheerachary India Rainfall Analysis (IRA). Moreover, the Morphological filtering and Extended Empirical wavelet transformation (MFEEWT) approach is utilized for pre-processing process. Also, the deep neural network is utilized for performing rainfall prediction and classification. Additionally, the parameters of the DNN model is optimizing by Flamingo Search Optimization Algorithm. Finally, the proposed MFEEWT-DNN- FSOA approach has effectively predict the rainfall in different locations around India. The proposed model is implemented in Python tool and the performance metrics are calculated. The proposed MFEEWT-DNN- FSOA approach has achieved 25%, 26%, 25.5% high accuracy and 35.8%, 24.7%, 15.9% lower error rate for forecasting rainfall in Cannur at Kerala than the existing Map-Reduce based Exponential Smoothing Technology for rainfall prediction (MR-EST-RP), modular artificial neural networks with support vector regression for rainfall prediction (MANN-SVR-RP), and biogeography-based extreme learning machine (BBO-ELM) (BBO-ELM-RP) methods respectively.","PeriodicalId":54795,"journal":{"name":"Journal of Intelligent & Fuzzy Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135136368","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
Spin orbit magnetic random access memory based binary CNN in-memory accelerator (BIMA) with sense amplifier 基于自旋轨道磁随机存取存储器的二进制CNN内存加速器(BIMA)
4区 计算机科学 Q1 Mathematics Pub Date : 2023-11-10 DOI: 10.3233/jifs-223898
K. Kalaichelvi, M. Sundaram, P. Sanmugavalli
The research tends to suggest a spin-orbit torque magnetic random access memory (SOT-MRAM)-based Binary CNN In-Memory Accelerator (BIMA) to minimize power utilization and suggests an In-Memory Computing (IMC) for AdderNet-based BIMA to further enhance performance by fully utilizing the benefits of IMC as well as a low current consumption configuration employing SOT-MRAM. And recommended an IMC-friendly computation pipeline for AdderNet convolution at the algorithm level. Additionally, the suggested sense amplifier is not only capable of the addition operation but also typical Boolean operations including subtraction etc. The architecture suggested in this research consumes less power than its spin-orbit torque (STT) MRAM and resistive random access memory (ReRAM)-based counterparts in the Modified National Institute of Standards and Technology (MNIST) data set, according to simulation results. Based to evaluation outcomes, the pre-sented strategy outperforms the in-memory accelerator in terms of speedup and energy efficiency by 17.13× and 18.20×, respectively.
该研究倾向于提出一种基于自旋轨道转矩磁随机存取存储器(SOT-MRAM)的二进制CNN内存加速器(BIMA),以最大限度地降低功耗,并建议基于addernet的BIMA的内存计算(IMC),以进一步提高性能,充分利用IMC的优势以及采用SOT-MRAM的低电流消耗配置。并在算法层面推荐了一种适合imc的AdderNet卷积计算管道。此外,所建议的感测放大器不仅能够进行加法运算,还能够进行典型的布尔运算,包括减法等。根据仿真结果,本研究中提出的架构比其自旋轨道扭矩(STT) MRAM和基于电阻随机存取存储器(ReRAM)的修改国家标准与技术研究所(MNIST)数据集中的对偶功耗更低。根据评估结果,该策略在加速和能效方面分别优于内存加速器17.13倍和18.20倍。
{"title":"Spin orbit magnetic random access memory based binary CNN in-memory accelerator (BIMA) with sense amplifier","authors":"K. Kalaichelvi, M. Sundaram, P. Sanmugavalli","doi":"10.3233/jifs-223898","DOIUrl":"https://doi.org/10.3233/jifs-223898","url":null,"abstract":"The research tends to suggest a spin-orbit torque magnetic random access memory (SOT-MRAM)-based Binary CNN In-Memory Accelerator (BIMA) to minimize power utilization and suggests an In-Memory Computing (IMC) for AdderNet-based BIMA to further enhance performance by fully utilizing the benefits of IMC as well as a low current consumption configuration employing SOT-MRAM. And recommended an IMC-friendly computation pipeline for AdderNet convolution at the algorithm level. Additionally, the suggested sense amplifier is not only capable of the addition operation but also typical Boolean operations including subtraction etc. The architecture suggested in this research consumes less power than its spin-orbit torque (STT) MRAM and resistive random access memory (ReRAM)-based counterparts in the Modified National Institute of Standards and Technology (MNIST) data set, according to simulation results. Based to evaluation outcomes, the pre-sented strategy outperforms the in-memory accelerator in terms of speedup and energy efficiency by 17.13× and 18.20×, respectively.","PeriodicalId":54795,"journal":{"name":"Journal of Intelligent & Fuzzy Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135137220","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
期刊
Journal of Intelligent & Fuzzy Systems
全部 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