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

Proceedings of the 13th USENIX conference on Operating systems Design and Implementation

作者： Jie Zhang Miryeong Kwon Donghyun Gouk Sungjoon Koh Changlim Lee Mohammad Alian Myoungjun Chun Mahmut Taylan Kandemir Nam Sung Kim Jihong Kim Myoungsoo Jung Yonsei University Computer Architecture and Memory Systems Laboratory University of Illinois Urbana-Champaign Seoul National University Pennsylvania State University

ISBN: (纸本)9781931971478

A modern datacenter server aims to achieve high energy efficiency by co-running multiple applications. Some of such applications (e.g., web search) are latency sensitive. Therefore, they require low-latency I/O services to fast respond to requests from clients. However, we observe that simply replacing the storage devices of servers with Ultra-Low-Latency (ULL) SSDs does not notably reduce the latency of I/O services, especially when co-running multiple applications. In this paper, we propose FLASHSHARE to assist ULL SSDs to satisfy different levels of I/O service latency requirements for different co-running applications. Specifically, FLASHSHARE is a holistic cross-stack approach, which can significantly reduce I/O interferences among co-running applications at a server without any change in applications. At the kernel-level, we extend the data structures of the storage stack to pass attributes of (co-running) applications through all the layers of the underlying storage stack spanning from the OS kernel to the SSD firmware. For given attributes, the block layer and NVMe driver of FLASHSHARE differently manage the I/O scheduler and interrupt handler of NVMe. We also enhance the NVMe controller and cache layer at the SSD firmware-level, by dynamically partitioning DRAM in the ULL SSD and adjusting its caching strategies to meet diverse user requirements. The evaluation results demonstrate that FLASHSHARE can shorten the average and 99th-percentile turnaround response times of co-running applications by 22% and 31%, respectively.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Metamorphosis of discontinuity lines and rectification of magnetic flux avalanches in the presence of noncentrosymmetric pinning forces

引用

Physical Review B 2021年第22期103卷 224514-224514页

作者： M. Motta L. Burger Lu Jiang J. D. González Acosta Ž. L. Jelić F. Colauto W. A. Ortiz T. H. Johansen M. V. Milošević C. Cirillo C. Attanasio Cun Xue A. V. Silhanek B. Vanderheyden Departamento de Física Universidade Federal de São Carlos 13565-905 São Carlos São Paulo Brazil Montefiore Research Unit Department of Electrical Engineering and Computer Science Université de Liège 4000 Sart Tilman Belgium School of Aeronautics Northwestern Polytechnical University Xi'an 710072 China Facultad de Ingeniería Universidad del Magdalena Santa Marta Colombia Departement Fysica Universiteit Antwerpen Groenenborgerlaan 171 B-2020 Antwerpen Belgium Nokia Bell Labs Antwerp Belgium Department of Physics University of Oslo POB 1048 Blindern 0316 Oslo Norway CNR-SPIN c/o Università degli Studi di Salerno I-84084 Fisciano (Sa) Italy Dipartimento di Fisica “E.R. Caianiello” Università degli Studi di Salerno I-84084 Fisciano (Sa) Italy School of Mechanics Civil Engineering and Architecture and MIIT Key Laboratory of Dynamics and Control of Complex Systems Northwestern Polytechnical University Xi'an 710072 China Experimental Physics of Nanostructured Materials Q-MAT CESAM Université de Liège B-4000 Sart Tilman Belgium

Considering a noncentrosymmetric pinning texture composed of a square array of triangular holes, the magnetic flux penetration and expulsion are investigated experimentally and theoretically. A direct visualization of the magnetic landscape obtained using a magneto-optical technique on a Nb film is complemented by a multiscale numerical modeling. This combined approach allows the magnetic flux dynamics to be identified from the single flux quantum limit up to the macroscopic electromagnetic response. Within the theoretical framework provided by time-dependent Ginzburg-Landau simulations, an estimation of the in-plane current anisotropy is obtained and its dependence with the radius of the curvature of hole vertices is addressed. These simulations show that current crowding plays an important role in channeling the flux motion, favoring hole-to-hole flux hopping rather than promoting interstitial flux displacement in between the holes. The resulting anisotropy of the critical current density gives rise to a distinct pattern of discontinuity lines for increasing and decreasing applied magnetic fields, in sharp contrast to the invariable patterns reported for centrosymmetric pinning potentials. This observation is partially accounted for by the rectification effect, as demonstrated by finite-element modeling. At low temperatures, where magnetic field penetration is dominated by thermomagnetic instabilities, highly directional magnetic flux avalanches with a fingerlike shape are observed to propagate along the easy axis of the pinning potential. This morphology is reproduced by numerical simulations. Our findings demonstrate that anisotropic pinning landscapes and, in particular, ratchet potentials produce subtle modifications to the critical state field profile that are reflected in the distribution of discontinuity lines.

关键词： Flux pinning Magneto-optical effect Monolayer films Superconductors Finite-element method Landau-Ginzburg theory

来源：评论

学校读者我要写书评

暂无评论

DEFINITION OF A TRANSPARENT CONSTRAINT-BASED MODELING AND SIMULATION LAYER FOR THE MANAGEMENT OF COMPLEX systems

DEFINITION OF A TRANSPARENT CONSTRAINT-BASED MODELING AND SI...

引用

Simulation Multi-Conference

作者： Kevin Henares Jose L. Risco-Martin Marina Zapater Dept. of Computer Architecture and Automation Complutense University of Madrid Madrid Spain Embedded Systems Laboratory (ESL) Swiss Federal Institute of Technology Lausanne (EPFL) Lausanne Switzerland

Modeling and Simulation (M&S) is one of the most multifaceted topics present today in both industry and academia. However, we are involved in a new M&S paradigm. systems are becoming more complex and new simulation needs arise and have to be studied. As a consequence, the way in which we perform M&S must be adapted, providing new ideas and tools. In this paper, we propose a rule-based constraints evaluator, which facilitate the validation and verification of complex models in a transparent manner. For this, constraints are defined. The constraints definition process is completely independent of the model development process because (a) the set of constraints is defined once the model has been developed, and (b) constraints are validated at simulation time. The proposed Constraint M&S architecture has been built using the Discrete Event System Specification (DEVS) formalism and has been tested on a validated data center simulation model.

关键词： Model checking Constraint modeling and simulation Discrete events Verification Data centers

来源：评论

学校读者我要写书评

暂无评论

An Improvement on the Linear Algebraic Attack for the Indeterminate Equation Encryption Scheme

An Improvement on the Linear Algebraic Attack for the Indete...

引用

International Symposium on Information Theory and Its Applications, ISITA

作者： Yasuhiko Ikematsu Koichiro Akiyama Tsuyoshi Takagi Department of Mathematical Informatics The University of Tokyo Tokyo Japan Computer Architecture and Network Systems Laboratory Corporate R&D Center Toshiba Corporation

ISBN: (纸本)9781538682234;9784885523182

At SAC2017, Akiyama et al. proposed the indeterminate equation encryption scheme whose security is based on a solution problem of indeterminate equation. It is an extension of algebraic surface encryption scheme. A public key X for this scheme is a polynomial in two variables over a finite ring. Akiyama et al. also proposed two attacks, the linear algebraic attack (LAA) and the key recovery attack (KRA), by using the lattice structure associated with this scheme. In this paper, we give an improvement on LAA. Also we explain the relation between our improvement and the improvement on LAA proposed by Xagawa and examine parameters that those attacks fail by experiments. As a result, we conclude that if the total degree of the public key X is one, then KRA is more efficient than LAA and if that of X is two, then LAA is more efficient than KRA.

关键词： Encryption Lattices Public key Informatics Quantum computing

来源：评论

学校读者我要写书评

暂无评论

One pathogen does not an epidemic make: A review of interacting contagions, diseases, beliefs, and stories

arXiv

引用

arXiv 2025年

作者： Hébert-Dufresne, Laurent Ahn, Yong-Yeol Allard, Antoine Crothers, Jessica W. Dodds, Peter Sheridan Galesic, Mirta Ghanbarnejad, Fakhteh Gravel, Dominique Hammond, Ross A. Lerman, Kristina Lovato, Juniper Openshaw, John J. Redner, S. Scarpino, Samuel V. St-Onge, Guillaume Tangherlini, Timothy R. Young, Jean-Gabriel Vermont Complex Systems Institute University of Vermont BurlingtonVT United States Translational Global Infectious Disease Research Center University of Vermont BurlingtonVT United States Department of Computer Science University of Vermont BurlingtonVT United States Center for Complex Networks and Systems Research Luddy School of Informatics Computing and Engineering Indiana University BloomingtonIN United States Département de physique de génie physique et d’optique Université Laval QuébecQC Canada Department of Pathology and Laboratory Medicine Robert Larner M.D. College of Medicine University of Vermont BurlingtonVT United States Santa Fe Institute Santa FeNM United States Complexity Science Hub Vienna Austria School of Technology and Architecture SRH University of Applied Sciences Heidelberg Leipzig Germany Département de biologie Université de Sherbrooke SherbrookeQC Canada Brown School Washington University in St. Louis St. LouisMO United States The Brookings Institution WashingtonDC United States Information Sciences Institute University of Southern California United States Division of Infectious Diseases and Geographic Medicine Stanford University StanfordCA United States Institute for Experiential AI Northeastern University BostonMA United States Laboratory for the Modeling of Biological and Socio-technical Systems Northeastern University BostonMA United States The Roux Institute Northeastern University PortlandME United States Department of Scandinavian School of Information University of California Berkeley BerkeleyCA United States Department of Mathematics & Statistics University of Vermont BurlingtonVT United States

From pathogens and computer viruses to genes and memes, contagion models have found widespread utility across the natural and social sciences. Despite their success and breadth of adoption, the approach and structure of these models remain surprisingly siloed by field. Given the siloed nature of their development and widespread use, one persistent assumption is that a given contagion can be studied in isolation, independently from what else might be spreading in the population. In reality, countless contagions of biological and social nature interact within hosts (interacting with existing beliefs, or the immune system) and across hosts (interacting in the environment, or affecting transmission mechanisms). Additionally, from a modeling perspective, we know that relaxing these assumptions has profound effects on the physics and translational implications of the models. Here, we review mechanisms for interactions in social and biological contagions, as well as the models and frameworks developed to include these interactions in the study of the contagions. We highlight existing problems related to the inference of interactions and to the scalability of mathematical models and identify promising avenues of future inquiries. In doing so, we highlight the need for interdisciplinary efforts under a unified science of contagions and for removing a common dichotomy between social and biological contagions. Copyright © 2025, The Authors. All rights reserved.

关键词： Histology

来源：评论

学校读者我要写书评

暂无评论

BigNeuron: a resource to benchmark and predict performance of algorithms for automated tracing of neurons in light microscopy datasets

引用

Nature methods 2023年第6期20卷 824-835页

作者： Linus Manubens-Gil Zhi Zhou Hanbo Chen Arvind Ramanathan Xiaoxiao Liu Yufeng Liu Alessandro Bria Todd Gillette Zongcai Ruan Jian Yang Miroslav Radojević Ting Zhao Li Cheng Lei Qu Siqi Liu Kristofer E Bouchard Lin Gu Weidong Cai Shuiwang Ji Badrinath Roysam Ching-Wei Wang Hongchuan Yu Amos Sironi Daniel Maxim Iascone Jie Zhou Erhan Bas Eduardo Conde-Sousa Paulo Aguiar Xiang Li Yujie Li Sumit Nanda Yuan Wang Leila Muresan Pascal Fua Bing Ye Hai-Yan He Jochen F Staiger Manuel Peter Daniel N Cox Michel Simonneau Marcel Oberlaender Gregory Jefferis Kei Ito Paloma Gonzalez-Bellido Jinhyun Kim Edwin Rubel Hollis T Cline Hongkui Zeng Aljoscha Nern Ann-Shyn Chiang Jianhua Yao Jane Roskams Rick Livesey Janine Stevens Tianming Liu Chinh Dang Yike Guo Ning Zhong Georgia Tourassi Sean Hill Michael Hawrylycz Christof Koch Erik Meijering Giorgio A Ascoli Hanchuan Peng Institute for Brain and Intelligence Southeast University Nanjing China. Microsoft Corporation Redmond WA USA. Tencent AI Lab Bellevue WA USA. Computing Environment and Life Sciences Directorate Argonne National Laboratory Lemont IL USA. Kaya Medical Seattle WA USA. University of Cassino and Southern Lazio Cassino Italy. Center for Neural Informatics Structures and Plasticity Krasnow Institute for Advanced Study George Mason University Fairfax VA USA. Faculty of Information Technology Beijing University of Technology Beijing China. Beijing International Collaboration Base on Brain Informatics and Wisdom Services Beijing China. Nuctech Netherlands Rotterdam the Netherlands. Janelia Research Campus Howard Hughes Medical Institute Ashburn VA USA. Department of Electrical and Computer Engineering University of Alberta Edmonton Alberta Canada. Ministry of Education Key Laboratory of Intelligent Computation and Signal Processing Anhui University Hefei China. Paige AI New York NY USA. Scientific Data Division and Biological Systems and Engineering Division Lawrence Berkeley National Lab Berkeley CA USA. Helen Wills Neuroscience Institute and Redwood Center for Theoretical Neuroscience UC Berkeley Berkeley CA USA. RIKEN AIP Tokyo Japan. Research Center for Advanced Science and Technology (RCAST) The University of Tokyo Tokyo Japan. School of Computer Science University of Sydney Sydney New South Wales Australia. Texas A&M University College Station TX USA. Cullen College of Engineering University of Houston Houston TX USA. Graduate Institute of Biomedical Engineering National Taiwan University of Science and Technology Taipei Taiwan. National Centre for Computer Animation Bournemouth University Poole UK. PROPHESEE Paris France. Department of Neuroscience Columbia University New York NY USA. Mortimer B. Zuckerman Mind Brain Behavior Institute Columbia University New York NY USA. Department of Computer Science Northern Illinois Universit

BigNeuron is an open community bench-testing platform with the goal of setting open standards for accurate and fast automatic neuron tracing. We gathered a diverse set of image volumes across several species that is representative of the data obtained in many neuroscience laboratories interested in neuron tracing. Here, we report generated gold standard manual annotations for a subset of the available imaging datasets and quantified tracing quality for 35 automatic tracing algorithms. The goal of generating such a hand-curated diverse dataset is to advance the development of tracing algorithms and enable generalizable benchmarking. Together with image quality features, we pooled the data in an interactive web application that enables users and developers to perform principal component analysis, t-distributed stochastic neighbor embedding, correlation and clustering, visualization of imaging and tracing data, and benchmarking of automatic tracing algorithms in user-defined data subsets. The image quality metrics explain most of the variance in the data, followed by neuromorphological features related to neuron size. We observed that diverse algorithms can provide complementary information to obtain accurate results and developed a method to iteratively combine methods and generate consensus reconstructions. The consensus trees obtained provide estimates of the neuron structure ground truth that typically outperform single algorithms in noisy datasets. However, specific algorithms may outperform the consensus tree strategy in specific imaging conditions. Finally, to aid users in predicting the most accurate automatic tracing results without manual annotations for comparison, we used support vector machine regression to predict reconstruction quality given an image volume and a set of automatic tracings.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Multi-level spectral deferred corrections scheme for the shallow water equations on the rotating sphere

arXiv

引用

arXiv 2018年

作者： Hamona, François P. Schreiberb, Martin Miniond, Michael L. Center for Computational Sciences and Engineering Lawrence Berkeley National Laboratory Berkeley United States Department of Mathematics/Computer Science University of Exeter Exeter United Kingdom Computer Architecture and Parallel Systems Technical University of Munich Germany Department of Applied Mathematics Lawrence Berkeley National Laboratory Berkeley United States

Effcient time integration schemes are necessary to capture the complex processes involved in atmospheric ows over long periods of time. In this work, we propose a high-order, implicit-explicit numerical scheme that combines Multi-Level Spectral Deferred Corrections (MLSDC) and the Spherical Harmonics (SH) transform to solve the wave-propagation problems arising from the shallow-water equations on the rotating *** iterative temporal integration is based on a sequence of corrections distributed on coupled spacetime levels to perform a significant portion of the calculations on a coarse representation of the problem and hence to reduce the time-to-solution while preserving accuracy. In our scheme, referred to as MLSDCSH, the spatial discretization plays a key role in the efficiency of MLSDC, since the SH basis allows for consistent transfer functions between space-time levels that preserve important physical properties of the *** study the performance of the MLSDC-SH scheme with shallow-water test cases commonly used in numerical atmospheric modeling. We use this suite of test cases, which gradually adds more complexity to the nonlinear system of governing partial differential equations, to perform a detailed analysis of the accuracy of MLSDC-SH upon renement in time. We illustrate the stability properties of MLSDC-SH and show that the proposed scheme achieves up to eighth-order convergence in time. Finally, we study the conditions in which MLSDC-SH achieves its theoretical speedup, and we show that it can significantlyreduce the computational cost compared to single-level Spectral Deferred Corrections (SDC). Copyright © 2018, The Authors. All rights reserved.

关键词： Harmonic analysis

来源：评论

学校读者我要写书评

暂无评论

HIGH THROUGHPUT IMAGE CODEC FOR HIGH-RESOLUTION SATELLITE IMAGES

HIGH THROUGHPUT IMAGE CODEC FOR HIGH-RESOLUTION SATELLITE IM...

引用

IEEE International Geoscience and Remote Sensing Symposium

作者： Carlos de Cea-Dominguez P. Enfedaque Juan C. Moure Joan Bartrina-Rapesta Francesc Auli-Llinas Department of Information and Communications Engineering Universitat Autònoma de Barcelona Spain Department of Computer Architecture and Operating Systems Universitat Autònoma de Barcelona Spain Computational Research Division Lawrence Berkeley National Laboratory

The growth in the use of satellite images has generated the need for their fast compression, processing, and distribution. JPEG2000 is a widespread standard for the compression and transmission of such images once they are in the ground. Despite its advanced features and excellent coding performance, JPEG2000 demands significant computational resources. This paper introduces a wavelet-based codec that uses the JPEG2000 framework, but replaces its most computationally demanding coding stage by a highly parallel engine. When executed in Graphics Processing Units to code high-resolution satellite images, the proposed codec achieves speed-ups of up to 8× when compared to the fastest implementation of JPEG2000 executed in a multi-core platform.

关键词： High throughput image coding Bitplane image coding JPEG2000

来源：评论

学校读者我要写书评

暂无评论

AGlobal benchmark of algorithms for segmentinglate gadolinium-enhanced cardiac magnetic resonance imaging

arXiv

引用

arXiv 2020年

作者： Xiong, Zhaohan Xia, Qing Hu, Zhiqiang Huang, Ning Bian, Cheng Zheng, Yefeng Vesal, Sulaiman Ravikumar, Nishant Maier, Andreas Yang, Xin Heng, Pheng-Ann Ni, Dong Li, Caizi Tong, Qianqian Si, Weixin Puybareau, Elodie Khoudli, Younes Géraud, Thierry Chen, Chen Bai, Wenjia Rueckert, Daniel Xu, Lingchao Zhuang, Xiahai Luo, Xinzhe Jia, Shuman Sermesant, Maxime Liu, Yashu Wang, Kuanquan Borra, Davide Masci, Alessandro Corsi, Cristiana De Vente, Coen Veta, Mitko Karim, Rashed Preetha, Chandrakanth Jayachandran Engelhardt, Sandy Qiao, Menyun Wang, Yuanyuan Tao, Qian Nuñez-Garcia, Marta Camara, Oscar Savioli, Nicolo Lamata, Pablo Zhao, Jichao Auckland Bioengineering Institute University of Auckland Auckland New Zealand State Key Lab of Virtual Reality Technology and Systems Beihang University Beijing China School of Electronics Engineering and Computer Science Peking University Beijing China SenseTime Inc Shenzhen China Tencent Jarvis Laboratory Shenzhen China Pattern Recognition Lab Friedrich-Alexander-Universität Erlangen-Nürnberg Erlangen Germany Department of Computer Science and Engineering Chinese University of Hong Kong Hong Kong National-Regional Key Technology Engineering Laboratory for Medical Ultrasound School of Biomedical Engineering Shenzhen University Shenzhen China School of Computer Science Wuhan University Wuhan China Shenzhen Key Laboratory of Virtual Reality and Human Interaction Technology Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences Shenzhen China Epita Research and Development Laboratory Paris France Department of Computing Imperial College London London United Kingdom School of Naval Architecture Shanghai Jiao Tong University Ocean & Civil Engineering Shanghai China School of Data Science Fudan University Shanghai China Epione Research Group Universite Cote d'Azur Inria Sophia Antipolis France Harbin Institute of Technology School of Computer Science and Technology Harbin China Department of Electric University of Bologna Electronic and Information Engineering Cesena Italy Department of Biomedical Engineering Eindhoven University of Technology Eindhoven Netherlands School of Biomedical Engineering and Imaging Sciences Kings College London London United Kingdom Faculty of Electrical Engineering and Information Technology University of Magdeburg Magdeburg Germany Heidelberg University Hospital Germany Biomedical Engineering Center Fudan University Shanghai China Department of Radiology Leiden University Medical Center Leiden Netherlands Department of Information and Communication Technologies Universitat Pompeu Fabra Barcelona Spain D

Segmentation of cardiac images, particularly late gadolinium-enhanced magnetic resonance imaging (LGE-MRI)widely used for visualizing diseased cardiacstructures, is a crucial first step for clinical diagnosis and treatment. However, direct segmentation ofLGE-MRIsischallenging due to *** most clinical studies have relied on manual and labor-intensive approaches, automatic methods are of high interest, particularly optimized machine learning *** address this, we organized the "2018 Left Atrium Segmentation Challenge" using 154 3D LGE-MRIs, currently the world's largest cardiac LGE-MRI dataset, and associated labels of the left atriumsegmented by three medical experts,ultimately attractingthe participation of27 international teams. In this paper, extensive analysis of the submitted algorithms using technical and biological metrics was performed by undergoing subgroup analysis and conducting hyper-parameter analysis,offeringan overall picture ofthe major design choices of convolutional neural networks(CNNs) and practical considerations for achieving state-of-the-art left atrium segmentation. Results show the top methodachieved a dice score of 93.2%and a mean surface to a surface distance of 0.7mm, significantly outperforming prior state-of-the-art. Particularly, our analysisdemonstrated that double, sequentially usedCNNs, in which a first CNN is used for automatic region-of-interestlocalization and a subsequent CNN is used for refinedregional segmentation, achieved far superiorresults than traditional methods and pipelinescontaining *** findings from this study can potentially be extended to other imaging datasets and modalities, having an impact on the wider medical imaging *** large-scale benchmarking study makes a significant step towards much-improved segmentation methods for cardiac LGE-MRIs, and will serveas animportant benchmark for evaluating and comparing the future works in the field. Copyright © 2020, Th

关键词： Magnetic resonance imaging

来源：评论

学校读者我要写书评

暂无评论

Tool Support for Restricted Use Case Specification: Findings from a Controlled Experiment

Tool Support for Restricted Use Case Specification: Findings...

引用

Asia-Pacific Conference on Software Engineering

作者： Markus Weninger Paul Grünbacher Huihui Zhang Tao Yue Shaukat Ali Christian Doppler Laboratory MEVSS Institute for System Software Johannes Kepler University Linz Austria Christian Doppler Laboratory MEVSS Institute for Software Systems Engineering Johannes Kepler University Linz Austria School of Computer Engineering Weifang University China Simula Research Laboratory Norway Information Systems Architecture Science Research Division National Institute of Informatics Tokyo Japan

ISBN: (纸本)9781728119717;9781728119700

Evidence has shown that the use of restricted natural languages can reduce ambiguities in textual use case specifications (UCSs). Restricted natural languages often come with specific editors that support particular use case templates and provide enforcement of the language's restrictions. However, whether restriction enforcement facilitates the definition of UCSs as compared to an editor without such support is a fundamental question to answer. To this end, we report results of a controlled experiment in which we compared two approaches for defining restricted UCSs: (i) a specific Restricted Use Case Modeling (RUCM) tool that supports restriction enforcement; and (ii) a general Office Word UCS template without such enforcement. We compared both approaches from multiple perspectives including restriction misuse, understandability, and restrictiveness. Results show that the restriction misuse rates are generally low, which indicates the usefulness of the RUCM, independent of the use of the editors. The results also indicate that the RUCM tool eases the application of more complex restrictions. We also found that the participants profited from extensive training prior to the experiment. The experiment participants further showed their strong willingness to recommend the RUCM tool to others and to use it in the future, which was not the case for the Office Word template.

关键词： Tools Unified modeling language Task analysis Analytical models Software engineering Training Natural languages

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：