检索结果-内蒙古大学图书馆

IEEE Power and Energy Society General Meeting

作者： Pengcheng You Steven H. Low Zaiyue Yang Yongmin Zhang Lingkun Fu State Key Laboratory of Industrial Control Technology Zhejiang University Engineering and Applied Science California Institute of Technology State Key Laboratory of Wind Power System Zhejiang Windey Co. Ltd.

ISBN: (纸本)9781509041695

This paper proposes a real-time algorithm that recommends battery swapping stations (BSSs) to electric taxis (ETs) that need their batteries swapped. The algorithm takes into consideration available batteries at BSSs, driving ranges of ETs and the current traffic conditions, etc, in order to avoid long queues at BSSs. We consider a basic model that assumes past decisions are perfectly executed, and formulate an optimal ET-to-BSS assignment problem. This problem is an integer program and therefore hard to scale. For real-time implementation, we approximate the optimal assignment problem by a repeated potential game and propose an iterative best response algorithm to compute ET-to-BSS assignments. Preliminary numerical results suggest that our heuristic algorithm solves the optimal assignment problem approximately.

关键词： Batteries Taxi manual reduction Swap basic model Heuristic algorithms long slide STATIONS algorithms Real time Electricity Optimal

来源：评论

学校读者我要写书评

暂无评论

Search for Gravitational Waves Emitted from SN2023ixf

引用

Astrophysical Journal 2025年第2期985卷 183-183页

作者： Abac, A.G. Abbott, R. Abouelfettouh, I. Acernese, F. Ackley, K. Adhicary, S. Adhikari, N. Adhikari, R.X. Adkins, V.K. Agarwal, D. Agathos, M. Aghaei Abchouyeh, M. Aguiar, O.D. Aguilar, I. Aiello, L. Ain, A. Akutsu, T. Albanesi, S. Alfaidi, R.A. Al-Jodah, A. Alléné, C. Allocca, A. Al-Shammari, S. Altin, P.A. Alvarez-Lopez, S. Amato, A. Amez-Droz, L. Amorosi, A. Amra, C. Ananyeva, A. Anderson, S.B. Anderson, W.G. Andia, M. Ando, M. Andrade, T. Andres, N. Andrés-Carcasona, M. Andrić, T. Anglin, J. Ansoldi, S. Antelis, J.M. Antier, S. Aoumi, M. Appavuravther, E.Z. Appert, S. Apple, S.K. Arai, K. Araya, A. Araya, M.C. Areeda, J.S. Argianas, L. Aritomi, N. Armato, F. Arnaud, N. Arogeti, M. Aronson, S.M. Ashton, G. Aso, Y. Assiduo, M. Assis de Souza Melo, S. Aston, S.M. Astone, P. Attadio, F. Aubin, F. AultONeal, K. Avallone, G. Babak, S. Badaracco, F. Badger, C. Bae, S. Bagnasco, S. Bagui, E. Baier, J.G. Baiotti, L. Bajpai, R. Baka, T. Ball, M. Ballardin, G. Ballmer, S.W. Banagiri, S. Banerjee, B. Bankar, D. Baral, P. Barayoga, J.C. Barish, B.C. Barker, D. Barneo, P. Barone, F. Barr, B. Barsotti, L. Barsuglia, M. Barta, D. Bartoletti, A.M. Barton, M.A. Bartos, I. Basak, S. Basalaev, A. Bassiri, R. Basti, A. Bates, D.E. Bawaj, M. Baxi, P. Bayley, J.C. Baylor, A.C. Baynard, P.A. Bazzan, M. Bedakihale, V.M. Beirnaert, F. Bejger, M. Belardinelli, D. Bell, A.S. Benedetto, V. Benoit, W. Bentley, J.D. Ben Yaala, M. Bera, S. Berbel, M. Bergamin, F. Berger, B.K. Bernuzzi, S. Beroiz, M. Bersanetti, D. Bertolini, A. Betzwieser, J. Beveridge, D. Bevins, N. Bhandare, R. Bhardwaj, U. Bhatt, R. Bhattacharjee, D. Bhaumik, S. Bhowmick, S. Bianchi, A. Bilenko, I.A. Billingsley, G. Binetti, A. Bini, S. Birnholtz, O. Biscoveanu, S. Bisht, A. Bitossi, M. Bizouard, M.-A. Blackburn, J.K. Blagg, L.A. Blair, C.D. Blair, D.G. Bobba, F. Bode, N. Boileau, G. Boldrini, M. Bolingbroke, G.N. Bolliand, A. Bonavena, L.D. Bondarescu, R. Bondu, F. Bonilla, E. Bonilla, M.S. Bonino, A. Bonnand, R. Booker, P. Borchers, A. Boschi, V. Bose, S. Bossilkov, V. Max Planck Institute for Gravitational Physics (Albert Einstein Institute) Potsdam D-14476 Germany LIGO Laboratory California Institute of Technology Pasadena 91125 CA United States LIGO Hanford Observatory Richland 99352 WA United States Dipartimento di Farmacia Università di Salerno Fisciano Salerno I-84084 Italy INFN Sezione di Napoli Napoli I-80126 Italy University of Warwick Coventry CV4 7AL United Kingdom The Pennsylvania State University University Park 16802 PA United States University of Wisconsin-Milwaukee Milwaukee 53201 WI United States Louisiana State University Baton Rouge 70803 LA United States Université catholique de Louvain Louvain-la-Neuve B-1348 Belgium Inter-University Centre for Astronomy and Astrophysics Pune 411007 India Queen Mary University of London London E1 4NS United Kingdom Department of Physics and Astronomy Sejong University 209 Neungdongro Gwangjin-gu Seoul 143-747 South Korea Instituto Nacional de Pesquisas Espaciais São José dos Campos São Paulo 12227-010 Brazil Stanford University Stanford 94305 CA United States Università di Roma Tor Vergata Roma I-00133 Italy INFN Sezione di Roma Tor Vergata Roma I-00133 Italy Cardiff University Cardiff CF24 3AA United Kingdom Universiteit Antwerpen Antwerpen 2000 Belgium Gravitational Wave Science Project National Astronomical Observatory of Japan Mitaka City 2-21-1 Osawa Tokyo 181-8588 Japan Advanced Technology Center National Astronomical Observatory of Japan Mitaka City 2-21-1 Osawa Tokyo 181-8588 Japan INFN Sezione di Torino Torino I-10125 Italy Theoretisch-Physikalisches Institut Friedrich-Schiller-Universität Jena Jena D-07743 Germany Dipartimento di Fisica Università degli Studi di Torino Torino I-10125 Italy SUPA University of Glasgow Glasgow G12 8QQ United Kingdom OzGrav University of Western Australia Crawley 6009 WA Australia University Savoie Mont Blanc CNRS Laboratoire d’Annecy de Physique des Particules IN2P3 Annecy F-7

We present the results of a search for gravitational-wave transients associated with core-collapse supernova SN 2023ixf, which was observed in the galaxy Messier 101 via optical emission on 2023 May 19, during the LIGO–Virgo–KAGRA 15th Engineering Run. We define a five-day on-source window during which an accompanying gravitational-wave signal may have occurred. No gravitational waves have been identified in data when at least two gravitational-wave observatories were operating, which covered ∼14% of this five-day window. We report the search detection efficiency for various possible gravitational-wave emission models. Considering the distance to M101 (6.7 Mpc), we derive constraints on the gravitational-wave emission mechanism of core-collapse supernovae across a broad frequency spectrum, ranging from 50 Hz to 2 kHz, where we assume the gravitational-wave emission occurred when coincident data are available in the on-source window. Considering an ellipsoid model for a rotating proto-neutron star, our search is sensitive to gravitational-wave energy 1 × 10⁻⁴ M_⊙c² and luminosity 2.6 × 10⁻⁴ M_⊙c² s⁻¹ for a source emitting at 82 Hz. These constraints are around an order of magnitude more stringent than those obtained so far with gravitational-wave data. The constraint on the ellipticity of the proto-neutron star that is formed is as low as 1.08, at frequencies above 1200 Hz, surpassing past results. © 2025. The Author(s).

关键词：

来源：评论

学校读者我要写书评

暂无评论

Towards Realistic Face Photo-Sketch Synthesis via Composition-Aided GANs

arXiv

引用

arXiv 2017年

作者： Yu, Jun Shi, Shengjie Gao, Fei Tao, Dacheng Huang, Qingming Key Laboratory of Complex Systems Modeling and Simulation School of Computer Science and Technology Hangzhou Dianzi University Hangzhou310018 China State Key Laboratory of Integrated Services Networks Xidian University Xian710071 China UBTech Sydney Artificial Intelligence Institute The School of Information Technologies Faculty of Engineering and Information Technologies The University of Sydney J12 Cleveland St DarlingtonNSW2008 Australia School of Computer and Control Engineering University of Chinese Academy of Sciences Beijing100190 China

Face photo-sketch synthesis aims at generating a facial sketch/photo conditioned on a given photo/sketch. It is of wide applications including digital entertainment and law enforcement. Precisely depicting face photos/sketches remains challenging due to the restrictions on structural realism and textural consistency. While existing methods achieve compelling results, they mostly yield blurred effects and great deformation over various facial components, leading to the unrealistic feeling of synthesized images. To tackle this challenge, in this work, we propose to use the facial composition information to help the synthesis of face sketch/photo. Specially, we propose a novel composition-aided generative adversarial network (CA-GAN) for face photo-sketch synthesis. In CA-GAN, we utilize paired inputs including a face photo/sketch and the corresponding pixel-wise face labels for generating a sketch/photo. In addition, to focus training on hard-generated components and delicate facial structures, we propose a compositional reconstruction loss. Finally, we use stacked CA-GANs (SCA-GAN) to further rectify defects and add compelling details. Experimental results show that our method is capable of generating both visually comfortable and identity-preserving face sketches/photos over a wide range of challenging data. Our method achieves the state-of-the-art quality, reducing best previous Fréchet Inception distance (FID) by a large margin. Besides, we demonstrate that the proposed method is of considerable generalization ability. We have made our code and results publicly available: Https://***/ca-gan/. Copyright © 2017, The Authors. All rights reserved.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

A novel policy iteration based deterministic Q-learning for discrete-time nonlinear systems

引用

Science China(Information Sciences) 2015年第12期58卷 147-161页

作者： WEI QingLai LIU DeRong State Key Laboratory of Management and Control for Complex Systems Institute of AutomationChinese Academy of Sciences School of Automation and Electrical Engineering University of Science and Technology Beijing

In this paper, a novel iterative Q-learning algorithm, called "policy iteration based deterministic Qlearning algorithm", is developed to solve the optimal control problems for discrete-time deterministic nonlinear systems. The idea is to use an iterative adaptive dynamic programming(ADP) technique to construct the iterative control law which optimizes the iterative Q function. When the optimal Q function is obtained, the optimal control law can be achieved by directly minimizing the optimal Q function, where the mathematical model of the system is not necessary. Convergence property is analyzed to show that the iterative Q function is monotonically non-increasing and converges to the solution of the optimality equation. It is also proven that any of the iterative control laws is a stable control law. Neural networks are employed to implement the policy iteration based deterministic Q-learning algorithm, by approximating the iterative Q function and the iterative control law, respectively. Finally, two simulation examples are presented to illustrate the performance of the developed algorithm.

关键词： adaptive critic designs adaptive dynamic programming approximate dynamic programming Q learning policy iteration neural networks nonlinear systems optimal control

来源：评论

学校读者我要写书评

暂无评论

Integrating Genetic Algorithm with Time control for Just-In-Time Scheduling Problems

引用

IFAC-PapersOnLine 2015年第3期48卷 893-897页

作者： Chen, Junru Weng, Wei Rong, Gang Fujimura, Shigeru Graduate School of Information Production and Systems Waseda University 2-7 Hibikino Wakamatsu-ku Kitakyushu Fukuoka 808-0135 Japan State Key Laboratory of Industrial Control Technology Institute of Cyber-systems and Control Zhejiang University Hangzhou 310027 China

To reduce inventory costs and increase customer satisfaction in a real production environment, Just-in-Time (JIT) manufacturing should be combined with more flexibility. Flexibility in manufacturing system ensures improved product quality and mass customization. In this paper, we consider flexible job-shop problem (FJSP) to include several types of flexibility. Prior research on JIT scheduling problems paid little attention to flexible job shop systems. In this paper, an optimization method for FJSP for JIT manufacturing was proposed, genetic algorithm and time control are integrated to improve the JIT performance. Computational simulations and comparisons demonstrate that the proposed method shows more competitive performance than other evolutionary algorithms. © 2015, IFAC (International Federation of Automatic control) Hosting by Elsevier Ltd. All rights reserved.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

An Answer Recommendation Algorithm for Medical Community Question Answering systems

An Answer Recommendation Algorithm for Medical Community Que...

引用

2016年IEEE/INFORMS服务运筹、物流与信息化国际会议

作者： Jing Wang Chuntao Man Yifei Zhao Feiyue Wang College of Automation Harbin University of Science & Technology The State Key Laboratory of Management and Control for Complex Systems Institute of AutomationChinese Academy of Sciences

Online medical community question answering(c QA) systems are playing important roles as a supplement of the traditional medical service systems. The answer recommendation service provides guidance to diagnose diseases and brings convenience and valuable reference to users. In this paper, we propose a method to recommend answer for particular questions on medical c QA system. There are three steps for the answer recommendation system, including similar cases retrieval, answers quality estimation and answer recommendation. The proposed algorithm is tested on a dataset collected from online medical community question answering system. The results show a good performance in answer recommendation.

关键词： medical community question answering systems similar cases retrieval answer quality estimation data mining

来源：评论

学校读者我要写书评

暂无评论

Learning to Win in Evolutionary Two-person Boolean Game with Fixed Strategy Updating Rule

引用

IFAC-PapersOnLine 2015年第28期48卷 520-525页

作者： WANG, Dong Hongbin, M.A. Beijing Institute of Technology Beijing China State Key Laboratory of Intelligent Control and Decision of Complex Systems Beijing Institution of Technology Canada

This paper introduces an algorithm to learn the strategy updating rule for a two- person Boolean game using the records of the history strategies and game results. The two-person game in this paper is introduced as a zero-sum game along with a Boolean strategy set, and the strategies are governed by fixed Boolean functions whose arguments are the history strategies and game results with additive binary noise, which can be modeled as a stochastic Boolean dynamic system. However, for this easy-to-play game, there is no effective convenient methods to win more often. To achieve this goal, a learning algorithm based on Boolean regression and maximum-likelihood estimation is put forward to learn the strategy updating rule and the noise property using the records of the history strategies and game results. In addition, extensive simulations via actual examples have illustrated the effectiveness of the proposed learning algorithm. © 2015

关键词： Learning algorithms Identification (control systems) Maximum likelihood estimation Parameter estimation Stochastic systems Boolean dynamics Boolean games Extensive simulations Fixed strategy Learning Noise properties Strategy updating Two person game

来源：评论

学校读者我要写书评

暂无评论

Prevalence and attributable health burden of chronic respiratory diseases, 1990–2017: a systematic analysis for the Global Burden of Disease Study 2017

引用

The Lancet Respiratory Medicine 2020年第6期8卷 585-596页

作者： Soriano, Joan B Kendrick, Parkes J Paulson, Katherine R Gupta, Vinay Abrams, Elissa M Adedoyin, Rufus Adesoji Adhikari, Tara Ballav Advani, Shailesh M Agrawal, Anurag Ahmadian, Elham Alahdab, Fares Aljunid, Syed Mohamed Altirkawi, Khalid A Alvis-Guzman, Nelson Anber, Nahla Hamed Andrei, Catalina Liliana Anjomshoa, Mina Ansari, Fereshteh Antó, Josep M Arabloo, Jalal Athari, Seyyede Masoume Athari, Seyyed Shamsadin Awoke, Nefsu Badawi, Alaa Banoub, Joseph Adel Mattar Bennett, Derrick A Bensenor, Isabela M Berfield, Kathleen S Sachiko Bernstein, Robert S Bhattacharyya, Krittika Bijani, Ali Brauer, Michael Bukhman, Gene Butt, Zahid A Cámera, Luis Alberto Car, Josip Carrero, Juan J Carvalho, Felix Castañeda-Orjuela, Carlos A Choi, Jee-Young Jasmine Christopher, Devasahayam J Cohen, Aaron J Dandona, Lalit Dandona, Rakhi Dang, Anh Kim Daryani, Ahmad de Courten, Barbora Demeke, Feleke Mekonnen Demoz, Gebre Teklemariam De Neve, Jan-Walter Desai, Rupak Dharmaratne, Samath Dhamminda Diaz, Daniel Douiri, Abdel Driscoll, Tim Robert Duken, Eyasu Ejeta Eftekhari, Aziz Elkout, Hajer Endries, Aman Yesuf Fadhil, Ibtihal Faro, Andre Farzadfar, Farshad Fernandes, Eduarda Filip, Irina Fischer, Florian Foroutan, Masoud Garcia-Gordillo, M.A. Gebre, Abadi Kahsu Gebremedhin, Ketema Bizuwork Gebremeskel, Gebreamlak Gebremedhn Gezae, Kebede Embaye Ghoshal, Aloke Gopal Gill, Paramjit Singh Gillum, Richard F Goudarzi, Houman Guo, Yuming Gupta, Rajeev Hailu, Gessessew Bugssa Hasanzadeh, Amir Hassen, Hamid Yimam Hay, Simon I Hoang, Chi Linh Hole, Michael K Horita, Nobuyuki Hosgood, H Dean Hostiuc, Mihaela Househ, Mowafa Ilesanmi, Olayinka Stephen Ilic, Milena D Irvani, Seyed Sina Naghibi Islam, Sheikh Mohammed Shariful Jakovljevic, Mihajlo Jamal, Amr A Jha, Ravi Prakash Jonas, Jost B Kabir, Zubair Kasaeian, Amir Kasahun, Gebremicheal Gebreslassie Kassa, Getachew Mullu Kefale, Adane Teshome Kengne, Andre Pascal Khader, Yousef Saleh Khafaie, Morteza Abdullatif Khan, Ejaz Ahmad Khan, Junaid Khubchandani, Jagdish Kim, Young-Eun Kim, Yun Jin Kisa, Hospital Universitario de La Princesa (Princess University Hospital) Madrid Spain Autonomous University of Madrid Madrid Spain Centro de Investigación Biomédica en Red Enfermedades Respiratorias (CIBERES) (Center for Biomedical Research in Respiratory Diseases Network) Madrid Spain Institute for Health Metrics and Evaluation Seattle WA United States Department of Surgery University of Washington Seattle WA United States Department of Health Metrics Sciences School of Medicine University of Washington Seattle WA United States Department of Global Health University of Washington Seattle WA United States Department of Medicine University of Washington Seattle WA United States University of Washington Seattle WA United States Section of Allergy and Clinical Immunology University of Manitoba Winnipeg MB Canada Ophthalmology Department University of Manitoba Winnipeg MB Canada Department of Paediatrics University of British Columbia Vancouver BC Canada School of Population and Public Health University of British Columbia Vancouver BC Canada Department of Medical Rehabilitation Obafemi Awolowo University Ile-Ife Nigeria Department of Public Health Aarhus University Aarhus Denmark Nepal Health Frontiers University of Southern Denmark Kathmandu Nepal Social Behavioral Research Branch National Institute of Health Bethesda MD United States Department of Oncology Georgetown University Washington DC United States Institute of Genomics and Integrative Biology Council of Scientific & Industrial Research Delhi India Internal Medicine Baylor College of Medicine Houston TX United States Research Center for Chronic Kidney Disease Tabriz University of Medical Sciences Tabriz Iran Research Center for Evidence Based Medicine Tabriz University of Medical Sciences Tabriz Iran Joint Ukraine-Azerbaijan International Research and Education Center of Nanobiotechnology and Functional Nanosystems Baku Azerbaijan Mayo Evidence-based Practice Center Mayo Clinic Foundat

Background: Previous attempts to characterise the burden of chronic respiratory diseases have focused only on specific disease conditions, such as chronic obstructive pulmonary disease (COPD) or asthma. In this study, we aimed to characterise the burden of chronic respiratory diseases globally, providing a comprehensive and up-to-date analysis on geographical and time trends from 1990 to 2017. Methods: Using data from the Global Burden of Diseases, Injuries, and Risk Factors Study (GBD) 2017, we estimated the prevalence, morbidity, and mortality attributable to chronic respiratory diseases through an analysis of deaths, disability-adjusted life-years (DALYs), and years of life lost (YLL) by GBD super-region, from 1990 to 2017, stratified by age and sex. Specific diseases analysed included asthma, COPD, interstitial lung disease and pulmonary sarcoidosis, pneumoconiosis, and other chronic respiratory diseases. We also assessed the contribution of risk factors (smoking, second-hand smoke, ambient particulate matter and ozone pollution, household air pollution from solid fuels, and occupational risks) to chronic respiratory disease-attributable DALYs. Findings: In 2017, 544·9 million people (95% uncertainty interval [UI] 506·9–584·8) worldwide had a chronic respiratory disease, representing an increase of 39·8% compared with 1990. Chronic respiratory disease prevalence showed wide variability across GBD super-regions, with the highest prevalence among both males and females in high-income regions, and the lowest prevalence in sub-Saharan Africa and south Asia. The age-sex-specific prevalence of each chronic respiratory disease in 2017 was also highly variable geographically. Chronic respiratory diseases were the third leading cause of death in 2017 (7·0% [95% UI 6·8–7·2] of all deaths), behind cardiovascular diseases and neoplasms. Deaths due to chronic respiratory diseases numbered 3 914 196 (95% UI 3 790 578–4 044 819) in 2017, an increase of 18·0% since 1990, while

关键词：

来源：评论

学校读者我要写书评

暂无评论

Steps toward Parallel Intelligence

引用

IEEE/CAA Journal of Automatica Sinica 2016年第4期3卷 345-348页

作者： Fei-Yue Wang Xiao Wang Lingxi Li Li Li IEEE State Key Laboratory of Management and Control for Complex Systems (SKL-MCCS) Institute of AutomationChinese Academy of Sciences (CASIA) Research Center of Computational Experiments and Parallel Systems the National University of Defense Technology Qingdao Academy of Intelligent Industries (QAII) QingdaoShandongChinaand SKL-MCCSCASIA Department of Electrical and Computer Engineering Purdue School of Engineering and TechnologyIndiana University-Purdue University Indianapolis Department of Automation Tsinghua University Jiangsu Province Collaborative Innovation Center of Modern Urban Traffic Technologies

The origin of artificial intelligence is investigated, based on which the concepts of hybrid intelligence and parallel intelligence are presented. The paradigm shift in Intelligence indicates the ''new normal'' of cyber-social-physical systems (CPSS), in which the system behaviors are guided by Merton's Laws. Thus, the ACP-based parallel intelligence consisting of Artificial societies, Computational experiments and Parallel execution are introduced to bridge the big modeling gap in CPSS. © 2014 Chinese Association of Automation.

关键词： control systems Electrical engineering

来源：评论

学校读者我要写书评

暂无评论

Scene-specific pedestrian detection based on parallel vision

arXiv

引用

arXiv 2017年

作者： Zhang, Wenwen Wang, Kunfeng Qu, Hua Zhao, Jihong Wang, Fei-Yue School of Software Engineering Xi’an Jiaotong University Xi’an710049 China State Key Laboratory for Management and Control of Complex Systems Institute of Automation Chinese Academy of Sciences Beijing100190 China Qingdao Academy of Intelligent Industries Qingdao266000 China School of Software Engineering Xi’an Jiaotong University Xi’an710049 China Department of Communication and Information Engineering Xi’an Jiaotong University Xi’an710049 China Research Center for Computational Experiments and Parallel Systems Technology National University of Defense Technology Changsha410073 China

As a special type of object detection, pedestrian detection in generic scenes has made a significant progress trained with large amounts of labeled training data manually. While the models trained with generic dataset work bad when they are directly used in specific scenes. With special viewpoints, flow light and backgrounds, datasets from specific scenes are much different from the datasets from generic scenes. In order to make the generic scene pedestrian detectors work well in specific scenes, the labeled data from specific scenes are needed to adapt the models to the specific scenes. While labeling the data manually spends much time and money, especially for specific scenes, each time with a new specific scene, large amounts of images must be labeled. What’s more, the labeling information is not so accurate in the pixels manually and different people make different labeling information. In this paper, we propose an ACP-based method, with augmented reality’s help, we build the virtual world of specific scenes, and make people walking in the virtual scenes where it is possible for them to appear to solve this problem of lacking labeled data and the results show that data from virtual world is helpful to adapt generic pedestrian detectors to specific scenes. Copyright © 2017, The Authors. All rights reserved.

关键词： Virtual reality

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：