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

arXiv 2020年

作者： Basiri, Mohammad Hossein Ghojogh, Benyamin Azad, Nasser L. Fischmeister, Sebastian Karray, Fakhri Crowley, Mark The Department of Systems Design Engineering University of Waterloo ON Canada The Department of Electrical and Computer Engineering University of Waterloo ON Canada The Smart Hybrid and Electric Vehicles Systems Lab The Real-Time Embedded Software Lab The Machine Learning Lab The Centre for Pattern Analysis and Machine Intelligence

Vehicle platooning has been shown to be quite fruitful in the transportation industry to enhance fuel economy, road throughput, and driving comfort. Model Predictive Control (MPC) is widely used in literature for platoon control to achieve certain objectives, such as safely reducing the distance among consecutive vehicles while following the leader vehicle. In this paper, we propose a Distributed Nonlinear MPC (DNMPC), based upon an existing approach, to control a heterogeneous dynamic platoon with unidirectional topologies, handling possible cut-in/cut-out maneuvers. The introduced method addresses a collision-free driving experience while tracking the desired speed profile and maintaining a safe desired gap among the vehicles. The time of convergence in the dynamic platooning is derived based on the time of cut-in and/or cut-out maneuvers. In addition, we analyze the improvement level of driving comfort, fuel economy, and absolute and relative convergence of the method by using distributed metric learning and distributed optimization with Alternating Direction Method of Multipliers (ADMM). Simulation results on a dynamic platoon with cut-in and cut-out maneuvers and with different unidirectional topologies show the effectiveness of the introduced method. Copyright © 2020, The Authors. All rights reserved.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

Continual Learning in the Presence of Repetition

arXiv

引用

arXiv 2024年

作者： Hemati, Hamed Pellegrini, Lorenzo Duan, Xiaotian Zhao, Zixuan Xia, Fangfang Masana, Marc Tscheschner, Benedikt Veas, Eduardo Zheng, Yuxiang Zhao, Shiji Li, Shao-Yuan Huang, Sheng-Jun Lomonaco, Vincenzo van de Ven, Gido M. Institute for Computer Science University of St. Gallen Rosenbergstrasse 30 St. Gallen9000 Switzerland Department of Computer Science University of Bologna Via dell’Università 50 Cesena47521 Italy The University of Chicago 5801 S Ellis Ave Chicago60637 United States Argonne National Laboratory 9700 S Cass Ave Lemont60439 United States Graz University of Technology Rechbauerstraße 12 Graz8010 Austria TU Graz - SAL Dependable Embedded Systems Lab Silicon Austria Labs Graz8010 Austria Know-Center GmbH Sandgasse 36/4 Graz8010 Austria MIIT Key Laboratory of Pattern Analysis and Machine Intelligence Nanjing University of Aeronautics and Astronautics Nanjing211106 China Department of Computer Science University of Pisa Piano Secondo Largo Bruno Pontecorvo 3 Pisa56127 Italy Department of Electrical Engineering KU Leuven Kasteelpark Arenberg 10 Leuven3001 Belgium

Continual learning (CL) provides a framework for training models in ever-evolving environments. Although re-occurrence of previously seen objects or tasks is common in real-world problems, the concept of repetition in the data stream is not often considered in standard benchmarks for CL. Unlike with the rehearsal mechanism in buffer-based strategies, where sample repetition is controlled by the strategy, repetition in the data stream naturally stems from the environment. This report provides a summary of the CLVision challenge at CVPR 2023, which focused on the topic of repetition in class-incremental learning. The report initially outlines the challenge objective and then describes three solutions proposed by finalist teams that aim to effectively exploit the repetition in the stream to learn continually. The experimental results from the challenge highlight the effectiveness of ensemble-based solutions that employ multiple versions of similar modules, each trained on different but overlapping subsets of classes. This report underscores the transformative potential of taking a different perspective in CL by employing repetition in the data stream to foster innovative strategy design. © 2024, CC BY.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Mitosis domain generalization in histopathology images - The MIDOG challenge

arXiv

引用

arXiv 2022年

作者： Aubreville, Marc Stathonikos, Nikolas Bertram, Christof A. Klopfleisch, Robert ter Hoeve, Natalie Ciompi, Francesco Wilm, Frauke Marzahl, Christian Donovan, Taryn A. Maier, Andreas Breen, Jack Ravikumar, Nishant Chung, Youjin Park, Jinah Nateghi, Ramin Pourakpour, Fattaneh Fick, Rutger H.J. Hadj, Saima Ben Jahanifar, Mostafa Rajpoot, Nasir Dexl, Jakob Wittenberg, Thomas Kondo, Satoshi Lafarge, Maxime W. Koelzer, Viktor H. Liang, Jingtang Wang, Yubo Long, Xi Liu, Jingxin Razavi, Salar Khademi, April Yang, Sen Wang, Xiyue Veta, Mitko Breininger, Katharina Technische Hochschule Ingolstadt Ingolstadt Germany Pathology Department UMC Utrecht Netherlands Institute of Pathology University of Veterinary Medicine Vienna Austria Institute of Veterinary Pathology Freie Universität Berlin Berlin Germany Computational Pathology Group Radboud UMC Nijmegen Netherlands Pattern Recognition Lab Friedrich-Alexander-Universität Erlangen-Nürnberg Germany Department of Anatomic Pathology Schwarzman Animal Medical Center New York United States CISTIB Center for Computational Imaging and Simulation Technologies in Biomedicine School of Computing University of Leeds United Kingdom Korea Advanced Institute of Science and Technology Daejeon Korea Republic of Electrical and Electronics Engineering Department Shiraz University of Technology Shiraz Iran Tehran Iran Tribun Health Paris France Tissue Image Analytics Centre Department of Computer Science University of Warwick United Kingdom Fraunhofer-Institute for Integrated Circuits IIS Erlangen Germany Muroran Institute of Technology Hokkaido Japan Department of Pathology and Molecular Pathology University Hospital University of Zurich Zurich Switzerland School of Life Science and Technology Xidian University Shannxi China Histo Pathology Diagnostic Center Shanghai China Xi'an Jiaotong-Liverpool University Suzhou China Electrical Computer and Biomedical Engineering Ryerson University TorontoON Canada Tencent AI Lab Shenzhen518057 China College of Computer Science Sichuan University Chengdu610065 China Medical Image Analysis Group TU Eindhoven Netherlands Department of Artificial Intelligence in Biomedical Engineering Friedrich-Alexander-Universität Erlangen-Nürnberg Germany

The density of mitotic figures within tumor tissue is known to be highly correlated with tumor proliferation and thus is an important marker in tumor grading. Recognition of mitotic figures by pathologists is known to be subject to a strong inter-rater bias, which limits the prognostic value. State-of-the-art deep learning methods can support the expert in this assessment but are known to strongly deteriorate when applied in a different clinical environment than was used for training. One decisive component in the underlying domain shift has been identified as the variability caused by using different whole slide scanners. The goal of the MICCAI MIDOG 2021 challenge has been to propose and evaluate methods that counter this domain shift and derive scanner-agnostic mitosis detection algorithms. The challenge used a training set of 200 cases, split across four scanning systems. As a test set, an additional 100 cases split across four scanning systems, including two previously unseen scanners, were given. The best approaches performed on an expert level, with the winning algorithm yielding an F1 score of 0.748 (CI95: 0.704-0.781). In this paper, we evaluate and compare the approaches that were submitted to the challenge and identify methodological factors contributing to better performance. Copyright © 2022, The Authors. All rights reserved.

关键词： Scanning

来源：评论

学校读者我要写书评

暂无评论

Why is the Winner the Best?

Why is the Winner the Best?

引用

Conference on computer Vision and pattern Recognition (CVPR)

作者： M. Eisenmann A. Reinke V. Weru M. D. Tizabi F. Isensee T. J. Adler S. Ali V. Andrearczyk M. Aubreville U. Baid S. Bakas N. Balu S. Bano J. Bernal S. Bodenstedt A. Casella V. Cheplygina M. Daum M. De Bruijne A. Depeursinge R. Dorent J. Egger D. G. Ellis S. Engelhardt M. Ganz N. Ghatwary G. Girard P. Godau A. Gupta L. Hansen K. Harada M. Heinrich N. Heller A. Hering A. Huaulmé P. Jannin A. E. Kavur O. Kodym M. Kozubek J. Li H. Li J. Ma C. Martín-Isla B. Menze A. Noble V. Oreiller N. Padoy S. Pati K. Payette T. Rädsch J. Rafael-Patiño V. Singh Bawa S. Speidel C. H. Sudre K. Van Wijnen M. Wagner D. Wei A. Yamlahi M. H. Yap C. Yuan M. Zenk A. Zia D. Zimmerer D. Aydogan B. Bhattarai L. Bloch R. Brüngel J. Cho C. Choi Q. Dou I. Ezhov C. M. Friedrich C. Fuller R. R. Gaire A. Galdran Á. García Faura M. Grammatikopoulou S. Hong M. Jahanifar I. Jang A. Kadkhodamohammadi I. Kang F. Kofler S. Kondo H. Kuijf M. Li M. Luu T. Martinčič P. Morais M. A. Naser B. Oliveira D. Owen S. Pang J. Park S. Park S. Płotka E. Puybareau N. Rajpoot K. Ryu N. Saeed A. Shephard P. Shi D. Štepec R. Subedi G. Tochon H. R. Torres H. Urien J. L. Vilaça K. A. Wahid H. Wang J. Wang L. Wang X. Wang B. Wiestler M. Wodzinski F. Xia J. Xie Z. Xiong S. Yang Y. Yang Z. Zhao K. Maier-Hein P. F. Jäger A. Kopp-Schneider L. Maier-Hein Division of Intelligent Medical Systems German Cancer Research Center (DKFZ) Heidelberg Germany Helmholtz Imaging German Cancer Research Center (DKFZ) Heidelberg Germany Faculty of Mathematics and Computer Science Heidelberg University Heidelberg Germany Division of Biostatistics German Cancer Research Center (DKFZ) Heidelberg Germany Division of Medical Image Computing German Cancer Research Center (DKFZ) Heidelberg Germany Faculty of Engineering and Physical Sciences School of Computing University of Leeds Leeds UK Institute of Informatics School of Management HES-SO Valais-Wallis University of Applied Sciences and Arts Western Switzerland Sierre Switzerland Department of Nuclear Medicine and Molecular Imaging Lausanne University Hospital Lausanne Switzerland Technische Hochschule Ingolstadt Ingolstadt Germany Center for Artificial Intelligence and Data Science for Integrated Diagnostics (AI2D) and Center for Biomedical Image Computing and Analytics (CBICA) University of Pennsylvania Philadelphia PA USA Department of Pathology and Laboratory Medicine Perelman School of Medicine University of Pennsylvania Philadelphia PA USA Department of Radiology Perelman School of Medicine University of Pennsylvania Philadelphia PA USA Department of Radiology University of Washington Seattle WA USA Department of Computer Science Wellcome/EPSRC Centre for Interventional and Surgical Sciences (WEISS) University College London London UK Universitat Autònoma de Barcelona & Computer Vision Center Barcelona Spain Division of Translational Surgical Oncology National Center for Tumor Diseases (NCT/UCC) Dresden Dresden Germany Department of Advanced Robotics Istituto Italiano di Tecnologia Italy Department of Electronics Information and Bioengineering Politecnico di Milano Milan Italy IT University of Copenhagen Copenhagen Denmark Department of General Visceral and Transplantation Surgery Heidelberg University Hospital Heidelberg Germany Department of Radiology and Nuc

International benchmarking competitions have become fundamental for the comparative performance assessment of image analysis methods. However, little attention has been given to investigating what can be learnt from these competitions. Do they really generate scientific progress? What are common and successful participation strategies? What makes a solution superior to a competing method? To address this gap in the literature, we performed a multicenter study with all 80 competitions that were conducted in the scope of IEEE ISBI 2021 and MICCAI 2021. Statistical analyses performed based on comprehensive descriptions of the submitted algorithms linked to their rank as well as the underlying participation strategies revealed common characteristics of winning solutions. These typically include the use of multi-task learning (63%) and/or multi-stage pipelines (61%), and a focus on augmentation (100%), image preprocessing (97%), data curation (79%), and post-processing (66%). The “typical” lead of a winning team is a computer scientist with a doctoral degree, five years of experience in biomedical image analysis, and four years of experience in deep learning. Two core general development strategies stood out for highly-ranked teams: the reflection of the metrics in the method design and the focus on analyzing and handling failure cases. According to the organizers, 43% of the winning algorithms exceeded the state of the art but only 11% completely solved the respective domain problem. The insights of our study could help researchers (1) improve algorithm development strategies when approaching new problems, and (2) focus on open research questions revealed by this work.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Understanding metric-related pitfalls in image analysis validation

arXiv

引用

arXiv 2023年

作者： Reinke, Annika Tizabi, Minu D. Baumgartner, Michael Eisenmann, Matthias Heckmann-Nötzel, Doreen Kavur, A. Emre Rädsch, Tim Sudre, Carole H. Acion, Laura Antonelli, Michela Arbel, Tal Bakas, Spyridon Benis, Arriel Blaschko, Matthew B. Buettner, Florian Cardoso, M. Jorge Cheplygina, Veronika Chen, Jianxu Christodoulou, Evangelia Cimini, Beth A. Collins, Gary S. Farahani, Keyvan Ferrer, Luciana Galdran, Adrian van Ginneken, Bram Glocker, Ben Godau, Patrick Haase, Robert Hashimoto, Daniel A. Hoffman, Michael M. Huisman, Merel Isensee, Fabian Jannin, Pierre Kahn, Charles E. Kainmueller, Dagmar Kainz, Bernhard Karargyris, Alexandros Karthikesalingam, Alan Kenngott, Hannes Kleesiek, Jens Kofler, Florian Kooi, Thijs Kopp-Schneider, Annette Kozubek, Michal Kreshuk, Anna Kurc, Tahsin Landman, Bennett A. Litjens, Geert Madani, Amin Maier-Hein, Klaus Martel, Anne L. Mattson, Peter Meijering, Erik Menze, Bjoern Moons, Karel G.M. Müller, Henning Nichyporuk, Brennan Nickel, Felix Petersen, Jens Rafelski, Susanne M. Rajpoot, Nasir Reyes, Mauricio Riegler, Michael A. Rieke, Nicola Saez-Rodriguez, Julio Sánchez, Clara I. Shetty, Shravya Summers, Ronald M. Taha, Abdel A. Tiulpin, Aleksei Tsaftaris, Sotirios A. van Calster, Ben Varoquaux, Gaël Yaniv, Ziv R. Jäger, Paul F. Maier-Hein, Lena Faculty of Mathematics and Computer Science Heidelberg University Heidelberg Germany Heidelberg Division of Intelligent Medical Systems Germany NCT Heidelberg A Partnership Between DKFZ University Medical Center Heidelberg Germany Heidelberg Division of Medical Image Computing Germany Heidelberg Division of Intelligent Medical Systems Germany MRC Unit for Lifelong Health and Ageing UCL Centre for Medical Image Computing Department of Computer Science University College London London United Kingdom School of Biomedical Engineering and Imaging Science King’s College London London United Kingdom Instituto de Cálculo CONICET – Universidad de Buenos Aires Buenos Aires Argentina Centre for Medical Image Computing University College London London United Kingdom McGill University Montreal Canada Division of Computational Pathology Dept of Pathology & Laboratory Medicine Indiana University School of Medicine IU Health Information and Translational Sciences Building Indianapolis United States University of Pennsylvania Richards Medical Research Laboratories FL7 PhiladelphiaPA United States Department of Digital Medical Technologies Holon Institute of Technology Holon Israel European Federation for Medical Informatics Le Mont-sur-Lausanne Switzerland Center for Processing Speech and Images Department of Electrical Engineering KU Leuven Leuven Belgium partner site Frankfurt/Mainz a partnership between DKFZ and UCT Frankfurt Marburg Germany Heidelberg Germany Goethe University Frankfurt Department of Medicine Germany Goethe University Frankfurt Department of Informatics Germany and Frankfurt Cancer Insititute Germany Department of Computer Science IT University of Copenhagen Copenhagen Denmark Leibniz-Institut für Analytische Wissenschaften – ISAS – e.V. Dortmund Germany Imaging Platform Broad Institute of MIT and Harvard CambridgeMA United States Centre for Statistics in Medicine University of Oxford Oxford United Kingdom Center for Biomedical In

Validation metrics are key for tracking scientific progress and bridging the current chasm between artificial intelligence (AI) research and its translation into practice. However, increasing evidence shows that particularly in image analysis, metrics are often chosen inadequately. While taking into account the individual strengths, weaknesses, and limitations of validation metrics is a critical prerequisite to making educated choices, the relevant knowledge is currently scattered and poorly accessible to individual researchers. Based on a multi-stage Delphi process conducted by a multidisciplinary expert consortium as well as extensive community feedback, the present work provides the first reliable and comprehensive common point of access to information on pitfalls related to validation metrics in image analysis. While focused on biomedical image analysis, the addressed pitfalls generalize across application domains and are categorized according to a newly created, domain-agnostic taxonomy. The work serves to enhance global comprehension of a key topic in image analysis validation. © 2023, CC BY.

关键词： computer vision

来源：评论

学校读者我要写书评

暂无评论

Urban land-cover classification based on Swarm intelligence from high resolution remote sensing imagery

Urban land-cover classification based on Swarm intelligence ...

引用

International Conference on Remote Sensing, Environment and Transportation engineering

作者： Bedawi, Safaa M. Kamel, Mohamed S. Pattern Analysis and Machine Intelligence Lab. Department of Electrical and Computer Engineering University of Waterloo Waterloo ON N2L 3G1 Canada

ISBN: (纸本)9781424491711

Urban land-cover classification is one of the most challenging problems in pattern analysis and machine intelligence systems in remote sensing. Dense urban environment sensed by very high-resolution (VHR) optical sensors is even more challenging. Occlusions and shadows due to buildings and trees hide some objects in the scene. Despite its simplicity and usefulness, conventional classification methods have failed to have a high classification accuracy in dense urban areas. The objective of this study is to improve the quality of the land-cover classification. We propose using a Particle Swarm Optimization (PSO) based algorithm for the classification of VHR (0.1 to 1 m) remote sensing data over urban areas. This method is to discover classification rules through simulating the social behavior of animals such as the behaviours of bird flocking. The results for aerial images classification show the significance of this method. PSO-based classifier has been applied to the classification of remote sensing data in dense urban district of Kitchener-Waterloo and has achieved high predictive accuracy of 90 %. © 2011 IEEE.

关键词： Image classification

来源：评论

学校读者我要写书评

暂无评论

A NOVEL APPROACH TO PATH PLANNING FOR AUTONOMOUS MOBILE ROBOTS

引用

CONTROL AND INTELLIGENT SYSTEMS 2011年第4期39卷 235-244页

作者： Miao, Yun-Qian Khamis, Alaa M. Karray, Fakhri Kamel, Mohamed S. Pattern Analysis and Machine Intelligence (PAMI) ResearchGroup Department of Electrical and Computer Engineering University of Waterloo Waterloo ON Canada Faculty of Petroleum and Mining Engineering Suez Canal University Egypt

Path planning is considered as one of the core problems of au- tonomous mobile robots. Different approaches have been proposed with different levels of complexity, accuracy, and applicability. This paper presents a hybrid approach to the problem of path planning that can be used to find global optimal collision-free paths. This ap- proach relies on combining potential field (PF) method and genetic algorithm (GA) which takes the strengths of both and overcomes their inherent limitations. In this integrated frame, the PF method is designed as a gradient-based searching strategy to exploit local optimal, and the GA is used to explore over the whole problem space. In this work, different implementing strategies are examined in different complexity scenarios. The conducted experiments show that global optimal paths can be achieved effectively using the pro- posed approach with a strategy of high diversity and memorization.

关键词： Mobile robotics path planning potential field genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

Random finite set theoretic based soft/hard data fusion with application for target tracking

Random finite set theoretic based soft/hard data fusion with...

引用

International Conference on Multisensor Fusion and Integration for Intelligent Systems (MFI)

作者： Bahador Khaleghi Alaa Khamis Fakhreddin Karray Pattern Analysis and Machine Intelligence (PAMI) Laboratory Department of Electrical and Computer Engineering University of Waterloo Waterloo ONT Canada

This paper reports on ongoing research on development of data fusion systems capable of processing soft as well as hard data. Such fusion systems are distinguished from the conventional systems where input data are assumed to be provided by typically well-characterized electronic sensor systems. The incorporation of soft human-generated data into fusion process is an emerging trend in fusion community majorly motivated by asymmetric warfare situations where observational opportunities for traditional hard sensors is restricted. Random finite set theory is a mathematical framework with powerful representational and computational abilities making it a promising approach to address several fundamental challenges in soft/hard fusion systems. In this paper the first prototype soft/hard fusion system based on random finite set theory is described. Experimental results obtained using the developed system prove the plausibility as well as efficiency of a random finite set theoretic approach to fusion of soft/hard data.

关键词： Humans Target tracking Data models Observers Robot sensing systems

来源：评论

学校读者我要写书评

暂无评论

Particle filtering for bearing-only audio-visual speaker detection and tracking

Particle filtering for bearing-only audio-visual speaker det...

引用

International Conference on Signals, Circuits and Systems, SCS

作者： Andrew Rae Alaa Khamis Otman Basir Mohamed Kamel Pattern Analysis and Machine Intelligence (PAMI) research group Department of Electrical and Computer Engineering University of Waterloo Canada Department of Electrical and Computer Engineering University of Waterloo Canada PAMI research group Department of Electrical and Computer Engineering University of Waterloo Canada

ISBN: (纸本)9781424443970;9781424443987

We present a method for audio-visual speaker detection and tracking in a smart meeting room environment based on bearing measurements and particle filtering. Bearing measurements are determined using the Time Difference of Arrival (TDOA) of the acoustic signal reaching a pair of microphones, and by tracking facial regions in images from monocular cameras. A particle filter is used to sample the space of possible speaker locations within the meeting room, and to fuse the bearing measurements from auditory and visual sources. The proposed system was tested in a video messaging scenario, using a single participant seated in front of a screen to which a camera and microphone pair are attached. The experimental results show that the accuracy of speaker tracking using bearing measurements is related to the location of the speaker relative to the locations of the camera and microphones, which can be quantified using a parameter known as Dilution of Precision.

关键词： Filtering Particle tracking Loudspeakers Acoustic measurements Microphones Cameras Acoustic signal detection Particle measurements Time measurement Time difference of arrival

来源：评论

学校读者我要写书评

暂无评论

Learning term dependency links using information theoretic inclusion measure

Learning term dependency links using information theoretic i...

引用

17th IEEE International Conference on Data Mining Workshops, ICDM Workshops 2007

作者： Makrehchi, Masoud Kamel, Mohamed S. Pattern Analysis and Machine Intelligence Lab. Department of Electrical and Computer Engineering University of Waterloo Waterloo ON N2L 3G1 Canada

ISBN: (纸本)0769530192

An algorithm to identify and remove term redundancy is proposed for text classifiers using ranking-based feature selection. The proposed method employs a normalized mutual information, which is called inclusion measure, to estimate asymmetric dependency between two terms. Based on pair-wise dependency measures, a dependency matrix is constructed. In this paper, an algorithm is proposed to learn term dependency links from term dependency matrix, and visualize the dependency between term in a graph called term dependency tree. All nodes of the tree are categorized into two groups: hubs and links. Any node whose outdegree is less than two will join the Links group. We show that all link nodes are most likely redundant. We also introduce a criterion, which is called substitution cost, to decide whether to remove or retain a candidate, redundant term. The proposed approach is applied to four well-known benchmark data sets with a SVM and Rocchio classifier using a set of highly aggressive feature selection schemes. The results show the effectiveness of the proposed method especially when applied to weak classifiers. © 2007 IEEE.

关键词： Forestry

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：