Computers & Chemical Engineering最新文献

筛选
英文 中文
A computationally efficient policy optimization scheme in feedback iterative learning control for nonlinear batch process
IF 3.9 2区 工程技术
Computers & Chemical Engineering Pub Date : 2025-01-21 DOI: 10.1016/j.compchemeng.2025.109005
Kaihua Gao , Jingyi Lu , Yuanqiang Zhou , Furong Gao
{"title":"A computationally efficient policy optimization scheme in feedback iterative learning control for nonlinear batch process","authors":"Kaihua Gao ,&nbsp;Jingyi Lu ,&nbsp;Yuanqiang Zhou ,&nbsp;Furong Gao","doi":"10.1016/j.compchemeng.2025.109005","DOIUrl":"10.1016/j.compchemeng.2025.109005","url":null,"abstract":"<div><div>In this paper, we propose a computationally efficient feedback iterative learning control (ILC) scheme for nonlinear batch processes. We present a structured framework that delineates the feedback ILC as a composite of two integral components: a state feedback controller and a conventional ILC mechanism. Within this framework, we employ policy search techniques to optimize the feedback component. In parallel, we tackle the feedforward aspect by formulating a stochastic optimal ILC problem. These two components are offline iteratively updated, thereby ensuring convergence under ideal conditions. To account for missing process models in practical scenarios, we incorporate Gaussian process (GP) modeling into our framework. By leveraging the GP model, we extend our iterative optimization approach to a GP-based feedback ILC optimization algorithm that guarantees tractability. We use two numerical examples to demonstrate the merits of our framework, including its fast convergence and effective rejection of disturbances.</div></div>","PeriodicalId":286,"journal":{"name":"Computers & Chemical Engineering","volume":"195 ","pages":"Article 109005"},"PeriodicalIF":3.9,"publicationDate":"2025-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143348532","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Machine learning-guided space-filling designs for high throughput liquid formulation development
IF 3.9 2区 工程技术
Computers & Chemical Engineering Pub Date : 2025-01-18 DOI: 10.1016/j.compchemeng.2025.109007
Aniket Chitre , Daria Semochkina , David C. Woods , Alexei A. Lapkin
{"title":"Machine learning-guided space-filling designs for high throughput liquid formulation development","authors":"Aniket Chitre ,&nbsp;Daria Semochkina ,&nbsp;David C. Woods ,&nbsp;Alexei A. Lapkin","doi":"10.1016/j.compchemeng.2025.109007","DOIUrl":"10.1016/j.compchemeng.2025.109007","url":null,"abstract":"<div><div>Liquid formulation design involves using a relatively limited experimental budget to search a high-dimensional space, owing to the combinatorial selection of ingredients and their concentrations from a larger subset of available ingredients. This work investigates alternative shampoo formulations. A space-filling design is desired for screening relatively unexplored formulation chemistries. One of the few computationally efficient solutions for this mixed nominal-continuous design of experiments problem is the adoption of maximum projection designs with quantitative and qualitative factors (MaxProQQ). However, such purely space-filling designs can select experiments in infeasible regions of the design space. Here, stable products are considered feasible. We develop and apply weighted-space filling designs, where predictive phase stability classifiers are trained for difficult-to-formulate (predominantly unstable) sub-systems, to guide these experiments to regions of feasibility, whilst simultaneously optimising for chemical diversity by building on MaxProQQ. This approach is extendable to other mixed-variable design problems, particularly those with sequential design objectives.</div></div>","PeriodicalId":286,"journal":{"name":"Computers & Chemical Engineering","volume":"195 ","pages":"Article 109007"},"PeriodicalIF":3.9,"publicationDate":"2025-01-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143360858","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Systematic design of pulse dosing to eradicate persister bacteria: The case of fluoroquinolones
IF 3.9 2区 工程技术
Computers & Chemical Engineering Pub Date : 2025-01-18 DOI: 10.1016/j.compchemeng.2025.109010
Garima Singh, Sayed Golam Mohiuddin, Sreyashi Ghosh, Jenet Narzary, Mehmet A. Orman, Michael Nikolaou
{"title":"Systematic design of pulse dosing to eradicate persister bacteria: The case of fluoroquinolones","authors":"Garima Singh,&nbsp;Sayed Golam Mohiuddin,&nbsp;Sreyashi Ghosh,&nbsp;Jenet Narzary,&nbsp;Mehmet A. Orman,&nbsp;Michael Nikolaou","doi":"10.1016/j.compchemeng.2025.109010","DOIUrl":"10.1016/j.compchemeng.2025.109010","url":null,"abstract":"<div><div>A small fraction of infectious bacteria use persistence as a strategy to survive exposure to antibiotics. Pulse dosing of antibiotics, if designed well, has long been considered a potentially effective strategy towards eradication of such bacterial pathogens. In a recent study, we developed a method to systematically design optimal pulse dosing regimens for rapid eradication of persisters with <span><math><mi>β</mi></math></span>-lactam antibiotics, and validated the effectiveness of that method experimentally. In this paper, we extend that method for fluoroquinolones. This is because, in contrast to <span><math><mi>β</mi></math></span>-lactams, fluoroquinolones impart different dynamic behavior on treated bacteria, by inducing persister formation and by triggering a non-negligible post-antibiotic effect. Pulse dosing designed according to the proposed method demonstrated rapid bacterial population reduction compared to constant dosing, underscoring the potential of optimal pulse dosing for efficient use of fluoroquinolone antibiotics. In addition, model fitting and parameter estimation also highlighted differences in persister mechanisms between fluoroquinolones and β-lactams. Overall, our study demonstrates that pulse dosing strategies can be effectively designed with the proposed method, using simple formulas and data derived from basic experiments.</div></div>","PeriodicalId":286,"journal":{"name":"Computers & Chemical Engineering","volume":"195 ","pages":"Article 109010"},"PeriodicalIF":3.9,"publicationDate":"2025-01-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143348530","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Data-driven contextual robust optimization based on support vector clustering
IF 3.9 2区 工程技术
Computers & Chemical Engineering Pub Date : 2025-01-17 DOI: 10.1016/j.compchemeng.2025.109004
Xianyu Li , Fenglian Dong , Zhiwei Wei , Chao Shang
{"title":"Data-driven contextual robust optimization based on support vector clustering","authors":"Xianyu Li ,&nbsp;Fenglian Dong ,&nbsp;Zhiwei Wei ,&nbsp;Chao Shang","doi":"10.1016/j.compchemeng.2025.109004","DOIUrl":"10.1016/j.compchemeng.2025.109004","url":null,"abstract":"<div><div>Support vector clustering (SVC) is an effective data-driven method to construct uncertainty sets in robust optimization (RO). However, it cannot appropriately address varying uncertainty in a contextually uncertain environment. In this work, we propose a new contextual RO (CRO) scheme, where an efficient contextual uncertainty set called kNN-SVC is developed to capture the correlation between covariates and uncertainty. Using the k-nearest neighbors (kNN) to select a subset of historical observations, contextual information can be integrated into SVC uncertainty sets, thereby alleviating conservatism while inheriting merits of SVC such as polytopic representability and ease of manipulating robustness. Besides, using only a fraction of data samples ensures low computational costs. Numerical examples demonstrate the performance improvement of the proposed kNN-SVC uncertainty set over conventional sets without considering contextual information. An industrial case of gasoline blending shows the usefulness of the proposed approach in producing robust decisions against linearization errors in nonlinear blending.</div></div>","PeriodicalId":286,"journal":{"name":"Computers & Chemical Engineering","volume":"195 ","pages":"Article 109004"},"PeriodicalIF":3.9,"publicationDate":"2025-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143348529","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Logic-Based Discrete-Steepest Descent: A solution method for process synthesis Generalized Disjunctive Programs
IF 3.9 2区 工程技术
Computers & Chemical Engineering Pub Date : 2025-01-17 DOI: 10.1016/j.compchemeng.2024.108993
Daniel Ovalle , David A. Liñán , Albert Lee , Jorge M. Gómez , Luis Ricardez-Sandoval , Ignacio E. Grossmann , David E. Bernal Neira
{"title":"Logic-Based Discrete-Steepest Descent: A solution method for process synthesis Generalized Disjunctive Programs","authors":"Daniel Ovalle ,&nbsp;David A. Liñán ,&nbsp;Albert Lee ,&nbsp;Jorge M. Gómez ,&nbsp;Luis Ricardez-Sandoval ,&nbsp;Ignacio E. Grossmann ,&nbsp;David E. Bernal Neira","doi":"10.1016/j.compchemeng.2024.108993","DOIUrl":"10.1016/j.compchemeng.2024.108993","url":null,"abstract":"<div><div>Optimization of chemical processes is challenging due to nonlinearities arising from chemical principles and discrete design decisions. The optimal synthesis and design of chemical processes can be posed as a Generalized Disjunctive Programming (GDP) problem. While reformulating GDP problems as Mixed-Integer Nonlinear Programming (MINLP) problems is common, specialized algorithms for GDP remain scarce. This study introduces the Logic-Based Discrete-Steepest Descent Algorithm (LD-SDA) as a solution method for GDP problems involving ordered Boolean variables. LD-SDA transforms these variables into external integer decisions and uses a two-level decomposition: the upper-level sets external configurations, and the lower-level solves the remaining variables, efficiently exploiting the GDP structure. In the case studies presented in this work, including batch processing, reactor superstructures, and distillation columns, LD-SDA consistently outperforms conventional GDP and MINLP solvers, especially as the problem size grows. LD-SDA also proves superior when solving challenging problems where other solvers encounter difficulties finding optimal solutions.</div></div>","PeriodicalId":286,"journal":{"name":"Computers & Chemical Engineering","volume":"195 ","pages":"Article 108993"},"PeriodicalIF":3.9,"publicationDate":"2025-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143348531","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A detailed MILP model and an ad hoc decomposition algorithm for the operational optimization of gas transport networks
IF 3.9 2区 工程技术
Computers & Chemical Engineering Pub Date : 2025-01-17 DOI: 10.1016/j.compchemeng.2025.109006
Lavinia Marina Paola Ghilardi , Francesco Casella , Daniele Barbati , Roberto Palazzo , Emanuele Martelli
{"title":"A detailed MILP model and an ad hoc decomposition algorithm for the operational optimization of gas transport networks","authors":"Lavinia Marina Paola Ghilardi ,&nbsp;Francesco Casella ,&nbsp;Daniele Barbati ,&nbsp;Roberto Palazzo ,&nbsp;Emanuele Martelli","doi":"10.1016/j.compchemeng.2025.109006","DOIUrl":"10.1016/j.compchemeng.2025.109006","url":null,"abstract":"<div><div>Nowadays, the management of natural gas networks primarily relies on the expertise gained by operators over the years. Nevertheless, the need to reduce energy consumption and the progressive installation of electric compressors call for the adoption of systematic optimization tools. This study proposes a Mixed Integer Linear Programming (MILP) model for optimizing the operation of complex real-world gas networks to minimize the environmental impact of the compression work in presence of both gas-turbine driven and electric compressors. The operational problem includes the gas transport dynamic equations, detailed modeling of compressor stations and control valves, while handling complex branch and looped networks with possible reverse flow. To address large-scale problems, a graph reduction procedure and a novel bilevel decomposition algorithm are developed. This methodology, validated with real data, enables the optimization of the nationwide Italian network, comprising 51 compressors and 9727 km of pipes.</div></div>","PeriodicalId":286,"journal":{"name":"Computers & Chemical Engineering","volume":"195 ","pages":"Article 109006"},"PeriodicalIF":3.9,"publicationDate":"2025-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143348535","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Optimal sensor placement for contamination detection and identification in water distribution networks under demand uncertainty
IF 3.9 2区 工程技术
Computers & Chemical Engineering Pub Date : 2025-01-13 DOI: 10.1016/j.compchemeng.2025.109003
Venkata Reddy Palleti
{"title":"Optimal sensor placement for contamination detection and identification in water distribution networks under demand uncertainty","authors":"Venkata Reddy Palleti","doi":"10.1016/j.compchemeng.2025.109003","DOIUrl":"10.1016/j.compchemeng.2025.109003","url":null,"abstract":"<div><div>Water Distribution Networks (WDNs) are one of the most important critical infrastructures in any nation. WDNs are often prone to either accidental or intentional contamination. Intentional contamination, like terrorist attacks on WDNs, can lead to poisoned water, causing many fatalities and large economic consequences. In order to protect against these attacks, an efficient sensor network design is required by placing a limited number of sensors in the network. In this work, we will design sensor networks to satisfy two criteria, namely, observability (ability to detect the contamination) and identifiability ability to detect and identify the contamination source). Hydraulic simulations are performed on a WDN subjected to variable demand conditions. We will map the problem of the sensor network to a minimum set cover problem. A greedy heuristic algorithm is used to obtain the sensor network design under variable demand conditions. The proposed methodology is illustrated on a real life WDN.</div></div>","PeriodicalId":286,"journal":{"name":"Computers & Chemical Engineering","volume":"194 ","pages":"Article 109003"},"PeriodicalIF":3.9,"publicationDate":"2025-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143136737","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Process design for plastic waste pyrolysis: Yield analysis and economic assessment
IF 3.9 2区 工程技术
Computers & Chemical Engineering Pub Date : 2025-01-11 DOI: 10.1016/j.compchemeng.2025.109001
Hyojin Jung, Yuchan Ahn
{"title":"Process design for plastic waste pyrolysis: Yield analysis and economic assessment","authors":"Hyojin Jung,&nbsp;Yuchan Ahn","doi":"10.1016/j.compchemeng.2025.109001","DOIUrl":"10.1016/j.compchemeng.2025.109001","url":null,"abstract":"<div><div>The widespread use of plastic products and inadequate waste management systems have rendered plastic waste a major source of environmental pollution, thereby necessitating effective plastic recycling methods. In this study, we propose two pyrolysis processes for recycling plastic waste using Aspen Plus: a base process and an alternative process. The main difference lies in the condensation and separation methods used to produce pyrolysis oil. In the base process, condensation is carried out using a cooler, followed by decomposition with a flash drum. In contrast, the alternative process utilizes a distillation column for both condensation and separation. The results showed that PS achieved the highest oil yield of 81.3 %, while PS/PE exhibited the greatest improvement, with a 27.34 % increase in oil production yield in the alternative process compared to the base process. However, the alternative process incurs higher operating and capital costs due to the precise control requirements, particularly for feedstocks like PS/PE/PP/PET, which had the highest energy production cost at 31.07×10 <sup>−4</sup> $/ MJ compared to 27.85×10 <sup>−4</sup> $/ MJ in the base process. Despite these higher costs, the alternative process significantly improved oil production, especially for plastics such as PS and PS/PE. These findings underscore the importance of selecting pyrolysis processes based on feedstock composition and specific recycling goals, highlighting the trade-off between higher yields and increased energy production costs and emphasizing the need for balance.</div></div>","PeriodicalId":286,"journal":{"name":"Computers & Chemical Engineering","volume":"194 ","pages":"Article 109001"},"PeriodicalIF":3.9,"publicationDate":"2025-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143136738","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Ensemble transfer learning assisted soft sensor for distributed output inference in chemical processes
IF 3.9 2区 工程技术
Computers & Chemical Engineering Pub Date : 2025-01-09 DOI: 10.1016/j.compchemeng.2025.109002
Jialiang Zhu, Wangwang Zhu, Yi Liu
{"title":"Ensemble transfer learning assisted soft sensor for distributed output inference in chemical processes","authors":"Jialiang Zhu,&nbsp;Wangwang Zhu,&nbsp;Yi Liu","doi":"10.1016/j.compchemeng.2025.109002","DOIUrl":"10.1016/j.compchemeng.2025.109002","url":null,"abstract":"<div><div>Chemical processes with distributed outputs are characterized by various operating conditions, and the scarcity of labeled data poses challenges to the prediction of product quality. An ensemble transfer Gaussian process regression (ETGPR) model is developed for prediction of different quantities of distributed outputs. First, for each test instances from target domain, just-in-time learning is adopted to select distance-based similar instances from source domain in related operating conditions. Mutual information helps create various local models by building diverse input variable sets. Subsequently, Bayesian inference is used to produce the posterior probabilities relative to the test instance, then set as the weights of local prediction. The instance transfer is thus completed via distance-based similar instance selection from source domain for local model construction, and the model performance is improved by the ensemble weighting strategy, concerning the target domain, under diverse operating conditions. Therefore, by utilizing and transferring information from source domain, unsupervised transfer can be implemented with available unlabeled target data. The superiority of ETGPR model is confirmed in the case of modeling the polymerization process with distributed outputs.</div></div>","PeriodicalId":286,"journal":{"name":"Computers & Chemical Engineering","volume":"194 ","pages":"Article 109002"},"PeriodicalIF":3.9,"publicationDate":"2025-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143136597","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Multi-objective reaction optimization under uncertainties using expected quantile improvement
IF 3.9 2区 工程技术
Computers & Chemical Engineering Pub Date : 2025-01-09 DOI: 10.1016/j.compchemeng.2024.108983
Jiyizhe Zhang , Daria Semochkina , Naoto Sugisawa , David C. Woods , Alexei A. Lapkin
{"title":"Multi-objective reaction optimization under uncertainties using expected quantile improvement","authors":"Jiyizhe Zhang ,&nbsp;Daria Semochkina ,&nbsp;Naoto Sugisawa ,&nbsp;David C. Woods ,&nbsp;Alexei A. Lapkin","doi":"10.1016/j.compchemeng.2024.108983","DOIUrl":"10.1016/j.compchemeng.2024.108983","url":null,"abstract":"<div><div>Multi-objective Bayesian optimization (MOBO) has shown to be a promising tool for reaction development. However, noise is usually inevitable in experimental and chemical processes, and finding reliable solutions is challenging when the noise is unknown or significant. In this study, we focus on finding a set of optimal reaction conditions using multi-objective Euclidian expected quantile improvement (MO-E-EQI) under noisy settings. First, the performance of MO-E-EQI is evaluated by comparing with some recent MOBO algorithms <em>in silico</em> with linear and log-linear heteroscedastic noise structures and different magnitudes. It is noticed that high noise can degrade the performance of MOBO algorithms. MO-E-EQI shows robust performance in terms of hypervolume-based metric, coverage metric and number of solutions on the Pareto front. Finally, MO-E-EQI is implemented in a real case to optimize an esterification reaction to achieve the maximum space-time-yield and the minimal E-factor. The algorithm identifies a clear trade-off between the two objectives.</div></div>","PeriodicalId":286,"journal":{"name":"Computers & Chemical Engineering","volume":"194 ","pages":"Article 108983"},"PeriodicalIF":3.9,"publicationDate":"2025-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143136740","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信