首页 > 最新文献

Information Processing & Management最新文献

英文 中文
Modeling heterogeneous normality in time series anomaly detection 时间序列异常检测中的异构正态性建模
IF 6.9 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2026-07-01 Epub Date: 2026-01-28 DOI: 10.1016/j.ipm.2026.104644
Xiaohui Zhou , Yijie Wang , Hongzuo Xu , Yizhou Li
Time series anomaly detection is crucial in many fields, where the objective is to identify unusual patterns by learning normality from sequential observations. However, existing methods typically treat the entire training data as a single, homogeneous normal class, which disregards the normal diversity caused by distribution shifts over time. As a result, these methods are forced to learn a single, complex decision boundary that must enclose all variations of normal behavior, making it difficult to precisely distinguish subtle anomalies hidden within the normal patterns. Therefore, this paper tackles this challenge by explicitly modeling heterogeneous normality, which allows for learning simpler, localized decision boundaries to separate anomalies. Specifically, we propose a novel approach that decomposes the heterogeneous class space into multiple normal classes, adopting a two-stage coarse-to-fine training paradigm: (1) a Mixture of Experts (MoE) framework assigns pseudo-labels by routing input features to specialized experts for prediction, approximating the latent sub-class structure; (2) enhanced features are generated based on pseudo-labels and feature space is refined via spectral decomposition, which contracts class boundaries and better exposes anomalies. Extensive experiments on 23 univariate datasets and 17 multivariate datasets show that our approach significantly outperforms state-of-the-art competitors by 2.55%-21.76% in VUS-PR, validating the importance of modeling heterogeneous normality in time series anomaly detection.
时间序列异常检测在许多领域都是至关重要的,其目标是通过从序列观测中学习正态性来识别异常模式。然而,现有的方法通常将整个训练数据视为一个单一的、同构的正态类,而忽略了分布随时间变化而引起的正态多样性。因此,这些方法被迫学习一个单一的、复杂的决策边界,它必须包含正常行为的所有变化,这使得精确区分隐藏在正常模式中的微妙异常变得困难。因此,本文通过显式建模异构正态性来解决这一挑战,这允许学习更简单的局部决策边界来分离异常。具体来说,我们提出了一种新的方法,将异构类空间分解为多个正常类,采用两阶段粗到精的训练范式:(1)混合专家(MoE)框架通过将输入特征路由给专门的专家进行预测来分配伪标签,近似潜在的子类结构;(2)基于伪标签生成增强特征,通过谱分解细化特征空间,收缩类边界,更好地暴露异常;在23个单变量数据集和17个多变量数据集上进行的大量实验表明,我们的方法在VUS-PR方面明显优于最先进的竞争对手2.55%-21.76%,验证了异构正态性建模在时间序列异常检测中的重要性。
{"title":"Modeling heterogeneous normality in time series anomaly detection","authors":"Xiaohui Zhou ,&nbsp;Yijie Wang ,&nbsp;Hongzuo Xu ,&nbsp;Yizhou Li","doi":"10.1016/j.ipm.2026.104644","DOIUrl":"10.1016/j.ipm.2026.104644","url":null,"abstract":"<div><div>Time series anomaly detection is crucial in many fields, where the objective is to identify unusual patterns by learning normality from sequential observations. However, existing methods typically treat the entire training data as a single, homogeneous normal class, which disregards the normal diversity caused by distribution shifts over time. As a result, these methods are forced to learn a single, complex decision boundary that must enclose all variations of normal behavior, making it difficult to precisely distinguish subtle anomalies hidden within the normal patterns. Therefore, this paper tackles this challenge by explicitly modeling heterogeneous normality, which allows for learning simpler, localized decision boundaries to separate anomalies. Specifically, we propose a novel approach that decomposes the heterogeneous class space into multiple normal classes, adopting a two-stage <em>coarse-to-fine</em> training paradigm: (1) a Mixture of Experts (MoE) framework assigns pseudo-labels by routing input features to specialized experts for prediction, approximating the latent sub-class structure; (2) enhanced features are generated based on pseudo-labels and feature space is refined via spectral decomposition, which contracts class boundaries and better exposes anomalies. Extensive experiments on 23 univariate datasets and 17 multivariate datasets show that our approach significantly outperforms state-of-the-art competitors by 2.55%-21.76% in VUS-PR, validating the importance of modeling heterogeneous normality in time series anomaly detection.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"63 5","pages":"Article 104644"},"PeriodicalIF":6.9,"publicationDate":"2026-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146081583","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A blockchain-based digital evidence management system: Integrating forensic procedures and multi-party authorization 基于区块链的数字证据管理系统:整合取证程序和多方授权
IF 6.9 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2026-07-01 Epub Date: 2026-01-27 DOI: 10.1016/j.ipm.2026.104654
Yunji Park, Doowon Jeong
Current blockchain-based digital evidence systems provide strong technical integrity but fail to adequately address the procedural legitimacy required for court admissibility, frequently omitting judicial authorization workflows, differentiated handling of voluntary versus compulsory evidence, and transparent destruction protocols. To address these gaps, we propose B-DEMS, a blockchain-based digital evidence management system that integrates the full evidence lifecycle–from registration to court-authorized destruction–while encoding jurisdiction-specific legal requirements across South Korea, the United States, the European Union, and China. B-DEMS implements multi-party authorization, conditional decryption, and transaction-based disposal to ensure auditability and procedural compliance. Experimental evaluation across 1950 workflow executions demonstrated that B-DEMS achieved a maximum throughput of 10,890 TPS, representing 51–219% improvement over state-of-the-art systems, while maintaining stable scalability with latency increasing only 2.7-fold under a 5-fold peer expansion. Security analysis confirmed a 0% attack success rate across 300 adversarial attempts, and cross-border cooperation scenarios exhibited consistent adherence to jurisdiction-specific approval workflows. By aligning evidentiary procedures with a scalable blockchain architecture, B-DEMS provides a technically robust and procedurally compliant foundation for practical deployment in multi-agency and international investigative environments.
目前基于区块链的数字证据系统提供了强大的技术完整性,但未能充分解决法院可采性所需的程序合法性,经常忽略司法授权工作流程,区分自愿与强制证据的处理,以及透明的销毁协议。为了解决这些差距,我们提出了b - dem,这是一种基于区块链的数字证据管理系统,集成了从登记到法院授权销毁的完整证据生命周期,同时对韩国、美国、欧盟和中国的特定司法管辖区的法律要求进行编码。B-DEMS实现了多方授权、条件解密和基于事务的处理,以确保可审计性和程序遵从性。对1950个工作流执行的实验评估表明,b - dem实现了10,890 TPS的最大吞吐量,比最先进的系统提高了51-219%,同时保持稳定的可扩展性,延迟在5倍的对等扩展下仅增加2.7倍。安全分析证实,在300次对抗性攻击中,攻击成功率为0%,跨境合作场景显示出对特定管辖权审批工作流程的一致遵守。通过将证据程序与可扩展的区块链架构相结合,b - dem为在多机构和国际调查环境中实际部署提供了技术上强大和程序上兼容的基础。
{"title":"A blockchain-based digital evidence management system: Integrating forensic procedures and multi-party authorization","authors":"Yunji Park,&nbsp;Doowon Jeong","doi":"10.1016/j.ipm.2026.104654","DOIUrl":"10.1016/j.ipm.2026.104654","url":null,"abstract":"<div><div>Current blockchain-based digital evidence systems provide strong technical integrity but fail to adequately address the procedural legitimacy required for court admissibility, frequently omitting judicial authorization workflows, differentiated handling of voluntary versus compulsory evidence, and transparent destruction protocols. To address these gaps, we propose B-DEMS, a blockchain-based digital evidence management system that integrates the full evidence lifecycle–from registration to court-authorized destruction–while encoding jurisdiction-specific legal requirements across South Korea, the United States, the European Union, and China. B-DEMS implements multi-party authorization, conditional decryption, and transaction-based disposal to ensure auditability and procedural compliance. Experimental evaluation across 1950 workflow executions demonstrated that B-DEMS achieved a maximum throughput of 10,890 TPS, representing 51–219% improvement over state-of-the-art systems, while maintaining stable scalability with latency increasing only 2.7-fold under a 5-fold peer expansion. Security analysis confirmed a 0% attack success rate across 300 adversarial attempts, and cross-border cooperation scenarios exhibited consistent adherence to jurisdiction-specific approval workflows. By aligning evidentiary procedures with a scalable blockchain architecture, B-DEMS provides a technically robust and procedurally compliant foundation for practical deployment in multi-agency and international investigative environments.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"63 5","pages":"Article 104654"},"PeriodicalIF":6.9,"publicationDate":"2026-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146081581","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
SRCR: Faithful structured reasoning with curriculum reinforcement learning for explainable question answering SRCR:忠实的结构化推理与课程强化学习,用于可解释的问题回答
IF 6.9 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2026-07-01 Epub Date: 2026-01-27 DOI: 10.1016/j.ipm.2026.104653
Yue Fan , Hu Zhang , Ru Li , Guangjun Zhang , Yujie Wang , Hongye Tan , Yuanlong Wang , Xiaoli Li , Jiye Liang
Existing explainable question answering methods based on structured reasoning lack effective modeling of logical dependencies between steps and underutilize the potential of intermediate conclusions in structured reasoning. To address these challenges, we propose SRCR, a faithful Structured Reasoning method based on Curriculum Reinforcement learning. Specifically, we propose an easy-to-difficult reverse structured curriculum that gradually slides the initial state of reasoning from end to beginning, which fully captures the complex dependencies of multi-step reasoning. Moreover, we treat fact selection and deductive generation as a unified process and construct a faithfulness reward function to mine faithful reasoning steps during the model learning and exploring phases. Experimental results on the structured reasoning datasets EntailmentBank and STREET demonstrate that SRCR achieves state-of-the-art performance in factual accuracy and intermediate conclusion correctness, surpassing previous methods by 8.0% and 2.0%, respectively. Moreover, SRCR also improves answer accuracy by 2.6% to 8.3%, and extensive analysis shows that SRCR can generate more faithful structured explanations.
现有的基于结构化推理的可解释问答方法缺乏对步骤间逻辑依赖关系的有效建模,未能充分利用结构化推理中中间结论的潜力。为了解决这些挑战,我们提出了SRCR,一种基于课程强化学习的忠实结构化推理方法。具体来说,我们提出了一个易难的反向结构化课程,逐步将推理的初始状态从头到尾滑动,充分捕捉了多步骤推理的复杂依赖关系。此外,我们将事实选择和演绎生成视为一个统一的过程,并构建忠实度奖励函数来挖掘模型学习和探索阶段的忠实推理步骤。在结构化推理数据集EntailmentBank和STREET上的实验结果表明,SRCR在事实准确性和中间结论正确性方面达到了最先进的性能,分别比以前的方法提高了8.0%和2.0%。此外,SRCR还将答案准确率提高了2.6%至8.3%,广泛的分析表明,SRCR可以生成更忠实的结构化解释。
{"title":"SRCR: Faithful structured reasoning with curriculum reinforcement learning for explainable question answering","authors":"Yue Fan ,&nbsp;Hu Zhang ,&nbsp;Ru Li ,&nbsp;Guangjun Zhang ,&nbsp;Yujie Wang ,&nbsp;Hongye Tan ,&nbsp;Yuanlong Wang ,&nbsp;Xiaoli Li ,&nbsp;Jiye Liang","doi":"10.1016/j.ipm.2026.104653","DOIUrl":"10.1016/j.ipm.2026.104653","url":null,"abstract":"<div><div>Existing explainable question answering methods based on structured reasoning lack effective modeling of logical dependencies between steps and underutilize the potential of intermediate conclusions in structured reasoning. To address these challenges, we propose SRCR, a faithful <strong>S</strong>tructured <strong>R</strong>easoning method based on <strong>C</strong>urriculum <strong>R</strong>einforcement learning. Specifically, we propose an easy-to-difficult reverse structured curriculum that gradually slides the initial state of reasoning from end to beginning, which fully captures the complex dependencies of multi-step reasoning. Moreover, we treat fact selection and deductive generation as a unified process and construct a faithfulness reward function to mine faithful reasoning steps during the model learning and exploring phases. Experimental results on the structured reasoning datasets EntailmentBank and STREET demonstrate that SRCR achieves state-of-the-art performance in factual accuracy and intermediate conclusion correctness, surpassing previous methods by 8.0% and 2.0%, respectively. Moreover, SRCR also improves answer accuracy by 2.6% to 8.3%, and extensive analysis shows that SRCR can generate more faithful structured explanations.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"63 5","pages":"Article 104653"},"PeriodicalIF":6.9,"publicationDate":"2026-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146081585","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Beyond traditional search: New characteristics of online health information seeking about chronic disease with Gen AI 超越传统搜索:使用人工智能搜索慢性病在线健康信息的新特点
IF 6.9 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2026-07-01 Epub Date: 2026-02-03 DOI: 10.1016/j.ipm.2026.104668
Zhenyi Tang , Yang Su , Preben Hansen , Pengyi Zhang
Chronic health information seeking is vital for patient well-being and self-management, yet how AI aids this process remains unclear. To explore how users interact with Gen AI tools when seeking and evaluating chronic health information, this study conducted an experiment involving 60 participants, collecting 757 user-generated dialogues related to three chronic conditions. We developed a complementary coding framework integrating analysis of user behavior and AI’s response to understand user-AI interactions and their impact on chronic disease information seeking, evaluation and adoption. The results show that while user interactions with Gen AI share similarities with traditional searches, they also exhibit distinct characteristics: 1) User-input prompts are more detailed, with longer sentences and more terms to specify information needs. Users also adopt more diverse reformulation strategies, often informed or inspired by AI feedback. 2) Some users communicate with AI as if interacting with a human, and the AI often responds with emotionally supportive, human-like replies. 3) Users spend less time but engage in more conversation turns, as the AI provides clear, well-structured responses that maintain dialogue flow and adapt to user intent, thereby enhancing retrieval efficiency and encouraging continued interaction. 4) While most users evaluate AI-generated content heuristically and rarely seek external verification, encountering factual inaccuracies or low-credibility responses can reduce their willingness to adopt the AI's output. These findings offer a more holistic understanding of human-AI interaction in online health information seeking and provide valuable guidance for optimizing system design, enhancing algorithm literacy, and improving health management practices.
寻找慢性健康信息对患者的健康和自我管理至关重要,但人工智能如何帮助这一过程仍不清楚。为了探索用户在寻找和评估慢性健康信息时如何与新一代人工智能工具进行交互,本研究进行了一项涉及60名参与者的实验,收集了与三种慢性疾病相关的757个用户生成的对话。我们开发了一个互补的编码框架,整合了用户行为和人工智能响应的分析,以了解用户-人工智能交互及其对慢性病信息寻求、评估和采用的影响。结果表明,虽然用户与Gen AI的交互与传统搜索有相似之处,但它们也表现出不同的特征:1)用户输入提示更详细,句子更长,术语更多,以指定信息需求。用户也会采用更多样化的重新表述策略,通常会受到人工智能反馈的启发。2)一些用户与AI进行交流,就像与人类互动一样,而AI通常会做出情感上支持的、类似人类的回应。3)用户花费的时间更少,但参与的对话回合更多,因为AI提供了清晰、结构良好的响应,保持了对话流,适应了用户的意图,从而提高了检索效率,鼓励了持续的交互。4)虽然大多数用户都是启发式地评估人工智能生成的内容,很少寻求外部验证,但遇到事实不准确或低可信度的回应会降低他们采用人工智能输出的意愿。这些发现为在线健康信息搜索中人类与人工智能的交互提供了更全面的理解,并为优化系统设计、提高算法素养和改进健康管理实践提供了有价值的指导。
{"title":"Beyond traditional search: New characteristics of online health information seeking about chronic disease with Gen AI","authors":"Zhenyi Tang ,&nbsp;Yang Su ,&nbsp;Preben Hansen ,&nbsp;Pengyi Zhang","doi":"10.1016/j.ipm.2026.104668","DOIUrl":"10.1016/j.ipm.2026.104668","url":null,"abstract":"<div><div>Chronic health information seeking is vital for patient well-being and self-management, yet how AI aids this process remains unclear. To explore how users interact with Gen AI tools when seeking and evaluating chronic health information, this study conducted an experiment involving 60 participants, collecting 757 user-generated dialogues related to three chronic conditions. We developed a complementary coding framework integrating analysis of user behavior and AI’s response to understand user-AI interactions and their impact on chronic disease information seeking, evaluation and adoption. The results show that while user interactions with Gen AI share similarities with traditional searches, they also exhibit distinct characteristics: 1) User-input prompts are more detailed, with longer sentences and more terms to specify information needs. Users also adopt more diverse reformulation strategies, often informed or inspired by AI feedback. 2) Some users communicate with AI as if interacting with a human, and the AI often responds with emotionally supportive, human-like replies. 3) Users spend less time but engage in more conversation turns, as the AI provides clear, well-structured responses that maintain dialogue flow and adapt to user intent, thereby enhancing retrieval efficiency and encouraging continued interaction. 4) While most users evaluate AI-generated content heuristically and rarely seek external verification, encountering factual inaccuracies or low-credibility responses can reduce their willingness to adopt the AI's output. These findings offer a more holistic understanding of human-AI interaction in online health information seeking and provide valuable guidance for optimizing system design, enhancing algorithm literacy, and improving health management practices.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"63 5","pages":"Article 104668"},"PeriodicalIF":6.9,"publicationDate":"2026-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146190717","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
From exposure to followers: A stock-and-flow closed-loop framework of creator dynamics 从曝光到追随者:创造者动态的库存-流量闭环框架
IF 6.9 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2026-07-01 Epub Date: 2026-02-09 DOI: 10.1016/j.ipm.2026.104677
Yushi Sun, Bo Sun
In the creator economy, platforms allocate exposure on feeds, and new followers arise largely from that exposure. What is missing is an estimable account-level closed-loop model that links platform-allocated post exposure to long-run follower accumulation. We develop an interpretable stock-and-flow framework with feedback: out-of-feed exposure increases with reach but saturates as the addressable audience is exhausted, unfolds over days after posting, converts into follower inflow, and is offset by proportional churn. The framework yields objects such as a viability threshold, a saturation level, and dynamic responses that separate timing from long-run levels, enabling diagnosis and planning. Using a panel of 1015 creators (794,051 account-days; 829,783 posts), we estimate the primitives via a low-dimensional pipeline and validate the implied dynamics in-sample and out-of-sample. On a strict 180-day holdout, the model attains a median MAPE of 0.020, comparable to strong forecasting baselines and econometric benchmarks. Subsample tests confirm portability across scales and platforms. By mapping traces to decision-relevant diagnostics of saturation, conversion, cadence, and churn, the framework supports design diagnostics and monitoring, and enables causal evaluations when exogenous variation is available.
在创造者经济中,平台会根据动态分配曝光度,而新粉丝主要来自于这种曝光度。缺少的是一个可评估的账户级闭环模型,该模型将平台分配的帖子曝光与长期追随者积累联系起来。我们开发了一个带有反馈的可解释的库存和流量框架:未发布内容的曝光率随着覆盖范围的增加而增加,但随着目标受众的枯竭而饱和,在发布后的几天内展开,转化为关注者流入,并被比例流失率抵消。该框架产生诸如生存能力阈值、饱和水平和动态响应等对象,这些对象将时间与长期水平分开,从而实现诊断和规划。使用1015个创建者(794,051个账户日;829,783个帖子)的面板,我们通过低维管道估计原语,并验证隐含的样本内和样本外动态。在严格的180天内,该模型的MAPE中值为0.020,与强大的预测基线和计量经济学基准相当。子样本测试确认了跨规模和平台的可移植性。通过将轨迹映射到与决策相关的饱和度、转换、节奏和流失的诊断,该框架支持设计诊断和监控,并在外生变化可用时进行因果评估。
{"title":"From exposure to followers: A stock-and-flow closed-loop framework of creator dynamics","authors":"Yushi Sun,&nbsp;Bo Sun","doi":"10.1016/j.ipm.2026.104677","DOIUrl":"10.1016/j.ipm.2026.104677","url":null,"abstract":"<div><div>In the creator economy, platforms allocate exposure on feeds, and new followers arise largely from that exposure. What is missing is an estimable account-level closed-loop model that links platform-allocated post exposure to long-run follower accumulation. We develop an interpretable stock-and-flow framework with feedback: out-of-feed exposure increases with reach but saturates as the addressable audience is exhausted, unfolds over days after posting, converts into follower inflow, and is offset by proportional churn. The framework yields objects such as a viability threshold, a saturation level, and dynamic responses that separate timing from long-run levels, enabling diagnosis and planning. Using a panel of 1015 creators (794,051 account-days; 829,783 posts), we estimate the primitives via a low-dimensional pipeline and validate the implied dynamics in-sample and out-of-sample. On a strict 180-day holdout, the model attains a median MAPE of 0.020, comparable to strong forecasting baselines and econometric benchmarks. Subsample tests confirm portability across scales and platforms. By mapping traces to decision-relevant diagnostics of saturation, conversion, cadence, and churn, the framework supports design diagnostics and monitoring, and enables causal evaluations when exogenous variation is available.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"63 5","pages":"Article 104677"},"PeriodicalIF":6.9,"publicationDate":"2026-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146190569","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
SPECTRA-Net: Spatiotemporal edge-preserving contextual reinforcement architecture for adaptive crowd behavior recognition 光谱网络:用于自适应人群行为识别的时空边缘保持上下文强化结构
IF 6.9 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2026-07-01 Epub Date: 2026-01-27 DOI: 10.1016/j.ipm.2026.104647
Min Zhu , Dengyin Zhang
The study presents the HERA-Net (Hierarchical Edge-aware Reinforcement Architecture) framework, which combines Hierarchical Motion Saliency (HMS) and Deep Reinforcement Learning (DRL) for adaptive crowd behavior recognition. The UCSD Ped2 dataset, comprising 32 surveillance clips (240 × 360 px), showed that HERA-Net improved generalization performance by 20 %, resilience to occlusion by 18 %, and recognition accuracy by 12–15 % compared to state-of-the-art models. In dynamic crowd situations, the HMS module hierarchically mixes local and global motion cues to maintain edge boundaries, while the DRL policy adaptively enhances recognition. A PPO-based DRL enables real-time adaptive behavior detection, and a unique edge-aware loss function ensures exact motion boundaries. Experimental results demonstrate that HERA-Net successfully balances precision and adaptability, making it a dependable, real-time system for intelligent surveillance, anomaly identification, and crowd monitoring.
该研究提出了HERA-Net(分层边缘感知强化架构)框架,该框架将分层运动显著性(HMS)和深度强化学习(DRL)相结合,用于自适应人群行为识别。UCSD Ped2数据集包含32个监控片段(240 × 360像素),表明与最先进的模型相比,HERA-Net的泛化性能提高了20%,遮挡复原力提高了18%,识别精度提高了12 - 15%。在动态人群情况下,HMS模块分层混合局部和全局运动线索以保持边缘边界,而DRL策略自适应增强识别。基于ppo的DRL实现实时自适应行为检测,独特的边缘感知损失功能确保精确的运动边界。实验结果表明,HERA-Net成功地平衡了精度和适应性,使其成为一种可靠、实时的智能监控、异常识别和人群监控系统。
{"title":"SPECTRA-Net: Spatiotemporal edge-preserving contextual reinforcement architecture for adaptive crowd behavior recognition","authors":"Min Zhu ,&nbsp;Dengyin Zhang","doi":"10.1016/j.ipm.2026.104647","DOIUrl":"10.1016/j.ipm.2026.104647","url":null,"abstract":"<div><div>The study presents the HERA-Net (Hierarchical Edge-aware Reinforcement Architecture) framework, which combines Hierarchical Motion Saliency (HMS) and Deep Reinforcement Learning (DRL) for adaptive crowd behavior recognition. The UCSD Ped2 dataset, comprising 32 surveillance clips (240 × 360 px), showed that HERA-Net improved generalization performance by 20 %, resilience to occlusion by 18 %, and recognition accuracy by 12–15 % compared to state-of-the-art models. In dynamic crowd situations, the HMS module hierarchically mixes local and global motion cues to maintain edge boundaries, while the DRL policy adaptively enhances recognition. A PPO-based DRL enables real-time adaptive behavior detection, and a unique edge-aware loss function ensures exact motion boundaries. Experimental results demonstrate that HERA-Net successfully balances precision and adaptability, making it a dependable, real-time system for intelligent surveillance, anomaly identification, and crowd monitoring.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"63 5","pages":"Article 104647"},"PeriodicalIF":6.9,"publicationDate":"2026-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146045205","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Exploring factors influencing open government data value realization in China: A mixed design using grounded theory, system dynamics, and questionnaire survey 中国政府开放数据价值实现的影响因素探讨:基于实证理论、系统动力学和问卷调查的混合设计
IF 6.9 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2026-07-01 Epub Date: 2026-02-06 DOI: 10.1016/j.ipm.2026.104670
Yongqiang Sun , Zequan Luan , Jie Ma
As digital economy strategies advance and the data market gradually matures, the pathways for realizing the value of China’s government open data have undergone significant changes, with numerous emerging influencing factors. Previous research has primarily relied on portal operational data and static efficiency assessment methods, making it challenging to identify the evolutionary mechanisms and dynamic relationships among these factors. To bridge this gap and inform policy-making and theoretical advancements, we employ a hybrid design that combines grounded theory and system dynamics. Utilizing 33 semi-structured interviews and 317 questionnaire responses (292 valid), we construct causal loops and a stock-flow structure. A 60-month simulation analysis examines factors influencing open government data (OGD) value realization, focusing on: (a) influencing factors and feedback positions; (b) the ranking of factor strengths and directionality. Our findings reveal that increased data demand rates sustainably elevate the long-run equilibrium level of government open data value realization, while higher data depreciation rates reduce this equilibrium. This research advances the dynamic theory of OGD value realization, broadens insights into key drivers and inhibitors, and provides methodological support for implementing strategies such as prioritizing high-demand data releases, optimizing APIs and data rights confirmation processes, and enhancing storage security by mitigating data depreciation. Our findings indicate that enhancing OGD value cannot be achieved solely by increased accessibility or platform capabilities. Instead, it requires examining multifaceted feedback loops and synergistic interactions to uncover specific value generation mechanisms and identify bottlenecks.
随着数字经济战略的推进和数据市场的逐步成熟,中国政府开放数据价值的实现路径发生了重大变化,影响因素层出不穷。以往的研究主要依赖于门户运营数据和静态效率评估方法,因此很难确定这些因素之间的演化机制和动态关系。为了弥合这一差距,并为政策制定和理论进步提供信息,我们采用了结合接地理论和系统动力学的混合设计。利用33个半结构化访谈和317份问卷回复(292份有效),我们构建了因果循环和库存流结构。一项为期60个月的模拟分析考察了影响政府开放数据(OGD)价值实现的因素,重点是:(A)影响因素和反馈立场;(b)因子强度和方向性排序。研究发现,数据需求率的提高持续提升了政府开放数据价值实现的长期均衡水平,而数据折旧率的提高则降低了这一均衡水平。本研究推进了OGD价值实现的动态理论,拓宽了对关键驱动因素和抑制因素的见解,并为实施高需求数据发布优先级、优化api和数据权限确认流程以及通过减轻数据贬值来增强存储安全性等策略提供了方法学支持。我们的研究结果表明,提高OGD价值不能仅仅通过增加可访问性或平台功能来实现。相反,它需要检查多方面的反馈循环和协同互动,以发现特定的价值产生机制并确定瓶颈。
{"title":"Exploring factors influencing open government data value realization in China: A mixed design using grounded theory, system dynamics, and questionnaire survey","authors":"Yongqiang Sun ,&nbsp;Zequan Luan ,&nbsp;Jie Ma","doi":"10.1016/j.ipm.2026.104670","DOIUrl":"10.1016/j.ipm.2026.104670","url":null,"abstract":"<div><div>As digital economy strategies advance and the data market gradually matures, the pathways for realizing the value of China’s government open data have undergone significant changes, with numerous emerging influencing factors. Previous research has primarily relied on portal operational data and static efficiency assessment methods, making it challenging to identify the evolutionary mechanisms and dynamic relationships among these factors. To bridge this gap and inform policy-making and theoretical advancements, we employ a hybrid design that combines grounded theory and system dynamics. Utilizing 33 semi-structured interviews and 317 questionnaire responses (292 valid), we construct causal loops and a stock-flow structure. A 60-month simulation analysis examines factors influencing open government data (OGD) value realization, focusing on: (a) influencing factors and feedback positions; (b) the ranking of factor strengths and directionality. Our findings reveal that increased data demand rates sustainably elevate the long-run equilibrium level of government open data value realization, while higher data depreciation rates reduce this equilibrium. This research advances the dynamic theory of OGD value realization, broadens insights into key drivers and inhibitors, and provides methodological support for implementing strategies such as prioritizing high-demand data releases, optimizing APIs and data rights confirmation processes, and enhancing storage security by mitigating data depreciation. Our findings indicate that enhancing OGD value cannot be achieved solely by increased accessibility or platform capabilities. Instead, it requires examining multifaceted feedback loops and synergistic interactions to uncover specific value generation mechanisms and identify bottlenecks.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"63 5","pages":"Article 104670"},"PeriodicalIF":6.9,"publicationDate":"2026-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146190661","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Haze-prior guided frequency-embedded attention learning for single-stage hazy-weather crowd counting 单阶段雾霾天气人群计数的雾先验引导嵌入频率注意力学习
IF 6.9 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2026-07-01 Epub Date: 2026-02-06 DOI: 10.1016/j.ipm.2026.104671
Weihang Kong , Jienan Shen , Shaohua Li , Liangang Tong , He Li
Conventional two-stage hazy crowd counting suffers from error propagation between separate dehazing and counting pipelines, leading to degraded performance. To address this, we propose an end-to-end single-stage framework that jointly optimizes haze-invariant feature learning and crowd density estimation, achieving state-of-the-art accuracy through two key innovations. Frequency-embedded Hybrid Attention Aggregation (FHAA): This module uses frequency-domain attention to explore frequency features in hazy images, thereby enhancing key feature capture and improving feature learning. Experiments show it reduces Mean Absolute Error (MAE) by 34.48% compared to the model without it, proving its effectiveness in boosting performance. Haze-prior Guided Learning Mechanism: It explicitly models haze distortion, understands haze’s impact on images, and adaptively mitigates interference without manual dehazing annotations, reducing annotation cost and difficulty. Comparative experiments reveal a further 13.64% MAE reduction compared to the model without this mechanism, validating its anti-interference capability. The FHAA module focuses on key frequency features for crowd counting, suppressing haze noise and improving robustness in hazy weather. The haze-prior mechanism uses predicted haze distribution maps to adjust feature learning based on haze intensity, adapting to complex hazy scenes. To support research, we release two synthetic hazy crowd counting datasets at https://github.com/312524/Hazy-CC-extended. These datasets, with the same scale as Hazy-ShanghaiTechRGBD but higher haze densities, address the lack of haze-intensity diversity in existing benchmarks. Extensive ablation studies and performance comparisons on four datasets demonstrate the feasibility and superiority of our method for hazy-weather crowd counting.
传统的两阶段雾霾人群计数在单独的除雾和计数管道之间存在误差传播,导致性能下降。为了解决这个问题,我们提出了一个端到端单阶段框架,该框架共同优化了雾霾不变特征学习和人群密度估计,通过两个关键创新实现了最先进的精度。频率嵌入式混合注意聚合(FHAA):该模块使用频域注意来探索模糊图像中的频率特征,从而增强关键特征捕获和改进特征学习。实验结果表明,该方法比不使用该方法的模型减少了34.48%的平均绝对误差(MAE),证明了其提高性能的有效性。雾先验引导学习机制:明确建模雾霾失真,理解雾霾对图像的影响,自适应减轻干扰,无需人工去雾标注,降低标注成本和难度。对比实验表明,与没有该机制的模型相比,MAE进一步降低了13.64%,验证了其抗干扰能力。FHAA模块专注于人群计数、抑制雾霾噪声和提高雾霾天气下的鲁棒性的关键频率特征。雾霾先验机制利用预测的雾霾分布图,根据雾霾强度调整特征学习,适应复杂的雾霾场景。为了支持研究,我们在https://github.com/312524/Hazy-CC-extended上发布了两个合成的模糊人群计数数据集。这些数据集具有与haze- shanghaitechrgbd相同的尺度,但雾霾密度更高,解决了现有基准缺乏雾霾强度多样性的问题。广泛的消融研究和四个数据集的性能比较证明了我们的方法在雾霾天气人群计数的可行性和优越性。
{"title":"Haze-prior guided frequency-embedded attention learning for single-stage hazy-weather crowd counting","authors":"Weihang Kong ,&nbsp;Jienan Shen ,&nbsp;Shaohua Li ,&nbsp;Liangang Tong ,&nbsp;He Li","doi":"10.1016/j.ipm.2026.104671","DOIUrl":"10.1016/j.ipm.2026.104671","url":null,"abstract":"<div><div>Conventional two-stage hazy crowd counting suffers from error propagation between separate dehazing and counting pipelines, leading to degraded performance. To address this, we propose an end-to-end single-stage framework that jointly optimizes haze-invariant feature learning and crowd density estimation, achieving state-of-the-art accuracy through two key innovations. Frequency-embedded Hybrid Attention Aggregation (FHAA): This module uses frequency-domain attention to explore frequency features in hazy images, thereby enhancing key feature capture and improving feature learning. Experiments show it reduces Mean Absolute Error (MAE) by 34.48% compared to the model without it, proving its effectiveness in boosting performance. Haze-prior Guided Learning Mechanism: It explicitly models haze distortion, understands haze’s impact on images, and adaptively mitigates interference without manual dehazing annotations, reducing annotation cost and difficulty. Comparative experiments reveal a further 13.64% MAE reduction compared to the model without this mechanism, validating its anti-interference capability. The FHAA module focuses on key frequency features for crowd counting, suppressing haze noise and improving robustness in hazy weather. The haze-prior mechanism uses predicted haze distribution maps to adjust feature learning based on haze intensity, adapting to complex hazy scenes. To support research, we release two synthetic hazy crowd counting datasets at <span><span>https://github.com/312524/Hazy-CC-extended</span><svg><path></path></svg></span>. These datasets, with the same scale as Hazy-ShanghaiTechRGBD but higher haze densities, address the lack of haze-intensity diversity in existing benchmarks. Extensive ablation studies and performance comparisons on four datasets demonstrate the feasibility and superiority of our method for hazy-weather crowd counting.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"63 5","pages":"Article 104671"},"PeriodicalIF":6.9,"publicationDate":"2026-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146190665","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Defending LLMs against jailbreak attacks through representation offset detection 通过表示偏移检测保护llm免受越狱攻击
IF 6.9 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2026-07-01 Epub Date: 2026-02-02 DOI: 10.1016/j.ipm.2026.104662
Shuo Liu , Xiang Cheng , Zhenzhong Zheng , Sen Su
Jailbreak attacks bypass the security mechanisms of Large Language Models (LLMs) by disguising harmful prompts, seriously threatening model security. Existing approaches mainly rely on pre-training on specific datasets, which are usually costly and time-consuming. In this paper, we propose Representation Offset Defense (ROD), a plug-and-play detection framework that requires no pre-training. ROD identifies jailbreak attacks by exploiting the representational space mismatch between user inputs and their actual intents, and consists of two modules: main intent extraction (MIE) for generalizing the proposed schema, and representation offset analysis (ROA) for quantifying the semantic bias. We evaluate ROD with six jailbreak attack strategies on two widely used LLMs (Vicuna-7B and Llama2-7B). ROD achieves an average 96.1% defense success rate on Vicuna and 97.9% on Llama2, outperforming existing benchmarks.
越狱攻击绕过llm (Large Language Models)的安全机制,通过隐藏有害的提示信息,严重威胁llm的安全。现有的方法主要依赖于特定数据集的预训练,这通常是昂贵和耗时的。在本文中,我们提出了表征偏移防御(ROD),这是一种无需预训练的即插即用检测框架。ROD通过利用用户输入与其实际意图之间的表示空间不匹配来识别越狱攻击,它由两个模块组成:用于泛化提议模式的主意图提取(MIE)和用于量化语义偏差的表示偏移分析(ROA)。我们在两种广泛使用的llm (Vicuna-7B和Llama2-7B)上使用六种越狱攻击策略来评估ROD。ROD对骆马的平均防御成功率为96.1%,对羊驼的平均防御成功率为97.9%,优于现有的基准。
{"title":"Defending LLMs against jailbreak attacks through representation offset detection","authors":"Shuo Liu ,&nbsp;Xiang Cheng ,&nbsp;Zhenzhong Zheng ,&nbsp;Sen Su","doi":"10.1016/j.ipm.2026.104662","DOIUrl":"10.1016/j.ipm.2026.104662","url":null,"abstract":"<div><div>Jailbreak attacks bypass the security mechanisms of Large Language Models (LLMs) by disguising harmful prompts, seriously threatening model security. Existing approaches mainly rely on pre-training on specific datasets, which are usually costly and time-consuming. In this paper, we propose Representation Offset Defense (ROD), a plug-and-play detection framework that requires no pre-training. ROD identifies jailbreak attacks by exploiting the representational space mismatch between user inputs and their actual intents, and consists of two modules: main intent extraction (MIE) for generalizing the proposed schema, and representation offset analysis (ROA) for quantifying the semantic bias. We evaluate ROD with six jailbreak attack strategies on two widely used LLMs (Vicuna-7B and Llama2-7B). ROD achieves an average 96.1% defense success rate on Vicuna and 97.9% on Llama2, outperforming existing benchmarks.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"63 5","pages":"Article 104662"},"PeriodicalIF":6.9,"publicationDate":"2026-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146190592","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The autonomy equation: How agentic AI reshapes trust and workload in routine productivity applications 自主方程式:人工智能如何重塑日常生产力应用中的信任和工作量
IF 6.9 1区 管理学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2026-07-01 Epub Date: 2026-02-11 DOI: 10.1016/j.ipm.2026.104681
Angelo Geninatti Cossatin, Fabio Ferrero, Liliana Ardissono, Noemi Mauro
User experience and trust in AI-assisted technologies are key factors in controlling their adoption. We investigate these aspects in an Agentic AI platform that integrates routine productivity services and exhibits different levels of autonomy: a manual baseline that lacks AI-driven automation, an Agentic AI with medium autonomy that requires user confirmation before acting, and an Agentic AI with high autonomy that acts proactively for low-stakes tasks. The study, involving 230 participants with heterogeneous professional backgrounds, examines how autonomy of the system affects user activity, user workload, perceived support, and trust.
We found that both Agentic AI systems outperformed the baseline in user productivity. In task execution, they achieved a precision of over 82%, higher than the baseline’s 65%. The recall of the Agentic AI system with high autonomy was 63%. This denotes much higher throughput than the system without AI-driven automation (14%). The Agentic AI systems outperformed the baseline in workload reduction (NASA-TLX Aggregate score) with a statistically significant difference. Both AI-driven systems received equivalent or slightly higher trust than the baseline. However, the system with medium autonomy was the best at balancing productivity gains and user preferences for control. Specifically, the correlations between individual user characteristics (Desirability of Control and Propensity to Trust) and the resulting trust in the systems suggest that the influence of personal traits on system evaluation is least pronounced when automation is combined with explicit user intervention. These results encourage the adoption of user-controllable Agentic AI architectures in multitasking support.
用户体验和对人工智能辅助技术的信任是控制其采用的关键因素。我们在一个集成了常规生产力服务并表现出不同程度自主权的人工智能平台中研究了这些方面:缺乏人工智能驱动的自动化的手动基线,具有中等自主性的人工智能,需要用户在行动前确认,以及具有高度自主性的人工智能,主动执行低风险任务。该研究涉及230名具有不同专业背景的参与者,研究了系统的自主性如何影响用户活动、用户工作量、感知支持和信任。我们发现,这两种人工智能系统在用户生产力方面都优于基线。在执行任务时,他们达到了82%以上的精确度,高于基准的65%。具有高度自主性的代理人工智能系统的召回率为63%。这表明吞吐量远高于没有人工智能驱动的自动化系统(14%)。代理人工智能系统在工作量减少(NASA-TLX总分)方面的表现优于基线,差异具有统计学意义。两种人工智能驱动的系统都获得了与基线相当或略高的信任。然而,具有中等自主权的系统在平衡生产率提高和用户对控制的偏好方面是最好的。具体来说,个人用户特征(控制欲望和信任倾向)与系统信任之间的相关性表明,当自动化与明确的用户干预相结合时,个人特征对系统评估的影响是最不明显的。这些结果鼓励在多任务支持中采用用户可控的代理AI架构。
{"title":"The autonomy equation: How agentic AI reshapes trust and workload in routine productivity applications","authors":"Angelo Geninatti Cossatin,&nbsp;Fabio Ferrero,&nbsp;Liliana Ardissono,&nbsp;Noemi Mauro","doi":"10.1016/j.ipm.2026.104681","DOIUrl":"10.1016/j.ipm.2026.104681","url":null,"abstract":"<div><div>User experience and trust in AI-assisted technologies are key factors in controlling their adoption. We investigate these aspects in an Agentic AI platform that integrates routine productivity services and exhibits different levels of autonomy: a manual baseline that lacks AI-driven automation, an Agentic AI with medium autonomy that requires user confirmation before acting, and an Agentic AI with high autonomy that acts proactively for low-stakes tasks. The study, involving 230 participants with heterogeneous professional backgrounds, examines how autonomy of the system affects user activity, user workload, perceived support, and trust.</div><div>We found that both Agentic AI systems outperformed the baseline in user productivity. In task execution, they achieved a precision of over 82%, higher than the baseline’s 65%. The recall of the Agentic AI system with high autonomy was 63%. This denotes much higher throughput than the system without AI-driven automation (14%). The Agentic AI systems outperformed the baseline in workload reduction (NASA-TLX Aggregate score) with a statistically significant difference. Both AI-driven systems received equivalent or slightly higher trust than the baseline. However, the system with medium autonomy was the best at balancing productivity gains and user preferences for control. Specifically, the correlations between individual user characteristics (Desirability of Control and Propensity to Trust) and the resulting trust in the systems suggest that the influence of personal traits on system evaluation is least pronounced when automation is combined with explicit user intervention. These results encourage the adoption of user-controllable Agentic AI architectures in multitasking support.</div></div>","PeriodicalId":50365,"journal":{"name":"Information Processing & Management","volume":"63 5","pages":"Article 104681"},"PeriodicalIF":6.9,"publicationDate":"2026-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146190671","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":1,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Information Processing & Management
全部 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