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

arXiv 2025年

作者： Gong, Luqi Chen, Haotian Chen, Yikun Yao, Tianliang Li, Chao Zhao, Shuai Han, Guangjie School of Computer Science Beijing University of Posts and Telecommunications Beijing China Research Center for Space Computing System Zhejiang Lab Hangzhou China SWJTU-LEEDS Joint School Southwest Jiaotong University Chengdu China Guangdong Zhiyun City construction Technology Co. LTD Zhuhai China Department of Control Science and Engineering College of Electronic and Information Engineering Tongji University Shanghai China Key Laboratory of Maritime Intelligent Network Information Technology Ministry of Education Hohai University China

In unmanned aerial systems, especially in complex environments, accurately detecting tiny objects is crucial. Resizing images is a common strategy to improve detection accuracy, particularly for small objects. However, simply enlarging images significantly increases computational costs and the number of negative samples, severely degrading detection performance and limiting its applicability. This paper proposes a Dynamic Pooling Network (DPNet) for tiny object detection to mitigate these issues. DPNet employs a flexible down-sampling strategy by introducing a factor (df) to relax the fixed downsampling process of the feature map to an adjustable one. Furthermore, we design a lightweight predictor to predict df for each input image, which will be used to decrease the resolution of feature map in backbone. Thus, we achieve input-aware downsampling. We design an Adaptive Normalization Module (ANM) to make a unified detector well compatible with different dfs. At the same time, we also design a guidance loss to supervise the predictor’s training. DPNet realizes the dynamic allocation of computing resources to trade off detection accuracy and efficiency through this. Experiments on the TinyCOCO and TinyPerson datasets show that our DPNet can save over 35% and 25% GFLOPs, respectively, while maintaining comparable detection *** code will be made publicly available. Copyright © 2025, The Authors. All rights reserved.

关键词： Image coding

来源：评论

学校读者我要写书评

暂无评论

Generating Approximate Ground States of Molecules Using Quantum Machine Learning

arXiv

引用

arXiv 2022年

作者： Ceroni, Jack Stetina, Torin F. Kieferová, Mária Marrero, Carlos Ortiz Arrazola, Juan Miguel Wiebe, Nathan Xanadu TorontoONM5G 2C8 Canada Department of Mathematics University of Toronto TorontoONM5S 3E1 Canada Simons Institute for the Theory of Computing BerkeleyCA94704 United States Berkeley Quantum Information and Computation Center University of California BerkeleyCA94720 United States Centre for Quantum Computation and Communication Technology Centre for Quantum Software and Information University of Technology SydneyNSW2007 Australia AI & Data Analytics Division Pacific Northwest National Laboratory RichlandWA99354 United States Department of Electrical & Computer Engineering North Carolina State University RaleighNC27607 United States Department of Computer Science University of Toronto ONM5S 1A1 Canada High Performance Computing Group Pacific Northwest National Laboratory RichlandWA99354 United States

The potential energy surface (PES) of molecules with respect to their nuclear positions is a primary tool in understanding chemical reactions from first principles. However, obtaining this information is complicated by the fact that sampling a large number of ground states over a high-dimensional PES can require a vast number of state preparations. In this work, we propose using a generative quantum machine learning model to prepare quantum states at arbitrary points on the PES. The model is trained using quantum data consisting of ground-state wavefunctions associated with different classical nuclear coordinates. Our approach uses a classical neural network to convert the nuclear coordinates of a molecule into quantum parameters of a variational quantum circuit. The model is trained using a fidelity loss function to optimize the neural network parameters. We show that gradient evaluation is efficient and numerically demonstrate our method’s ability to prepare wavefunctions on the PES of hydrogen chains, water, and beryllium hydride. In all cases, we find that a small number of training points are needed to achieve very high overlap with the groundstates in practice. From a theoretical perspective, we further prove limitations on these protocols by showing that if we were able to learn across an avoided crossing using a small number of samples, then we would be able to violate Grover’s lower bound. Additionally, we prove lower bounds on the amount of quantum data needed to learn a locally optimal neural network function using arguments from quantum Fisher information. This work further identifies that quantum chemistry can be an important use case for quantum machine learning. © 2022, CC BY.

关键词： Molecules

来源：评论

学校读者我要写书评

暂无评论

Iterated Problem Reformulation for Evolutionary Large-Scale Multiobjective Optimization

Iterated Problem Reformulation for Evolutionary Large-Scale ...

引用

Congress on Evolutionary Computation

作者： Cheng He Ran Cheng Ye Tian Xingyi Zhang Department of Computer Science and Engineering University Key Laboratory of Evolving Intelligent Systems of Guangdong Province Southern University of Science and Technology Shenzhen China Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Institutes of Physical Science and Information Technology Anhui University Hefei China Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University Hefei China

ISBN: (数字)9781728169293

ISBN: (纸本)9781728169309

Due to the curse of dimensionality, two main issues remain challenging for applying evolutionary algorithms (EAs) to large-scale multiobjective optimization. The first issue is how to improve the efficiency of EAs for reducing computation cost. The second one is how to improve the diversity maintenance of EAs to avoid local optima. Nevertheless, these two issues are somehow conflicting with each other, and thus it is crucial to strike a balance between them in practice. Thereby, we propose an iterated problem reformulation based EA for large-scale multiobjective optimization, where the problem reformulation based method and the decomposition based method are used iteratively to address the aforementioned issues. The proposed method is compared with several state-of-the-art EAs on a variety of large-scale multiobjective optimization problems. Experimental results demonstrate the effectiveness of our proposed iterated method in large-scale multiobjective optimization.

关键词： Sociology Convergence Pareto optimization Indexes computer science

来源：评论

学校读者我要写书评

暂无评论

Adaptive feature selection with weighted fuzzy rough sets for noisy data

引用

Fuzzy Sets and Systems 2025年 518卷

作者： Xiaoling Yang Hongmei Chen Tianrui Li Shan Feng Jihong Wan Yiyu Yao School of Mathematical Sciences Sichuan Normal University China School of Computing and Artificial Intelligence Southwest Jiaotong University China Department of Computer Science University of Regina Regina Canada National Engineering Laboratory of Integrated Transportation Big Data Application Technology Southwest Jiaotong University China Manufacturing Industry Chains Collaboration and Information Support Technology Key Laboratory of Sichuan Province Southwest Jiaotong University China

The existence of noise in data may decrease the performance of the classification model. An intuitive assumption suggests that samples with a higher local density have a greater probability of being correctly classified. Moreover, there are differences in the importance of features. It should further increase the influence of important features on the classification task. Motivated by these issues, we propose a sample-driven adaptive feature selection method. It aims to the impact of noise and obtain the adaptive importance of features. In this paper, the Weighted Fuzzy Rough Sets model (WFRS) is proposed by utilizing more reliable samples to address noisy data. Firstly, the approximation margin is derived by applying the WFRS model within the original feature space from the sample's perspective. It serves as a basis for deriving the feature weights. On this basis, the weighted feature space is obtained. This space compresses the features with the lower weight and stretches the features with higher weight. Then, we obtain a specific fuzzy relation to maximize the within-class samples and minimize the between-class samples in the weighted feature space. Further, an evaluation function of features is constructed to model the uncertainty of fuzzy positive and non-negative regions. A Sample-driven adaptive Feature selection algorithm based on the Weighted fuzzy rough sets model (SFW) is designed to capture the varying importance of features by considering the local density of samples. The weighted features are subsequently selected to facilitate the downstream classification tasks. Experimental results show the WFRS model's robustness, the effectiveness of SFW, and its superiority compared to alternative methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Crosslink-net: Double-branch encoder segmentation network via fusing vertical and horizontal convolutions

arXiv

引用

arXiv 2021年

作者： Yu, Qian Qi, Lei Zhou, Luping Wang, Lei Yin, Yilong Shi, Yinghuan Wang, Wuzhang Gao, Yang School of Data and Computer Science Shandong Women's University Jinan250300 China The State Key Laboratory for Novel Software Technology Nanjing University Nanjing210023 China School of Computer Science and Engineering Southeast University Nanjing211189 China The School of Electrical and Information Engineering University of Sydney NSW2006 Australia The School of Computing and Information Technology University of Wollongong WollongongNSW2522 Australia The School of Soft Shandong University Jinan250100 China Department of Respiratory and Critical Care Medicine Shandong Chest Hospital Jinan250013 China

Accurate image segmentation plays a crucial role in medical image analysis, yet it faces great challenges of various shapes, diverse sizes, and blurry boundaries. To address these difficulties, square kernel-based encoder-decoder architecture has been proposed and widely used, but its performance remains still unsatisfactory. To further cope with these challenges, we present a novel double-branch encoder architecture. Our architecture is inspired by two observations: 1) Since the discrimination of features learned via square convolutional kernels needs to be further improved, we propose to utilize non-square vertical and horizontal convolutional kernels in the double-branch encoder, so features learned by the two branches can be expected to complement each other. 2) Considering that spatial attention can help models to better focus on the target region in a large-sized image, we develop an attention loss to further emphasize the segmentation on small-sized targets. Together, the above two schemes give rise to a novel double-branch encoder segmentation framework for medical image segmentation, namely Crosslink-Net. The experiments validate the effectiveness of our model on four datasets. The code is released at https://***/Qianyu1226/*** Codes 68T07 Copyright © 2021, The Authors. All rights reserved.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Cerebrovascular Segmentation in MRA via Reverse Edge Attention Network 23rd

Cerebrovascular Segmentation in MRA via Reverse Edge Attenti...

引用

23rd International Conference on Medical Image computing and computer-Assisted Intervention, MICCAI 2020

作者： Zhang, Hao Xia, Likun Song, Ran Yang, Jianlong Hao, Huaying Liu, Jiang Zhao, Yitian College of Information Engineering Capital Normal University Beijing China Cixi Institute of Biomedical Engineering Ningbo Institute of Industrial Technology Chinese Academy of Sciences Ningbo China School of Control Science and Engineering Shandong University Jinan China Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen China International Science and Technology Cooperation Base of Electronic System Reliability and Mathematical Interdisciplinary Capital Normal University Beijing China Laboratory of Neural Computing and Intelligent Perception Capital Normal University Beijing China Beijing Advanced Innovation Center for Imaging Theory and Technology Capital Normal University Beijing China

ISBN: (纸本)9783030597245

Automated extraction of cerebrovascular is of great importance in understanding the mechanism, diagnosis, and treatment of many cerebrovascular pathologies. However, segmentation of cerebrovascular networks from magnetic resonance angiography (MRA) imagery continues to be challenging because of relatively poor contrast and inhomogeneous backgrounds, and the anatomical variations, complex geometry and topology of the networks themselves. In this paper, we present a novel cerebrovascular segmentation framework that consists of image enhancement and segmentation phases. We aim to remove redundant features, while retaining edge information in shallow features when combining these with deep features. We first employ a Retinex model, which is able to model noise explicitly to aid removal of imaging noise, as well as reducing redundancy within an image and emphasizing the vessel regions, thereby simplifying the subsequent segmentation problem. Subsequently, a reverse edge attention module is employed to discover edge information by paying particular attention to the regions that are not salient in high-level semantic features. The experimental results show that the proposed framework enables the reverse edge attention network to deliver a reliable cerebrovascular segmentation. © 2020, Springer Nature Switzerland AG.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

FUTURE-AI: International consensus guideline for trustworthy and deployable artificial intelligence in healthcare

arXiv

引用

arXiv 2023年

作者： Lekadir, Karim Feragen, Aasa Fofanah, Abdul Joseph Frangi, Alejandro F. Buyx, Alena Emelie, Anais Lara, Andrea Porras, Antonio R. Chan, An-Wen Navarro, Arcadi Glocker, Ben Botwe, Benard O. Khanal, Bishesh Beger, Brigit Wu, Carol C. Cintas, Celia Langlotz, Curtis P. Rueckert, Daniel Mzurikwao, Deogratias Fotiadis, Dimitrios I. Zhussupov, Doszhan Ferrante, Enzo Meijering, Erik Weicken, Eva González, Fabio A. Asselbergs, Folkert W. Prior, Fred Krestin, Gabriel P. Collins, Gary S. Tegenaw, Geletaw S. Kaissis, Georgios Misuraca, Gianluca Tsakou, Gianna Dwivedi, Girish Kondylakis, Haridimos Jayakody, Harsha Woodruf, Henry C. Mayer, Horst Joachim Aerts, Hugo JWL Walsh, Ian Chouvarda, Ioanna Buvat, Irène Tributsch, Isabell Rekik, Islem Duncan, James Kalpathy-Cramer, Jayashree Zahir, Jihad Park, Jinah Mongan, John Gichoya, Judy W. Schnabel, Julia A. Kushibar, Kaisar Riklund, Katrine Mori, Kensaku Marias, Kostas Amugongo, Lameck M. Fromont, Lauren A. Maier-Hein, Lena Alberich, Leonor Cerdá Rittner, Leticia Phiri, Lighton Marrakchi-Kacem, Linda Donoso-Bach, Lluís Martí-Bonmatí, Luis Cardoso, M. Jorge Bobowicz, Maciej Shabani, Mahsa Tsiknakis, Manolis Zuluaga, Maria A. Bielikova, Maria Fritzsche, Marie-Christine Camacho, Marina Linguraru, Marius George Wenzel, Markus De Bruijne, Marleen Tolsgaard, Martin G. Ghassemi, Marzyeh Ashrafuzzaman, Md Goisauf, Melanie Yaqub, Mohammad Abadía, Mónica Cano Mahmoud, Mukhtar M.E. Elattar, Mustafa Rieke, Nicola Papanikolaou, Nikolaos Lazrak, Noussair Díaz, Oliver Salvado, Olivier Pujol, Oriol Sall, Ousmane Guevara, Pamela Gordebeke, Peter Lambin, Philippe Brown, Pieta Abolmaesumi, Purang Dou, Qi Lu, Qinghua Osuala, Richard Nakasi, Rose Zhou, S. Kevin Napel, Sandy Colantonio, Sara Albarqouni, Shadi Joshi, Smriti Carter, Stacy Klein, Stefan Petersen, Steffen E. Aussó, Susanna Awate, Suyash Raviv, Tammy Riklin Cook, Tessa Mutsvangwa, Tinashe E.M. Rogers, Wendy A. Niessen, Wiro J. Puig-Bosch, Xènia Zeng, Yi Mohammed, Yunusa G. Aquino, Yves Saint James Salahuddin, Zohaib Starmans, Martijn P.A. Department de Matemàtiques i Informàtica Universitat de Barcelona Barcelona Spain Barcelona Spain DTU Compute Technical University of Denmark Kgs Lyngby Denmark Department of Mathematics and Computer Science Faculty of Science and Technology Milton Margai Technical University Freetown Sierra Leone Center for Computational Imaging & Simulation Technologies in Biomedicine Schools of Computing and Medicine University of Leeds Leeds United Kingdom Cardiovascular Science and Electronic Engineering Departments KU Leuven Leuven Belgium Institute of History and Ethics in Medicine Technical University of Munich Munich Germany Faculty of Engineering of Systems Informatics and Sciences of Computing Galileo University Guatemala City Guatemala Department of Biostatistics and Informatics Colorado School of Public Health University of Colorado Anschutz Medical Campus AuroraCO United States Department of Medicine Women’s College Research Institute University of Toronto Toronto Canada Universitat Pompeu Fabra BarcelonaBeta Brain Research Center Barcelona Spain Department of Computing Imperial College London London United Kingdom School of Biomedical & Allied Health Sciences University of Ghana Accra Ghana Department of Midwifery & Radiography School of Health & Psychological Sciences City University of London United Kingdom Kathmandu Nepal European Heart Network Brussels Belgium Department of Thoracic Imaging University of Texas MD Anderson Cancer Center Houston United States IBM Research Africa Nairobi Kenya Departments of Radiology Medicine and Biomedical Data Science Stanford University School of Medicine Stanford United States Institute for AI and Informatics in Medicine Klinikum rechts der Isar Technical University Munich Munich Germany Department of Computing Imperial College London London United Kingdom Muhimbili University of Health and Allied Sciences Dar es Salaam Tanzania United Republic of Ioannina Greece Almaty AI Lab Almaty Kazakhstan

Background: Despite major advances in artificial intelligence (AI) research for healthcare, the deployment and adoption of AI technologies remain limited in clinical practice. In recent years, concerns have been raised about the clinical, technical, ethical and legal risks associated with healthcare AI. To increase adoption in the real world, it is essential that AI technologies are trusted and accepted by patients, clinicians, health organisations and authorities. This paper describes the FUTURE-AI framework as the first international consensus guideline for trustworthy AI in healthcare. Methods: The FUTURE-AI consortium was founded in 2021 and now comprises 117 interdisciplinary experts from 50 countries representing all continents, including AI scientists, clinical researchers, biomedical ethicists, and social scientists. Over a two-year period, the consortium established guiding principles and best practices for trustworthy and deployable AI through an iterative process comprising an in-depth literature review, a modified Delphi survey, and online consensus meetings. Findings: The FUTURE-AI framework was established based on six guiding principles for trustworthy AI in healthcare, i.e. Fairness, Universality, Traceability, Usability, Robustness and Explainability. Through consensus, a set of 30 best practices were defined, addressing technical, clinical, socio-ethical and legal dimensions of trustworthy AI. The recommendations cover the entire lifecycle of healthcare AI, from design, development and validation to regulation, deployment, and monitoring. Interpretation: FUTURE-AI is a structured, risk-informed framework which provides guidance for constructing healthcare AI tools that will be trusted, deployed and adopted in real-world clinical practice. Researchers are encouraged to take the recommendations into account in proof-of-concept stages to facilitate future translation towards clinical practice of healthcare AI. Copyright © 2023, The Authors. All rights

关键词： Clinical research

来源：评论

学校读者我要写书评

暂无评论

AngularGrad: A New Optimization Technique for Angular Convergence of Convolutional Neural Networks

arXiv

引用

arXiv 2021年

作者： Roy, Swalpa Kumar Paoletti, Mercedes E. Haut, Juan M. Dubey, Shiv Ram Kar, Purbayan Plaza, Antonio Chaudhuri, Bidyut B. The Computer Science and Engineering Alipurduar Government Engineering and Management College 736206 India The Hyperspectral Computing Laboratory Department of Technology of Computers and Communications University of Extremadura Cáceres10003 Spain The Computer Vision and Biometrics Lab Indian Institute of Information Technology Prayagraj Uttar Pradesh Allahabad211015 India The Media Analysis Group Sony Research India Private Limited Karnataka Bangalore560103 India The Computer Vision and Pattern Recognition Unit Indian Statistical Institute Kolkata700108 India

Convolutional neural networks (CNNs) are trained using stochastic gradient descent (SGD)-based optimizers. Recently, the adaptive moment estimation (Adam) optimizer has become very popular due to its adaptive momentum, which tackles the dying gradient problem of SGD. Nevertheless, existing optimizers are still unable to exploit the optimization curvature information efficiently. This paper proposes a new AngularGrad optimizer that considers the behavior of the direction/angle of consecutive gradients. This is the first attempt in the literature to exploit the gradient angular information apart from its magnitude. The proposed AngularGrad generates a score to control the step size based on the gradient angular information of previous iterations. Thus, the optimization steps become smoother as a more accurate step size of immediate past gradients is captured through the angular information. Two variants of AngularGrad are developed based on the use of Tangent or Cosine functions for computing the gradient angular information. Theoretically, AngularGrad exhibits the same regret bound as Adam for convergence purposes. Nevertheless, extensive experiments conducted on benchmark data sets against state-of-the-art methods reveal a superior performance of AngularGrad. Source code: https://***/mhaut/AngularGrad. Copyright © 2021, The Authors. All rights reserved.

关键词： Optimization

来源：评论

学校读者我要写书评

暂无评论

LMS-Net: A learned Mumford-Shah network for binary few-shot medical image segmentation

引用

Medical Image Analysis 2025年

作者： Shengdong Zhang Fan Jia Xiang Li Hao Zhang Jun Shi Liyan Ma Shihui Ying Department of Mathematics School of Science Shanghai University Shanghai 200444 China Department of Mathematics and Scientific Computing and Imaging (SCI) Institute University of Utah Salt Lake City 84102 UT USA School of Computer Science and Technology East China Normal University Shanghai 200444 China School of Communication and Information Engineering Shanghai University Shanghai 200444 China School of Computer Engineering and Science Shanghai University Shanghai 200444 China School of Mechatronic Engineering and Automation Shanghai Key Laboratory of Intelligent Manufacturing and Robotics Shanghai University Shanghai 200444 China Shanghai Institute of Applied Mathematics and Mechanics Shanghai 200072 China School of Mechanics and Engineering Science Shanghai University Shanghai 200072 China

Few-shot semantic segmentation (FSS) methods have shown great promise in handling data-scarce scenarios, particularly in medical image segmentation tasks. However, most existing FSS architectures lack sufficient interpretability and fail to fully incorporate the underlying physical structures of semantic regions. To address these issues, in this paper, we propose a novel deep unfolding network, called the Learned Mumford-Shah Network (LMS-Net), for the FSS task. Specifically, motivated by the effectiveness of pixel-to-prototype comparison in prototypical FSS methods and the capability of deep priors to model complex spatial structures, we leverage our learned Mumford-Shah model (LMS model) as a mathematical foundation to integrate these insights into a unified framework. By reformulating the LMS model into prototype update and mask update tasks, we propose an alternating optimization algorithm to solve it efficiently. Further, the iterative steps of this algorithm are unfolded into corresponding network modules, resulting in LMS-Net with clear interpretability. Comprehensive experiments on three publicly available medical segmentation datasets verify the effectiveness of our method, demonstrating superior accuracy and robustness in handling complex structures and adapting to challenging segmentation scenarios. These results highlight the potential of LMS-Net to advance FSS in medical imaging applications. Our code will be available at: https://***/SDZhang01/LMSNet .

关键词：

来源：评论

学校读者我要写书评

暂无评论

A latent encoder coupled generative adversarial network (LE-GAN) for efficient hyperspectral image super-resolution

arXiv

引用

arXiv 2021年

作者： Shi, Yue Han, Liangxiu Han, Lianghao Chang, Sheng Hu, Tongle Dancey, Darren Department of Computing and Mathematics Faculty of Science and Engineering Manchester Metropolitan University ManchesterM1 5GD United Kingdom Department of Computer Science Brunel University UB8 3PH United Kingdom State Key Laboratory of Remote Sensing Science Aerospace Information Research Institute Chinese Academy of Sciences Beijing100101 China College of Plant Protection Hebei Agriculture University Baoding070001 China

Realistic hyperspectral image (HSI) super-resolution (SR) techniques aim to generate a high-resolution (HR) HSI with higher spectral and spatial fidelity from its low-resolution (LR) counterpart. The generative adversarial network (GAN) has proven to be an effective deep learning framework for image super-resolution. However, the optimisation process of existing GAN-based models frequently suffers from the problem of mode collapse, leading to the limited capacity of spectral-spatial invariant reconstruction. This may cause the spectral-spatial distortion on the generated HSI, especially with a large upscaling factor. To alleviate the problem of mode collapse, this work has proposed a novel GAN model coupled with a latent encoder (LE-GAN), which can map the generated spectral-spatial features from the image space to the latent space and produce a coupling component to regularise the generated samples. Essentially, we treat an HSI as a high-dimensional manifold embedded in a latent space. Thus, the optimisation of GAN models is converted to the problem of learning the distributions of high-resolution HSI samples in the latent space, making the distributions of the generated super-resolution HSIs closer to those of their original high-resolution counterparts. We have conducted experimental evaluations on the model performance of super-resolution and its capability in alleviating mode collapse. The proposed approach has been tested and validated based on two real HSI datasets with different sensors (i.e. AVIRIS and UHD-185) for various upscaling factors (i.e. ×2, ×4, ×8) and added noise levels (i.e. ∞ db, 40 db, 80 db), and compared with the state-of-the-art super-resolution models (i.e. HyCoNet, LTTR, BAGAN, SR- GAN, WGAN). Experimental results show that the proposed model outperforms the competitors on the superresolution quality, robustness, and alleviation of mode collapse. The proposed approach is able to capture spectral and spatial details and generate more faith

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：