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

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Think-aloud interviews: A tool for exploring student statistical reasoning

arXiv

引用

arXiv 2019年

作者： Reinhart, Alex Evans, Ciaran Luby, Amanda Orellana, Josue Meyer, Mikaela Wieczorek, Jerzy Elliott, Peter Burckhardt, Philipp Nugent, Rebecca Department of Statistics & Data Science Carnegie Mellon University United States Department of Mathematics and Statistics Wake Forest University United States Department of Mathematics & Statistics Swarthmore College United States Center for the Neural Basis of Cognition Machine Learning Department Carnegie Mellon University United States Department of Statistics Colby College United States

Think-aloud interviews have been a valuable but underused tool in statistics education research. Think-alouds, in which students narrate their reasoning in real time while solving problems, differ in important ways from other types of cognitive interviews and related education research methods. Beyond the uses already found in the statistics literature-mostly validating the wording of statistical concept inventory questions and studying student misconceptions-we suggest other possible use cases for think-alouds and summarize best-practice guidelines for designing think-aloud interview studies. Using examples from our own experiences studying the local student body for our introductory statistics courses, we illustrate how research goals should inform study-design decisions and what kinds of insights think-alouds can provide. We hope that our overview of think-alouds encourages more statistics educators and researchers to begin using this method. © 2019, CC BY.

关键词： Statistics

来源：评论

学校读者我要写书评

暂无评论

Nonparametric density estimation with adversarial losses 18

Nonparametric density estimation with adversarial losses

引用

Proceedings of the 32nd International Conference on Neural Information Processing Systems

作者： Shashank Singh Ananya Uppal Boyue Li Chun-Liang Li Manzil Zaheer Barnabás Póczos Machine Learning Department Carnegie Mellon University and Department of Statistics & Data Science Carnegie Mellon University Department of Mathematical Sciences Carnegie Mellon University Language Technologies Institute Carnegie Mellon University Machine Learning Department Carnegie Mellon University

We study minimax convergence rates of nonparametric density estimation under a large class of loss functions called "adversarial losses", which, besides classical Lp losses, includes maximum mean discrepancy (MMD), Wasserstein distance, and total variation distance. These losses are closely related to the losses encoded by discriminator networks in generative adversarial networks (GANs). In a general framework, we study how the choice of loss and the assumed smoothness of the underlying density together determine the minimax rate. We also discuss implications for training GANs based on deep ReLU networks, and more general connections to learning implicit generative models in a minimax statistical sense.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Prime-residue-class of uniform charges on the integers

arXiv

引用

arXiv 2018年

作者： Spece, Michael Kadane, Joseph B. Department of Statistics & Data Science and Machine Learning Department Carnegie Mellon University PittsburghPA15213 United States Department of Statistics & Data Science Carnegie Mellon University PittsburghPA15213 United States

There is a probability charge on the power set of the integers that gives probability 1/p to every residue class modulo a prime p. There exists such a charge that gives probability w to the set of prime numbers iff w ∈ [0,1/2]. Similarly, there is such a charge that gives probability x to a residue class modulo c, where c is composite, iff x ∈ [0,1/y], where y is the largest prime factor of c. Copyright © 2018, The Authors. All rights reserved.

关键词： C (programming language)

来源：评论

学校读者我要写书评

暂无评论

Uplink-downlink duality between multiple-access and broadcast channels with compressing relays

arXiv

引用

arXiv 2020年

作者： Liu, Liang Liu, Ya-Feng Patil, Pratik Yu, Wei the Department of Electronic and Information Engineering The Hong Kong Polytechnic University Hong Kong the State Key Laboratory of Scientific and Engineering Computing Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China The Edward S. Rogers Sr. Department of Electrical and Computer Engineering the University of Toronto the Department of Statistics and Data Science and the Machine Learning Department Carnegie Mellon University PittsburghPA15213 United States The Edward S. Rogers Sr. Department of Electrical and Computer Engineering University of Toronto 10 King’s College Road TorontoONM5S3G4 Canada

—Uplink-downlink duality refers to the fact that under a sum-power constraint, the capacity regions of a Gaussian multiple-access channel and a Gaussian broadcast channel with Hermitian transposed channel matrices are identical. This paper generalizes this result to a cooperative cellular network, in which remote access-points are deployed as relays in serving the users under the coordination of a central processor (CP). In this model, the users and the relays are connected over noisy wireless links, while the relays and the CP are connected over noiseless but rate-limited fronthaul links. Based on a Lagrangian technique, this paper establishes a duality relationship between such a multiple-access relay channel and broadcast relay channel, under the assumption that the relays use compression-based strategies. Specifically, we show that under the same total transmit power constraint and individual fronthaul rate constraints, the achievable rate regions of the Gaussian multiple-access and broadcast relay channels are identical, when either independent compression or Wyner-Ziv and multivariate compression strategies are used. The key observations are that if the beamforming vectors at the relays are fixed, the sum-power minimization problems under the achievable rate and fronthaul constraints in both the uplink and the downlink can be transformed into either a linear programming or a semidefinite programming problem depending on the compression technique, and that the uplink and downlink problems are Lagrangian duals of each other. Moreover, the dual variables corresponding to the downlink rate constraints become the uplink powers;the dual variables corresponding to the downlink fronthaul constraints become the uplink quantization noises. This duality relationship enables an efficient algorithm for optimizing the downlink transmission and relaying strategies based on the uplink. Copyright © 2020, The Authors. All rights reserved.

关键词： Linear programming

来源：评论

学校读者我要写书评

暂无评论

Evaluating the Accuracy and Reliability of Real-World Digital Mobility Outcomes in Older Adults After Hip Fracture: Cross-Sectional Observational Study

引用

JMIR Formative Research 2025年 9卷 e67792页

作者： Berge, Martin A. Paraschiv-Ionescu, Anisoara Kirk, Cameron Küderle, Arne Micó-Amigo, Encarna Becker, Clemens Cereatti, Andrea Del Din, Silvia Engdal, Monika Garcia-Aymerich, Judith Grønvik, Karoline B. Hansen, Clint Hausdorff, Jeffrey M. Helbostad, Jorunn L. Jansen, Carl-Philipp Johnsen, Lars Gunnar Klenk, Jochen Koch, Sarah Maetzler, Walter Megaritis, Dimitrios Müller, Arne Rochester, Lynn Schwickert, Lars Taraldsen, Kristin Vereijken, Beatrix Department of Neuromedicine and Movement Science Norwegian University of Science and Technology Trondheim Norway Laboratory of Movement Analysis and Measurement Ecole Polytechnique Federale de Lausanne Lausanne Switzerland Translational and Clinical Research Institute Faculty of Medical Sciences Newcastle University Newcastle Upon Tyne United Kingdom Machine Learning and Data Analytics Lab Department Artificial Intelligence in Biomedical Engineering Friedrich-Alexander-Universität Erlangen-Nürnberg Erlangen Germany Geriatric Center Medical Faculty Heidelberg Heidelberg University Heidelberg Germany Department of Geriatrics and Rehabilitation Robert Bosch Hospital Stuttgart Germany Department of Electronics and Telecommunications Politecnico di Torino Turin Italy National Institute for Health and Care Research Newcastle Biomedical Research Centre Newcastle University The Newcastle Upon Tyne Hospitals NHS Foundation Trust Newcastle Upon Tyne United Kingdom Barcelona Institute for Global Health Barcelona Spain Department of Medicine and Life Sciences Universitat Pompeu Fabra Catalonia Barcelona Spain CIBER Epidemiología y Salud Pública Madrid Spain Department of Neurology University Hospital Schleswig-Holstein Kiel University Kiel Germany Center for the Study of Movement Cognition and Mobility Neurological Institute Tel Aviv Medical Center Tel Aviv Israel Department of Physical Therapy Faculty of Medical & Health Sciences Tel Aviv University Tel Aviv Israel Sagol School of Neuroscience Tel Aviv University Tel Aviv Israel Rush Alzheimer’s Disease Center Rush University Medical Center Chicago IL United States Department of Orthopedic Surgery Rush Medical College Rush University Chicago IL United States Department of Orthopaedic Surgery St. Olav’s Hospital Trondheim Norway Institute of Epidemiology and Medical Biometry Ulm University Ulm Germany IB University of Health and Social Sciences Study Centre Stuttgart Stuttgart Germany Department of Sport

Background: Algorithms estimating real-world digital mobility outcomes (DMOs) are increasingly validated in healthy adults and various disease cohorts. However, their accuracy and reliability in older adults after hip fracture, who often walk slowly for short durations, is underexplored. Objective: This study examined DMO accuracy and reliability in a hip fracture cohort considering walking bout (WB) duration, physical function, days since surgery, and walking aid use. Methods: In total, 19 community-dwelling participants were real-world monitored for 2.5 hours using a lower back wearable device and a reference system combining inertial modules, distance sensors, and pressure insoles. A total of 6 DMO estimates from 164 WBs from 58% (11/19) of the participants (aged 71-90 years;assessed 32-390 days after surgery;Short Physical Performance Battery [SPPB] scores of 3-12;gait speed range 0.39-1.34 m/s) were assessed against the reference system at the WB and participant level. We stratified by WB duration (all WBs, WBs of >10 seconds, WBs of 10-30 seconds, and WBs of >30 seconds) and lower versus higher SPPB scores and observed whether days since surgery and walking aid use affected DMO accuracy and reliability. Results: Across WBs, walking speed and distance ranged from 0.25 to 1.29 m/s and from 1.7 to 436.5 m, respectively. Estimation of walking speed, cadence, stride duration, number of steps, and distance stratified by WB duration showed intraclass correlation coefficients (ICCs) ranging from 0.50 to 0.99 and mean relative errors (MREs) from –6.9% to 12.8%. Stride length estimation showed poor reliability, with ICCs ranging from 0.30 to 0.49 and MREs from 6.1% to 13.2%. Walking speed and distance ICCs in the higher–SPPB score group ranged from 0.85 to 0.99, and MREs ranged from –10.1% to –1.7%. In the lower–SPPB score group, walking speed and distance ICCs ranged from 0.17 to 0.99, and MREs ranged from 13.5% to 32.6%. There was no discernible effect of time since s

关键词： active aging cadence digital mobility assessment distance free living gait walking speed wearable device

来源：评论

学校读者我要写书评

暂无评论

Smart Annotation Tool for Multi-sensor Gait-based Daily Activity data

Smart Annotation Tool for Multi-sensor Gait-based Daily Acti...

引用

IEEE International Conference on Pervasive Computing and Communications

作者： Christine F. Martindale Nils Roth Julius Hannink Sebastijan Sprager Bjoern M. Eskofier Machine Learning and Data Analytics Lab Computer Science Department Friedrich-Alexander University Erlangen-Nürnberg Germany Faculty of Computer and Information Science University of Ljubljana Slovenia

ISBN: (纸本)9781538632284

The monitoring of patients within a natural, home environment is important in order to close knowledge gaps in the treatment and care of neurodegenerative diseases, such as quantifying the daily fluctuation of Parkinson's patients' symptoms. The combination of machine learning algorithms and wearable sensors for gait analysis is becoming capable of achieving this. However, these algorithms require large, labelled, realistic datasets for training. Most systems used as a ground truth for labelling are restricted to the laboratory environment, as well as being large and expensive. We propose a study design for a realistic activity monitoring dataset, collected with inertial measurement units, pressure insoles and cameras. It is not restricted by a fixed location or capture volume and still enables the labelling of gait phases or, where non-gait movement such as jumping occur: on-the-ground, off-the-ground phases. Additionally, this paper proposes a smart annotation tool which reduces annotation cost by more than 80%. This smart annotation is based on edge detection within the pressure sensor signal. The tool also enables annotators to perform assisted correction of these labels in a post-processing step. This system enables the collection and labelling of large, fairly realistic datasets where 93% of the automatically generated labels are correct and only an additional 10% need to be inserted manually. Our tool and protocol, as a whole, will be useful for efficiently collecting the large datasets needed for training and validation of algorithms capable of cyclic human motion analysis in natural environments.

关键词： Image edge detection Tools Cameras Labeling Pressure sensors Intelligent sensors Edge detection Pressure Sensor Device Component Cameras intelligent sensors ANNOTATIONS laboratory environment dataset Wearable sensors Measurement units Research Design INSOLE Packaging

来源：评论

学校读者我要写书评

暂无评论

Gradient descent finds global minima of deep neural networks

arXiv

引用

arXiv 2018年

作者： Du, Simon S. Lee, Jason D. Li, Haochuan Wang, Liwei Zhai, Xiyu Machine Learning Department Carnegie Mellon University Data Science and Operations Department University of Southern California School of Physics Peking University Center for Data Science Peking University Beijing Institute of Big Data Research Key Laboratory of Machine Perception Moe School of Eecs Peking University Department of Eecs Massachusetts Institute of Technology

Gradient descent finds a global minimum in training deep neural networks despite the objective function being non-convex. The current paper proves gradient descent achieves zero training loss in polynomial time for a deep over-parameterized neural network with residual connections (ResNet). Our analysis relies on the particular structure of the Gram matrix induced by the neural network architecture. This structure allows us to show the Gram matrix is stable throughout the training process and this stability implies the global optimality of the gradient descent algorithm. We further extend our analysis to deep residual convolutional neural networks and obtain a similar convergence result. Copyright © 2018, The Authors. All rights reserved.

关键词： Gradient methods

来源：评论

学校读者我要写书评

暂无评论

Open and Sustainable AI: challenges, opportunities and the road ahead in the life sciences

arXiv

引用

arXiv 2025年

作者： Farrell, Gavin Adamidi, Eleni Buono, Rafael Andrade Anton, Mihail Attafi, Omar Abdelghani Gutierrez, Salvador Capella Capriotti, Emidio Castro, Leyla Jael Cirillo, Davide Crossman, Lisa Dessimoz, Christophe Dimopoulos, Alexandros Fernández-Díaz, Raúl Fragkouli, Styliani-Christina Goble, Carole Gu, Wei Hancock, John M. Khanteymoori, Alireza Lenaerts, Tom Liberante, Fabio G. Maccallum, Peter Monzon, Alexander Miguel Palmblad, Magnus Poveda, Lucy Radulescu, Ovidiu Shields, Denis C. Sufi, Shoaib Vergoulis, Thanasis Psomopoulos, Fotis Tosatto, Silvio C.E. Institute of Applied Biosciences Centre for Research and Technology Hellas Thessaloniki Greece 1Department of Biomedical Sciences University of Padova Padova35121 Italy Department of Biomedical Sciences University of Padova Via Ugo Bassi 58/B Padova35131 Italy Athena Research & Innovation Center Aigialias & Chalepa Marousi15125 Greece VIB Data Core VIB.AI Center for AI & Computational Biology Technologiepark-Zwijnaarde 75 Ghent9052 Belgium ELIXIR Europe Hub EMBL-EBI South Building Wellcome Genome HinxtonCB10 1SD United Kingdom Plaça Eusebi Güell 1-3 Barcelona08034 Spain Department of Pharmacy and Biotechnology University of Bologna Bologna40126 Italy Computational Genomics Platform IRCCS University Hospital of Bologna Bologna40138 Italy ZB MED Information Centre for Life Sciences Gleueler Straße 60 Cologne50931 Germany SequenceAnalysis.co.uk United Kingdom University of East Anglia Research Park NorwichNR4 7TJ United Kingdom Department of Computational Biology University of Lausanne Genopode 2024.3 Lausanne1015 Switzerland Swiss Institute of Bioinformatics Amphipôle Quartier UNIL-Sorge Lausanne1015 Switzerland Institute for Fundamental Biomedical Science Biomedical Sciences Research Center Alexander Fleming Vari Greece Department of Informatics & Telematics School of Digital Technology Harokopio University Athens Greece School of Medicine University College Dublin Belfield Dublin 4 Ireland Conway Institute of Biomolecular and Biomedical Research University College Dublin Belfield Dublin 4 Ireland IBM Research Dublin DublinD15 HN66 Ireland Institute of Applied Biosciences Centre for Research and Technology Hellas Thessaloniki57001 Greece Department of Biology National & Kapodistrian University of Athens Athens15772 Greece Department of Computer Science University of Manchester Oxford Road ManchesterM19 3PL United Kingdom Luxembourg National Data Service 6 avenue des Hauts-Fourneaux Esch-sur-AlzetteL-4362 Luxembourg Insti

Artificial intelligence (AI) has recently seen transformative breakthroughs in the life sciences, expanding possibilities for researchers to interpret biological information at an unprecedented capacity, with novel applications and advances being made almost daily. In order to maximise return on the growing investments in AI-based life science research and accelerate this progress, it has become urgent to address the exacerbation of long-standing research challenges arising from the rapid adoption of AI methods. We review the increased erosion of trust in AI research outputs, driven by the issues of poor reusability and reproducibility, and highlight their consequent impact on environmental sustainability. Furthermore, we discuss the fragmented components of the AI ecosystem and lack of guiding pathways to best support Open and Sustainable AI (OSAI) model development. In response, this perspective introduces a practical set of OSAI recommendations directly mapped to over 300 components of the AI ecosystem. Our work connects researchers with relevant AI resources, facilitating the implementation of sustainable, reusable and transparent AI. Built upon life science community consensus and aligned to existing efforts, the outputs of this perspective are designed to aid the future development of policy and structured pathways for guiding AI *** Codes 92 © 2025, CC BY-NC-ND.

关键词： Reusability

来源：评论

学校读者我要写书评

暂无评论

Algorithmic regularization in learning deep homogeneous models: layers are automatically balanced 18

Algorithmic regularization in learning deep homogeneous mode...

引用

Proceedings of the 32nd International Conference on Neural Information Processing Systems

作者： Simon S. Du Wei Hu Jason D. Lee Machine Learning Department School of Computer Science Carnegie Mellon University Computer Science Department Princeton University Department of Data Sciences and Operations Marshall School of Business University of Southern California

We study the implicit regularization imposed by gradient descent for learning multi-layer homogeneous functions including feed-forward fully connected and convolutional deep neural networks with linear, ReLU or Leaky ReLU activation. We rigorously prove that gradient flow (i.e. gradient descent with infinitesimal step size) effectively enforces the differences between squared norms across different layers to remain invariant without any explicit regularization. This result implies that if the weights are initially small, gradient flow automatically balances the magnitudes of all layers. Using a discretization argument, we analyze gradient descent with positive step size for the non-convex low-rank asymmetric matrix factorization problem without any regularization. Inspired by our findings for gradient flow, we prove that gradient descent with step sizes ηt = O(t-(1/2 + δ)) (0 < δ ≤ 1/2) automatically balances two low-rank factors and converges to a bounded global optimum. Furthermore, for rank-1 asymmetric matrix factorization we give a finer analysis showing gradient descent with constant step size converges to the global minimum at a globally linear rate. We believe that the idea of examining the invariance imposed by first order algorithms in learning homogeneous models could serve as a fundamental building block for studying optimization for learning deep models.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：