首页 > 最新文献

ACM Transactions on Intelligent Systems and Technology最新文献

英文 中文
A Comprehensive Survey on Model Quantization for Deep Neural Networks in Image Classification 图像分类中深度神经网络模型量化研究综述
IF 5 4区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2023-11-14 DOI: 10.1145/3623402
Babak Rokh, Ali Azarpeyvand, Alireza Khanteymoori
Recent advancements in machine learning achieved by Deep Neural Networks (DNNs) have been significant. While demonstrating high accuracy, DNNs are associated with a huge number of parameters and computations, which leads to high memory usage and energy consumption. As a result, deploying DNNs on devices with constrained hardware resources poses significant challenges. To overcome this, various compression techniques have been widely employed to optimize DNN accelerators. A promising approach is quantization, in which the full-precision values are stored in low bit-width precision. Quantization not only reduces memory requirements but also replaces high-cost operations with low-cost ones. DNN quantization offers flexibility and efficiency in hardware design, making it a widely adopted technique in various methods. Since quantization has been extensively utilized in previous works, there is a need for an integrated report that provides an understanding, analysis, and comparison of different quantization approaches. Consequently, we present a comprehensive survey of quantization concepts and methods, with a focus on image classification. We describe clustering-based quantization methods and explore the use of a scale factor parameter for approximating full-precision values. Moreover, we thoroughly review the training of a quantized DNN, including the use of a straight-through estimator and quantization regularization. We explain the replacement of floating-point operations with low-cost bitwise operations in a quantized DNN and the sensitivity of different layers in quantization. Furthermore, we highlight the evaluation metrics for quantization methods and important benchmarks in the image classification task. We also present the accuracy of the state-of-the-art methods on CIFAR-10 and ImageNet. This article attempts to make the readers familiar with the basic and advanced concepts of quantization, introduce important works in DNN quantization, and highlight challenges for future research in this field.
最近,深度神经网络(dnn)在机器学习方面取得了重大进展。在展示高准确性的同时,深度神经网络与大量的参数和计算相关联,这导致了高内存使用和能耗。因此,在硬件资源受限的设备上部署dnn带来了重大挑战。为了克服这个问题,各种压缩技术被广泛用于优化深度神经网络加速器。一种很有前途的方法是量化,在这种方法中,全精度值以低位宽精度存储。量化不仅降低了内存需求,而且用低成本的操作取代了高成本的操作。深度神经网络量化在硬件设计上具有灵活性和高效性,在各种方法中被广泛采用。由于量化在以前的工作中被广泛使用,因此需要一份综合报告,以提供对不同量化方法的理解、分析和比较。因此,我们提出了量化的概念和方法的全面调查,重点是图像分类。我们描述了基于聚类的量化方法,并探索了使用尺度因子参数来近似全精度值。此外,我们全面回顾了量化深度神经网络的训练,包括使用直通估计器和量化正则化。我们解释了在量化DNN中用低成本的位操作取代浮点操作以及量化中不同层的灵敏度。此外,我们强调了量化方法的评价指标和图像分类任务中的重要基准。我们还介绍了CIFAR-10和ImageNet上最先进的方法的准确性。本文试图使读者熟悉量化的基本和高级概念,介绍深度神经网络量化的重要工作,并强调该领域未来研究的挑战。
{"title":"A Comprehensive Survey on Model Quantization for Deep Neural Networks in Image Classification","authors":"Babak Rokh, Ali Azarpeyvand, Alireza Khanteymoori","doi":"10.1145/3623402","DOIUrl":"https://doi.org/10.1145/3623402","url":null,"abstract":"Recent advancements in machine learning achieved by Deep Neural Networks (DNNs) have been significant. While demonstrating high accuracy, DNNs are associated with a huge number of parameters and computations, which leads to high memory usage and energy consumption. As a result, deploying DNNs on devices with constrained hardware resources poses significant challenges. To overcome this, various compression techniques have been widely employed to optimize DNN accelerators. A promising approach is quantization, in which the full-precision values are stored in low bit-width precision. Quantization not only reduces memory requirements but also replaces high-cost operations with low-cost ones. DNN quantization offers flexibility and efficiency in hardware design, making it a widely adopted technique in various methods. Since quantization has been extensively utilized in previous works, there is a need for an integrated report that provides an understanding, analysis, and comparison of different quantization approaches. Consequently, we present a comprehensive survey of quantization concepts and methods, with a focus on image classification. We describe clustering-based quantization methods and explore the use of a scale factor parameter for approximating full-precision values. Moreover, we thoroughly review the training of a quantized DNN, including the use of a straight-through estimator and quantization regularization. We explain the replacement of floating-point operations with low-cost bitwise operations in a quantized DNN and the sensitivity of different layers in quantization. Furthermore, we highlight the evaluation metrics for quantization methods and important benchmarks in the image classification task. We also present the accuracy of the state-of-the-art methods on CIFAR-10 and ImageNet. This article attempts to make the readers familiar with the basic and advanced concepts of quantization, introduce important works in DNN quantization, and highlight challenges for future research in this field.","PeriodicalId":48967,"journal":{"name":"ACM Transactions on Intelligent Systems and Technology","volume":"125 1","pages":""},"PeriodicalIF":5.0,"publicationDate":"2023-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138529993","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
Adaptive Integration of Categorical and Multi-relational Ontologies with EHR Data for Medical Concept Embedding 用于医学概念嵌入的分类本体和多关系本体与电子病历数据的自适应集成
IF 5 4区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2023-11-14 DOI: 10.1145/3625224
Chin Wang Cheong, Kejing Yin, William K. Cheung, Benjamin C. M. Fung, Jonathan Poon

Representation learning has been applied to Electronic Health Records (EHR) for medical concept embedding and the downstream predictive analytics tasks with promising results. Medical ontologies can also be integrated to guide the learning so the embedding space can better align with existing medical knowledge. Yet, properly carrying out the integration is non-trivial. Medical concepts that are similar according to a medical ontology may not be necessarily close in the embedding space learned from the EHR data, as medical ontologies organize medical concepts for their own specific objectives. Any integration methodology without considering the underlying inconsistency will result in sub-optimal medical concept embedding and, in turn, degrade the performance of the downstream tasks. In this article, we propose a novel representation learning framework called ADORE (ADaptive Ontological REpresentations) that allows the medical ontologies to adapt their structures for more robust integrating with the EHR data. ADORE first learns multiple embeddings for each category in the ontology via an attention mechanism. At the same time, it supports an adaptive integration of categorical and multi-relational ontologies in the embedding space using a category-aware graph attention network. We evaluate the performance of ADORE on a number of predictive analytics tasks using two EHR datasets. Our experimental results show that the medical concept embeddings obtained by ADORE can outperform the state-of-the-art methods for all the tasks. More importantly, it can result in clinically meaningful sub-categorization of the existing ontological categories and yield attention values that can further enhance the model interpretability.

表示学习已被应用于电子健康记录(EHR)的医学概念嵌入和下游预测分析任务,并取得了良好的效果。还可以集成医学本体来指导学习,以便嵌入空间能够更好地与现有医学知识保持一致。然而,正确地进行积分是非常重要的。根据医学本体,相似的医学概念在从EHR数据中学习的嵌入空间中不一定是接近的,因为医学本体根据自己的特定目标组织医学概念。任何不考虑潜在不一致性的集成方法都将导致次优的医学概念嵌入,进而降低下游任务的性能。在本文中,我们提出了一种新的表征学习框架,称为ADORE(自适应本体论表征),它允许医学本体论调整其结构,以便与电子病历数据更健壮地集成。ADORE首先通过注意机制学习本体中每个类别的多个嵌入。同时,它支持在嵌入空间中使用类别感知图关注网络自适应集成分类本体和多关系本体。我们使用两个EHR数据集评估ADORE在许多预测分析任务上的性能。我们的实验结果表明,ADORE获得的医学概念嵌入在所有任务上都优于目前最先进的方法。更重要的是,它可以对现有的本体论类别进行临床有意义的子分类,并产生可进一步增强模型可解释性的注意值。
{"title":"Adaptive Integration of Categorical and Multi-relational Ontologies with EHR Data for Medical Concept Embedding","authors":"Chin Wang Cheong, Kejing Yin, William K. Cheung, Benjamin C. M. Fung, Jonathan Poon","doi":"10.1145/3625224","DOIUrl":"https://doi.org/10.1145/3625224","url":null,"abstract":"<p>Representation learning has been applied to Electronic Health Records (EHR) for medical concept embedding and the downstream predictive analytics tasks with promising results. Medical ontologies can also be integrated to guide the learning so the embedding space can better align with existing medical knowledge. Yet, properly carrying out the integration is non-trivial. Medical concepts that are similar according to a medical ontology may not be necessarily close in the embedding space learned from the EHR data, as medical ontologies organize medical concepts for their own specific objectives. Any integration methodology without considering the underlying inconsistency will result in sub-optimal medical concept embedding and, in turn, degrade the performance of the downstream tasks. In this article, we propose a novel representation learning framework called ADORE <i>(<b>AD</b>aptive <b>O</b>ntological <b>RE</b>presentations)</i> that allows the medical ontologies to adapt their structures for more robust integrating with the EHR data. ADORE first learns multiple embeddings for each category in the ontology via an attention mechanism. At the same time, it supports an adaptive integration of categorical and multi-relational ontologies in the embedding space using a category-aware graph attention network. We evaluate the performance of ADORE on a number of predictive analytics tasks using two EHR datasets. Our experimental results show that the medical concept embeddings obtained by ADORE can outperform the state-of-the-art methods for all the tasks. More importantly, it can result in clinically meaningful sub-categorization of the existing ontological categories and yield attention values that can further enhance the model interpretability.</p>","PeriodicalId":48967,"journal":{"name":"ACM Transactions on Intelligent Systems and Technology","volume":"33 1","pages":""},"PeriodicalIF":5.0,"publicationDate":"2023-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138530000","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
Performing Cancer Diagnosis via an Isoform Expression Ranking-based LSTM Model 通过基于异构体表达排序的LSTM模型进行癌症诊断
IF 5 4区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2023-11-14 DOI: 10.1145/3625237
Óscar Reyes, Eduardo Pérez

The known set of genetic factors involved in the development of several types of cancer has considerably been expanded, thus easing to devise and implement better therapeutic strategies. The automatic diagnosis of cancer, however, remains as a complex task because of the high heterogeneity of tumors and the biological variability between samples. In this work, a long short-term memory network-based model is proposed for diagnosing cancer from transcript-base data. An efficient method that transforms data into gene/isoform expression-based rankings was formulated, allowing us to directly embed important information in the relative order of the elements of a ranking that can subsequently ease the classification of samples. The proposed predictive model leverages the power of deep recurrent neural networks, being able to learn existing patterns on the individual rankings of isoforms describing each sample of the population. To evaluate the suitability of the proposal, an extensive experimental study was conducted on 17 transcript-based datasets, and the results showed the effectiveness of this novel approach and also indicated the gene/isoforms expression-based rankings contained valuable information that can lead to a more effective cancer diagnosis.

与几种类型的癌症发展有关的已知遗传因素已经大大扩大,从而易于设计和实施更好的治疗策略。然而,由于肿瘤的高度异质性和样本之间的生物学变异性,癌症的自动诊断仍然是一项复杂的任务。在这项工作中,提出了一个基于长短期记忆网络的模型,用于从转录基础数据诊断癌症。我们制定了一种有效的方法,将数据转换为基于基因/异构体表达的排名,使我们能够直接将重要信息嵌入到排名元素的相对顺序中,从而简化样本的分类。所提出的预测模型利用了深度递归神经网络的力量,能够学习描述种群中每个样本的同种异构体的个体排名的现有模式。为了评估该建议的适用性,对17个基于转录的数据集进行了广泛的实验研究,结果显示了这种新方法的有效性,并表明基于基因/同种异构体表达的排名包含有价值的信息,可以导致更有效的癌症诊断。
{"title":"Performing Cancer Diagnosis via an Isoform Expression Ranking-based LSTM Model","authors":"Óscar Reyes, Eduardo Pérez","doi":"10.1145/3625237","DOIUrl":"https://doi.org/10.1145/3625237","url":null,"abstract":"<p>The known set of genetic factors involved in the development of several types of cancer has considerably been expanded, thus easing to devise and implement better therapeutic strategies. The automatic diagnosis of cancer, however, remains as a complex task because of the high heterogeneity of tumors and the biological variability between samples. In this work, a long short-term memory network-based model is proposed for diagnosing cancer from transcript-base data. An efficient method that transforms data into gene/isoform expression-based rankings was formulated, allowing us to directly embed important information in the relative order of the elements of a ranking that can subsequently ease the classification of samples. The proposed predictive model leverages the power of deep recurrent neural networks, being able to learn existing patterns on the individual rankings of isoforms describing each sample of the population. To evaluate the suitability of the proposal, an extensive experimental study was conducted on 17 transcript-based datasets, and the results showed the effectiveness of this novel approach and also indicated the gene/isoforms expression-based rankings contained valuable information that can lead to a more effective cancer diagnosis.</p>","PeriodicalId":48967,"journal":{"name":"ACM Transactions on Intelligent Systems and Technology","volume":"80 1","pages":""},"PeriodicalIF":5.0,"publicationDate":"2023-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138529963","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
Memory Network-Based Interpreter of User Preferences in Content-Aware Recommender Systems 内容感知推荐系统中基于记忆网络的用户偏好解释器
IF 5 4区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2023-11-14 DOI: 10.1145/3625239
Nhu-Thuat Tran, Hady W. Lauw

This article introduces a novel architecture for two objectives recommendation and interpretability in a unified model. We leverage textual content as a source of interpretability in content-aware recommender systems. The goal is to characterize user preferences with a set of human-understandable attributes, each is described by a single word, enabling comprehension of user interests behind item adoptions. This is achieved via a dedicated architecture, which is interpretable by design, involving two components for recommendation and interpretation. In particular, we seek an interpreter, which accepts holistic user’s representation from a recommender to output a set of activated attributes describing user preferences. Besides encoding interpretability properties such as fidelity, conciseness and diversity, the proposed memory network-based interpreter enables the generalization of user representation by discovering relevant attributes that go beyond her adopted items’ textual content. We design experiments involving both human- and functionally-grounded evaluations of interpretability. Results on four real-world datasets show that our proposed model not only discovers highly relevant attributes for interpreting user preferences, but also enjoys comparable or better recommendation accuracy than a series of baselines.

本文介绍了在统一模型中实现推荐和可解释性两个目标的新体系结构。我们利用文本内容作为内容感知推荐系统中可解释性的来源。目标是用一组人类可理解的属性来描述用户偏好,每个属性都由一个单词描述,从而能够理解产品采用背后的用户兴趣。这是通过一个专用的体系结构实现的,该体系结构可通过设计进行解释,涉及两个用于推荐和解释的组件。特别是,我们寻求一个解释器,它接受来自推荐器的整体用户表示,以输出一组描述用户偏好的激活属性。除了编码保真度、简洁性和多样性等可解释性属性外,所提出的基于记忆网络的解释器通过发现超出其所采用项目文本内容的相关属性来实现用户表示的泛化。我们设计了涉及人类和功能的可解释性评估的实验。在四个真实数据集上的结果表明,我们提出的模型不仅发现了解释用户偏好的高度相关属性,而且具有与一系列基线相当或更好的推荐准确性。
{"title":"Memory Network-Based Interpreter of User Preferences in Content-Aware Recommender Systems","authors":"Nhu-Thuat Tran, Hady W. Lauw","doi":"10.1145/3625239","DOIUrl":"https://doi.org/10.1145/3625239","url":null,"abstract":"<p>This article introduces a novel architecture for two objectives <i>recommendation</i> and <i>interpretability</i> in a unified model. We leverage textual content as a source of interpretability in content-aware recommender systems. The goal is to characterize user preferences with a set of human-understandable attributes, each is described by a single word, enabling comprehension of user interests behind item adoptions. This is achieved via a dedicated architecture, which is interpretable by design, involving two components for recommendation and interpretation. In particular, we seek an <i>interpreter</i>, which accepts holistic user’s representation from a <i>recommender</i> to output a set of activated attributes describing user preferences. Besides encoding interpretability properties such as fidelity, conciseness and diversity, the proposed memory network-based <i>interpreter</i> enables the generalization of user representation by discovering relevant attributes that go beyond her adopted items’ textual content. We design experiments involving both human- and functionally-grounded evaluations of interpretability. Results on four real-world datasets show that our proposed model not only discovers highly relevant attributes for interpreting user preferences, but also enjoys comparable or better recommendation accuracy than a series of baselines.</p>","PeriodicalId":48967,"journal":{"name":"ACM Transactions on Intelligent Systems and Technology","volume":"13 1","pages":""},"PeriodicalIF":5.0,"publicationDate":"2023-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138529965","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
Adversarial Attacks on Deep Reinforcement Learning-based Traffic Signal Control Systems with Colluding Vehicles 基于深度强化学习的串通车辆交通信号控制系统对抗性攻击
IF 5 4区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2023-11-14 DOI: 10.1145/3625236
Ao Qu, Yihong Tang, Wei Ma

The rapid advancements of Internet of Things (IoT) and Artificial Intelligence (AI) have catalyzed the development of adaptive traffic control systems (ATCS) for smart cities. In particular, deep reinforcement learning (DRL) models produce state-of-the-art performance and have great potential for practical applications. In the existing DRL-based ATCS, the controlled signals collect traffic state information from nearby vehicles, and then optimal actions (e.g., switching phases) can be determined based on the collected information. The DRL models fully “trust” that vehicles are sending the true information to the traffic signals, making the ATCS vulnerable to adversarial attacks with falsified information. In view of this, this article first time formulates a novel task in which a group of vehicles can cooperatively send falsified information to “cheat” DRL-based ATCS in order to save their total travel time. To solve the proposed task, we develop CollusionVeh, a generic and effective vehicle-colluding framework composed of a road situation encoder, a vehicle interpreter, and a communication mechanism. We employ our framework to attack established DRL-based ATCS and demonstrate that the total travel time for the colluding vehicles can be significantly reduced with a reasonable number of learning episodes, and the colluding effect will decrease if the number of colluding vehicles increases. Additionally, insights and suggestions for the real-world deployment of DRL-based ATCS are provided. The research outcomes could help improve the reliability and robustness of the ATCS and better protect the smart mobility systems.

物联网(IoT)和人工智能(AI)的快速发展促进了智慧城市自适应交通控制系统(ATCS)的发展。特别是,深度强化学习(DRL)模型产生了最先进的性能,具有很大的实际应用潜力。在现有的基于drl的ATCS中,控制信号从附近车辆收集交通状态信息,然后根据收集到的信息确定最优动作(如切换相位)。DRL模型完全“相信”车辆正在向交通信号发送真实信息,这使得ATCS容易受到伪造信息的对抗性攻击。鉴于此,本文首次提出了一种新颖的任务,即一组车辆协同发送伪造信息“欺骗”基于drl的ATCS,以节省总行驶时间。为了解决所提出的任务,我们开发了CollusionVeh,这是一个通用且有效的车辆串通框架,由路况编码器、车辆解释器和通信机制组成。我们使用我们的框架来攻击已经建立的基于drl的ATCS,并证明通过合理的学习集数可以显著减少串通车辆的总旅行时间,并且如果串通车辆的数量增加,串通效应将减弱。此外,本文还为实际部署基于drl的ATCS提供了见解和建议。研究成果有助于提高ATCS的可靠性和鲁棒性,更好地保护智能交通系统。
{"title":"Adversarial Attacks on Deep Reinforcement Learning-based Traffic Signal Control Systems with Colluding Vehicles","authors":"Ao Qu, Yihong Tang, Wei Ma","doi":"10.1145/3625236","DOIUrl":"https://doi.org/10.1145/3625236","url":null,"abstract":"<p>The rapid advancements of Internet of Things (IoT) and Artificial Intelligence (AI) have catalyzed the development of adaptive traffic control systems (ATCS) for smart cities. In particular, deep reinforcement learning (DRL) models produce state-of-the-art performance and have great potential for practical applications. In the existing DRL-based ATCS, the controlled signals collect traffic state information from nearby vehicles, and then optimal actions (e.g., switching phases) can be determined based on the collected information. The DRL models fully “trust” that vehicles are sending the true information to the traffic signals, making the ATCS vulnerable to adversarial attacks with falsified information. In view of this, this article first time formulates a novel task in which a group of vehicles can cooperatively send falsified information to “cheat” DRL-based ATCS in order to save their total travel time. To solve the proposed task, we develop <span>CollusionVeh</span>, a generic and effective vehicle-colluding framework composed of a road situation encoder, a vehicle interpreter, and a communication mechanism. We employ our framework to attack established DRL-based ATCS and demonstrate that the total travel time for the colluding vehicles can be significantly reduced with a reasonable number of learning episodes, and the colluding effect will decrease if the number of colluding vehicles increases. Additionally, insights and suggestions for the real-world deployment of DRL-based ATCS are provided. The research outcomes could help improve the reliability and robustness of the ATCS and better protect the smart mobility systems.</p>","PeriodicalId":48967,"journal":{"name":"ACM Transactions on Intelligent Systems and Technology","volume":"126 1","pages":""},"PeriodicalIF":5.0,"publicationDate":"2023-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138529970","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
Demand-Driven Urban Facility Visit Prediction 需求驱动的城市设施访问预测
4区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2023-11-09 DOI: 10.1145/3625233
Yunke Zhang, Tong Li, Yuan Yuan, Fengli Xu, Fan Yang, Funing Sun, Yong Li
Predicting citizens’ visiting behaviors to urban facilities is instrumental for city governors and planners to detect inequalities in urban opportunities and optimize the distribution of facilities and resources. Previous works predict facility visits simply using observed visit behavior, yet citizens’ intrinsic demands for facilities are not characterized explicitly, causing potential incorrect learned relations in the prediction results. In this paper, to make up for this deficiency, we present a demand-driven urban facility visit prediction method that decomposes citizens’ visits to facilities into their unobservable demands and their capability to fulfill them. Demands are expressed as the function of regional demographic attributes by a neural network, and the fulfillment capability is determined by the urban region’s spatial accessibility to facilities. Extensive evaluations of datasets of three large cities confirm the efficiency and rationality of our model. Our method outperforms the best state-of-the-art model by 8.28% on average in facility visit prediction tasks. Further analyses demonstrate the reasonableness of recovered facility demands and their relationship with citizen demographics. For instance, senior citizens tend to have higher medical demands but lower shopping demands. Meanwhile, estimated capabilities and accessibilities provide deeper insights into the decaying accessibility with respect to spatial distance and facilities’ diverse functions in the urban environment. Our findings shed light on demand-driven urban data mining and demand-based urban facility planning.
预测市民对城市设施的访问行为有助于城市管理者和规划者发现城市机会的不平等,优化设施和资源的配置。以往的研究只是简单地使用观察到的参观行为来预测设施参观,但没有明确地描述公民对设施的内在需求,导致预测结果中可能存在错误的学习关系。为了弥补这一不足,本文提出了一种需求驱动的城市设施访问预测方法,该方法将市民对设施的访问分解为不可观察需求和满足能力。通过神经网络将需求表达为区域人口属性的函数,满足能力由城市区域的设施空间可达性决定。对三个大城市数据集的广泛评估证实了我们模型的有效性和合理性。在设施访问预测任务中,我们的方法比最先进的模型平均高出8.28%。进一步的分析证明了回收设施需求的合理性及其与公民人口统计学的关系。例如,老年人往往有较高的医疗需求,但较低的购物需求。同时,通过对可达性的估算,可以更深入地了解城市环境中可达性在空间距离和设施功能多样性方面的衰减。我们的研究结果揭示了需求驱动的城市数据挖掘和基于需求的城市设施规划。
{"title":"Demand-Driven Urban Facility Visit Prediction","authors":"Yunke Zhang, Tong Li, Yuan Yuan, Fengli Xu, Fan Yang, Funing Sun, Yong Li","doi":"10.1145/3625233","DOIUrl":"https://doi.org/10.1145/3625233","url":null,"abstract":"Predicting citizens’ visiting behaviors to urban facilities is instrumental for city governors and planners to detect inequalities in urban opportunities and optimize the distribution of facilities and resources. Previous works predict facility visits simply using observed visit behavior, yet citizens’ intrinsic demands for facilities are not characterized explicitly, causing potential incorrect learned relations in the prediction results. In this paper, to make up for this deficiency, we present a demand-driven urban facility visit prediction method that decomposes citizens’ visits to facilities into their unobservable demands and their capability to fulfill them. Demands are expressed as the function of regional demographic attributes by a neural network, and the fulfillment capability is determined by the urban region’s spatial accessibility to facilities. Extensive evaluations of datasets of three large cities confirm the efficiency and rationality of our model. Our method outperforms the best state-of-the-art model by 8.28% on average in facility visit prediction tasks. Further analyses demonstrate the reasonableness of recovered facility demands and their relationship with citizen demographics. For instance, senior citizens tend to have higher medical demands but lower shopping demands. Meanwhile, estimated capabilities and accessibilities provide deeper insights into the decaying accessibility with respect to spatial distance and facilities’ diverse functions in the urban environment. Our findings shed light on demand-driven urban data mining and demand-based urban facility planning.","PeriodicalId":48967,"journal":{"name":"ACM Transactions on Intelligent Systems and Technology","volume":" 26","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135242119","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
Quantifying Levels of Influence and Causal Responsibility in Dynamic Decision Making Events 动态决策事件中影响和因果责任的量化水平
4区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2023-11-03 DOI: 10.1145/3631611
Yossef Saad, Joachim Meyer
Intelligent systems support human operators’ decision-making processes, many of which are dynamic and involve temporal changes in the decision-related parameters. As we increasingly depend on automation, it becomes imperative to understand and quantify its influence on the operator’s decisions and to evaluate its implications for the human’s causal responsibility for outcomes. Past studies proposed a model for human responsibility in static decision-making processes involving intelligent systems. We present a model for dynamic, non-stationary decision-making events based on the concept of causation strength. We apply it to a test case of a dynamic binary categorization decision. The results show that for automation to influence humans significantly, it must have high detection sensitivity. However, this condition is insufficient since it is unlikely that automation, irrespective of its sensitivity, will sway humans with high detection sensitivity away from their original position. Specific combinations of automation and human detection sensitivities are required for automation to have a major influence. Moreover, the automation influence and the human causal responsibility that can be derived from it are sensitive to possible changes in the human’s detection capabilities due to fatigue or other factors, creating a ”Responsibility Cliff.” This should be considered during system design and when policies and regulations are defined. This model constitutes a basis for further analyses of complex events in which human and automation sensitivity levels change over time and for evaluating human involvement in such events.
智能系统支持人类操作员的决策过程,其中许多是动态的,涉及决策相关参数的时间变化。随着我们越来越依赖自动化,理解和量化其对操作员决策的影响以及评估其对结果的人类因果责任的含义变得势在必行。过去的研究提出了一个涉及智能系统的静态决策过程中人类责任的模型。我们提出了一个基于因果关系强度概念的动态非平稳决策事件模型。我们将其应用于一个动态二元分类决策的测试用例。结果表明,要使自动化对人类产生显著影响,必须具有很高的检测灵敏度。然而,这个条件是不够的,因为自动化,不管它的灵敏度如何,不太可能使具有高检测灵敏度的人离开他们原来的位置。自动化和人类检测灵敏度的特定组合需要自动化产生重大影响。此外,自动化的影响和由此产生的人类因果责任对由于疲劳或其他因素导致的人类检测能力的可能变化非常敏感,从而形成了“责任悬崖”。在系统设计期间以及在定义政策和法规时,应该考虑到这一点。该模型为进一步分析人类和自动化敏感性水平随时间变化的复杂事件以及评估人类参与此类事件奠定了基础。
{"title":"Quantifying Levels of Influence and Causal Responsibility in Dynamic Decision Making Events","authors":"Yossef Saad, Joachim Meyer","doi":"10.1145/3631611","DOIUrl":"https://doi.org/10.1145/3631611","url":null,"abstract":"Intelligent systems support human operators’ decision-making processes, many of which are dynamic and involve temporal changes in the decision-related parameters. As we increasingly depend on automation, it becomes imperative to understand and quantify its influence on the operator’s decisions and to evaluate its implications for the human’s causal responsibility for outcomes. Past studies proposed a model for human responsibility in static decision-making processes involving intelligent systems. We present a model for dynamic, non-stationary decision-making events based on the concept of causation strength. We apply it to a test case of a dynamic binary categorization decision. The results show that for automation to influence humans significantly, it must have high detection sensitivity. However, this condition is insufficient since it is unlikely that automation, irrespective of its sensitivity, will sway humans with high detection sensitivity away from their original position. Specific combinations of automation and human detection sensitivities are required for automation to have a major influence. Moreover, the automation influence and the human causal responsibility that can be derived from it are sensitive to possible changes in the human’s detection capabilities due to fatigue or other factors, creating a ”Responsibility Cliff.” This should be considered during system design and when policies and regulations are defined. This model constitutes a basis for further analyses of complex events in which human and automation sensitivity levels change over time and for evaluating human involvement in such events.","PeriodicalId":48967,"journal":{"name":"ACM Transactions on Intelligent Systems and Technology","volume":"20 23","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135818195","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
Second-order Confidence Network for Early Classification of Time Series 时间序列早期分类的二阶置信网络
4区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2023-11-02 DOI: 10.1145/3631531
Junwei Lv, Yuqi Chu, Jun Hu, Peipei Li, Xuegang Hu
Time series data are ubiquitous in a variety of disciplines. Early classification of time series, which aims to predict the class label of a time series as early and accurately as possible, is a significant but challenging task in many time-sensitive applications. Existing approaches mainly utilize heuristic stopping rules to capture stopping signals from the prediction results of time series classifiers. However, heuristic stopping rules can only capture obvious stopping signals, which makes these approaches give either correct but late predictions or early but incorrect predictions. To tackle the problem, we propose a novel second-order confidence network for early classification of time series, which can automatically learn to capture implicit stopping signals in early time series in a unified framework. The proposed model leverages deep neural models to capture temporal patterns and outputs second-order confidence to reflect the implicit stopping signals. Specifically, our model not only exploits the data from a time step but from the probability sequence to capture stopping signals. By combining stopping signals from the classifier output and the second-order confidence, we design a more robust trigger to decide whether or not to request more observations from future time steps. Experimental results show that our approach can achieve superior in early classification compared to state-of-the-art approaches.
时间序列数据在各种学科中无处不在。在许多时间敏感型应用中,时间序列的早期分类是一项重要但具有挑战性的任务,其目的是尽可能早、准确地预测时间序列的类别标签。现有方法主要利用启发式停止规则从时间序列分类器的预测结果中捕获停止信号。然而,启发式停止规则只能捕获明显的停止信号,这使得这些方法要么给出正确但晚的预测,要么给出早但不正确的预测。为了解决这一问题,我们提出了一种新的用于时间序列早期分类的二阶置信网络,该网络可以在一个统一的框架内自动学习捕获早期时间序列中的隐式停止信号。该模型利用深度神经模型捕获时间模式,并输出二阶置信度来反映隐含的停止信号。具体来说,我们的模型不仅利用时间步长的数据,而且利用概率序列的数据来捕获停止信号。通过结合来自分类器输出的停止信号和二阶置信度,我们设计了一个更健壮的触发器来决定是否从未来的时间步长请求更多的观察值。实验结果表明,与现有的方法相比,我们的方法在早期分类方面取得了更好的效果。
{"title":"Second-order Confidence Network for Early Classification of Time Series","authors":"Junwei Lv, Yuqi Chu, Jun Hu, Peipei Li, Xuegang Hu","doi":"10.1145/3631531","DOIUrl":"https://doi.org/10.1145/3631531","url":null,"abstract":"Time series data are ubiquitous in a variety of disciplines. Early classification of time series, which aims to predict the class label of a time series as early and accurately as possible, is a significant but challenging task in many time-sensitive applications. Existing approaches mainly utilize heuristic stopping rules to capture stopping signals from the prediction results of time series classifiers. However, heuristic stopping rules can only capture obvious stopping signals, which makes these approaches give either correct but late predictions or early but incorrect predictions. To tackle the problem, we propose a novel second-order confidence network for early classification of time series, which can automatically learn to capture implicit stopping signals in early time series in a unified framework. The proposed model leverages deep neural models to capture temporal patterns and outputs second-order confidence to reflect the implicit stopping signals. Specifically, our model not only exploits the data from a time step but from the probability sequence to capture stopping signals. By combining stopping signals from the classifier output and the second-order confidence, we design a more robust trigger to decide whether or not to request more observations from future time steps. Experimental results show that our approach can achieve superior in early classification compared to state-of-the-art approaches.","PeriodicalId":48967,"journal":{"name":"ACM Transactions on Intelligent Systems and Technology","volume":"4 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135876640","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
Watermarking in Secure Federated Learning: A Verification Framework Based on Client-Side Backdooring 安全联邦学习中的水印:基于客户端后门的验证框架
4区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2023-10-30 DOI: 10.1145/3630636
Wenyuan Yang, Shuo Shao, Yue Yang, Xiyao Liu, Ximeng Liu, Zhihua Xia, Gerald Schaefer, Hui Fang
Federated learning (FL) allows multiple participants to collaboratively build deep learning (DL) models without directly sharing data. Consequently, the issue of copyright protection in FL becomes important since unreliable participants may gain access to the jointly trained model. Application of homomorphic encryption (HE) in secure FL framework prevents the central server from accessing plaintext models. Thus, it is no longer feasible to embed the watermark at the central server using existing watermarking schemes. In this paper, we propose a novel client-side FL watermarking scheme to tackle the copyright protection issue in secure FL with HE. To our best knowledge, it is the first scheme to embed the watermark to models under the Secure FL environment. We design a black-box watermarking scheme based on client-side backdooring to embed a pre-designed trigger set into an FL model by a gradient-enhanced embedding method. Additionally, we propose a trigger set construction mechanism to ensure the watermark cannot be forged. Experimental results demonstrate that our proposed scheme delivers outstanding protection performance and robustness against various watermark removal attacks and ambiguity attack.
联邦学习(FL)允许多个参与者协作构建深度学习(DL)模型,而无需直接共享数据。因此,FL中的版权保护问题变得很重要,因为不可靠的参与者可以访问联合训练的模型。在安全FL框架中应用同态加密(HE)可以防止中央服务器访问明文模型。因此,使用现有的水印方案在中央服务器上嵌入水印已不再可行。在本文中,我们提出了一种新的客户端FL水印方案来解决带有HE的安全FL中的版权保护问题。据我们所知,这是在Secure FL环境下第一个将水印嵌入到模型中的方案。设计了一种基于客户端后门的黑盒水印方案,通过梯度增强嵌入方法将预先设计好的触发集嵌入到FL模型中。此外,我们还提出了一种触发集构造机制,以保证水印不能被伪造。实验结果表明,该方案对各种水印去除攻击和模糊攻击具有良好的保护性能和鲁棒性。
{"title":"Watermarking in Secure Federated Learning: A Verification Framework Based on Client-Side Backdooring","authors":"Wenyuan Yang, Shuo Shao, Yue Yang, Xiyao Liu, Ximeng Liu, Zhihua Xia, Gerald Schaefer, Hui Fang","doi":"10.1145/3630636","DOIUrl":"https://doi.org/10.1145/3630636","url":null,"abstract":"Federated learning (FL) allows multiple participants to collaboratively build deep learning (DL) models without directly sharing data. Consequently, the issue of copyright protection in FL becomes important since unreliable participants may gain access to the jointly trained model. Application of homomorphic encryption (HE) in secure FL framework prevents the central server from accessing plaintext models. Thus, it is no longer feasible to embed the watermark at the central server using existing watermarking schemes. In this paper, we propose a novel client-side FL watermarking scheme to tackle the copyright protection issue in secure FL with HE. To our best knowledge, it is the first scheme to embed the watermark to models under the Secure FL environment. We design a black-box watermarking scheme based on client-side backdooring to embed a pre-designed trigger set into an FL model by a gradient-enhanced embedding method. Additionally, we propose a trigger set construction mechanism to ensure the watermark cannot be forged. Experimental results demonstrate that our proposed scheme delivers outstanding protection performance and robustness against various watermark removal attacks and ambiguity attack.","PeriodicalId":48967,"journal":{"name":"ACM Transactions on Intelligent Systems and Technology","volume":"549 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136018958","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}
引用次数: 3
Out-of-Distribution Detection in Time-Series Domain: A Novel Seasonal Ratio Scoring Approach 时间序列域的非分布检测:一种新的季节比率评分方法
4区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2023-10-30 DOI: 10.1145/3630633
Taha Belkhouja, Yan Yan, Janardhan Rao Doppa
Safe deployment of time-series classifiers for real-world applications relies on the ability to detect the data which is not generated from the same distribution as training data. This task is referred to as out-of-distribution (OOD) detection. We consider the novel problem of OOD detection for the time-series domain. We discuss the unique challenges posed by time-series data and explain why prior methods from the image domain will perform poorly. Motivated by these challenges, this paper proposes a novel Seasonal Ratio Scoring (SRS) approach. SRS consists of three key algorithmic steps. First, each input is decomposed into class-wise semantic component and remainder. Second, this decomposition is employed to estimate the class-wise conditional likelihoods of the input and remainder using deep generative models. The seasonal ratio score is computed from these estimates. Third, a threshold interval is identified from the in-distribution data to detect OOD examples. Experiments on diverse real-world benchmarks demonstrate that the SRS method is well-suited for time-series OOD detection when compared to baseline methods.
真实应用程序中时间序列分类器的安全部署依赖于检测与训练数据不同分布的数据的能力。这个任务被称为out- distribution (OOD)检测。我们考虑了时间序列域OOD检测的新问题。我们讨论了时间序列数据带来的独特挑战,并解释了为什么以前的图像域方法表现不佳。针对这些挑战,本文提出了一种新颖的季节比率评分方法。SRS包括三个关键的算法步骤。首先,将每个输入分解为类语义组件和余项。其次,该分解用于使用深度生成模型估计输入和剩余的分类条件似然。季节性比率得分是根据这些估计值计算的。第三,从分布数据中识别阈值区间来检测OOD样例。在不同的实际基准上进行的实验表明,与基线方法相比,SRS方法非常适合时间序列OOD检测。
{"title":"Out-of-Distribution Detection in Time-Series Domain: A Novel Seasonal Ratio Scoring Approach","authors":"Taha Belkhouja, Yan Yan, Janardhan Rao Doppa","doi":"10.1145/3630633","DOIUrl":"https://doi.org/10.1145/3630633","url":null,"abstract":"Safe deployment of time-series classifiers for real-world applications relies on the ability to detect the data which is not generated from the same distribution as training data. This task is referred to as out-of-distribution (OOD) detection. We consider the novel problem of OOD detection for the time-series domain. We discuss the unique challenges posed by time-series data and explain why prior methods from the image domain will perform poorly. Motivated by these challenges, this paper proposes a novel Seasonal Ratio Scoring (SRS) approach. SRS consists of three key algorithmic steps. First, each input is decomposed into class-wise semantic component and remainder. Second, this decomposition is employed to estimate the class-wise conditional likelihoods of the input and remainder using deep generative models. The seasonal ratio score is computed from these estimates. Third, a threshold interval is identified from the in-distribution data to detect OOD examples. Experiments on diverse real-world benchmarks demonstrate that the SRS method is well-suited for time-series OOD detection when compared to baseline methods.","PeriodicalId":48967,"journal":{"name":"ACM Transactions on Intelligent Systems and Technology","volume":"637 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136019728","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
期刊
ACM Transactions on Intelligent Systems and Technology
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1