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

11th International Conference on Electrical Engineering, Computer Science and informatics, EECSI 2024

作者： Yunita, Yunita Stiawan, Deris Rini, Dian Palupi Sriwijaya University Faculty of Computer Science Indonesia Sriwijaya University Intelligent System Research Group Faculty of Computer Science South Sumatera Palembang Indonesia Sriwijaya University Communication Network and Information Security Research Group Faculty of Computer Science South Sumatera Palembang Indonesia Sriwijaya University Image Processing Dan Pattern Recognition Laboratory Group Faculty of Computer Science South Sumatera Palembang Indonesia

ISBN: (纸本)9798350355314

One of the problems with Smart Transportation is the problem of cost and travel time. This problem is known as the Variable Routing Problem (VRP). In some real cases, in addition to considering route selection, there are limitations on the capacity and time period for the vehicle to serve each customer known as Time Windows, so VRP has developed into Variable Routing Problem with Time Windows (VRPTW). One way to solve VRPTW is to use metaheuristic methods. However, the metaheuristic method has a weakness, which are it can get stuck in local optimums and fail to find better global solutions. To overcome this, a combination with other methods or known as hybrid is needed. The formulation of this research problem is how to develop a Smart transportation model using a metaheuristic hybrid algorithm. The purpose of this study is to develop a Smart transportation model using a metaheuristic hybrid algorithm. The method used is to combine two metaheuristic algorithms, which are the Dragonfly Algorithm (DA) and the Variable Neighborhood Search (VNS). The result of this research is a new algorithm model which is a hybrid between DA and VNS. Through a combination of global exploration using DA and local exploitation using VNS, this algorithm is expected to be able to find a better solution and faster convergence in solving VRPTW problems © 2024 IEEE.

关键词： Travel time

来源：评论

学校读者我要写书评

暂无评论

Vehicle Routing Problem with Time Windows using Hybrid Metaheuristic Dragonfly Algorithm and Variable Neighborhood Search: Work on Progress

Vehicle Routing Problem with Time Windows using Hybrid Metah...

引用

International Conference on Electrical Engineering, Computer Science and informatics (EECSI)

作者： Yunita Yunita Deris Stiawan Dian Palupi Rini Doctoral Student at Faculty of Computer Science Sriwijaya University Intelligent System Research Group Faculty of Computer Science Sriwijaya University Palembang South Sumatera Communication Network and Information Security Research Group Faculty of Computer Science Sriwijaya University Palembang South Sumatera Image Processing dan Pattern Recognition Laboratory Group Faculty of Computer Science Sriwijaya University Palembang South Sumatera

ISBN: (数字)9798350355314

ISBN: (纸本)9798350355321

关键词： Electrical engineering Computer science Costs Metaheuristics Vehicle routing Routing Search problems Smart transportation informatics Convergence

来源：评论

学校读者我要写书评

暂无评论

An evolutionary lion optimization algorithm-based image compression technique for biomedical applications

An evolutionary lion optimization algorithm-based image comp...

引用

作者： Geetha, Karuppaiah Anitha, Veerasamy Elhoseny, Mohamed Kathiresan, Shankar Shamsolmoali, Pourya Selim, Mahmoud M. Department of Computer Science & Engineering MIET Engineering College Tamilnadu India Department of Computer Science and Engineering Imayam College of Engineering Anna University ChennaiTamilnadu India Faculty of Computers and Information Mansoura University Mansoura Egypt Scientific Group for Research and Technology Cairo Egypt Department of Computer Applications Alagappa University Karaikudi India Huawei Technologies Corporate Shanghai China. & Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Shanghai China Department of Mathematics Al-Aflaj College of Science and Human Studies Prince Sattam Bin Abdulaziz University Al-Kharj Saudi Arabia

Recently, medical image compression becomes essential to effectively handle large amounts of medical data for storage and communication purposes. Vector quantization (VQ) is a popular image compression technique, and the commonly used VQ model is Linde–Buzo–Gray (LBG) that constructs a local optimal codebook to compress images. The codebook construction was considered as an optimization problem, and a bioinspired algorithm was employed to solve it. This article proposed a VQ codebook construction approach called the L2-LBG method utilizing the Lion optimization algorithm (LOA) and Lempel Ziv Markov chain Algorithm (LZMA). Once LOA constructed the codebook, LZMA was applied to compress the index table and further increase the compression performance of the LOA. A set of experimentation has been carried out using the benchmark medical images, and a comparative analysis was conducted with Cuckoo Search-based LBG (CS-LBG), Firefly-based LBG (FF-LBG) and JPEG2000. The compression efficiency of the presented model was validated in terms of compression ratio (CR), compression factor (CF), bit rate, and peak signal to noise ratio (PSNR). The proposed L2-LBG method obtained a higher CR of 0.3425375 and PSNR value of 52.62459 compared to CS-LBG, FA-LBG, and JPEG2000 methods. The experimental values revealed that the L2-LBG process yielded effective compression performance with a better-quality reconstructed image. © 2020 John Wiley & Sons Australia, Ltd

关键词： Vector quantization

来源：评论

学校读者我要写书评

暂无评论

Rotation equivariant feature image pyramid network for object detection in optical remote sensing imagery

arXiv

引用

arXiv 2021年

作者： Shamsolmoali, Pourya Zareapoor, Masoumeh Chanussot, Jocelyn Zhou, Huiyu Yang, Jie The Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Shanghai200240 China The GIPSA-Lab Université Grenoble Alpes CNRS Grenoble INP Grenoble38000 France The Faculty of Electrical and Computer Engineering University of Iceland Reykjavik101 Iceland The School of Informatics University of Leicester LeicesterLE1 7RH United Kingdom

To read the paper please go to IEEE Transactions on Geoscience and Remote Sensing on IEEE Xplore. Detection of objects is extremely important in various aerial vision-based applications. Over the last few years, the methods based on convolution neural networks have made substantial progress. However, because of the large variety of object scales, densities, and arbitrary orientations, the current detectors struggle with the extraction of semantically strong features for small-scale objects by a predefined convolution kernel. To address this problem, we propose the rotation equivariant feature image pyramid network (REFIPN), an image pyramid network based on rotation equivariance convolution. The proposed model adopts single-shot detector in parallel with a lightweight image pyramid module to extract representative features and generate regions of interest in an optimization approach. The proposed network extracts feature in a wide range of scales and orientations by using novel convolution filters. These features are used to generate vector fields and determine the weight and angle of the highest-scoring orientation for all spatial locations on an image. By this approach, the performance for small-sized object detection is enhanced without sacrificing the performance for large-sized object detection. The performance of the proposed model is validated on two commonly used aerial benchmarks and the results show our proposed model can achieve state-of-the-art performance with satisfactory efficiency. Copyright © 2021, The Authors. All rights reserved.

关键词： Object detection

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Benchmarking quality-dependent and cost-sensitive score-level multimodal biometric fusion algorithms

arXiv

引用

arXiv 2021年

作者： Poh, Norman Bourlai, Thirimachos Kittler, Josef Allano, Lorene Alonso-Fernandez, Fernando Ambekar, Onkar Baker, John Dorizzi, Bernadette Fatukasi, Omolara Fierrez, Julian Ganster, Harald Ortega-Garcia, Javier Maurer, Donald Salah, Albert Ali Scheidat, Tobias Vielhauer, Claus Centre for Vision Speech and Signal Processing School of Electronics and Physical Sciences University of Surrey Guildford SurreyGU2 7XH United Kingdom Biometrics Center Lane Department of Computer Science and Electrical Engineering College of Engineering and Mineral Resources West Virginia University MorgantownWV26506-6109 United States Institut Telecom Telecom and Management SudParis Evry91011 France Biometric Recognition Group – ATVS Escuela Politecnica Superior Universidad Autonoma de Madrid Madrid28049 Spain Amsterdam1098 XG Netherlands Applied Physics Laboratory Johns Hopkins University LaurelMD20723 United States Electronics and Physics Department Institut Telecom Telecom and Management SudParis Evry91011 France Institute of Digital Image Processing Joanneum Research Graz8010 Austria ISLA-ISIS University of Amsterdam Amsterdam1098 XG Netherlands Department of Informatics and Media Brandenburg University of Applied Sciences Brandenburg an der HavelD-14770 Germany Research Group Multimedia and Security Department of Technical and Business Information Systems Faculty of Computer Science Otto-von-Guericke-University of Magdeburg MagdeburgD-39106 Germany

Automatically verifying the identity of a person by means of biometrics (e.g., face and fingerprint) is an important application in our day-to-day activities such as accessing banking services and security control in airports. To increase the system reliability, several biometric devices are often used. Such a combined system is known as a multimodal biometric system. This paper reports a benchmarking study carried out within the framework of the BioSecure DS2 (Access Control) evaluation campaign organized by the University of Surrey, involving face, fingerprint, and iris biometrics for person authentication, targeting the application of physical access control in a medium-size establishment with some 500 persons. While multimodal biometrics is a well-investigated subject in the literature, there exists no benchmark for a fusion algorithm comparison. Working towards this goal, we designed two sets of experiments: quality-dependent and cost-sensitive evaluation. The quality-dependent evaluation aims at assessing how well fusion algorithms can perform under changing quality of raw biometric images principally due to change of devices. The cost-sensitive evaluation, on the other hand, investigates how well a fusion algorithm can perform given restricted computation and in the presence of software and hardware failures, resulting in errors such as failure-to-acquire and failure-to-match. Since multiple capturing devices are available, a fusion algorithm should be able to handle this nonideal but nevertheless realistic scenario. In both evaluations, each fusion algorithm is provided with scores from each biometric comparison subsystem as well as the quality measures of both the template and the query data. The response to the call of the evaluation campaign proved very encouraging, with the submission of 22 fusion systems. To the best of our knowledge, this campaign is the first attempt to benchmark quality-based multimodal fusion algorithms. In the presence of changing

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Automated multi-contrast brain pathological area extraction from 2D MR images

引用

Journal of Applied Research and Technology 2015年第1期13卷 58-69页

作者： Dvořák, P. Bartušek, K. Kropatsch, W.G. Smékal, Z. Institute of Scientific Instruments of the ASCR V.v.i Academy if Sciences of the Czech Republic Brno Czech Republic Dept. of Telecommunications Faculty of Electrical Engineering and Communication Brno University of Technology Brno Czech Republic Pattern Recognition and Image Processing Group Institute of Computer Graphics and Algorithms Faculty of Informatics Vienna University of Technology Vienna Austria

The aim of this work is to propose the fully automated pathological area extraction from multi-parametric 2D MR images of brain. The proposed method is based on multi-resolution symmetry analysis and automatic thresholding. The proposed algorithm first detects the presence of pathology and then starts its extraction. T2 images are used for the presence detection and the multi-contrast MRI is used for the extraction, concretely T2 and FLAIR images. The extraction is based on thresholding, where Otsu's algorithm is used for the automatic determination of the threshold. Since the method is based on symmetry, it works for both axial and coronal planes. In both these planes of healthy brain, the approximate left-right symmetry exists and it is used as the prior knowledge for searching the approximate pathology location. It is assumed that this area is not located symmetrically in both hemispheres, which is met in most cases. The detection algorithm was tested on 203 T2-weighted images and reached the true positive rate of 87.52% and true negative rate of 93.14%. The extraction algorithm was tested on 357 axial and 443 coronal real images from publicly available BRATS databases containing 3D volumes brain tumor patients. The results were evaluated by Dice Coefficient (axial: 0.85 ± 0.11, coronal 0.82 ± 0.18) and by Accuracy (axial: 0.96 ± 0.05, coronal 0.94 ± 0.09). © 2015 Universidad Nacional Autónoma de México.

关键词： Brain Pathology Brain Tumor MRI Multi-contrast MRI Symmetry Analysis

来源：评论

学校读者我要写书评

暂无评论

A global method for reducing multidimensional size graphs

引用

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2011年 6658 LNCS卷 1-11页

作者： Cerri, Andrea Frosini, Patrizio Kropatsch, Walter G. Landi, Claudia Vienna University of Technology Faculty of Informatics Pattern Recognition and Image Processing Group Austria Università di Bologna ARCES Dipartimento di Matematica Italy Università di Modena e Reggio Emilia Dipartimento di Scienze e Metodi dell'Ingegneria Italy

ISBN: (纸本)9783642208430

This paper introduces the concept of discrete multidimensional size function, a mathematical tool studying the so-called size graphs. These graphs constitutes an ingredient of Size Theory, a geometrical/topological approach to shape analysis and comparison. A global method for reducing size graphs is presented, together with a theorem stating that size graphs reduced in such a way preserve all the information in terms of multidimensional size functions. This approach can lead to simplify the effective computation of discrete multidimensional size functions, as shown by examples. © 2011 Springer-Verlag Berlin Heidelberg.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

An Evaluation of Low Cost Scanning versus Industrial 3D Scanning Devices

An Evaluation of Low Cost Scanning versus Industrial 3D Scan...

引用

Congress on image and Signal processing, CISP

作者： Miha Drenik Martin Kampel Faculty of Computer and Information Science University of Ljubljana Ljubljana Slovenia Pattern Recognition and Image Processing Group Technical University of of Vienna Vienna Austria

This paper presents an evaluation of two different 3D scanning devices. They can be put into operation depending on the monetary constraints of the user on one hand, and the accuracy needed for a specific application on the other hand. The setting up of the systems and the process of scanning with the devices are presented. Two setups were formed to evaluate the capabilities of a low costs scanning device together with industrial scanning devices. A comparison of the scans obtained was made by using a Konica Minolta VI-9i industrial scanning solution as a reference. The analysis comprises the estimation of surface flatness, the evaluation of measuring of geometric shapes, and the appraisal of the time required for obtaining a virtual 3D representation of a scanned object. The results show that both the curves as well as the shapes as a whole have been captured accurately.

关键词： Costs Shape measurement Application software Feeds Signal processing Computer industry Information science pattern recognition image processing Time measurement

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：