首页 > 最新文献

Big Data最新文献

英文 中文
Method for Power Grid Digital Operation Data Integration Based on K-Medoids Clustering with Support for Real-Time Cross-Modal Applications. 基于k -媒质聚类支持实时跨模态应用的电网数字化运行数据集成方法。
IF 2.6 4区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-12-01 DOI: 10.1177/2167647X251406607
Yuping Yan, Hanyang Xie, Liang Chen, You Wen, Huaquan Su

Data in power grid digital operation exhibit multisource heterogeneous characteristics, resulting in low integration efficiency and slow anomaly detection response. To address this, this paper proposes a method for power grid digital operation data integration based on K-medoids clustering. The basic service layer utilizes an Field Programmable Gate Array parallel architecture. This enables millisecond-level synchronous acquisition and dynamic preprocessing of multisource data, such as mechanical vibration, partial discharge signals, and temperature. The implementation is based on the analysis of the power grid digital operation structure. The data are then fed back to the cloud service layer, which, through business integration services, data analysis, and data access services, performs data filtering and analysis. Subsequently, the data are input to the application layer via the database server. The application layer employs a K-medoids clustering method that introduces a density-weighted Euclidean distance metric and an adaptive centroid selection strategy, significantly enhancing the clustering performance of multisource data. In particular, the proposed architecture supports real-time data processing and can be extended to cross-modal scenarios, including integration with speech-to-text systems in power grid monitoring. By aligning with low-latency neural network principles, this method facilitates timely decision-making in intelligent operation environments. Experiments confirm the method's efficacy. It acquires and integrates multisource heterogeneous power grid digital operation data effectively. The data throughput of different power grid digital operation data sources all exceed 110 MB/s. The silhouette coefficient of the integrated data sets is greater than 0.91, indicating that the integration of power grid digital operation data using this method exhibits good separability and reliability, enabling rapid detection of data anomalies within the power grid, thus laying a solid foundation for the operation and maintenance management of power grid digital operation.

电网数字化运行数据呈现多源异构特征,导致集成效率低,异常检测响应慢。针对这一问题,本文提出了一种基于k -介质聚类的电网数字化运行数据集成方法。基本服务层采用现场可编程门阵列并行架构。这可以实现毫秒级的多源数据同步采集和动态预处理,如机械振动、局部放电信号和温度。在对电网数字化运行结构分析的基础上,提出了实现方案。然后将数据反馈给云服务层,云服务层通过业务集成服务、数据分析和数据访问服务执行数据过滤和分析。随后,数据通过数据库服务器输入到应用层。应用层采用k -介质聚类方法,引入密度加权欧几里得距离度量和自适应质心选择策略,显著提高了多源数据的聚类性能。特别是,所提出的架构支持实时数据处理,并可扩展到跨模式场景,包括与电网监控中的语音到文本系统集成。该方法结合低延迟神经网络原理,有利于在智能运行环境下的及时决策。实验证实了该方法的有效性。它有效地获取和集成了多源异构电网数字化运行数据。不同电网数字化运行数据源的数据吞吐量均超过110 MB/s。综合数据集的廓形系数大于0.91,表明采用该方法对电网数字化运行数据进行整合,具有良好的可分离性和可靠性,能够快速发现电网内部的数据异常,为电网数字化运行的运维管理奠定了坚实的基础。
{"title":"Method for Power Grid Digital Operation Data Integration Based on K-Medoids Clustering with Support for Real-Time Cross-Modal Applications.","authors":"Yuping Yan, Hanyang Xie, Liang Chen, You Wen, Huaquan Su","doi":"10.1177/2167647X251406607","DOIUrl":"https://doi.org/10.1177/2167647X251406607","url":null,"abstract":"<p><p>Data in power grid digital operation exhibit multisource heterogeneous characteristics, resulting in low integration efficiency and slow anomaly detection response. To address this, this paper proposes a method for power grid digital operation data integration based on K-medoids clustering. The basic service layer utilizes an Field Programmable Gate Array parallel architecture. This enables millisecond-level synchronous acquisition and dynamic preprocessing of multisource data, such as mechanical vibration, partial discharge signals, and temperature. The implementation is based on the analysis of the power grid digital operation structure. The data are then fed back to the cloud service layer, which, through business integration services, data analysis, and data access services, performs data filtering and analysis. Subsequently, the data are input to the application layer via the database server. The application layer employs a K-medoids clustering method that introduces a density-weighted Euclidean distance metric and an adaptive centroid selection strategy, significantly enhancing the clustering performance of multisource data. In particular, the proposed architecture supports real-time data processing and can be extended to cross-modal scenarios, including integration with speech-to-text systems in power grid monitoring. By aligning with low-latency neural network principles, this method facilitates timely decision-making in intelligent operation environments. Experiments confirm the method's efficacy. It acquires and integrates multisource heterogeneous power grid digital operation data effectively. The data throughput of different power grid digital operation data sources all exceed 110 MB/s. The silhouette coefficient of the integrated data sets is greater than 0.91, indicating that the integration of power grid digital operation data using this method exhibits good separability and reliability, enabling rapid detection of data anomalies within the power grid, thus laying a solid foundation for the operation and maintenance management of power grid digital operation.</p>","PeriodicalId":51314,"journal":{"name":"Big Data","volume":"13 6","pages":"453-470"},"PeriodicalIF":2.6,"publicationDate":"2025-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145716573","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
Analysis on Research Situation of Soybean Quality Evaluation Based on Bibliometrics. 基于文献计量学的大豆品质评价研究现状分析。
IF 2.6 4区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-12-01 Epub Date: 2025-12-04 DOI: 10.1177/2167647X251399053
Yanxia Gao, Pengju Tang, Xuhong Tang, Dong Wang, Jiaqi Luo, JiaDong Wu

Soybeans are a high-quality vegetable protein resource and a fundamental strategic material integral to the national economy and public livelihood. To investigate the research status of soybean quality evaluation, this study analyzes relevant literature from Web of Science and China Knowledge Network (2000-2024). Using bibliometric methods with Excel and VOSviewer, we examined publication years, keywords, authors, sources, countries/regions, and institutions, generating visualizations to intuitively illustrate the field's developmental status. Results indicate that over the past 25 years, soybean quality evaluation research has emerged as a focal point in crop science, with institutions predominantly located in China and the United States. Key journals in this domain include Food Chemistry, Frontiers in Plant Science, and Soybean Science, among others. Research primarily focuses on soybean physical characteristics and the component-quality relationship. Interdisciplinary advancements have positioned spectral analysis, intelligent systems, and multitechnology fusion as innovative frontiers in this field. These findings enhance researchers' understanding of current trends and support evidence-based decision-making in soybean quality evaluation.

大豆是一种优质植物蛋白资源,是关系国计民生的基础性战略物资。为了了解大豆品质评价的研究现状,本研究分析了Web of Science和中国知识网(2000-2024)的相关文献。利用文献计量学方法,结合Excel和VOSviewer,对论文的出版年份、关键词、作者、来源、国家/地区和机构进行了统计分析,生成了可视化图,直观地说明了该领域的发展状况。结果表明,在过去的25年中,大豆质量评价研究已成为作物科学的一个焦点,研究机构主要集中在中国和美国。该领域的主要期刊包括《食品化学》、《植物科学前沿》和《大豆科学》等。研究主要集中在大豆的物理特性和成分与品质的关系。跨学科的进步将光谱分析、智能系统和多技术融合定位为该领域的创新前沿。这些发现增强了研究人员对当前趋势的理解,并为大豆质量评价的循证决策提供了支持。
{"title":"Analysis on Research Situation of Soybean Quality Evaluation Based on Bibliometrics.","authors":"Yanxia Gao, Pengju Tang, Xuhong Tang, Dong Wang, Jiaqi Luo, JiaDong Wu","doi":"10.1177/2167647X251399053","DOIUrl":"10.1177/2167647X251399053","url":null,"abstract":"<p><p>Soybeans are a high-quality vegetable protein resource and a fundamental strategic material integral to the national economy and public livelihood. To investigate the research status of soybean quality evaluation, this study analyzes relevant literature from Web of Science and China Knowledge Network (2000-2024). Using bibliometric methods with Excel and VOSviewer, we examined publication years, keywords, authors, sources, countries/regions, and institutions, generating visualizations to intuitively illustrate the field's developmental status. Results indicate that over the past 25 years, soybean quality evaluation research has emerged as a focal point in crop science, with institutions predominantly located in China and the United States. Key journals in this domain include <i>Food Chemistry</i>, <i>Frontiers in Plant Science</i>, and <i>Soybean Science</i>, among others. Research primarily focuses on soybean physical characteristics and the component-quality relationship. Interdisciplinary advancements have positioned spectral analysis, intelligent systems, and multitechnology fusion as innovative frontiers in this field. These findings enhance researchers' understanding of current trends and support evidence-based decision-making in soybean quality evaluation.</p>","PeriodicalId":51314,"journal":{"name":"Big Data","volume":" ","pages":"487-496"},"PeriodicalIF":2.6,"publicationDate":"2025-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145679308","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
Prediction of Remaining Life of Aircraft Engines Based on BiLSTM-GRU-Attention Model. 基于BiLSTM-GRU-Attention模型的航空发动机剩余寿命预测
IF 2.6 4区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-12-01 DOI: 10.1177/2167647X251405797
Qiong He, Xueqing Guo

This study aims to enhance the prediction precision of aircraft engine remaining useful life (RUL) by overcoming common challenges in current models, such as ineffective feature extraction and insufficient modeling of long-term temporal dependencies. We propose a novel multilayer hybrid architecture that combines bidirectional long short-term memory (BiLSTM) and gated recurrent unit (GRU) networks, augmented with an attention mechanism to enhance the model's focus on informative temporal patterns. In this framework, raw time series data are initially processed by the BiLSTM to extract bidirectional features associated with engine health conditions. The GRU network is subsequently used to effectively model long-range dependencies, thereby enriching the temporal representation. An adaptive attention module is included to assign varying importance to different features, allowing the model to focus on key indicators of engine condition. Evaluation results on the FD001 and FD003 datasets show that the model achieves root mean squared error reductions ranging from 8.81% to 30.60% and from 7.48% to 37.96%, validating its performance and robustness in RUL forecasting. In comparison with conventional BiLSTM and GRU models, the proposed BiLSTM-GRU-Attention architecture integrates attention-based feature weighting with a hybrid recurrent framework, thereby offering a concise and effective approach to RUL prediction for aircraft engines.

本研究旨在克服现有模型存在的特征提取效率低、对长期时间依赖性建模不足等问题,提高飞机发动机剩余使用寿命(RUL)预测精度。我们提出了一种新的多层混合架构,它结合了双向长短期记忆(BiLSTM)和门控循环单元(GRU)网络,并增加了一个注意机制,以增强模型对信息时间模式的关注。在该框架中,原始时间序列数据首先由BiLSTM处理,以提取与发动机健康状况相关的双向特征。GRU网络随后被用于有效地建模远程依赖关系,从而丰富了时间表征。其中包括一个自适应关注模块,用于为不同特征分配不同的重要性,从而使模型能够专注于发动机状况的关键指标。在FD001和FD003数据集上的评价结果表明,该模型的均方根误差降低幅度分别为8.81% ~ 30.60%和7.48% ~ 37.96%,验证了该模型在RUL预测中的性能和稳健性。与传统的BiLSTM和GRU模型相比,所提出的BiLSTM-GRU- attention架构将基于注意力的特征加权与混合循环框架相结合,从而为飞机发动机RUL预测提供了一种简洁有效的方法。
{"title":"Prediction of Remaining Life of Aircraft Engines Based on BiLSTM-GRU-Attention Model.","authors":"Qiong He, Xueqing Guo","doi":"10.1177/2167647X251405797","DOIUrl":"https://doi.org/10.1177/2167647X251405797","url":null,"abstract":"<p><p>This study aims to enhance the prediction precision of aircraft engine remaining useful life (RUL) by overcoming common challenges in current models, such as ineffective feature extraction and insufficient modeling of long-term temporal dependencies. We propose a novel multilayer hybrid architecture that combines bidirectional long short-term memory (BiLSTM) and gated recurrent unit (GRU) networks, augmented with an attention mechanism to enhance the model's focus on informative temporal patterns. In this framework, raw time series data are initially processed by the BiLSTM to extract bidirectional features associated with engine health conditions. The GRU network is subsequently used to effectively model long-range dependencies, thereby enriching the temporal representation. An adaptive attention module is included to assign varying importance to different features, allowing the model to focus on key indicators of engine condition. Evaluation results on the FD001 and FD003 datasets show that the model achieves root mean squared error reductions ranging from 8.81% to 30.60% and from 7.48% to 37.96%, validating its performance and robustness in RUL forecasting. In comparison with conventional BiLSTM and GRU models, the proposed BiLSTM-GRU-Attention architecture integrates attention-based feature weighting with a hybrid recurrent framework, thereby offering a concise and effective approach to RUL prediction for aircraft engines.</p>","PeriodicalId":51314,"journal":{"name":"Big Data","volume":"13 6","pages":"471-486"},"PeriodicalIF":2.6,"publicationDate":"2025-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145716512","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
Monitoring Carbon Emission from Key Industries Based on VF-LSTM Model. 基于VF-LSTM模型的重点行业碳排放监测。
IF 2.6 4区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-12-01 Epub Date: 2025-11-18 DOI: 10.1177/2167647X251392796
Yang Wang, Tianchun Xiang, Shuai Luo, Yi Gao, Xiangyu Kong

Human activities that generate greenhouse gas emissions pose a significant threat to urban green and sustainable development. Production activities in key industrial sectors are a primary contributor to high urban carbon emissions. Therefore, effectively reducing carbon emissions in these sectors is crucial for achieving urban carbon peak and neutrality goals. Carbon emission monitoring is a critical approach that aids governmental bodies in understanding changes in industrial carbon emissions, thereby supporting decision-making and carbon reduction efforts. However, current industry-oriented carbon monitoring methods suffer from issues such as low frequency, poor accuracy, and inadequate privacy security. To address these challenges, this article proposes a novel privacy-protected "electricity-carbon'' nexus model, long short-term memory with the vertical federated framework (VF-LSTM), to monitor carbon emissions in key urban industries. The vertical federated framework ensures "usable but invisible" privacy protection for multisource data from various participants. The embedded long short-term memory model accurately captures industry-specific carbon emissions. Using data from key industries (steel, petrochemical, chemical, and nonferrous industries), this article constructs and validates the performance of the proposed industry-level carbon emission monitoring model. The results demonstrate that the model has high accuracy and robustness, effectively monitoring industry carbon emissions while protecting data privacy.

人类活动产生的温室气体排放对城市的绿色和可持续发展构成了重大威胁。关键工业部门的生产活动是造成城市高碳排放的主要因素。因此,有效减少这些行业的碳排放对于实现城市碳峰值和碳中和目标至关重要。碳排放监测是帮助政府机构了解工业碳排放变化的关键方法,从而支持决策和碳减排工作。然而,目前以工业为导向的碳监测方法存在频率低、准确性差、隐私安全性不足等问题。为了应对这些挑战,本文提出了一种新的隐私保护的“电-碳”联系模型,即纵向联合框架的长短期记忆(VF-LSTM),以监测城市关键行业的碳排放。垂直联合框架确保了来自不同参与者的多源数据的“可用但不可见”的隐私保护。嵌入的长短期记忆模型准确地捕获了特定行业的碳排放量。本文利用重点行业(钢铁、石化、化工和有色)的数据,构建并验证了所提出的行业层面碳排放监测模型的性能。结果表明,该模型具有较高的准确性和鲁棒性,能够在保护数据隐私的同时有效监测行业碳排放。
{"title":"Monitoring Carbon Emission from Key Industries Based on VF-LSTM Model.","authors":"Yang Wang, Tianchun Xiang, Shuai Luo, Yi Gao, Xiangyu Kong","doi":"10.1177/2167647X251392796","DOIUrl":"10.1177/2167647X251392796","url":null,"abstract":"<p><p>Human activities that generate greenhouse gas emissions pose a significant threat to urban green and sustainable development. Production activities in key industrial sectors are a primary contributor to high urban carbon emissions. Therefore, effectively reducing carbon emissions in these sectors is crucial for achieving urban carbon peak and neutrality goals. Carbon emission monitoring is a critical approach that aids governmental bodies in understanding changes in industrial carbon emissions, thereby supporting decision-making and carbon reduction efforts. However, current industry-oriented carbon monitoring methods suffer from issues such as low frequency, poor accuracy, and inadequate privacy security. To address these challenges, this article proposes a novel privacy-protected \"electricity-carbon'' nexus model, long short-term memory with the vertical federated framework (VF-LSTM), to monitor carbon emissions in key urban industries. The vertical federated framework ensures \"usable but invisible\" privacy protection for multisource data from various participants. The embedded long short-term memory model accurately captures industry-specific carbon emissions. Using data from key industries (steel, petrochemical, chemical, and nonferrous industries), this article constructs and validates the performance of the proposed industry-level carbon emission monitoring model. The results demonstrate that the model has high accuracy and robustness, effectively monitoring industry carbon emissions while protecting data privacy.</p>","PeriodicalId":51314,"journal":{"name":"Big Data","volume":" ","pages":"441-452"},"PeriodicalIF":2.6,"publicationDate":"2025-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145574953","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
Evolutionary Trends in Decision Sciences Education Research from Simulation and Games to Big Data Analytics and Generative Artificial Intelligence. 决策科学教育研究的进化趋势:从模拟和游戏到大数据分析和生成人工智能。
IF 2.6 4区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-10-01 Epub Date: 2025-02-28 DOI: 10.1089/big.2024.0128
Ikpe Justice Akpan, Rouzbeh Razavi, Asuama A Akpan

Decision sciences (DSC) involves studying complex dynamic systems and processes to aid informed choices subject to constraints in uncertain conditions. It integrates multidisciplinary methods and strategies to evaluate decision engineering processes, identifying alternatives and providing insights toward enhancing prudent decision-making. This study analyzes the evolutionary trends and innovation in DSC education and research trends over the past 25 years. Using metadata from bibliographic records and employing the science mapping method and text analytics, we map and evaluate the thematic, intellectual, and social structures of DSC research. The results identify "knowledge management," "decision support systems," "data envelopment analysis," "simulation," and "artificial intelligence" (AI) as some of the prominent critical skills and knowledge requirements for problem-solving in DSC before and during the period (2000-2024). However, these technologies are evolving significantly in the recent wave of digital transformation, with data analytics frameworks (including techniques such as big data analytics, machine learning, business intelligence, data mining, and information visualization) becoming crucial. DSC education and research continue to mirror the development in practice, with sustainable education through virtual/online learning becoming prominent. Innovative pedagogical approaches/strategies also include computer simulation and games ("play and learn" or "role-playing"). The current era witnesses AI adoption in different forms as conversational Chatbot agent and generative AI (GenAI), such as chat generative pretrained transformer in teaching, learning, and scholarly activities amidst challenges (academic integrity, plagiarism, intellectual property violations, and other ethical and legal issues). Future DSC education must innovatively integrate GenAI into DSC education and address the resulting challenges.

决策科学(DSC)涉及研究复杂的动态系统和过程,以帮助人们在不确定的条件下根据制约因素做出明智的选择。它整合了多学科方法和策略,以评估决策工程流程、确定替代方案并提供见解,从而加强审慎决策。本研究分析了过去 25 年中 DSC 教育和研究趋势的演变趋势和创新。利用书目记录中的元数据,并采用科学绘图法和文本分析法,我们对 DSC 研究的主题、知识和社会结构进行了绘图和评估。研究结果表明,"知识管理"、"决策支持系统"、"数据包络分析"、"模拟 "和 "人工智能"(AI)是 2000-2024 年之前和期间(2000-2024 年)DSC 解决问题所需的一些重要技能和知识。然而,在最近的数字化转型浪潮中,这些技术正在发生重大演变,数据分析框架(包括大数据分析、机器学习、商业智能、数据挖掘和信息可视化等技术)变得至关重要。DSC 教育和研究继续反映实践中的发展,通过虚拟/在线学习开展可持续教育的情况日益突出。创新的教学方法/策略还包括计算机模拟和游戏("边玩边学 "或 "角色扮演")。当今时代,人工智能以对话式聊天机器人(Chatbot agent)和生成式人工智能(GenAI)等不同形式被广泛采用,如在教学、学习和学术活动中使用的聊天生成式预训练转换器,它面临着各种挑战(学术诚信、剽窃、侵犯知识产权以及其他伦理和法律问题)。未来的 DSC 教育必须创新性地将 GenAI 融入 DSC 教育,并应对由此带来的挑战。
{"title":"Evolutionary Trends in Decision Sciences Education Research from Simulation and Games to Big Data Analytics and Generative Artificial Intelligence.","authors":"Ikpe Justice Akpan, Rouzbeh Razavi, Asuama A Akpan","doi":"10.1089/big.2024.0128","DOIUrl":"10.1089/big.2024.0128","url":null,"abstract":"<p><p>Decision sciences (DSC) involves studying complex dynamic systems and processes to aid informed choices subject to constraints in uncertain conditions. It integrates multidisciplinary methods and strategies to evaluate decision engineering processes, identifying alternatives and providing insights toward enhancing prudent decision-making. This study analyzes the evolutionary trends and innovation in DSC education and research trends over the past 25 years. Using metadata from bibliographic records and employing the science mapping method and text analytics, we map and evaluate the thematic, intellectual, and social structures of DSC research. The results identify \"knowledge management,\" \"decision support systems,\" \"data envelopment analysis,\" \"simulation,\" and \"artificial intelligence\" (AI) as some of the prominent critical skills and knowledge requirements for problem-solving in DSC before and during the period (2000-2024). However, these technologies are evolving significantly in the recent wave of digital transformation, with data analytics frameworks (including techniques such as big data analytics, machine learning, business intelligence, data mining, and information visualization) becoming crucial. DSC education and research continue to mirror the development in practice, with sustainable education through virtual/online learning becoming prominent. Innovative pedagogical approaches/strategies also include computer simulation and games (\"play and learn\" or \"role-playing\"). The current era witnesses AI adoption in different forms as conversational Chatbot agent and generative AI (GenAI), such as chat generative pretrained transformer in teaching, learning, and scholarly activities amidst challenges (academic integrity, plagiarism, intellectual property violations, and other ethical and legal issues). Future DSC education must innovatively integrate GenAI into DSC education and address the resulting challenges.</p>","PeriodicalId":51314,"journal":{"name":"Big Data","volume":" ","pages":"416-437"},"PeriodicalIF":2.6,"publicationDate":"2025-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143527974","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
The Impact of Cloaking Digital Footprints on User Privacy and Personalization. 隐藏数字足迹对用户隐私和个性化的影响。
IF 2.6 4区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-10-01 Epub Date: 2025-01-10 DOI: 10.1089/big.2024.0036
Sofie Goethals, Sandra Matz, Foster Provost, David Martens, Yanou Ramon

Our online lives generate a wealth of behavioral records-digital footprints-which are stored and leveraged by technology platforms. These data can be used to create value for users by personalizing services. At the same time, however, it also poses a threat to people's privacy by offering a highly intimate window into their private traits (e.g., their personality, political ideology, sexual orientation). We explore the concept of cloaking: allowing users to hide parts of their digital footprints from predictive algorithms, to prevent unwanted inferences. This article addresses two open questions: (i) can cloaking be effective in the longer term, as users continue to generate new digital footprints? And (ii) what is the potential impact of cloaking on the accuracy of desirable inferences? We introduce a novel strategy focused on cloaking "metafeatures" and compare its efficacy against just cloaking the raw footprints. The main findings are (i) while cloaking effectiveness does indeed diminish over time, using metafeatures slows the degradation; (ii) there is a tradeoff between privacy and personalization: cloaking undesired inferences also can inhibit desirable inferences. Furthermore, the metafeature strategy-which yields more stable cloaking-also incurs a larger reduction in desirable inferences.

我们的网络生活产生了大量的行为记录——数字足迹——这些记录被技术平台存储和利用。这些数据可以通过个性化服务为用户创造价值。然而,与此同时,它也对人们的隐私构成了威胁,因为它提供了一个非常亲密的窗口,可以看到他们的私人特征(例如,他们的个性、政治意识形态、性取向)。我们探索了隐形的概念:允许用户隐藏他们的部分数字足迹,以防止不必要的推断。本文解决了两个悬而未决的问题:(i)随着用户不断产生新的数字足迹,隐身在长期内是否有效?(ii)隐藏对理想推论的准确性有什么潜在影响?我们介绍了一种专注于掩盖“元特征”的新策略,并将其与仅仅掩盖原始足迹的效果进行了比较。主要发现是:(1)虽然隐形效果确实会随着时间的推移而减弱,但使用元特征可以减缓这种退化;(ii)隐私和个性化之间存在权衡:掩盖不希望的推断也会抑制希望的推断。此外,元特征策略——产生更稳定的隐形——也会导致理想推断的更大减少。
{"title":"The Impact of Cloaking Digital Footprints on User Privacy and Personalization.","authors":"Sofie Goethals, Sandra Matz, Foster Provost, David Martens, Yanou Ramon","doi":"10.1089/big.2024.0036","DOIUrl":"10.1089/big.2024.0036","url":null,"abstract":"<p><p>Our online lives generate a wealth of behavioral records-<i>digital footprints</i>-which are stored and leveraged by technology platforms. These data can be used to create value for users by personalizing services. At the same time, however, it also poses a threat to people's privacy by offering a highly intimate window into their private traits (e.g., their personality, political ideology, sexual orientation). We explore the concept of <i>cloaking</i>: allowing users to hide parts of their digital footprints from predictive algorithms, to prevent unwanted inferences. This article addresses two open questions: (i) can cloaking be effective in the longer term, as users continue to generate new digital footprints? And (ii) what is the potential impact of cloaking on the accuracy of <i>desirable</i> inferences? We introduce a novel strategy focused on cloaking \"metafeatures\" and compare its efficacy against just cloaking the raw footprints. The main findings are (i) while cloaking effectiveness does indeed diminish over time, using metafeatures slows the degradation; (ii) there is a tradeoff between privacy and personalization: cloaking undesired inferences also can inhibit desirable inferences. Furthermore, the metafeature strategy-which yields more stable cloaking-also incurs a larger reduction in desirable inferences.</p>","PeriodicalId":51314,"journal":{"name":"Big Data","volume":" ","pages":"345-363"},"PeriodicalIF":2.6,"publicationDate":"2025-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142958560","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
Maximizing Influence in Social Networks Using Combined Local Features and Deep Learning-Based Node Embedding. 利用组合本地特征和基于深度学习的节点嵌入,最大化社交网络中的影响力。
IF 2.6 4区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-10-01 Epub Date: 2024-10-22 DOI: 10.1089/big.2023.0117
Asgarali Bouyer, Hamid Ahmadi Beni, Amin Golzari Oskouei, Alireza Rouhi, Bahman Arasteh, Xiaoyang Liu

The influence maximization problem has several issues, including low infection rates and high time complexity. Many proposed methods are not suitable for large-scale networks due to their time complexity or free parameter usage. To address these challenges, this article proposes a local heuristic called Embedding Technique for Influence Maximization (ETIM) that uses shell decomposition, graph embedding, and reduction, as well as combined local structural features. The algorithm selects candidate nodes based on their connections among network shells and topological features, reducing the search space and computational overhead. It uses a deep learning-based node embedding technique to create a multidimensional vector of candidate nodes and calculates the dependency on spreading for each node based on local topological features. Finally, influential nodes are identified using the results of the previous phases and newly defined local features. The proposed algorithm is evaluated using the independent cascade model, showing its competitiveness and ability to achieve the best performance in terms of solution quality. Compared with the collective influence global algorithm, ETIM is significantly faster and improves the infection rate by an average of 12%.

影响最大化问题有几个问题,包括低感染率和高时间复杂性。由于时间复杂性或自由参数的使用,许多建议的方法都不适合大规模网络。为了应对这些挑战,本文提出了一种名为 "影响力最大化嵌入技术"(ETIM)的局部启发式算法,该算法使用壳分解、图嵌入和还原,并结合了局部结构特征。该算法根据网络壳之间的连接和拓扑特征选择候选节点,从而减少了搜索空间和计算开销。它使用基于深度学习的节点嵌入技术创建候选节点的多维向量,并根据本地拓扑特征计算每个节点对传播的依赖性。最后,利用前一阶段的结果和新定义的本地特征识别出有影响力的节点。利用独立级联模型对所提出的算法进行了评估,结果表明该算法具有竞争力,能够在解决方案质量方面达到最佳性能。与集体影响全局算法相比,ETIM 的速度明显更快,感染率平均提高了 12%。
{"title":"Maximizing Influence in Social Networks Using Combined Local Features and Deep Learning-Based Node Embedding.","authors":"Asgarali Bouyer, Hamid Ahmadi Beni, Amin Golzari Oskouei, Alireza Rouhi, Bahman Arasteh, Xiaoyang Liu","doi":"10.1089/big.2023.0117","DOIUrl":"10.1089/big.2023.0117","url":null,"abstract":"<p><p>The influence maximization problem has several issues, including low infection rates and high time complexity. Many proposed methods are not suitable for large-scale networks due to their time complexity or free parameter usage. To address these challenges, this article proposes a local heuristic called Embedding Technique for Influence Maximization (ETIM) that uses shell decomposition, graph embedding, and reduction, as well as combined local structural features. The algorithm selects candidate nodes based on their connections among network shells and topological features, reducing the search space and computational overhead. It uses a deep learning-based node embedding technique to create a multidimensional vector of candidate nodes and calculates the dependency on spreading for each node based on local topological features. Finally, influential nodes are identified using the results of the previous phases and newly defined local features. The proposed algorithm is evaluated using the independent cascade model, showing its competitiveness and ability to achieve the best performance in terms of solution quality. Compared with the collective influence global algorithm, ETIM is significantly faster and improves the infection rate by an average of 12%.</p>","PeriodicalId":51314,"journal":{"name":"Big Data","volume":" ","pages":"379-397"},"PeriodicalIF":2.6,"publicationDate":"2025-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142480288","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
DMHANT: DropMessage Hypergraph Attention Network for Information Propagation Prediction. DMHANT:用于信息传播预测的 DropMessage 超图注意力网络。
IF 2.6 4区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-10-01 Epub Date: 2024-10-23 DOI: 10.1089/big.2023.0131
Qi Ouyang, Hongchang Chen, Shuxin Liu, Liming Pu, Dongdong Ge, Ke Fan

Predicting propagation cascades is crucial for understanding information propagation in social networks. Existing methods always focus on structure or order of infected users in a single cascade sequence, ignoring the global dependencies of cascades and users, which is insufficient to characterize their dynamic interaction preferences. Moreover, existing methods are poor at addressing the problem of model robustness. To address these issues, we propose a predication model named DropMessage Hypergraph Attention Networks, which constructs a hypergraph based on the cascade sequence. Specifically, to dynamically obtain user preferences, we divide the diffusion hypergraph into multiple subgraphs according to the time stamps, develop hypergraph attention networks to explicitly learn complete interactions, and adopt a gated fusion strategy to connect them for user cascade prediction. In addition, a new drop immediately method DropMessage is added to increase the robustness of the model. Experimental results on three real-world datasets indicate that proposed model significantly outperforms the most advanced information propagation prediction model in both MAP@k and Hits@K metrics, and the experiment also proves that the model achieves more significant prediction performance than the existing model under data perturbation.

预测传播级联对于理解社交网络中的信息传播至关重要。现有方法总是关注单个级联序列中受感染用户的结构或顺序,忽略了级联和用户之间的全局依赖关系,不足以描述他们的动态互动偏好。此外,现有方法在解决模型稳健性问题方面也存在不足。为了解决这些问题,我们提出了一种名为 "DropMessage 超图注意力网络 "的预测模型,该模型基于级联序列构建超图。具体来说,为了动态获取用户偏好,我们根据时间戳将扩散超图划分为多个子图,开发超图注意力网络来显式学习完整的交互,并采用门控融合策略将它们连接起来进行用户级联预测。此外,为了提高模型的鲁棒性,还增加了一种新的立即删除方法 DropMessage。在三个真实数据集上的实验结果表明,所提出的模型在 MAP@k 和 Hits@K 两个指标上都明显优于最先进的信息传播预测模型,实验还证明该模型在数据扰动下比现有模型取得了更显著的预测性能。
{"title":"DMHANT: DropMessage Hypergraph Attention Network for Information Propagation Prediction.","authors":"Qi Ouyang, Hongchang Chen, Shuxin Liu, Liming Pu, Dongdong Ge, Ke Fan","doi":"10.1089/big.2023.0131","DOIUrl":"10.1089/big.2023.0131","url":null,"abstract":"<p><p>Predicting propagation cascades is crucial for understanding information propagation in social networks. Existing methods always focus on structure or order of infected users in a single cascade sequence, ignoring the global dependencies of cascades and users, which is insufficient to characterize their dynamic interaction preferences. Moreover, existing methods are poor at addressing the problem of model robustness. To address these issues, we propose a predication model named DropMessage Hypergraph Attention Networks, which constructs a hypergraph based on the cascade sequence. Specifically, to dynamically obtain user preferences, we divide the diffusion hypergraph into multiple subgraphs according to the time stamps, develop hypergraph attention networks to explicitly learn complete interactions, and adopt a gated fusion strategy to connect them for user cascade prediction. In addition, a new drop immediately method DropMessage is added to increase the robustness of the model. Experimental results on three real-world datasets indicate that proposed model significantly outperforms the most advanced information propagation prediction model in both MAP@k and Hits@K metrics, and the experiment also proves that the model achieves more significant prediction performance than the existing model under data perturbation.</p>","PeriodicalId":51314,"journal":{"name":"Big Data","volume":" ","pages":"364-378"},"PeriodicalIF":2.6,"publicationDate":"2025-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142512575","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
Optimizing Multilayer Networks Through Time-Dependent Decision-Making: A Comparative Study. 基于时间依赖决策的多层网络优化:比较研究。
IF 2.6 4区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-10-01 Epub Date: 2025-07-08 DOI: 10.1089/big.2024.0094
Kenan Menguc, Alper Yilmaz

This research highlights the importance of accurately analyzing real-world multilayer network problems and introduces effective solutions. Whether simulating protein-protein network, transportation network, or a social network, representation and analysis over these networks are crucial. Multilayer networks, that contain added layers, may undergo dynamic transformations over time akin to single-layer networks that experience changes over time. These dynamic networks, that expand and contract, can be optimized by guidance from human operators if the transient changes are known and can be controlled. For the expansion and contraction of networks, this study introduces two distinct algorithms designed to make optimal decisions across dynamic changes of a multilayer network. The main strategy is to minimize the standard deviation across betweenness centrality of the edges in a complex network. The approaches we introduce incorporate diverse constraints into a multilayer weighted network, probing the network's expansion or contraction under various conditions represented as objective functions. The addition of changing of objective function enhances the model's adaptability to solve a wide array of problem types. In this way, complex network structures representing real-world problems can be mathematically modeled which makes it easier to make informed decisions.

本研究强调了准确分析实际多层网络问题的重要性,并介绍了有效的解决方案。无论是模拟蛋白质-蛋白质网络、运输网络还是社会网络,对这些网络的表示和分析都是至关重要的。包含附加层的多层网络可能会随时间发生动态变化,类似于单层网络随时间发生变化。这些动态网络可以扩展和收缩,如果瞬态变化是已知的,并且可以控制,则可以通过人工操作人员的指导进行优化。对于网络的扩展和收缩,本研究引入了两种不同的算法,旨在跨多层网络的动态变化做出最优决策。其主要策略是最小化复杂网络中沿中间性和中心性的标准偏差。我们引入的方法将不同的约束纳入多层加权网络,探测网络在目标函数表示的各种条件下的扩张或收缩。目标函数变化的加入,增强了模型对广泛问题类型的适应性。通过这种方式,可以对代表现实世界问题的复杂网络结构进行数学建模,从而更容易做出明智的决策。
{"title":"Optimizing Multilayer Networks Through Time-Dependent Decision-Making: A Comparative Study.","authors":"Kenan Menguc, Alper Yilmaz","doi":"10.1089/big.2024.0094","DOIUrl":"10.1089/big.2024.0094","url":null,"abstract":"<p><p>This research highlights the importance of accurately analyzing real-world multilayer network problems and introduces effective solutions. Whether simulating protein-protein network, transportation network, or a social network, representation and analysis over these networks are crucial. Multilayer networks, that contain added layers, may undergo dynamic transformations over time akin to single-layer networks that experience changes over time. These dynamic networks, that expand and contract, can be optimized by guidance from human operators if the transient changes are known and can be controlled. For the expansion and contraction of networks, this study introduces two distinct algorithms designed to make optimal decisions across dynamic changes of a multilayer network. The main strategy is to minimize the standard deviation across betweenness centrality of the edges in a complex network. The approaches we introduce incorporate diverse constraints into a multilayer weighted network, probing the network's expansion or contraction under various conditions represented as objective functions. The addition of changing of objective function enhances the model's adaptability to solve a wide array of problem types. In this way, complex network structures representing real-world problems can be mathematically modeled which makes it easier to make informed decisions.</p>","PeriodicalId":51314,"journal":{"name":"Big Data","volume":" ","pages":"398-415"},"PeriodicalIF":2.6,"publicationDate":"2025-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144585578","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 Fast Survival Support Vector Regression Approach to Large Scale Credit Scoring via Safe Screening. 通过安全筛选进行大规模信用评分的快速生存支持向量回归方法。
IF 2.6 4区 计算机科学 Q2 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Pub Date : 2025-08-01 Epub Date: 2024-07-23 DOI: 10.1089/big.2023.0033
Hong Wang, Ling Hong

Survival models have found wider and wider applications in credit scoring recently due to their ability to estimate the dynamics of risk over time. In this research, we propose a Buckley-James safe sample screening support vector regression (BJS4VR) algorithm to model large-scale survival data by combing the Buckley-James transformation and support vector regression. Different from previous support vector regression survival models, censored samples here are imputed using a censoring unbiased Buckley-James estimator. Safe sample screening is then applied to discard samples that guaranteed to be non-active at the final optimal solution from the original data to improve efficiency. Experimental results on the large-scale real lending club loan data have shown that the proposed BJS4VR model outperforms existing popular survival models such as RSFM, CoxRidge and CoxBoost in terms of both prediction accuracy and time efficiency. Important variables highly correlated with credit risk are also identified with the proposed method.

由于生存模型能够估计随时间变化的风险动态,因此近来在信用评分领域得到了越来越广泛的应用。在这项研究中,我们提出了一种巴克利-詹姆斯安全样本筛选支持向量回归(BJS4VR)算法,通过结合巴克利-詹姆斯变换和支持向量回归,对大规模生存数据进行建模。与以往的支持向量回归生存模型不同,这里的删减样本是使用删减无偏的巴克利-詹姆斯估计器来估算的。然后应用安全样本筛选,从原始数据中剔除保证在最终最优解中不活跃的样本,以提高效率。在大规模真实借贷俱乐部贷款数据上的实验结果表明,所提出的 BJS4VR 模型在预测准确性和时间效率方面都优于现有的流行生存模型,如 RSFM、CoxRidge 和 CoxBoost。此外,所提出的方法还识别出了与信贷风险高度相关的重要变量。
{"title":"A Fast Survival Support Vector Regression Approach to Large Scale Credit Scoring via Safe Screening.","authors":"Hong Wang, Ling Hong","doi":"10.1089/big.2023.0033","DOIUrl":"10.1089/big.2023.0033","url":null,"abstract":"<p><p>Survival models have found wider and wider applications in credit scoring recently due to their ability to estimate the dynamics of risk over time. In this research, we propose a Buckley-James safe sample screening support vector regression (BJS4VR) algorithm to model large-scale survival data by combing the Buckley-James transformation and support vector regression. Different from previous support vector regression survival models, censored samples here are imputed using a censoring unbiased Buckley-James estimator. Safe sample screening is then applied to discard samples that guaranteed to be non-active at the final optimal solution from the original data to improve efficiency. Experimental results on the large-scale real lending club loan data have shown that the proposed BJS4VR model outperforms existing popular survival models such as RSFM, CoxRidge and CoxBoost in terms of both prediction accuracy and time efficiency. Important variables highly correlated with credit risk are also identified with the proposed method.</p>","PeriodicalId":51314,"journal":{"name":"Big Data","volume":" ","pages":"304-318"},"PeriodicalIF":2.6,"publicationDate":"2025-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141753329","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学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1