首页 > 最新文献

Big Data最新文献

英文 中文
Balancing Protection and Quality in Big Data Analytics Pipelines. 在大数据分析管道中平衡保护与质量。
IF 4.6 4区 计算机科学 Q1 Computer Science Pub Date : 2024-04-11 DOI: 10.1089/big.2023.0065
Antongiacomo Polimeno, P. Mignone, Chiara Braghin, M. Anisetti, Michelangelo Ceci, D. Malerba, C. Ardagna
Existing data engine implementations do not properly manage the conflict between the need of protecting and sharing data, which is hampering the spread of big data applications and limiting their impact. These two requirements have often been studied and defined independently, leading to a conceptual and technological misalignment. This article presents the architecture and technical implementation of a data engine addressing this conflict by integrating a new governance solution based on access control within a big data analytics pipeline. Our data engine enriches traditional components for data governance with an access control system that enforces access to data in a big data environment based on data transformations. Data are then used along the pipeline only after sanitization, protecting sensitive attributes before their usage, in an effort to facilitate the balance between protection and quality. The solution was tested in a real-world smart city scenario using the data of the Oslo city transportation system. Specifically, we compared the different predictive models trained with the data views obtained by applying the secure transformations required by different user roles to the same data set. The results show that the predictive models, built on data manipulated according to access control policies, are still effective.
现有的数据引擎实施方案没有妥善处理数据保护需求与数据共享需求之间的冲突,这阻碍了大数据应用的推广并限制了其影响力。这两种需求往往是独立研究和定义的,导致概念和技术上的错位。本文介绍了数据引擎的架构和技术实现,通过在大数据分析管道中集成基于访问控制的新治理解决方案来解决这一矛盾。我们的数据引擎利用访问控制系统丰富了数据治理的传统组件,该系统可根据数据转换在大数据环境中强制访问数据。数据只有在经过净化后才能在管道中使用,在使用前保护敏感属性,以促进保护和质量之间的平衡。我们利用奥斯陆城市交通系统的数据,在现实世界的智慧城市场景中对该解决方案进行了测试。具体来说,我们比较了通过对同一数据集应用不同用户角色所需的安全转换而获得的数据视图所训练的不同预测模型。结果表明,根据访问控制策略对数据进行处理后建立的预测模型仍然有效。
{"title":"Balancing Protection and Quality in Big Data Analytics Pipelines.","authors":"Antongiacomo Polimeno, P. Mignone, Chiara Braghin, M. Anisetti, Michelangelo Ceci, D. Malerba, C. Ardagna","doi":"10.1089/big.2023.0065","DOIUrl":"https://doi.org/10.1089/big.2023.0065","url":null,"abstract":"Existing data engine implementations do not properly manage the conflict between the need of protecting and sharing data, which is hampering the spread of big data applications and limiting their impact. These two requirements have often been studied and defined independently, leading to a conceptual and technological misalignment. This article presents the architecture and technical implementation of a data engine addressing this conflict by integrating a new governance solution based on access control within a big data analytics pipeline. Our data engine enriches traditional components for data governance with an access control system that enforces access to data in a big data environment based on data transformations. Data are then used along the pipeline only after sanitization, protecting sensitive attributes before their usage, in an effort to facilitate the balance between protection and quality. The solution was tested in a real-world smart city scenario using the data of the Oslo city transportation system. Specifically, we compared the different predictive models trained with the data views obtained by applying the secure transformations required by different user roles to the same data set. The results show that the predictive models, built on data manipulated according to access control policies, are still effective.","PeriodicalId":51314,"journal":{"name":"Big Data","volume":null,"pages":null},"PeriodicalIF":4.6,"publicationDate":"2024-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140713991","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
Image Smart Segmentation Analysis Against Diabetic Foot Ulcer Using Internet of Things with Virtual Sensing. 利用虚拟传感物联网对糖尿病足溃疡进行图像智能分割分析。
IF 4.6 4区 计算机科学 Q1 Computer Science Pub Date : 2024-04-01 Epub Date: 2023-06-08 DOI: 10.1089/big.2022.0283
Chandu Thota, Dinesh Jackson Samuel, Mustafa Musa Jaber, M M Kamruzzaman, Renjith V Ravi, Lydia J Gnanasigamani, R Premalatha

Diabetic foot ulcer (DFU) is a problem worldwide, and prevention is crucial. The image segmentation analysis of DFU identification plays a significant role. This will produce different segmentation of the same idea, incomplete, imprecise, and other problems. To address these issues, a method of image segmentation analysis of DFU through internet of things with the technique of virtual sensing for semantically similar objects, the analysis of four levels of range segmentation (region-based, edge-based, image-based, and computer-aided design-based range segmentation) for deeper segmentation of images is implemented. In this study, the multimodal is compressed with the object co-segmentation for semantical segmentation. The result is predicting the better validity and reliability assessment. The experimental results demonstrate that the proposed model can efficiently perform segmentation analysis, with a lower error rate, than the existing methodologies. The findings on the multiple-image dataset show that DFU obtains an average segmentation score of 90.85% and 89.03% correspondingly in two types of labeled ratios before DFU with virtual sensing and after DFU without virtual sensing (i.e., 25% and 30%), which is an increase of 10.91% and 12.22% over the previous best results. In live DFU studies, our proposed system improved by 59.1% compared with existing deep segmentation-based techniques and its average image smart segmentation improvements over its contemporaries are 15.06%, 23.94%, and 45.41%, respectively. Proposed range-based segmentation achieves interobserver reliability by 73.9% on the positive test namely likelihood ratio test set with only a 0.25 million parameters at the pace of labeled data.

糖尿病足溃疡(DFU)是一个世界性问题,预防至关重要。DFU 识别的图像分割分析起着重要作用。然而,目前对 DFU 的图像分割分析还存在一定的局限性,会产生同一概念的不同分割、不完整、不精确等问题。为解决这些问题,本文提出了一种通过物联网对 DFU 进行图像分割分析的方法,该方法利用虚拟传感技术对语义相似的物体进行分割,通过四个层次的范围分割分析(基于区域的范围分割、基于边缘的范围分割、基于图像的范围分割和基于计算机辅助设计的范围分割)对图像进行更深层次的分割。在本研究中,多模态压缩与对象共分割用于语义分割。结果预测了更好的有效性和可靠性评估。实验结果表明,与现有方法相比,所提出的模型能有效地进行分割分析,且错误率较低。对多图像数据集的研究结果表明,在有虚拟传感的 DFU 之前和无虚拟传感的 DFU 之后(即 25% 和 30%),DFU 在两类标注比例下分别获得了 90.85% 和 89.03% 的平均分割得分,比之前的最佳结果分别提高了 10.91% 和 12.22%。在实时 DFU 研究中,与现有的基于深度分割的技术相比,我们提出的系统提高了 59.1%,其平均图像智能分割改进率分别为 15.06%、23.94% 和 45.41%。在正向测试即似然比测试集上,拟议的基于范围的分割技术在标注数据的速度上只需 25 万个参数,就能实现 73.9% 的观察者间可靠性。
{"title":"Image Smart Segmentation Analysis Against Diabetic Foot Ulcer Using Internet of Things with Virtual Sensing.","authors":"Chandu Thota, Dinesh Jackson Samuel, Mustafa Musa Jaber, M M Kamruzzaman, Renjith V Ravi, Lydia J Gnanasigamani, R Premalatha","doi":"10.1089/big.2022.0283","DOIUrl":"10.1089/big.2022.0283","url":null,"abstract":"<p><p>Diabetic foot ulcer (DFU) is a problem worldwide, and prevention is crucial. The image segmentation analysis of DFU identification plays a significant role. This will produce different segmentation of the same idea, incomplete, imprecise, and other problems. To address these issues, a method of image segmentation analysis of DFU through internet of things with the technique of virtual sensing for semantically similar objects, the analysis of four levels of range segmentation (region-based, edge-based, image-based, and computer-aided design-based range segmentation) for deeper segmentation of images is implemented. In this study, the multimodal is compressed with the object co-segmentation for semantical segmentation. The result is predicting the better validity and reliability assessment. The experimental results demonstrate that the proposed model can efficiently perform segmentation analysis, with a lower error rate, than the existing methodologies. The findings on the multiple-image dataset show that DFU obtains an average segmentation score of 90.85% and 89.03% correspondingly in two types of labeled ratios before DFU with virtual sensing and after DFU without virtual sensing (i.e., 25% and 30%), which is an increase of 10.91% and 12.22% over the previous best results. In live DFU studies, our proposed system improved by 59.1% compared with existing deep segmentation-based techniques and its average image smart segmentation improvements over its contemporaries are 15.06%, 23.94%, and 45.41%, respectively. Proposed range-based segmentation achieves interobserver reliability by 73.9% on the positive test namely likelihood ratio test set with only a 0.25 million parameters at the pace of labeled data.</p>","PeriodicalId":51314,"journal":{"name":"Big Data","volume":null,"pages":null},"PeriodicalIF":4.6,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"9595875","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
An Intelligent Channel Estimation Algorithm Based on Extended Model for 5G-V2X. 基于 5G-V2X 扩展模型的智能信道估计算法。
IF 4.6 4区 计算机科学 Q1 Computer Science Pub Date : 2024-04-01 Epub Date: 2023-02-27 DOI: 10.1089/big.2022.0029
Jie Huang, Cheng Xu, Zhaohua Ji, Shan Xiao, Teng Liu, Nan Ma, Qinghui Zhou

Car networking systems based on 5G-V2X (vehicle-to-everything) have high requirements for reliability and low-latency communication to further improve communication performance. In the V2X scenario, this article establishes an extended model (basic expansion model) suitable for high-speed mobile scenarios based on the sparsity of the channel impulse response. And propose a channel estimation algorithm based on deep learning, the method designed a multilayer convolutional neural network to complete frequency domain interpolation. A two-way control cycle gating unit (bidirectional gated recurrent unit) is designed to predict the state in the time domain. And introduce speed parameters and multipath parameters to accurately train channel data under different moving speed environments. System simulation shows that the proposed algorithm can accurately train the number of channels. Compared with the traditional car networking channel estimation algorithm, the proposed algorithm improves the accuracy of channel estimation and effectively reduces the bit error rate.

基于 5G-V2X(车到万物)的车联网系统对可靠性和低延迟通信有很高的要求,以进一步提高通信性能。在V2X场景下,本文基于信道脉冲响应的稀疏性,建立了适用于高速移动场景的扩展模型(基本扩展模型)。并提出一种基于深度学习的信道估计算法,该方法设计了一个多层卷积神经网络来完成频域插值。设计了一个双向控制周期门控单元(双向门控递归单元)来预测时域中的状态。并引入速度参数和多径参数,精确训练不同移动速度环境下的信道数据。系统仿真表明,所提出的算法可以精确训练信道数。与传统车联网信道估计算法相比,提出的算法提高了信道估计的准确性,有效降低了误码率。
{"title":"An Intelligent Channel Estimation Algorithm Based on Extended Model for 5G-V2X.","authors":"Jie Huang, Cheng Xu, Zhaohua Ji, Shan Xiao, Teng Liu, Nan Ma, Qinghui Zhou","doi":"10.1089/big.2022.0029","DOIUrl":"10.1089/big.2022.0029","url":null,"abstract":"<p><p>Car networking systems based on 5G-V2X (vehicle-to-everything) have high requirements for reliability and low-latency communication to further improve communication performance. In the V2X scenario, this article establishes an extended model (basic expansion model) suitable for high-speed mobile scenarios based on the sparsity of the channel impulse response. And propose a channel estimation algorithm based on deep learning, the method designed a multilayer convolutional neural network to complete frequency domain interpolation. A two-way control cycle gating unit (bidirectional gated recurrent unit) is designed to predict the state in the time domain. And introduce speed parameters and multipath parameters to accurately train channel data under different moving speed environments. System simulation shows that the proposed algorithm can accurately train the number of channels. Compared with the traditional car networking channel estimation algorithm, the proposed algorithm improves the accuracy of channel estimation and effectively reduces the bit error rate.</p>","PeriodicalId":51314,"journal":{"name":"Big Data","volume":null,"pages":null},"PeriodicalIF":4.6,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"9328213","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
Preemptive Epidemic Information Transmission Model Using Nonreplication Edge Node Connectivity in Health Care Networks. 在医疗网络中使用无复制边缘节点连接的抢先式流行病信息传输模型
IF 4.6 4区 计算机科学 Q1 Computer Science Pub Date : 2024-04-01 Epub Date: 2023-04-19 DOI: 10.1089/big.2022.0278
Chandu Thota, Constandinos X Mavromoustakis, George Mastorakis

The reliability in medical data organization and transmission is eased with the inheritance of information and communication technologies in recent years. The growth of digital communication and sharing medium imposes the necessity for optimizing the accessibility and transmission of sensitive medical data to the end-users. In this article, the Preemptive Information Transmission Model (PITM) is introduced for improving the promptness in medical data delivery. This transmission model is designed to acquire the least communication in an epidemic region for seamless information availability. The proposed model makes use of a noncyclic connection procedure and preemptive forwarding inside and outside the epidemic region. The first is responsible for replication-less connection maximization ensuring better availability of the edge nodes. The connection replications are reduced using the pruning tree classifiers based on the communication time and delivery balancing factor. The later process is responsible for the reliable forwarding of the acquired data using a conditional selection of the infrastructure units. Both the processes of PITM are accountable for improving the delivery of observed medical data, over better transmissions, communication time, and achieving fewer delays.

近年来,随着信息和通信技术的发展,医疗数据组织和传输的可靠性得到了提高。随着数字通信和共享媒介的发展,有必要优化敏感医疗数据对终端用户的访问和传输。本文介绍了抢先信息传输模型(PITM),以提高医疗数据传输的及时性。该传输模型旨在获取疫区内最少的通信量,以实现信息的无缝可用性。所提出的模型利用非循环连接程序和疫区内外的抢先转发。前者负责无复制连接的最大化,确保边缘节点更好的可用性。根据通信时间和传输平衡因素,使用剪枝树分类器减少连接复制。后一个流程负责通过有条件地选择基础设施单元,可靠地转发获取的数据。PITM 的这两个过程都负责改进所观察到的医疗数据的传输,以获得更好的传输效果、更短的通信时间和更少的延迟。
{"title":"Preemptive Epidemic Information Transmission Model Using Nonreplication Edge Node Connectivity in Health Care Networks.","authors":"Chandu Thota, Constandinos X Mavromoustakis, George Mastorakis","doi":"10.1089/big.2022.0278","DOIUrl":"10.1089/big.2022.0278","url":null,"abstract":"<p><p>The reliability in medical data organization and transmission is eased with the inheritance of information and communication technologies in recent years. The growth of digital communication and sharing medium imposes the necessity for optimizing the accessibility and transmission of sensitive medical data to the end-users. In this article, the Preemptive Information Transmission Model (PITM) is introduced for improving the promptness in medical data delivery. This transmission model is designed to acquire the least communication in an epidemic region for seamless information availability. The proposed model makes use of a noncyclic connection procedure and preemptive forwarding inside and outside the epidemic region. The first is responsible for replication-less connection maximization ensuring better availability of the edge nodes. The connection replications are reduced using the pruning tree classifiers based on the communication time and delivery balancing factor. The later process is responsible for the reliable forwarding of the acquired data using a conditional selection of the infrastructure units. Both the processes of PITM are accountable for improving the delivery of observed medical data, over better transmissions, communication time, and achieving fewer delays.</p>","PeriodicalId":51314,"journal":{"name":"Big Data","volume":null,"pages":null},"PeriodicalIF":4.6,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"9440721","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
Opinion Evolution with Information Quality of Public Person and Mass Acceptance Threshold. 公众人物的信息质量与大众接受阈值的舆论演变。
IF 4.6 4区 计算机科学 Q1 Computer Science Pub Date : 2024-04-01 Epub Date: 2023-05-29 DOI: 10.1089/big.2022.0271
Jing Wei, Yuguang Jia, Wanyi Tie, Hengmin Zhu, Weidong Huang

Public persons are nodes with high attention to public events, and their opinions can directly affect the development on events. However, because of rationality, the followers' acceptance to the public persons' opinions will depend on the information trait on public persons' opinions and own comprehension. To study how different opinions of the public persons guide different followers, we build an opinion dynamics model, which would provide a theoretical method for public opinion management. Based on the classical bounded confidence model, we extract the information quality variables and individual trust threshold and introduce them to construct our two-stage opinion evolution model. And then in the simulation experiments, we analyze the different effects of opinion information quality, opinion release time, and frequency on public opinion by adjusting the different parameters. Finally, we added a case to compare real data, the data from classical model simulation and the data from improved model simulation to verify the effectiveness on our model. The research found that the more sufficient the argument and the more moderate the attitude, the more likely to guide the public opinion. If public person holds different opinions and different information quality, he should choose different time to present his opinion to achieve ideal guide effect. When public person holds neutral opinion and the information quality is relatively general, he/she can intervene in public opinion as soon as possible to control final public opinion; when public person holds extreme opinion and the information quality is relatively high, he/she can choose to express opinion after a certain period on public opinion evolution, which is conducive to improve the guidance effect on public opinion. The frequency of releasing opinions of public person consistently has a positive impact on the final public opinion.

公众人物是公共事件中关注度较高的节点,他们的意见会直接影响事件的发展。然而,由于理性的原因,追随者对公众人物意见的接受程度取决于公众人物意见的信息特征和自身的理解能力。为了研究公众人物的不同观点如何引导不同的追随者,我们建立了一个舆论动态模型,为舆论管理提供理论方法。在经典有界信任模型的基础上,我们提取了信息质量变量和个体信任阈值,并将其引入到两阶段舆论演化模型的构建中。然后在模拟实验中,通过调整不同的参数,分析舆情信息质量、舆情发布时间和频率对舆情的不同影响。最后,我们增加了一个案例,将真实数据、经典模型模拟数据和改进模型模拟数据进行对比,以验证模型的有效性。研究发现,论证越充分、态度越温和,越容易引导舆论。如果公众持有不同的观点,信息质量也不同,则应选择不同的时间发表观点,以达到理想的引导效果。当公众持中立意见,信息质量相对一般时,可以尽快介入舆论,控制最终舆论;当公众持极端意见,信息质量相对较高时,可以选择在舆论演变到一定阶段后再发表意见,有利于提高舆论引导效果。公众发布舆情的频率对最终舆情具有持续的积极影响。
{"title":"Opinion Evolution with Information Quality of Public Person and Mass Acceptance Threshold.","authors":"Jing Wei, Yuguang Jia, Wanyi Tie, Hengmin Zhu, Weidong Huang","doi":"10.1089/big.2022.0271","DOIUrl":"10.1089/big.2022.0271","url":null,"abstract":"<p><p>Public persons are nodes with high attention to public events, and their opinions can directly affect the development on events. However, because of rationality, the followers' acceptance to the public persons' opinions will depend on the information trait on public persons' opinions and own comprehension. To study how different opinions of the public persons guide different followers, we build an opinion dynamics model, which would provide a theoretical method for public opinion management. Based on the classical bounded confidence model, we extract the information quality variables and individual trust threshold and introduce them to construct our two-stage opinion evolution model. And then in the simulation experiments, we analyze the different effects of opinion information quality, opinion release time, and frequency on public opinion by adjusting the different parameters. Finally, we added a case to compare real data, the data from classical model simulation and the data from improved model simulation to verify the effectiveness on our model. The research found that the more sufficient the argument and the more moderate the attitude, the more likely to guide the public opinion. If public person holds different opinions and different information quality, he should choose different time to present his opinion to achieve ideal guide effect. When public person holds neutral opinion and the information quality is relatively general, he/she can intervene in public opinion as soon as possible to control final public opinion; when public person holds extreme opinion and the information quality is relatively high, he/she can choose to express opinion after a certain period on public opinion evolution, which is conducive to improve the guidance effect on public opinion. The frequency of releasing opinions of public person consistently has a positive impact on the final public opinion.</p>","PeriodicalId":51314,"journal":{"name":"Big Data","volume":null,"pages":null},"PeriodicalIF":4.6,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"9547763","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
Enhanced Neural Network-Based Univariate Time-Series Forecasting Model for Big Data. 基于神经网络的大数据单变量时间序列预测模型。
IF 4.6 4区 计算机科学 Q1 Computer Science Pub Date : 2024-04-01 Epub Date: 2023-02-24 DOI: 10.1089/big.2022.0155
Suyel Namasudra, S Dhamodharavadhani, R Rathipriya, Ruben Gonzalez Crespo, Nageswara Rao Moparthi

Big data is a combination of large structured, semistructured, and unstructured data collected from various sources that must be processed before using them in many analytical applications. Anomalies or inconsistencies in big data refer to the occurrences of some data that are in some way unusual and do not fit the general patterns. It is considered one of the major problems of big data. Data trust method (DTM) is a technique used to identify and replace anomaly or untrustworthy data using the interpolation method. This article discusses the DTM used for univariate time series (UTS) forecasting algorithms for big data, which is considered the preprocessing approach by using a neural network (NN) model. In this work, DTM is the combination of statistical-based untrustworthy data detection method and statistical-based untrustworthy data replacement method, and it is used to improve the forecast quality of UTS. In this study, an enhanced NN model has been proposed for big data that incorporates DTMs with the NN-based UTS forecasting model. The coefficient variance root mean squared error is utilized as the main characteristic indicator in the proposed work to choose the best UTS data for model development. The results show the effectiveness of the proposed method as it can improve the prediction process by determining and replacing the untrustworthy big data.

大数据是从各种来源收集的大量结构化、半结构化和非结构化数据的组合,在许多分析应用中使用这些数据之前必须对其进行处理。大数据中的异常或不一致是指某些数据在某种程度上不寻常,不符合一般模式。它被认为是大数据的主要问题之一。数据信任方法(DTM)是一种使用插值法识别和替换异常或不可信数据的技术。本文讨论了用于大数据单变量时间序列(UTS)预测算法的 DTM,它被认为是使用神经网络(NN)模型的预处理方法。在这项工作中,DTM 是基于统计的不可信数据检测方法和基于统计的不可信数据替换方法的组合,用于提高 UTS 的预测质量。本研究提出了一种针对大数据的增强型 NN 模型,将 DTM 与基于 NN 的UTS 预测模型相结合。该模型以系数方差均方根误差为主要特征指标,选择最佳的UTS数据进行模型开发。结果表明了所提方法的有效性,因为它可以通过确定和替换不可信的大数据来改进预测过程。
{"title":"Enhanced Neural Network-Based Univariate Time-Series Forecasting Model for Big Data.","authors":"Suyel Namasudra, S Dhamodharavadhani, R Rathipriya, Ruben Gonzalez Crespo, Nageswara Rao Moparthi","doi":"10.1089/big.2022.0155","DOIUrl":"10.1089/big.2022.0155","url":null,"abstract":"<p><p>Big data is a combination of large structured, semistructured, and unstructured data collected from various sources that must be processed before using them in many analytical applications. Anomalies or inconsistencies in big data refer to the occurrences of some data that are in some way unusual and do not fit the general patterns. It is considered one of the major problems of big data. Data trust method (DTM) is a technique used to identify and replace anomaly or untrustworthy data using the interpolation method. This article discusses the DTM used for univariate time series (UTS) forecasting algorithms for big data, which is considered the preprocessing approach by using a neural network (NN) model. In this work, DTM is the combination of statistical-based untrustworthy data detection method and statistical-based untrustworthy data replacement method, and it is used to improve the forecast quality of UTS. In this study, an enhanced NN model has been proposed for big data that incorporates DTMs with the NN-based UTS forecasting model. The coefficient variance root mean squared error is utilized as the main characteristic indicator in the proposed work to choose the best UTS data for model development. The results show the effectiveness of the proposed method as it can improve the prediction process by determining and replacing the untrustworthy big data.</p>","PeriodicalId":51314,"journal":{"name":"Big Data","volume":null,"pages":null},"PeriodicalIF":4.6,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"9320511","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
Cloud-Based Advanced Shuffled Frog Leaping Algorithm for Tasks Scheduling. 基于云的任务调度高级洗牌蛙跳算法。
IF 4.6 4区 计算机科学 Q1 Computer Science Pub Date : 2024-04-01 Epub Date: 2023-03-03 DOI: 10.1089/big.2022.0095
Dipesh Kumar, Nirupama Mandal, Yugal Kumar

In recent years, the world has seen incremental growth in online activities owing to which the volume of data in cloud servers has also been increasing exponentially. With rapidly increasing data, load on cloud servers has increased in the cloud computing environment. With rapidly evolving technology, various cloud-based systems were developed to enhance the user experience. But, the increased online activities around the globe have also increased data load on the cloud-based systems. To maintain the efficiency and performance of the applications hosted in cloud servers, task scheduling has become very important. The task scheduling process helps in reducing the makespan time and average cost by scheduling the tasks to virtual machines (VMs). The task scheduling depends on assigning tasks to VMs to process the incoming tasks. The task scheduling should follow some algorithm for assigning tasks to VMs. Many researchers have proposed different scheduling algorithms for task scheduling in the cloud computing environment. In this article, an advanced form of the shuffled frog optimization algorithm, which works on the nature and behavior of frogs searching for food, has been proposed. The authors have introduced a new algorithm to shuffle the position of frogs in memeplex to obtain the best result. By using this optimization technique, the cost function of the central processing unit, makespan, and fitness function were calculated. The fitness function is the sum of the budget cost function and the makespan time. The proposed method helps in reducing the makespan time as well as the average cost by scheduling the tasks to VMs effectively. Finally, the performance of the proposed advanced shuffled frog optimization method is compared with existing task scheduling methods such as whale optimization-based scheduler (W-Scheduler), sliced particle swarm optimization (SPSO-SA), inverted ant colony optimization algorithm, and static learning particle swarm optimization (SLPSO-SA) in terms of average cost and metric makespan. Experimentally, it was concluded that the proposed advanced frog optimization algorithm can schedule tasks to the VMs more effectively as compared with other scheduling methods with a makespan of 6, average cost of 4, and fitness of 10.

近年来,全球在线活动不断增加,云服务器中的数据量也因此呈指数级增长。随着数据量的快速增长,云计算环境中云服务器的负载也随之增加。随着技术的快速发展,各种基于云的系统应运而生,以提升用户体验。但是,全球在线活动的增加也增加了云计算系统的数据负载。为了保持云服务器托管应用程序的效率和性能,任务调度变得非常重要。任务调度过程通过将任务调度到虚拟机(VM),有助于缩短运行时间和降低平均成本。任务调度取决于向虚拟机分配任务,以处理接收到的任务。任务调度应遵循某种算法将任务分配给虚拟机。许多研究人员为云计算环境中的任务调度提出了不同的调度算法。本文提出了一种高级形式的洗牌青蛙优化算法,该算法基于青蛙寻找食物的性质和行为。作者引入了一种新算法,对 memeplex 中青蛙的位置进行洗牌,以获得最佳结果。通过使用这种优化技术,计算出了中央处理单元的成本函数、makespan 和适应度函数。合适度函数是预算成本函数和间隔时间之和。通过有效地将任务调度到虚拟机上,所提出的方法有助于减少正常运行时间和平均成本。最后,将所提出的高级洗牌蛙优化方法的性能与现有的任务调度方法进行了比较,如基于鲸鱼优化的调度器(W-Scheduler)、切片粒子群优化(SPSO-SA)、倒置蚁群优化算法和静态学习粒子群优化(SLPSO-SA)在平均成本和度量间隔方面的性能。实验结果表明,与其他调度方法相比,所提出的高级蛙群优化算法能更有效地将任务调度到虚拟机上,其makespan为6,平均成本为4,适合度为10。
{"title":"Cloud-Based Advanced Shuffled Frog Leaping Algorithm for Tasks Scheduling.","authors":"Dipesh Kumar, Nirupama Mandal, Yugal Kumar","doi":"10.1089/big.2022.0095","DOIUrl":"10.1089/big.2022.0095","url":null,"abstract":"<p><p>In recent years, the world has seen incremental growth in online activities owing to which the volume of data in cloud servers has also been increasing exponentially. With rapidly increasing data, load on cloud servers has increased in the cloud computing environment. With rapidly evolving technology, various cloud-based systems were developed to enhance the user experience. But, the increased online activities around the globe have also increased data load on the cloud-based systems. To maintain the efficiency and performance of the applications hosted in cloud servers, task scheduling has become very important. The task scheduling process helps in reducing the makespan time and average cost by scheduling the tasks to virtual machines (VMs). The task scheduling depends on assigning tasks to VMs to process the incoming tasks. The task scheduling should follow some algorithm for assigning tasks to VMs. Many researchers have proposed different scheduling algorithms for task scheduling in the cloud computing environment. In this article, an advanced form of the shuffled frog optimization algorithm, which works on the nature and behavior of frogs searching for food, has been proposed. The authors have introduced a new algorithm to shuffle the position of frogs in memeplex to obtain the best result. By using this optimization technique, the cost function of the central processing unit, makespan, and fitness function were calculated. The fitness function is the sum of the budget cost function and the makespan time. The proposed method helps in reducing the makespan time as well as the average cost by scheduling the tasks to VMs effectively. Finally, the performance of the proposed advanced shuffled frog optimization method is compared with existing task scheduling methods such as whale optimization-based scheduler (W-Scheduler), sliced particle swarm optimization (SPSO-SA), inverted ant colony optimization algorithm, and static learning particle swarm optimization (SLPSO-SA) in terms of average cost and metric makespan. Experimentally, it was concluded that the proposed advanced frog optimization algorithm can schedule tasks to the VMs more effectively as compared with other scheduling methods with a makespan of 6, average cost of 4, and fitness of 10.</p>","PeriodicalId":51314,"journal":{"name":"Big Data","volume":null,"pages":null},"PeriodicalIF":4.6,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"10821344","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
Dual-Path Graph Neural Network with Adaptive Auxiliary Module for Link Prediction. 带自适应辅助模块的双路径图神经网络用于链路预测
IF 4.6 4区 计算机科学 Q1 Computer Science Pub Date : 2024-03-25 DOI: 10.1089/big.2023.0130
Zhenzhen Yang, Zelong Lin, Yongpeng Yang, Jiaqi Li

Link prediction, which has important applications in many fields, predicts the possibility of the link between two nodes in a graph. Link prediction based on Graph Neural Network (GNN) obtains node representation and graph structure through GNN, which has attracted a growing amount of attention recently. However, the existing GNN-based link prediction approaches possess some shortcomings. On the one hand, because a graph contains different types of nodes, it leads to a great challenge for aggregating information and learning node representation from its neighbor nodes. On the other hand, the attention mechanism has been an effect instrument for enhancing the link prediction performance. However, the traditional attention mechanism is always monotonic for query nodes, which limits its influence on link prediction. To address these two problems, a Dual-Path Graph Neural Network (DPGNN) for link prediction is proposed in this study. First, we propose a novel Local Random Features Augmentation for Graph Convolution Network as a baseline of one path. Meanwhile, Graph Attention Network version 2 based on dynamic attention mechanism is adopted as a baseline of the other path. And then, we capture more meaningful node representation and more accurate link features by concatenating the information of these two paths. In addition, we propose an adaptive auxiliary module for better balancing the weight of auxiliary tasks, which brings more benefit to link prediction. Finally, extensive experiments verify the effectiveness and superiority of our proposed DPGNN for link prediction.

链接预测是指预测图中两个节点之间链接的可能性,在许多领域都有重要应用。基于图神经网络(GNN)的链接预测通过 GNN 获得节点表示和图结构,最近引起了越来越多的关注。然而,现有的基于 GNN 的链接预测方法存在一些缺陷。一方面,由于图中包含不同类型的节点,这给从相邻节点汇总信息和学习节点表示带来了巨大挑战。另一方面,注意力机制一直是提高链接预测性能的有效工具。然而,传统的注意力机制对于查询节点总是单调的,这限制了它对链接预测的影响。针对这两个问题,本研究提出了一种用于链接预测的双路径图神经网络(DPGNN)。首先,我们提出了一种新颖的局部随机特征增强图卷积网络(Local Random Features Augmentation for Graph Convolution Network),作为单路径的基线。同时,我们采用基于动态注意力机制的图注意力网络版本 2 作为另一条路径的基准。然后,我们通过串联这两条路径的信息来捕捉更有意义的节点表示和更准确的链接特征。此外,我们还提出了自适应辅助模块,以更好地平衡辅助任务的权重,从而为链接预测带来更多益处。最后,大量实验验证了我们提出的 DPGNN 在链接预测方面的有效性和优越性。
{"title":"Dual-Path Graph Neural Network with Adaptive Auxiliary Module for Link Prediction.","authors":"Zhenzhen Yang, Zelong Lin, Yongpeng Yang, Jiaqi Li","doi":"10.1089/big.2023.0130","DOIUrl":"https://doi.org/10.1089/big.2023.0130","url":null,"abstract":"<p><p>Link prediction, which has important applications in many fields, predicts the possibility of the link between two nodes in a graph. Link prediction based on Graph Neural Network (GNN) obtains node representation and graph structure through GNN, which has attracted a growing amount of attention recently. However, the existing GNN-based link prediction approaches possess some shortcomings. On the one hand, because a graph contains different types of nodes, it leads to a great challenge for aggregating information and learning node representation from its neighbor nodes. On the other hand, the attention mechanism has been an effect instrument for enhancing the link prediction performance. However, the traditional attention mechanism is always monotonic for query nodes, which limits its influence on link prediction. To address these two problems, a Dual-Path Graph Neural Network (DPGNN) for link prediction is proposed in this study. First, we propose a novel Local Random Features Augmentation for Graph Convolution Network as a baseline of one path. Meanwhile, Graph Attention Network version 2 based on dynamic attention mechanism is adopted as a baseline of the other path. And then, we capture more meaningful node representation and more accurate link features by concatenating the information of these two paths. In addition, we propose an adaptive auxiliary module for better balancing the weight of auxiliary tasks, which brings more benefit to link prediction. Finally, extensive experiments verify the effectiveness and superiority of our proposed DPGNN for link prediction.</p>","PeriodicalId":51314,"journal":{"name":"Big Data","volume":null,"pages":null},"PeriodicalIF":4.6,"publicationDate":"2024-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140289590","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
Investigating the Co-Movement and Asymmetric Relationships of Oil Prices on the Shipping Stock Returns: Evidence from Three Shipping-Flagged Companies from Germany, South Korea, and Taiwan. 探究油价对航运股回报的共动和非对称关系:来自德国、韩国和台湾的三家航运滞后公司的证据。
IF 4.6 4区 计算机科学 Q1 Computer Science Pub Date : 2024-02-13 DOI: 10.1089/big.2023.0026
Jumadil Saputra, Kasypi Mokhtar, Anuar Abu Bakar, Siti Marsila Mhd Ruslan

In the last 2 years, there has been a significant upswing in oil prices, leading to a decline in economic activity and demand. This trend holds substantial implications for the global economy, particularly within the emerging business landscape. Among the influential risk factors impacting the returns of shipping stocks, none looms larger than the volatility in oil prices. Yet, only a limited number of studies have explored the complex relationship between oil price shocks and the dynamics of the liner shipping industry, with specific focus on uncertainty linkages and potential diversification strategies. This study aims to investigate the co-movements and asymmetric associations between oil prices (specifically, West Texas Intermediate and Brent) and the stock returns of three prominent shipping companies from Germany, South Korea, and Taiwan. The results unequivocally highlight the indispensable role of oil prices in shaping both short-term and long-term shipping stock returns. In addition, the research underscores the statistical significance of exchange rates and interest rates in influencing these returns, with their effects varying across different time horizons. Notably, shipping stock prices exhibit heightened sensitivity to positive movements in oil prices, while exchange rates and interest rates exert contrasting impacts, one being positive and the other negative. These findings collectively illuminate the profound influence of market sentiment regarding crucial economic indicators within the global shipping sector.

在过去两年里,石油价格大幅上涨,导致经济活动和需求下降。这一趋势对全球经济,尤其是新兴商业领域产生了重大影响。在影响航运业股票收益的风险因素中,最重要的莫过于石油价格的波动。然而,只有为数有限的研究探讨了油价冲击与班轮航运业动态之间的复杂关系,并特别关注不确定性联系和潜在的多元化战略。本研究旨在探讨油价(特别是西德克萨斯中质油价和布伦特油价)与德国、韩国和台湾三家著名航运公司股票收益之间的共同变动和非对称关联。研究结果明确凸显了油价在影响短期和长期航运股票回报率方面不可或缺的作用。此外,研究还强调了汇率和利率在影响这些回报率方面的统计意义,它们在不同时间跨度上的影响也各不相同。值得注意的是,航运股票价格对石油价格的积极变动表现出更高的敏感性,而汇率和利率则产生了截然不同的影响,一个是积极的,另一个是消极的。这些发现共同揭示了市场情绪对全球航运业关键经济指标的深刻影响。
{"title":"Investigating the Co-Movement and Asymmetric Relationships of Oil Prices on the Shipping Stock Returns: Evidence from Three Shipping-Flagged Companies from Germany, South Korea, and Taiwan.","authors":"Jumadil Saputra, Kasypi Mokhtar, Anuar Abu Bakar, Siti Marsila Mhd Ruslan","doi":"10.1089/big.2023.0026","DOIUrl":"https://doi.org/10.1089/big.2023.0026","url":null,"abstract":"<p><p>In the last 2 years, there has been a significant upswing in oil prices, leading to a decline in economic activity and demand. This trend holds substantial implications for the global economy, particularly within the emerging business landscape. Among the influential risk factors impacting the returns of shipping stocks, none looms larger than the volatility in oil prices. Yet, only a limited number of studies have explored the complex relationship between oil price shocks and the dynamics of the liner shipping industry, with specific focus on uncertainty linkages and potential diversification strategies. This study aims to investigate the co-movements and asymmetric associations between oil prices (specifically, West Texas Intermediate and Brent) and the stock returns of three prominent shipping companies from Germany, South Korea, and Taiwan. The results unequivocally highlight the indispensable role of oil prices in shaping both short-term and long-term shipping stock returns. In addition, the research underscores the statistical significance of exchange rates and interest rates in influencing these returns, with their effects varying across different time horizons. Notably, shipping stock prices exhibit heightened sensitivity to positive movements in oil prices, while exchange rates and interest rates exert contrasting impacts, one being positive and the other negative. These findings collectively illuminate the profound influence of market sentiment regarding crucial economic indicators within the global shipping sector.</p>","PeriodicalId":51314,"journal":{"name":"Big Data","volume":null,"pages":null},"PeriodicalIF":4.6,"publicationDate":"2024-02-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139736755","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
An Autoregressive-Based Kalman Filter Approach for Daily PM2.5 Concentration Forecasting in Beijing, China. 基于自回归卡尔曼滤波器的中国北京 PM2.5 每日浓度预测方法。
IF 4.6 4区 计算机科学 Q1 Computer Science Pub Date : 2024-02-01 Epub Date: 2023-05-03 DOI: 10.1089/big.2022.0082
Xinyue Zhang, Chen Ding, Guizhi Wang

With the acceleration of urbanization, air pollution, especially PM2.5, has seriously affected human health and reduced people's life quality. Accurate PM2.5 prediction is significant for environmental protection authorities to take actions and develop prevention countermeasures. In this article, an adapted Kalman filter (KF) approach is presented to remove the nonlinearity and stochastic uncertainty of time series, suffered by the autoregressive integrated moving average (ARIMA) model. To further improve the accuracy of PM2.5 forecasting, a hybrid model is proposed by introducing an autoregressive (AR) model, where the AR part is used to determine the state-space equation, whereas the KF part is used for state estimation on PM2.5 concentration series. A modified artificial neural network (ANN), called AR-ANN is introduced to compare with the AR-KF model. According to the results, the AR-KF model outperforms the AR-ANN model and the original ARIMA model on the predication accuracy; that is, the AR-ANN obtains 10.85 and 15.45 of mean absolute error and root mean square error, respectively, whereas the ARIMA gains 30.58 and 29.39 on the corresponding metrics. It, therefore, proves that the presented AR-KF model can be adopted for air pollutant concentration prediction.

随着城市化进程的加快,空气污染尤其是 PM2.5 严重影响了人类健康,降低了人们的生活质量。准确预测 PM2.5 对环保部门采取行动和制定预防对策意义重大。本文提出了一种改进的卡尔曼滤波器(KF)方法,以消除自回归积分移动平均(ARIMA)模型所带来的时间序列的非线性和随机不确定性。为了进一步提高 PM2.5 预测的准确性,提出了一种混合模型,即引入自回归(AR)模型,其中 AR 部分用于确定状态空间方程,而 KF 部分用于 PM2.5 浓度序列的状态估计。为了与 AR-KF 模型进行比较,引入了一个名为 AR-ANN 的改进型人工神经网络(ANN)。结果表明,AR-KF 模型的预测精度优于 AR-ANN 模型和原始 ARIMA 模型,即 AR-ANN 模型的平均绝对误差和均方根误差分别为 10.85 和 15.45,而 ARIMA 模型的相应指标分别为 30.58 和 29.39。因此,这证明所提出的 AR-KF 模型可用于空气污染物浓度预测。
{"title":"An Autoregressive-Based Kalman Filter Approach for Daily PM<sub>2.5</sub> Concentration Forecasting in Beijing, China.","authors":"Xinyue Zhang, Chen Ding, Guizhi Wang","doi":"10.1089/big.2022.0082","DOIUrl":"10.1089/big.2022.0082","url":null,"abstract":"<p><p>With the acceleration of urbanization, air pollution, especially PM<sub>2.5</sub>, has seriously affected human health and reduced people's life quality. Accurate PM<sub>2.5</sub> prediction is significant for environmental protection authorities to take actions and develop prevention countermeasures. In this article, an adapted Kalman filter (KF) approach is presented to remove the nonlinearity and stochastic uncertainty of time series, suffered by the autoregressive integrated moving average (ARIMA) model. To further improve the accuracy of PM<sub>2.5</sub> forecasting, a hybrid model is proposed by introducing an autoregressive (AR) model, where the AR part is used to determine the state-space equation, whereas the KF part is used for state estimation on PM<sub>2.5</sub> concentration series. A modified artificial neural network (ANN), called AR-ANN is introduced to compare with the AR-KF model. According to the results, the AR-KF model outperforms the AR-ANN model and the original ARIMA model on the predication accuracy; that is, the AR-ANN obtains 10.85 and 15.45 of mean absolute error and root mean square error, respectively, whereas the ARIMA gains 30.58 and 29.39 on the corresponding metrics. It, therefore, proves that the presented AR-KF model can be adopted for air pollutant concentration prediction.</p>","PeriodicalId":51314,"journal":{"name":"Big Data","volume":null,"pages":null},"PeriodicalIF":4.6,"publicationDate":"2024-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"9757180","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
期刊
Big Data
全部 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