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

SSRN 2023年

作者： Górriz, Juan Manuel Álvarez-Illán, I. Álvarez-Marquina, A. Arco, J.E. Atzmueller, M. Ballarini, F. Barakova, E. Bologna, G. Bonomini, P. Castellanos-Dominguez, G. Castillo-Barnes, D. Cho, S.B. Contreras, R. Cuadra, J.M. Domínguez, E. Domínguez-Mateos, F. Duro, R.J. Elizondo, D. Fernández-Caballero, A. Fernandez-Jover, E. Formoso, M.A. Gallego-Molina, N.J. Gamazo, J. García González, J. Garcia-Rodriguez, J. Garre, C. Garrigós, J. Gómez-Rodellar, A. Gómez-Vilda, P. Graña, M. Guerrero-Rodriguez, B. Hendrikse, S.C.F. Jimenez-Mesa, C. Jodra-Chuan, M. Julian, V. Kotz, G. Kutt, K. Leming, M. de Lope, J. Macas, B. Marrero-Aguiar, V. Martinez, J.J. Martinez-Murcia, F.J. Martínez-Tomás, R. Mekyska, J. Nalepa, G.J. Novais, P. Orellana, D. Ortiz, A. Palacios-Alonso, D. Palma, J. Pereira, A. Pinacho-Davidson, P. Pinninghoff, M.A. Ponticorvo, M. Psarrou, A. Ramírez, J. Rincón, M. Rodellar-Biarge, V. Rodríguez-Rodríguez, I. Roelofsma, P.H.M.P. Santos, J. Salas-Gonzalez, D. Salcedo-Lagos, P. Segovia, F. Shoeibi, A. Silva, M. Simic, D. Suckling, J. Treur, J. Tsanas, A. Varela, R. Wang, S.H. Wang, W. Zhang, Y.D. Zhu, H. Zhu, Z. Ferrández-Vicente, J.M. SiPBA at Data Science and Computational Intelligence Institute University of Granada Granada Spain University of Granada Granada Spain Dept. of Psychiatry University of Cambridge Cambridge United Kingdom Dept. of Communications Engineering University of Malaga Malaga Spain School of Computing and Mathematical Sciences University of Leicester Leicester United Kingdom Semantic Information Systems Group Osnabrück University Osnabrück Germany Osnabrück Germany Dept. of Electronics Computer Technology and Projects Universidad Politécnica de Cartagena Cartagena Spain Universitat Politècnica de València València Spain Institute of Applied Computer Science Jagiellonian University Kraków Poland Dept. of Information and Communication Engineering University of Murcia Murcia Spain Dept. of Computer Science and Information Technologies University of A Coruña A Coruña Spain Dept. of Computer Science University of Oviedo Oviedo Spain Buenos Aires Argentina Buenos Aires Argentina Eindhoven University of Technology Eindhoven5612 AZ Netherlands Dept. of Computer Science University of Malaga Malaga Spain De Montfort University Leicester United Kingdom Dept. of Computer Science Faculty of Engineering Universidad de Concepción Concepción Chile Neurocognition and Emotion Research Unit Albacete Research Institute of Informatics University of Castilla-La Mancha Albacete Spain Dept. of Educational Informatics Universidad de Concepción Concepción Chile Madrid Spain Dept. of Humanistic Studies University of Naples Federico II Napoli Italy Escuela Técnica Superior de Ingeniería Informática Universidad Rey Juan Carlos Campus de Móstoles Móstoles Madrid28933 Spain Neuromorphic Speech Processing Lab Center for Biomedical Technology Universidad Politécnica de Madrid Campus de Montegancedo Pozuelo de Alarcón Madrid28223 Spain Biomedical Research Networking Center in Mental Health Instituto de Salud Carlos III Madrid28016 Spain Usher Institute Faculty o

Groundbreaking advances in theoretical and applied Artificial Intelligence (AI). DL algorithms are groundedin non-linear and complex artificial neural systems that progressively extract higher-level features from *** is frequently compared with human-level performance in real-world tasks, such as clinical diagnostics. Itis also a turning point in solving otherwise intractable problems in the design of virtual agents or robotics;orin providing novel insight into disease progress in genomics and Neuroimaging (NI), understanding humanbrain function, the automation of industrial processes based on computer vision, and so on. In this paper, themost relevant advances from the last few years in AI and several applications to neuroscience, neuroimaging,computer vision, and robotics are presented, reviewed and discussed. In this way, we summarize the state-ofthe-art in AI methods, models and applications within a collection of works presented at the 9th InternationalConference on the Interplay between Natural and Artificial Computation (IWINAC). The works presentedin this paper are excellent examples of new scientific discoveries made in laboratories that are successfullytransferred to real-life applications. © 2023, The Authors. All rights reserved.

关键词： Neuroimaging

来源：评论

学校读者我要写书评

暂无评论

Approximation and competitive algorithms for single-minded selling problem 1

引用

12th International Conference on Algorithmic Aspects in Information and Management, AAIM 2018

作者： Chin, Francis Y. L. Poon, Sheung-Hung Ting, Hing-Fung Xu, Dachuan Yu, Dongxiao Zhang, Yong Department of Computer Science The University of Hong Kong Pok Fu Lam Hong Kong School of Computer Science University of Nottingham Ningbo China Ningbo China Beijing Institute for Scientific and Engineering Computing Beijing University of Technology Beijing China Institute of Intelligent Computing School of Computer Science and Technology Shandong University Qingdao266237 China Research Center for High Performance Computing Joint Engineering Research Center for Health Big Data Intelligent Analysis Technology Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences Shenzhen China

ISBN: (数字)9783030046187

ISBN: (纸本)9783030046170

The problem of item selling with the objective of maximizing the revenue is studied. Given a seller with k types of items and n single-minded buyers, i.e., each buyer is only interested in a particular bundle of items, to maximize the revenue, the seller must carefully assign some amount of bundles to each buyer with respect to the buyer’s accepted price. Each buyer bi is associated with a value function vi(·) such that vi(x) is the accepted unit bundle price bi is willing to pay for x bundles. We show that the single-minded item selling problem is NP-hard. Moreover, we give an O(√k)-approximation algorithm. For the online version, i.e., the buyers come one by one and the decision on each buyer must be made before the arrival of the next buyer, an O(√k · (log h + log k))- competitive algorithm is achieved, where h is the highest unit item price among all buyers. © Springer Nature Switzerland AG 2018.

关键词： Sales

来源：评论

学校读者我要写书评

暂无评论

Τ-FPL: Tolerance-constrained learning in linear time 32

Τ-FPL: Tolerance-constrained learning in linear time

引用

32nd AAAI Conference on Artificial Intelligence, AAAI 2018

作者： Zhang, Ao Li, Nan Pu, Jian Wang, Jun Yan, Junchi Zha, Hongyuan Shanghai Key Laboratory of Trustworthy Computing MOE International Joint Lab of Trustworthy Software School of Computer Science and Software Engineering East China Normal University Shanghai China Institute of Data Science and Technologies Alibaba Group Hangzhou China IBM Research China Georgia Institute of Technology Atlante United States

ISBN: (纸本)9781577358008

In many real-world applications, learning a classifier with false-positive rate under a specified tolerance is appealing. Existing approaches either introduce prior knowledge dependent label cost or tune parameters based on traditional classifiers, which are of limitation in methodology since they do not directly incorporate the false-positive rate tolerance. In this paper, we propose a novel scoring-thresholding approach, τ-False Positive Learning (τ-FPL) to address this problem. We show that the scoring problem which takes the false-positive rate tolerance into accounts can be efficiently solved in linear time, also an out-of-bootstrap thresholding method can transform the learned ranking function into a low false-positive classifier. Both theoretical analysis and experimental results show superior performance of the proposed τ-FPL over the existing approaches. Copyright © 2018, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Mathematical transformations

来源：评论

学校读者我要写书评

暂无评论

All-electron periodic G0W0 implementation with numerical atomic orbital basis functions: Algorithm and benchmarks

引用

Physical Review Materials 2021年第1期5卷 013807-013807页

作者： Xinguo Ren Florian Merz Hong Jiang Yi Yao Markus Rampp Hermann Lederer Volker Blum Matthias Scheffler Beijing National Laboratory for Condensed Matter Physics Institute of Physics Chinese Academy of Sciences 3rd South Str. 8 Beijing 100190 China Lenovo HPC Innovation Center Meitnerstr. 9 D-70563 Stuttgart Germany Beijing National Laboratory for Molecular Sciences College of Chemistry and Molecular Engineering Peking University Beijing 100871 China Department of Chemistry University of North Carolina Chapel Hill North Carolina 27599 USA Department of Mechanical Engineering and Materials Science Duke University Durham North Carolina 27708 USA Max Planck Computing and Data Facility Giessenbachstrasse 2 D-85748 Garching Germany Department of Chemistry Duke University Durham North Carolina 27708 USA Fritz-Haber-Institut der Max-Planck-Gesellschaft Faradayweg 4-6 D-14195 Berlin Germany Physics Department Humboldt-Universität zu Berlin Zum Großen Windkanal 6 D-12489 Berlin Germany

We present an all-electron, periodic G0W0 implementation within the numerical atomic orbital (NAO) basis framework. A localized variant of the resolution-of-the-identity (RI) approximation is employed to significantly reduce the computational cost of evaluating and storing the two-electron Coulomb repulsion integrals. We demonstrate that the error arising from localized RI approximation can be reduced to an insignificant level by enhancing the set of auxiliary basis functions, used to expand the products of two single-particle NAOs. An efficient algorithm is introduced to deal with the Coulomb singularity in the Brillouin zone sampling that is suitable for the NAO framework. We perform systematic convergence tests and identify a set of computational parameters, which can serve as the default choice for most practical purposes. Benchmark calculations are carried out for a set of prototypical semiconductors and insulators, and compared to independent reference values obtained from an independent G0W0 implementation based on linearized augmented plane waves (LAPWs) plus high-energy localized orbitals (HLOs) basis set, as well as experimental results. With a moderate (FHI-aims tier 2) NAO basis set, our G0W0 calculations produce band gaps that typically lie in between the standard LAPW and the LAPW+HLO results. Complementing tier 2 with highly localized Slater-type orbitals (STOs), we find that the obtained band gaps show an overall convergence towards the LAPW+HLO results. The algorithms and techniques developed in this work pave the way for efficient implementations of correlated methods within the NAO framework.

关键词： Band gap Density functional calculations GW method Random phase approximation

来源：评论

学校读者我要写书评

暂无评论

When the signal is in the noise: Exploiting diffix’s sticky noise

arXiv

引用

arXiv 2018年

作者： Gadotti, Andrea Houssiau, Florimond Rocher, Luc Livshits, Benjamin de Montjoye, Yves-Alexandre Department of Computing and Data Science Institute Imperial College London ICTEAM Université catholique de Louvain

Anonymized data is highly valuable to both businesses and researchers. A large body of research has however shown the strong limits of the de-identification release-and-forget model, where data is anonymized and shared. This has led to the development of privacy-preserving query-based systems. Based on the idea of "sticky noise", Diffix has been recently proposed as a novel query-based mechanism satisfying alone the EU Article 29 Working Party’s definition of anonymization. According to its authors, Diffix adds less noise to answers than solutions based on differential privacy while allowing for an unlimited number of queries. This paper presents a new class of noise-exploitation attacks, exploiting the noise added by the system to infer private information about individuals in the dataset. Our first differential attack uses samples extracted from Diffix in a likelihood ratio test to discriminate between two probability distributions. We show that using this attack against a synthetic best-case dataset allows us to infer private information with 89.4% accuracy using only 5 attributes. Our second cloning attack uses dummy conditions that conditionally strongly affect the output of the query depending on the value of the private attribute. Using this attack on four real-world datasets, we show that we can infer private attributes of at least 93% of the users in the dataset with accuracy between 93.3% and 97.1%, issuing a median of 304 queries per user. We show how to optimize this attack, targeting 55.4% of the users and achieving 91.7% accuracy, using a maximum of only 32 queries per user. Our attacks demonstrate that adding data-dependent noise, as done by Diffix, is not sufficient to prevent inference of private attributes. We furthermore argue that Diffix alone fails to satisfy Art. 29 WP’s definition of anonymization. We conclude by discussing how non-provable privacy-preserving systems can be combined with fundamental security principles such as defense-in-depth

关键词： Probability distributions

来源：评论

学校读者我要写书评

暂无评论

McDiarmid-Type inequalities for graph-dependent variables and stability bounds

arXiv

引用

arXiv 2019年

作者： Zhang, Rui Ray Liu, Xingwu Wang, Yuyi Wang, Liwei School of Mathematics Monash University Institute of Computing Technology Chinese Academy of Sciences University of Chinese Academy of Sciences ETH Zurich Switzerland X-Order Lab China Key Laboratory of Machine Perception MOE School of EECS Peking University Center for Data Science

A crucial assumption in most statistical learning theory is that samples are independently and identically distributed (i.i.d.). However, for many real applications, the i.i.d. assumption does not hold. We consider learning problems in which examples are dependent and their dependency relation is characterized by a graph. To establish algorithm-dependent generalization theory for learning with non-i.i.d. data, we first prove novel McDiarmid-type concentration inequalities for Lipschitz functions of graph-dependent random variables. We show that concentration relies on the forest complexity of the graph, which characterizes the strength of the dependency. We demonstrate that for many types of dependent data, the forest complexity is small and thus implies good concentration. Based on our new inequalities we are able to build stability bounds for learning from graph-dependent data. Copyright © 2019, The Authors. All rights reserved.

关键词： Forestry

来源：评论

学校读者我要写书评

暂无评论

Systematic Resource Allocation in Cloud RAN with Caching as a Service under Two Timescales

Systematic Resource Allocation in Cloud RAN with Caching as ...

引用

作者： Tang, Jianhua Quek, Tony Q. S. Chang, Tsung-Hui Shim, Byonghyo Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing College of Information Science and Engineering Hunan Normal University Changsha410081 China Institute of New Media and Communications Department of Electrical and Computer Engineering Seoul National University Seoul08826 Korea Republic of Information Systems Technology and Design Pillar Singapore University of Technology and Design Singapore487372 Singapore Department of Electronic Engineering Kyung Hee University Yongin17104 Korea Republic of School of Science and Engineering Chinese University of Hong Kong Shenzhen518172 China Shenzhen Research Institute of Big Data Shenzhen518172 China Department of Electrical and Computer Engineering Institute of New Media and Communications Seoul National University Seoul08826 Korea Republic of

Recently, cloud radio access network (C-RAN) with caching as a service (CaaS) was proposed to merge the functionalities of communication, computing, and caching (CCC) together. In this paper, we dissect the interactions of CCC in C-RAN with CaaS from two dimensions: physical resource dimension and time dimension. In the physical resource dimension, we identify how to segment the baseband unit (BBU) pool resources (i.e., computation and storage) into different types of virtual machines (VMs). In the time dimension, we address how the long-term resource segmentation in the BBU pool impacts on the short-term transmit beamforming at the remote radio heads. We formulate the problem as a stochastic mixed-integer nonlinear programming (SMINLP) to minimize the system cost, including the server cost, VM cost and wireless transmission cost. After a series of approximation, including sample average approximation, successive convex approximation, and semidefinite relaxation, the SMINLP is approximated as a global consensus problem. The alternating direction method of multipliers (ADMM) is utilized to obtain the solution in a parallel fashion. Simulation results verify the convergence of our proposed algorithm, and also confirm that the proposed scheme is more cost-saving than that without considering the integration of CCC. © 1972-2012 IEEE.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

Electronic Impurity Doping of a 2D Hybrid Lead Iodide Perovskite by Bi and Sn

引用

PRX Energy 2023年第2期2卷 023010-023010页

作者： Haipeng Lu Gabrielle Koknat Yi Yao Ji Hao Xixi Qin Chuanxiao Xiao Ruyi Song Florian Merz Markus Rampp Sebastian Kokott Christian Carbogno Tianyang Li Glenn Teeter Matthias Scheffler Joseph J. Berry David B. Mitzi Jeffrey L. Blackburn Volker Blum Matthew C. Beard Material Chemical and Computational Science Directorate National Renewable Energy Laboratory Golden Colorado 80401 USA Department of Chemistry The Hong Kong University of Science and Technology Clear Water Bay Kowloon Hong Kong SAR China Thomas Lord Department of Mechanical Engineering and Material Science Duke University Durham North Carolina 27708 USA Department of Chemistry Duke University Durham North Carolina 27708 USA Lenovo HPC Innovation Center Meitnerstr. 9 D-70563 Stuttgart Germany Max Planck Computing and Data Facility Giessenbachstrasse 2 D-85748 Garching Germany The NOMAD Laboratory at the FHI of the Max-Planck-Gesellschaft and IRIS-Adlershof of the Humboldt-Universität zu Berlin 14195 Berlin Germany Renewable and Sustainable Energy Institute University of Colorado Boulder Boulder Colorado 80309 USA Department of Physics University of Colorado Boulder Boulder Colorado 80309 USA

Control over conductivity and carrier type (electrons and holes) defines semiconductors. A primary approach to target carrier concentrations involves introducing a small population of aliovalent impurity dopant atoms. In a combined synthetic and computational study, we assess impurity doping by introducing Bi and Sn into the prototype 2D Ruddlesden-Popper hybrid perovskite phenylethylammonium lead iodide (PEA2PbI4). Experimentally, we demonstrate that Bi and Sn can achieve n- and p-type doping, respectively, but the doping efficiency is low. Simulations show that Bi introduces a deep defect energy level (∼0.5 eV below the conduction band minimum) that contributes to the low doping efficiency, but, to reproduce the low doping efficiency observed experimentally, an acceptor level must also be present that limits n-type doping. Experiments find that Sn achieves p-dopant behavior and simulations suggest that this occurs through the additional oxidation of Sn defects. We also study how substitutional Bi incorporation can be controlled by tuning the electrochemical environment during synthesis. First-principles impurity doping simulations can be challenging; typical dopant concentrations constitute less than 0.01% of the atoms, necessitating large supercells, while a high level of theory is needed to capture the electronic levels. We demonstrate simulations of complex defect-containing unit cells that include up to 3383 atoms, employing spin-orbit coupled hybrid density functional theory. While p- and n-type behavior can be achieved with Sn and Bi, simulations and experiments provide concrete directions where future efforts must be focused to achieve higher doping efficiency.

关键词： Energy materials Solar energy

来源：评论

学校读者我要写书评

暂无评论

Coherent H ∞ control for Markovian jump linear quantum systems

引用

IFAC-PapersOnLine 2020年第2期53卷 269-274页

作者： Yanan Liu Daoyi Dong Ian R. Petersen Qing Gao Steven X. Ding Hidehiro Yonezawa School of Engineering and Information Technology University of New South Wales Canberra ACT 2600 Australia Center for Quantum Computation and Communication Technology Australian Research Council Canberra ACT 2600 Australia Institute for Automatic Control and Complex Systems (AKS) University of Duisburg-Essen. 47057 Duisburg Germany Research School of Electrical Energy and Materials Engineering The Australian National University Canberra ACT 2601 Australia School of Automation Science and Electrical Engineering State Key Laboratory of Software Development Environment Beijing and also with Advanced Innovation Center for Big Data and Brain Computing Beihang University Beijing 100191 China

The purpose of this paper is to design a coherent feedback controller for a Markovian jump linear quantum system suffering from a fault signal. The control objective is to bound the effect of the disturbance input on the output for the time-varying quantum system. We prove the relation between the H ∞ control problem, the dissipation properties, and the solutions of Riccati differential equations, by which the H ∞ controller of the Markovian jump linear quantum system is given by the solutions of Linear Matrix Inequalities (LMIs).

关键词： Coherent quantum feedback H∞ control fault-tolerant control Markovian jump linear quantum systems

来源：评论

学校读者我要写书评

暂无评论

From FAIR to CURE: Guidelines for Computational Models of Biological Systems

arXiv

引用

arXiv 2025年

作者： Sauro, Herbert M. Agmon, Eran Blinov, Michael L. Gennari, John H. Hellerstein, Joe Heydarabadipour, Adel Hunter, Peter Jardine, Bartholomew E. May, Elebeoba Nickerson, David P. Smith, Lucian P. Bader, Gary D. Bergmann, Frank Boyle, Patrick M. Dräger, Andreas Faeder, James R. Feng, Song Freire, Juliana Fröhlich, Fabian Glazier, James A. Gorochowski, Thomas E. Helikar, Tomas Hoops, Stefan Imoukhuede, Princess Keating, Sarah M. Konig, Matthias Laubenbacher, Reinhard Loew, Leslie M. Lopez, Carlos F. Lytton, William W. McCulloch, Andrew Mendes, Pedro Myers, Chris J. Myers, Jerry G. Mulugeta, Lealem Niarakis, Anna van Niekerk, David D. Olivier, Brett G. Patrie, Alexander A. Quardokus, Ellen M. Radde, Nicole Rohwer, Johann M. Sahle, Sven Schaff, James C. Sego, T.J. Shin, Janis Snoep, Jacky L. Vadigepalli, Rajanikanth Wiley, H. Steve Waltemath, Dagmar Moraru, Ion Department of Bioengineering University of Washington SeattleWA98195-5061 United States Intelligent Systems Engineering and Biocomplexity Institute Indiana University Street BloomingtonIN47408 United States Center for Cardiovascular Biology University of Washington SeattleWA98195-5061 United States eScience Institute University of Washington SeattleWA98195-5061 United States Institute for Stem Cell and Regenerative Medicine University of Washington SeattleWA98195-5061 United States School of Biological Sciences University of Bristol 24 Tyndall Avenue BristolBS8 1TQ United Kingdom Departments of Physiology & Pharmacology Neurology Downstate Health Science University BrooklynNY11203 United States Department of Neurology Kings County Hospital BrooklynNY11203 United States NASA-John H. Glenn Research Center MS 110-3 21000 Brookpark Road ClevelandOH44135 United States Center for Cell Analysis and Modeling UConn Health 263 Farmington Avenue FarmingtonCT06030-6406 United States Amsterdam Institute for Life and Environment Vrije Universiteit Amsterdam De Boelelaan 1108 Amsterdam1081 HZ Netherlands Department of Pathology and Genomic Medicine Thomas Jefferson University 1020 Locust St PhiladelphiaPA19107 United States Biological Sciences Division Pacific Northwest National Laboratory 902 Battelle Blvd RichlandWA99354 United States Auckland Bioengineering Institute University of Auckland Auckland1010 New Zealand Center of Integrative Biology University of Toulouse III-Paul Sabatier 165 Rue Marianne Grunberg-Manago Toulouse31400 France Lifeware Group Inria Building Alan Turing 1 Rue Honoré d’Estienne d’Orves Palaiseau91120 France Multiscale Modeling Group Altos Labs Redwood CityCA94065 United States partner site Tübingen Tübingen Germany Ottfried-Müller-Str. 37 Tübingen72076 Germany 06120 Germany Department of Computer Science Center for Data Science New York University New YorkNY11201 United States Department of Bi

Guidelines for managing scientific data have been established under the FAIR principles requiring that data be Findable, Accessible, Interoperable, and Reusable. In many scientific disciplines, especially computational biology, both data and models are key to progress. For this reason, and recognizing that such models are a very special type of "data", we argue that computational models, especially mechanistic models prevalent in medicine, physiology and systems biology, deserve a complementary set of guidelines. We propose the CURE principles, emphasizing that models should be Credible, Understandable, Reproducible, and Extensible. We delve into each principle, discussing verification, validation, and uncertainty quantification for model credibility;the clarity of model descriptions and annotations for understandability;adherence to standards and open science practices for reproducibility;and the use of open standards and modular code for extensibility and reuse. We outline recommended and baseline requirements for each aspect of CURE, aiming to enhance the impact and trustworthiness of computational models, particularly in biomedical applications where credibility is paramount. Our perspective underscores the need for a more disciplined approach to modeling, aligning with emerging trends such as Digital Twins and emphasizing the importance of data and modeling standards for interoperability and reuse. Finally, we emphasize that given the non-trivial effort required to implement the guidelines, the community moves to automate as many of the guidelines as possible. © 2025, CC BY.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：