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

2017 ACM SIGCHI Conference on Human Factors in Computing systems, CHI EA 2017

作者： Zamansky, Anna Roshier, Amanda Mancini, Clara Collins, Emily C. Hall, Carol Grillaert, Katie Morrison, Ann North, Steve Wirman, Hanna Information Systems Department University of Haifa Israel School of Veterinary Medicine and Science University of Nottingham United Kingdom Animal-Computer Interaction Lab Open University Milton Keynes United Kingdom Sheffield Robotics University of Sheffield United Kingdom School of Animal Rural and Environmental Sciences Nottingham Trent University United Kingdom Messerli Research Institute University of Veterinary Medicine Medical University of Vienna University of Vienna Austria Department of Architecture Design and Media Technology Aalborg University Denmark Mixed Reality Laboratory University of Nottingham United Kingdom School of Design Hong Kong Polytechnic University Hong Kong

ISBN: (纸本)9781450346566

Animal-computer Interaction (ACI) is a new and quickly developing discipline, which is closely related to HCI and is making reference to some of its theoretical frameworks and research methodologies. The first edition of the Workshop on Research Methods in ACI (RM4ACI) was co-located with the Third International Conference on Animal-computer Interaction, which took place in Milton-Keynes, UK in November 2016. This paper presents an overview of the workshop, including insights from discussions on some of the challenges faced by the ACI community as it works to develop ACI as a discipline, and on important opportunities for cross-fertilization between HCI and ACI that the HCI community could consider. Copyright © 2017 by the Association for Computing Machinery, Inc. (ACM).

关键词： Animals

来源：评论

学校读者我要写书评

暂无评论

BioTIME 2.0: Expanding and Improving a Database of Biodiversity Time Series

引用

Global Ecology and Biogeography 2025年第5期34卷

作者： Maria Dornelas Laura H. Antão Amanda E. Bates Viviana Brambilla Jonathan M. Chase Cher F. Y. Chow Ada Fontrodona-Eslava Anne E. Magurran Inês S. Martins Faye Moyes Alban Sagouis Samuel Adu-Acheampong Daniel Acquah-Lamptey Dušan Adam Penelope A. Ajani Aitor Albaina Pablo Almaraz Jeongseop An Roger Sigismund Anderson Madelaine Jean Robertson Anderson Alexsander Z. Antunes Ivan Arismendi Linda Armbrecht Pedro Aros-Mardones Sreejith Kalpuzha Ashtamoorthy Narayanan Ayyappan Gal Badihi Joseph J. Bailey Andrew H. Baird Mark Edward Baird Sreekumar Vadakkethil Balakrishnan José António L. Barão-Nóbrega Adi Barash Miguel Barbosa Jos Barlow Claus Bässler Matthieu Beaumont Natalie Beenaerts Tiago Octavio Begot Wallace Beiroz Ricardo Beldade David M. Bell Alecia Bellgrove Jonathan Belmaker Lisandro Benedetti-Cecchi Cassandra E. Benkwitt Pamela Medina-van Berkum Brandon T. Bestelmeyer Matthew G. Betts Maxwell Kelvin Billah Anne D. Bjorkman Magdalena Błażewicz Christopher P. Bloch Shane A. Blowes Antonio Bode Juliano A. Bogoni Thomas Bolger Timothy C. Bonebrake Erik Bonsdorff Roberta Bottarin Luke N. Brokensha Rob W. Brooker Andrew J. Brooks Helge Bruelheide Thiago Almeida Bueno Claire Laguionie Mariana Lopes Campagnoli James Cant Erica Pellegrini Caramaschi Alexandre Caron Tadhg Carroll Tancredi Caruso Juan Carvajal-Quintero Giuseppe Castaldelli Edward Castañeda-Moya Pedro V. Castilho Sonia Zanini Cechin Shahar Chaikin Uchangi Manjunatha Chandrashekara Tory J. Chase Chaolun Allen Chen Jorge José Cherem Sei-Woong Choi Erica M. Christensen Alexander V. Christianini Jackson Wing Four Chu Peter Coad Carl Van Colen Lise Comte Elisabeth J. Cooper J. Hans C. Cornelissen Eddy Cosson Unai Cotano Luc Crevecoeur Shannan Kyle Crow Graeme S. Cumming Vanessa S. Daga Gabriella Damasceno Gergana N. Daskalova Claire H. Davies Robert A. Davis Frank P. Day Sussy De-La-Zerda Amy Elizabeth Deacon Indradatta de Castro-Arrazola Steven Degraer Kharran Deonarinesingh Juan C. Diaz-Ricaurte Christopher R. Dickman Tara Dirilgen Ciaran John Dolan J. Emmet Centre for Biological Diversity School of Biology University of St Andrews Fife UK MARE—Centro de Ciências do Mar e do Ambiente Faculdade de Ciências Universidade de Lisboa Lisboa Portugal Research Centre for Ecological Change Organismal and Evolutionary Biology Research Programme Faculty of Biological and Environmental Sciences University of Helsinki Helsinki Finland Department of Biology University of Victoria Victoria British Columbia Canada German Centre for Integrative Biodiversity Research (iDiv) Halle-Jena-Leipzig Leipzig Germany Department of Computer Science Martin Luther University Halle-Wittenberg Halle (Saale) Germany Leverhulme Centre for Anthropocene Biodiversity Department of Biology University of York York UK Department of Animal Biology and Conservation Science University of Ghana Accra Ghana Philipps Universität Marburg Marburg Germany Department of Forest Ecology Silva Tarouca Research Institute Brno Czech Republic School of Life Sciences University of Technology Sydney Sydney New South Wales Australia Zoology and Animal Cell Biology Department University of the Basque Country (UPV/EHU) Leioa Spain Grupo de Oceanografía de Ecosistemas Instituto de Ciencias Marinas de Andalucía CSIC Campus Universitario de Puerto Real Puerto Real Spain National Institute of Ecology Seocheon Republic of Korea African Regional Postgraduate Programme in Insect Science University of Ghana Accra Ghana Département de Biologie Université de Sherbrooke Sherbrooke Quebec Canada Núcleo de Conservação da Biodiversidade Instituto de Pesquisas Ambientais Secretaria de Meio Ambiente Infraestrutura e Logística do Estado de São Paulo São Paulo Brazil Department of Fisheries Wildlife and Conservation Sciences Oregon State University Corvallis Oregon USA Institute for Marine and Antarctic Studies Ecology & Biodiversity Centre University of Tasmania Hobart Tasmania Australia Graduate Program in Oceanography Department of Oceanography Faculty of Natural Scienc

Motivation Here, we make available a second version of the BioTIME database, which compiles records of abundance estimates for species in sample events of ecological assemblages through time. The updated version expands version 1.0 of the database by doubling the number of studies and includes substantial additional curation to the taxonomic accuracy of the records, as well as the metadata. Moreover, we now provide an R package (BioTIMEr) to facilitate use of the database. Main Types of Variables Included The database is composed of one main data table containing the abundance records and 11 metadata tables. The data are organised in a hierarchy of scales where 11,989,233 records are nested in 1,603,067 sample events, from 553,253 sampling locations, which are nested in 708 studies. A study is defined as a sampling methodology applied to an assemblage for a minimum of 2 years. Spatial Location and Grain Sampling locations in BioTIME are distributed across the planet, including marine, terrestrial and freshwater realms. Spatial grain size and extent vary across studies depending on sampling methodology. We recommend gridding of sampling locations into areas of consistent size. Time Period and Grain The earliest time series in BioTIME start in 1874, and the most recent records are from 2023. Temporal grain and duration vary across studies. We recommend doing sample-level rarefaction to ensure consistent sampling effort through time before calculating any diversity metric. Major Taxa and Level of Measurement The database includes any eukaryotic taxa, with a combined total of 56,400 taxa. Software Format csv and. SQL.

关键词： assemblage biodiversity community database ecoinformatics species taxa time

来源：评论

学校读者我要写书评

暂无评论

Dynamic topologies for particle swarms 7

Dynamic topologies for particle swarms

引用

7th International Joint Conference on Computational Intelligence, IJCCI 2015

作者： Fernandes, Carlos M. Laredo, J.L.J. Merelo, J.J. Cotta, C. Rosa, A.C. LARSyS: Laboratory for Robotics and Systems in Engineering and Science University of Lisbon Lisbon Portugal Department of Architecture and Computer Technology University of Granada Granada Spain Departamento de Lenguages y Ciencias de la Computación University of Malaga Malaga Spain

ISBN: (纸本)9783662535240

The Particle Swarm Optimization (PSO) algorithm is a population-based metaheuristics in which the individuals communicate through decentralized networks. The network can be of many forms but traditionally its structure is predetermined and remains fixed during the search. This paper investigates an alternative approach. The particles are positioned on a 2-dimensional grid of nodes. During the run, they move through the network according to simple rules, while interacting with each other using signs that they leave on the nodes. The links between the particles – and consequently the information flow – are then defined at each time step by the position of the particle on the grid. As a result, each particle’s set of neighbors and connectivity degree varies during the search progress. The particles can move randomly or instead track signs left by other particles on the grid. In this paper, after a formal description of the general model, two different strategies (random and sign-based) are tested and compared to standard topologies on unimodal and multimodal functions, including a rotated and a shifted function with noise from the CEC benchmark. The experiments demonstrate that the dynamics provided by the proposed structure results in a more consistent and stable performance throughout the test set. The working mechanisms of the model are simple and easy to implement. © Springer-Verlag Berlin Heidelberg 2016.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

Two stage SVM and kNN text documents classifier 6th

Two stage SVM and kNN text documents classifier

引用

6th International Conference on Pattern Recognition and Machine Intelligence, PReMI 2015

作者： Kępa, Marcin Szymański, Julian Department of Computer Systems Architecture Gdańsk University of Technology Gdańsk Poland

The paper presents an approach to the large scale text documents classification problem in parallel environments. A two stage classifier is proposed, based on a combination of k-nearest neighbors and support vector machines classification methods. The details of the classifier and the parallelisation of classification, learning and prediction phases are described. The classifier makes use of our method named onevs- near. It is an extension of the one-vs-all approach, typically used with binary classifiers in order to solve multiclass problems. The experiments were performed on a large scale dataset, with use of many parallel threads on a supercomputer. Results of the experiments show that the proposed classifier scales well and gives reasonable quality results. Finally, it is shown that the proposed method gives better performance compared to the traditional approach. © Springer International Publishing Switzerland 2015.

关键词： Nearest neighbor search

来源：评论

学校读者我要写书评

暂无评论

A constraint-aware optimized path recommender in a crowdsourced environment 12

A constraint-aware optimized path recommender in a crowdsour...

引用

12th IEEE/ACS International Conference of computer systems and Applications, AICCSA 2015

作者： Ur Rehman, Faizan Lbath, Ahmed Sadiq, Bilal Rahman, Md. Abdur Murad, Abdullah Afyouni, Imad Ahmad, Akhlaq Basalamah, Saleh Department of Computer Science LIG University of Grenoble Alpes France Science and Technology Unit Umm Al-Qura University Saudi Arabia KACST GIS Technology Innovation Center Umm Al-Qura University Saudi Arabia College of Computer and Information Systems Umm Al-Qura University Saudi Arabia Innovation and Entrepreneurship Institute Umm Al-Qura University Saudi Arabia College of Engineering and Islamic Architecture Umm Al-Qura University Saudi Arabia Intemational Islamic University Malaysia

ISBN: (纸本)9781509004782

Recommending an optimized path for a large crowd poses a unique challenge to existing routing algorithms due to the interactions between users and the dynamic changes over road networks. Industries, researchers and end users show an enormous interest in crowdsourced data comprising social networks and user-generated content to remain updated with their concerns. In this paper, we present a data collection framework that helps users to find optimized routes in a dynamic environment. We have developed a data collection framework to collect dynamic road conditions via a set of location-based services to support a very large Hajj crowd by capturing their locations using smartphones. We also collect geotagged social network data that provides more details about road conditions. The system leverages geotagged crowdsourced information to identify constraints such as accidents, congestions, and roadblocks. Moreover, by continuously collecting real-time geotagged data of moving users, the system can also find the flow of traffic and road conditions. We propose a spatial grid index to compute the optimized path, and to identify the affected users within impact zones. The plan is to test the whole application and back-end server during Hajj 2016, where over three million pilgrims from all over the world gather to perform their rituals. © 2015 IEEE.

关键词： Location based services

来源：评论

学校读者我要写书评

暂无评论

Application of proper orthogonal decomposition and radial basis functions for crack size estimation using particle swarm optimization

引用

Journal of Physics: Conference Series 2017年第1期842卷

作者： B Benaissa M Köppen M Abdel Wahab S Khatir LEMI Department of Mechanical Engineering University M'hamed Bougara of Boumerdes. Algeria. Faculty of Computer Science and Systems Engineering Department of Creative Informatics Kyushu Institute of Technology. Japan. Department of Electrical Energy Systems and Automation Faculty of Engineering and Architecture Ghent University. Belgium.

Complex engineering problems require simulations, which are computationally expensive in cases of inverse identification tasks since they commonly requires hundreds of thousands of simulations. This paper propose a method based on model reduction for crack size estimation, combining the proper orthogonal decomposition method with radial basis functions. The reduced model is validated by comparing the obtained boundary displacements with the corresponding results from a finite element model. This inverse procedure is formulated as the minimization of the difference between the measured and computed values of displacement at selected boundary nodes, called sensor points, using particle swarm optimization algorithm. Convex and a non-convex specimens have been considered for investigations of crack presence, and identification of its size, different crack sizes have been tested to demonstrate the efficiency of the proposed approach.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Smart Community Load Matching Using Stochastic Demand Modeling and Historical Production Data

Smart Community Load Matching Using Stochastic Demand Modeli...

引用

IEEE International Conference on Environment and Electrical Engineering

作者： Emilio J. Palacios-Garcia Antonio Moreno-Munoz Isabel Santiago Isabel M. Moreno-Garcia aria I. Milanés-Montero department of Computer Architecture Electronics and Electronic Technology. University of Cordoba. Cordoba Spain. Power Electrical and Electronic Systems (PE&ES) University of Extremadura. Badajoz Spain.

ISBN: (纸本)9781509023219

The current upward trend of the residential energy demand and the high penetration of new renewable resources have changed the conception of the electrical grid. The centralized distribution scheme is currently moving forward to a distributed layout where the paradigm of Smart Energy Communities has emerged, meaning a set of households that share a Microgrid, have tied renewable production and can be either connected or disconnected from the main grid. In this context, due to the reduced dispatchability of the renewable generation, the planning of the installed PV power as well as the storage capacity is the cornerstone in order to achieve a high degree of both self-generation and self-consumption. However, the lack of detailed hourly or sub-hourly data makes it difficult. Therefore, this paper aims to present a high-resolution simulation method for evaluating the PV power and storage capacity requirements for a Smart Community based on a stochastic demand model and real PV production data, so the interplay between consumption and generation can be better understood.

关键词： Energy Consumption load modeling solar power generation energy storage

来源：评论

学校读者我要写书评

暂无评论

Studying bioluminescence flashes with the ANTARES deep Sea neutrino telescope

arXiv

引用

arXiv 2021年

作者： Reeb, Nico Hutschenreuter, S. Zehetner, P. Ensslin, T. Albert, A. Alves, S. André, M. Anghinolfi, M. Anton, G. Ardid, M. Aubert, J.-J. Aublin, J. Baret, B. Basa, S. Belhorma, B. Bendahman, M. Bertin, V. Biagi, S. Bissinger, M. Boumaaza, J. Bouta, M. Bouwhuis, M.C. Brânzaş, H. Bruijn, R. Brunner, J. Busto, J. Caiffi, B. Capone, A. Caramete, L. Carr, J. Carretero, V. Celli, S. Chabab, M. Chau, T.N. Chiarusi, T. Circella, M. Coleiro, A. Colomer-Molla, M. Coniglione, R. Coyle, P. Creusot, A. Díaz, A.F. de Wasseige, G. Deschamps, A. Distefano, C. Di Palma, I. Domi, A. Donzaud, C. Dornic, D. Drouhin, D. van Eeden, T. Enzenhöfer, A. Fermani, P. Ferrara, G. Filippini, F. Fusco, L. Gatelet, Y. Gay, P. Glotin, H. Gozzini, R. Ruiz, R. Gracia Graf, K. Guidi, C. Hallmann, S. van Haren, H. Heijboer, A.J. Hello, Y. Hernández-Rey, J.J. Hößl, J. Hofestädt, J. Huang, F. Illuminati, G. James, C.W. Jisse-Jung, B. de Jong, M. de Jong, P. Jongen, M. Kadler, M. Kalekin, O. Katz, U. Khan-Chowdhury, N.R. Kouchner, A. Kreykenbohm, I. Kulikovskiy, V. Lahmann, R. Le Breton, R. Lefèvre, D. Leonora, E. Levi, G. Lincetto, M. Lopez-Coto, D. Loucatos, S. Maderer, L. Manczak, J. Marcelin, M. Margiotta, A. Marinelli, A. Martínez-Mora, J.A. Melis, K. Migliozzi, P. Moussa, A. Muller, R. Nauta, L. Navas, S. Nezri, E. Fearraigh, B.Ó. Organokov, M. Pavalaş, G.E. Pellegrino, C. Perrin-Terrin, M. Piattelli, P. Pieterse, C. Poirè, C. Popa, V. Pradier, T. Randazzo, N. Reck, S. Riccobene, G. Romanov, A. Sánchez-Losa, A. Greus, F. Salesa Samtleben, D.F.E. Sanguineti, M. Sapienza, P. Schnabel, J. Schumann, J. Schüssler, F. Spurio, M. Stolarczyk, Th. Taiuti, M. Tingay, S.J. Vallage, B. van Elewyck, V. Versari, F. Viola, S. Vivolo, D. Wilms, J. Zavatarelli, S. Zegarelli, A. Zornoza, J.D. Zúñiga, J. Information Field Theory Group Max Planck Institute for Astrophysics Garching Germany Informatics 6 Chair of Robotics Artificial Intelligence and Real time Systems Technical University of Munich Garching Germany Department of Astrophysics IMAPP Radboud University Nijmegen Nijmegen Netherlands Department of Physics Ludwig-Maximilians University Munich Germany CERN Geneva Switzerland Université de Strasbourg CNRS IPHC UMR 7178 StrasbourgF-67000 France Université de Haute Alsace MulhouseF-68200 France IFIC - Instituto de Física Corpuscular CSIC Universitat de València c/ Catedrático José Beltrán 2 Paterna ValenciaE-46980 Spain Technical University of Catalonia Laboratory of Applied Bioacoustics Rambla Exposició Vilanova i la Geltrú Barcelona08800 Spain INFN - Sezione di Genova Via Dodecaneso 33 Genova16146 Italy Friedrich-Alexander-Universität Erlangen-Nürnberg Erlangen Centre for Astroparticle Physics Erwin-Rommel-Str. 1 Erlangen91058 Germany Universitat Politècnica de València C/ Paranimf 1 Gandia46730 Spain Aix Marseille Univ CNRS IN2P3 CPPM Marseille France Université de Paris CNRS Astroparticule et Cosmologie ParisF-75013 France Aix Marseille Univ CNRS CNES LAM Marseille France National Center for Energy Sciences and Nuclear Techniques B.P.1382 RabatR. P. 10001 Morocco University Mohammed V in Rabat Faculty of Sciences 4 av. Ibn Battouta B.P. 1014 R.P. Rabat10000 Morocco Via S. Sofia 62 Catania95123 Italy University Mohammed I Laboratory of Physics of Matter and Radiations B.P.717 Oujda6000 Morocco Nikhef Science Park Amsterdam Netherlands Institute of Space Science Bucharest MagureleRO-077125 Romania Universiteit van Amsterdam Instituut voor Hoge-Energie Fysica Science Park 105 Amsterdam1098 XG Netherlands INFN - Sezione di Roma P.le Aldo Moro 2 Roma00185 Italy Dipartimento di Fisica Università La Sapienza P.le Aldo Moro 2 Roma00185 Italy LPHEA Faculty of Science - Semlali Cadi Ayyad University P.O

We develop a novel technique to exploit the extensive data sets provided by underwater neutrino telescopes to gain information on bioluminescence in the deep sea. The passive nature of the telescopes gives us the unique opportunity to infer information on bioluminescent organisms without actively interfering with them. We propose a statistical method that allows us to reconstruct the light emission of individual organisms, as well as their location and movement. A mathematical model is built to describe the measurement process of underwater neutrino telescopes and the signal generation of the biological organisms. The Metric Gaussian Variational Inference algorithm is used to reconstruct the model parameters using photon counts recorded by the neutrino detectors. We apply this method to synthetic data sets and data collected by the ANTARES neutrino telescope. The telescope is located 40 km off the French coast and fixed to the sea floor at a depth of 2475 m. The runs with synthetic data reveal that we can reliably model the emitted bioluminescent flashes of the organisms. Furthermore, we find that the spatial resolution of the localization of light sources highly depends on the configuration of the telescope. Precise measurements of the efficiencies of the detectors and the attenuation length of the water are crucial to reconstruct the light emission. Finally, the application to ANTARES data reveals the first precise localizations of bioluminescent organisms using neutrino telescope data. © 2021, CC BY.

关键词： Bioluminescence

来源：评论

学校读者我要写书评

暂无评论

26th Annual Computational Neuroscience Meeting (CNS*2017) of the Organization for Computational Neuroscience Antwerp, Belgium, July 15-20, 2017

引用

BMC NEUROSCIENCE 2017年第SUPPL 1期18卷 59-59页

作者： [Anonymous] Indiana University Purdue University Indianapolis Indianapolis IN 46032 USA Stark Neurosciences Research Institute Indiana University School of Medicine Indianapolis IN 46032 USA Department of Mathematics East Carolina University Greenville NC 27858 USA Jülich Supercomputing Centre Forschungszentrum Jülich 52425 Jülich Germany Future Systems Swiss National Supercomputing Centre 8092 Zurich Switzerland User Engagement and Support Swiss National Supercomputing Centre 6900 Lugano Switzerland Institut de Neurosciences des Systèmes Aix Marseille Univ 13005 Marseille France Simulation Lab Neuroscience Forschungszentrum Jülich Jülich Germany Department of Experimental Psychology Ghent University 9000 Ghent Belgium Donders Center for Cognitive Neuroimaging Radboud University 6525HR Nijmegen The Netherlands Department of Electrical Computer and Energy Engineering University of Colorado Boulder CO 80309 USA Department of Neurosurgery Johns Hopkins School of Medicine Baltimore MD 21287 USA Department of Neurology Johns Hopkins School of Medicine Baltimore MD 21287 USA Department of Otolaryngology Johns Hopkins School of Medicine Baltimore MD 21287 USA INSERM U968 Paris France Sorbonne Universités UPMC University Paris 06 UMR_S 968 Institut de la Vision Paris France CNRS UMR_7210 Paris France Department of Computer Architecture and Technology University of Granada (CITIC) Granada Spain Sorbonne Universités UPMC Univ Paris 06 INSERM CNRS Institut de la Vision Paris France Department of Adaptive Machine Systems Osaka University Osaka Japan Department of Computer Science University of Cergy-Pontoise Cergy-Pontoise France Department of Physics and Astronomy College of Charleston Charleston SC 29424 USA School of Physics Faculty of Science University of Sydney Sydney NSW 2006 Australia Center of Excellence for Integrative Brain Function Australian Research Council Sydney Australia Max Planck Institute for Human Cognitive and Brain Sciences Saxony Lei

来源：评论

学校读者我要写书评

暂无评论

An efficient storage technology for object-based distributed storage system

International Journal of Control and Automation

引用

International Journal of Control and Automation 2015年第11期8卷 337-348页

作者： Zhang, Jilin Su, Yucheng Wan, Jian Zhou, Li Wang, Jue Zhang, Lei College of Electrical Engineering Zhejiang University Hangzhou China School of Computer Science and Technology Hangzhou Dianzi University Hangzhou China Key Laboratory of Complex Systems Modeling and Simulation Ministry of Education China Supercomputing Center of Computer Network Information Center Chinese Academy of Sciences Beijing China Computer Science Department Beijing University of Civil Engineering and Architecture Beijing China

There have two effective ways to improve the overall efficiency of the object-based distributed storage system, one is network caching technology and the other is metadata server cluster load balancing strategy. Under the heterogeneous storage environments, object-based distributed file system face the key challenge of lacking caching mechanism for the high-frequency access files, metadata server load imbalance also reduce the overall efficiency. To address these challenges, we discuss the design and implementation of an object-based distributed file storage caching system, and propose a weight-based metadata server cluster load balancing strategy. It effectively improve the metadata processing capacity. Based on the results, it demonstrated the feasibility and the efficiency of our methods. © 2015 SERSC.

关键词： Metadata

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：