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

arXiv 2018年

作者： Zhang, Dongqing Icke, Ilknur Dogdas, Belma Parimal, Sarayu Sampath, Smita Forbes, Joseph Bagchi, Ansuman Chin, Chih-Liang Chen, Antong Applied Mathematics and Modeling Merck & Co. Inc. West PointPA United States Department of Electrical Engineering and Computer Science Vanderbilt University NashvilleTN United States Scientific Informatics Merck & Co. Inc. BostonMA United States Applied Mathematics and Modeling Merck & Co. Inc. RahwayNJ United States Translational Biomarkers Merck Sharp & Dohme Singapore High Performance Computing Merck & Co. Inc. West PointPA United States Merck & Co. Inc. West PointPA United States

Automatic segmentation of left ventricle (LV) myocardium in cardiac short-axis cine MR images acquired on subjects with myocardial infarction is a challenging task, mainly because of the various types of image inhomogeneity caused by the infarctions. Among the approaches proposed to automate the LV myocardium segmentation task, methods based upon deep convolutional neural networks (CNN) have demonstrated their exceptional accuracy and robustness in recent years. However, most of the CNN-based approaches treat the frames in a cardiac cycle independently, which fails to capture the valuable dynamics of heart motion. Herein, an approach based on recurrent neural network (RNN), specifically a multi-level convolutional long short-term memory (ConvLSTM) model, is proposed to take the motion of the heart into consideration. Based on a ResNet-56 CNN, LV-related image features in consecutive frames of a cardiac cycle are extracted at both the low- and high-resolution levels, which are processed by the corresponding multi-level ConvLSTM models to generate the myocardium segmentations. A leave-one-out experiment was carried out on a set of 3,600 cardiac cine MR slices collected in-house for 8 porcine subjects with surgically induced myocardial infarction. Compared with a solely CNN-based approach, the proposed approach demonstrated its superior robustness against image inhomogeneity by incorporating information from adjacent frames. It also outperformed a one-level ConvLSTM approach thanks to its capabilities to take advantage of image features at multiple resolution levels. Copyright © 2018, The Authors. All rights reserved.

关键词： Heart

来源：评论

学校读者我要写书评

暂无评论

GRAPE: Genetic routine for astronomical period estimation

arXiv

引用

arXiv 2018年

作者： McWhirter, Paul R. Steele, Iain A. Hussain, Abir Al-Jumeily, Dhiya Vellasco, Marley M.B.R. Astrophysics Research Institute LJMU IC2 Liverpool Science Park 146 Brownlow Hill LiverpoolL3 5RF United Kingdom Applied Computing Research Group Department of Computer Science LJMU James Parsons Building 3 Byrom Street LiverpoolL3 3AF United Kingdom Pontifícia Universidade Católica Do Rio de Janeiro R. Marquês de São Vicente 225 Gávea Rio de Janeiro - RJ22451-900 Brazil

Period estimation is an important task in the classification of many variable astrophysical objects. Here we present GRAPE: Genetic Routine for Astronomical Period Estimation, a genetic algorithm optimised for the processing of survey data with spurious and aliased artefacts. It uses a Bayesian Generalised Lomb-Scargle (BGLS) fitness function designed for use with the Skycam survey conducted at the Liverpool Telescope. We construct a set of simulated light curves using both regular and Skycam survey cadence with four types of signal: sinusoidal, sawtooth, symmetric eclipsing binary and eccentric eclipsing binary. We apply GRAPE and a BGLS periodogram to this data and show that the performance of GRAPE is superior to the periodogram on sinusoidal and sawtooth light curves with relative hit rate improvement of 18.2% and 6.4% respectively. The symmetric and eccentric eclipsing binary light curves have similar performance on both *** show the Skycam cadence is sufficient to correctly estimate the period for all of the sinusoidal shape light curves although this degrades with increased non-sinusoidal shape with sawtooth, symmetric binary and eccentric binary light curves down by 20%, 30% and 35% respectively. The runtime of GRAPE demonstrates that light curves with more than 500-1000 data points achieve similar performance in less computing time. The GRAPE performance can be matched by a frequency spectrum with an oversampled fine-tuning grid at the cost of almost doubling the runtime. Finally, we propose improvements which will extend this method to the detection of quasiperiodic signals and the use of multiband light curves. Copyright © 2018, The Authors. All rights reserved.

关键词： Surveys

来源：评论

学校读者我要写书评

暂无评论

The robustness of LWPP and WPP, with an application to graph reconstruction

arXiv

引用

arXiv 2017年

作者： Hemaspaandra, Edith Hemaspaandra, Lane A. Spakowski, Holger Watanabe, Osamu Department of Computer Science Rochester Institute of Technology RochesterNY14623 United States Department of Computer Science University of Rochester RochesterNY14627 United States Department of Mathematics and Applied Mathematics University of Cape Town Rondebosch7701 South Africa Dept. of Mathematical and Computing Sciences Tokyo Institute of Technology Tokyo152-8552 Japan

We show that the counting class LWPP [FFK94] remains unchanged even if one allows a polynomial number of gap values rather than one. On the other hand, we show that it is impossible to improve this from polynomially many gap values to a superpolynomial number of gap values by relativizable proof techniques. The first of these results implies that the Legitimate Deck Problem (from the study of graph reconstruction) is in LWPP (and thus low for PP, i.e., PPLegitimate Deck= PP) if the weakened version of the Reconstruction Conjecture holds in which the number of nonisomorphic preimages is assumed merely to be polynomially bounded. This strengthens the 1992 result of Köbler, Schöning, and Torán [KST92] that the Legitimate Deck Problem is in LWPP if the Reconstruction Conjecture holds, and provides strengthened evidence that the Legitimate Deck Problem is not NP-hard. We additionally show on the one hand that our main LWPP robustness result also holds for WPP, and also holds even when one allows both the rejection- and acceptance- gap-value targets to simultaneously be polynomial-sized lists;yet on the other hand, we show that for the #P-based analog of LWPP the behavior much differs in that, in some relativized worlds, even two target values already yield a richer class than one value does. Despite that nonrobustness result for a #P-based class, we show that the #P-based "exact counting" class C=P remains unchanged even if one allows a polynomial number of target values for the number of accepting paths of the machine. Copyright © 2017, The Authors. All rights reserved.

关键词： C (programming language)

来源：评论

学校读者我要写书评

暂无评论

Experimental design for non-parametric correction of misspecified dynamical models

arXiv

引用

arXiv 2017年

作者： Shulkind, Gal Horesh, Lior Avron, Haim Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology CambridgeMA United States Quantum Computing IBM TJ Watson Research Center Yorktown HeightsNY United States Department of Applied Mathematics Tel Aviv University Israel

We consider a class of misspecified dynamical models where the governing term is only approximately known. Under the assumption that observations of the system’s evolution are accessible for various initial conditions, our goal is to infer a non-parametric correction to the misspecified driving term such as to faithfully represent the system dynamics and devise system evolution predictions for unobserved initial conditions. We model the unknown correction term as a Gaussian Process and analyze the problem of efficient experimental design to find an optimal correction term under constraints such as a limited experimental budget. We suggest a novel formulation for experimental design for this Gaussian Process and show that approximately optimal (up to a constant factor) designs may be efficiently derived by utilizing results from the literature on submodular optimization. Our numerical experiments exemplify the effectiveness of these techniques.62K05, 37M05, 62G08, 68T05 Copyright © 2017, The Authors. All rights reserved.

关键词： Dynamical systems

来源：评论

学校读者我要写书评

暂无评论

Understanding abuse: A typology of abusive language detection subtasks

arXiv

引用

arXiv 2017年

作者： Waseem, Zeerak Davidson, Thomas Warmsley, Dana Weber, Ingmar Department of Computer Science University of Sheffield United Kingdom Department of Sociology Cornell University IthacaNY United States Center for Applied Mathematics Cornell University IthacaNY United States Qatar Computing Research Institute HBKU Doha Qatar

As the body of research on abusive language detection and analysis grows, there is a need for critical consideration of the relationships between different subtasks that have been grouped under this label. Based on work on hate speech, cyberbullying, and online abuse we propose a typology that captures central similarities and differences between subtasks and we discuss its implications for data annotation and feature construction. We emphasize the practical actions that can be taken by researchers to best approach their abusive language detection subtask of interest. Copyright © 2017, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Aztec: A platform to render biomedical software findable, accessible, interoperable, and reusable

arXiv

引用

arXiv 2017年

作者： Wang, Wei Bleakley, Brian Ju, Chelsea Kyi, Vincent Tan, Patrick Choi, Howard Huang, Xinxin Zhou, Yichao Wood, Justin Wang, Ding Bui, Alex Ping, Peipei Department of Computer Science Henry Samueli School of Engineering and Applied Science UCLA NIH BD2K Center of Excellence for Biomedical Computing UCLA Department of Physiology David Geffen School of Medicine UCLA Department of Radiology David Geffen School of Medicine UCLA Department of Medicine David Geffen School of Medicine UCLA

Precision medicine and health requires the characterization and phenotyping of biological systems and patient datasets using a variety of data formats. This scenario mandates the centralization of various tools and resources in a unified platform to render them Findable, Accessible, Interoperable, and Reusable (FAIR Principles). Leveraging these principles, Aztec provides the scientific community with a new platform that promotes a long-term, sustainable ecosystem of biomedical research software. Aztec is available at https://*** and its source code is hosted at https://***/BD2K-Aztec. Copyright © 2017, The Authors. All rights reserved.

关键词： computer software reusability

来源：评论

学校读者我要写书评

暂无评论

Tackling common due window problem with a two-layered approach 10th

Tackling common due window problem with a two-layered approa...

引用

10th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2016

作者： Awasthi, Abhishek Lässig, Jörg Weise, Thomas Kramer, Oliver Department of Computer Science University of Applied Sciences Zittau/Görlitz Görlitz Germany School of Computer Science and Technology University of Science and Technology of China HefeiAnhui China Department of Computing Science Carl von Ossietzky University of Oldenburg Oldenburg Germany

ISBN: (纸本)9783319487489

This work presents a polynomial algorithm to optimize any given job sequence for the Common Due-Window (CDW) Problem. The CDW problem comprises of scheduling and sequencing a set of jobs against a due-window to minimize the total weighted earliness/tardiness penalty. This due-window is defined by the left and right common duedates. Jobs that finish before (after) the left (right) due-date are termed as early (tardy) jobs. We present an exact polynomial algorithm for optimally scheduling a given fixed job sequence for a single machine with the runtime complexity of O(n), where n is the number of jobs. The linear algorithm and a heuristic based on the V-shaped property are then incorporated with a modified Simulated Annealing (SA) algorithm to obtain the optimal/near-optimal solutions. We carry out computational experiments to demonstrate the utility of our approach over the benchmark instances and previous work on this problem. © Springer International Publishing AG 2016.

关键词： Simulated annealing

来源：评论

学校读者我要写书评

暂无评论

Towards ontology-based program analysis 30

Towards ontology-based program analysis

引用

30th European Conference on Object-Oriented Programming, ECOOP 2016

作者： Zhao, Yue Chen, Guoyang Liao, Chunhua Shen, Xipeng Department of Computer Science North Carolina State University United States Center for Applied Scientific Computing Lawrence Livermore National Laboratory United States

ISBN: (纸本)9783959770149

Program analysis is fundamental for program optimizations, debugging, and many other tasks. But developing program analyses has been a challenging and error-prone process for general users. Declarative program analysis has shown the promise to dramatically improve the productivity in the development of program analyses. Current declarative program analysis is however subject to some major limitations in supporting cooperations among analysis tools, guiding program optimizations, and often requires much effort for repeated program preprocessing. In this work, we advocate the integration of ontology into declarative program analysis. As a way to standardize the definitions of concepts in a domain and the representation of the knowledge in the domain, ontology offers a promising way to address the limitations of current declarative program analysis. We develop a prototype framework named PATO for conducting program analysis upon ontology-based program representation. Experiments on six program analyses confirm the potential of ontology for complementing existing declarative program analysis. It supports multiple analyses without separate program preprocessing, promotes cooperative Liveness analysis between two compilers, and effectively guides a data placement optimization for Graphic Processing Units (GPU). © Yue Zhao and Chunhua Liao and Xipeng Shen;licensed under Creative Commons License CC-BY.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

On the Potential Galactic Origin of the Ultra-High-Energy Event KM3-230213A

arXiv

引用

arXiv 2025年

作者： Adriani, O. Aiello, S. Albert, A. Alhebsi, A.R. Alshamsi, M. Garre, S. Alves Ambrosone, A. Ameli, F. Andre, M. Aphecetche, L. Ardid, M. Ardid, S. Aublin, J. Badaracco, F. Bailly-Salins, L. Bardačová, Z. Baret, B. Bariego-Quintana, A. Becherini, Y. Bendahman, M. Gualandi, F. Benfenati Benhassi, M. Bennani, M. Benoit, D.M. Berbee, E. Berti, E. Bertin, V. Betti, P. Biagi, S. Boettcher, M. Bonanno, D. Bottai, S. Bouasla, A.B. Boumaaza, J. Bouta, M. Bouwhuis, M. Bozza, C. Bozza, R.M. Brânzaş, H. Bretaudeau, F. Breuhaus, M. Bruijn, R. Brunner, J. Bruno, R. Buis, E. Buompane, R. Busto, J. Caiffi, B. Calvo, D. Capone, A. Carenini, F. Carretero, V. Cartraud, T. Castaldi, P. Cecchini, V. Celli, S. Cerisy, L. Chabab, M. Chen, A. Cherubini, S. Chiarusi, T. Circella, M. Clark, R. Cocimano, R. Coelho, J.A.B. Coleiro, A. Condorelli, A. Coniglione, R. Coyle, P. Creusot, A. Cuttone, G. Dallier, R. De Benedittis, A. De Wasseige, G. Decoene, V. Deguire, P. Del Rosso, I. Di Mauro, L.S. Di Palma, I. Díaz, A.F. Diego-Tortosa, D. Distefano, C. Domi, A. Donzaud, C. Dornic, D. Drakopoulou, E. Drouhin, D. Ducoin, J.-G. Duverne, P. Dvornický, R. Eberl, T. Eckerová, E. Eddymaoui, A. van Eeden, T. Eff, M. van Eijk, D. Bojaddaini, I.El. Hedri, S.El. Mentawi, S.El. Ellajosyula, V. Enzenhöfer, A. Ferrara, G. Filipović, M.D. Filippini, F. Franciotti, D. Fusco, L.A. Gal, T. Méndez, J. García Soto, A. Garcia Oliver, C. Gatius Geißelbrecht, N. Genton, E. Ghaddari, H. Gialanella, L. Gibson, B.K. Giorgio, E. Goos, I. Goswami, P. Gozzini, S.R. Gracia, R. Guidi, C. Guillon, B. Gutiérrez, M. Haack, C. van Haren, H. Heijboer, A. Hennig, L. Hernández-Rey, J.J. Idrissi, A. Ibnsalih, W. Idrissi Illuminati, G. Janik, O. Joly, D. de Jong, M. de Jong, P. Jung, B.J. Kalaczyński, P. Keegans, J. Kikvadze, V. Kistauri, G. Kopper, C. Kouchner, A. Kovalev, Y.Y. Krupa, L. Kueviakoe, V. Kulikovskiy, V. Kvatadze, R. Labalme, M. Lahmann, R. INFN Sezione di Firenze via Sansone 1 Sesto Fiorentino50019 Italy Università di Firenze Dipartimento di Fisica e Astronomia via Sansone 1 Sesto Fiorentino50019 Italy Via Santa Sofia 64 Catania95123 Italy Université de Strasbourg CNRS IPHC UMR 7178 StrasbourgF-67000 France Université de Haute Alsace rue des Frères Lumière Mulhouse68093Cedex France Khalifa University of Science and Technology Department of Physics PO Box 127788 Abu Dhabi United Arab Emirates Aix Marseille Univ CNRS IN2P3 CPPM Marseille France c/Catedrático José Beltrán 2 Valencia Paterna46980 Spain Università di Napoli "Federico II" Dip. Scienze Fisiche "E. Pancini" Complesso Universitario di Monte S. Angelo Via Cintia ed. G Napoli80126 Italy INFN Sezione di Napoli Complesso Universitario di Monte S. Angelo Via Cintia ed. G Napoli80126 Italy INFN Sezione di Roma Piazzale Aldo Moro 2 Roma00185 Italy Universitat Politècnica de Catalunya Laboratori d’Aplicacions Bioacústiques Centre Tecnològic de Vilanova i la Geltrú Avda. Rambla Exposició s/n Vilanova i la Geltrú08800 Spain Subatech IMT Atlantique IN2P3 CNRS Nantes Université 4 rue Alfred Kastler - La Chantrerie BP Nantes20722 44307 France Universitat Politècnica de València Instituto de Investigación para la Gestión Integrada de las Zonas Costeras C/ Paranimf 1 Gandia46730 Spain Université Paris Cité CNRS Astroparticule et Cosmologie ParisF-75013 France INFN Sezione di Genova Via Dodecaneso 33 Genova16146 Italy Università di Genova Via Dodecaneso 33 Genova16146 Italy LPC CAEN Normandie Univ ENSICAEN UNICAEN CNRS IN2P3 6 boulevard Maréchal Juin Caen14050 France Comenius University in Bratislava Department of Nuclear Physics and Biophysics Mlynska dolina F1 Bratislava842 48 Slovakia Czech Technical University in Prague Institute of Experimental and Applied Physics Husova 240/5 Prague110 00 Czech Republic Università di Bologna Dipartimento di Fisica e Astronomia v.le C. Berti-Pichat 6/2

The KM3NeT observatory detected the most energetic neutrino candidate ever observed, with an energy between 72 PeV and 2.6 EeV at the 90 % confidence level. The observed neutrino is likely of cosmic origin. In this article, it is investigated if the neutrino could have been produced within the Milky Way. Considering the low fluxes of the Galactic diffuse emission at these energies, the lack of a nearby potential Galactic particle accelerator in the direction of the event and the difficulty to accelerate particles to such high energies in Galactic systems, we conclude that if the event is indeed cosmic, it is most likely of extragalactic origin. Copyright © 2025, The Authors. All rights reserved.

关键词： Neutrons

来源：评论

学校读者我要写书评

暂无评论

An arm length stabilization system for KAGRA and future gravitational-wave detectors

arXiv

引用

arXiv 2019年

作者： Akutsu, T. Ando, M. Arai, K. Arai, K. Arai, Y. Araki, S. Araya, A. Aritomi, N. Aso, Y. Bae, S. Bae, Y. Baiotti, L. Bajpai, R. Barton, M.A. Cannon, K. Capocasa, E. Chan, M. Chen, C. Chen, K. Chen, Y. Chu, H. Chu, Y.-K. Doi, K. Eguchi, S. Enomoto, Y. Flaminio, R. Fujii, Y. Fukunaga, M. Fukushima, M. Ge, G. Hagiwara, A. Haino, S. Hasegawa, K. Hayakawa, H. Hayama, K. Himemoto, Y. Hiranuma, Y. Hirata, N. Hirose, E. Hong, Z. Hsieh, B.H. Huang, G.-Z. Huang, P. Huang, Y. Ikenoue, B. Imam, S. Inayoshi, K. Inoue, Y. Ioka, K. Itoh, Y. Izumi, K. Jung, K. Jung, P. Kajita, T. Kamiizumi, M. Kanbara, S. Kanda, N. Kang, G. Kawaguchi, K. Kawai, N. Kawasaki, T. Kim, C. Kim, J.C. Kim, W.S. Kim, Y.-M. Kimura, N. Kita, N. Kitazawa, H. Kojima, Y. Kokeyama, K. Komori, K. Kong, A.K.H. Kotake, K. Kozakai, C. Kozu, R. Kumar, R. Kume, J. Kuo, C. Kuo, H.-S. Kuroyanagi, S. Kusayanagi, K. Kwak, K. Lee, H.K. Lee, H.W. Lee, R. Leonardi, M. Lin, L.C.-C. Lin, C.-Y. Lin, F.-L. Liu, G.C. Luo, L.-W. Marchio, M. Michimura, Y. Mio, N. Miyakawa, O. Miyamoto, A. Miyazaki, Y. Miyo, K. Miyoki, S. Morisaki, S. Moriwaki, Y. Musha, M. Nagano, K. Nagano, S. Nakamura, K. Nakano, H. Nakano, M. Nakashima, R. Narikawa, T. Negishi, R. Ni, W.-T. Nishizawa, A. Obuchi, Y. Ogaki, W. Oh, J.J. Oh, S.H. Ohashi, M. Ohishi, N. Ohkawa, M. Ohmae, N. Okutomi, K. Oohara, K. Ooi, C.P. Oshino, S. Pan, K. Pang, H. Park, J. Peña Arellano, F.E. Pinto, I. Sago, N. Saito, S. Saito, Y. Sakai, K. Sakai, Y. Sakuno, Y. Sato, S. Sato, T. Sawada, T. Sekiguchi, T. Sekiguchi, Y. Shibagaki, S. Shimizu, R. Shimoda, T. Shimode, K. Shinkai, H. Shishido, T. Shoda, A. Somiya, K. Son, E.J. Sotani, H. Sugimoto, R. Suzuki, T. Suzuki, T. Tagoshi, H. Takahashi, H. Takahashi, R. Takamori, A. Takano, S. Takeda, H. Takeda, M. Tanaka, H. Tanaka, K. Tanaka, K. Tanaka, T. Tanaka, T. Tanioka, S. San Martin, E.N. Tapia Mitaka City Tokyo181-8588 Japan Japan Department of Physics University of Tokyo Bunkyo-ku Tokyo113-0033 Japan University of Tokyo Bunkyo-ku Tokyo113-0033 Japan California Institute of Technology PasadenaCA91125 United States KAGRA Observatory University of Tokyo Kashiwa CityChiba277-8582 Japan Tsukuba CityIbaraki305-0801 Japan Earthquake Research Institute University of Tokyo Bunkyo-ku Tokyo113-0032 Japan Kamioka-cho Hida City Gifu506-1205 Japan Mitaka City Tokyo181-8588 Japan Yuseong-gu Daejeon34141 Korea Republic of National Institute for Mathematical Sciences Daejeon34047 Korea Republic of Department of Earth and Space Science Graduate School of Science Osaka University Toyonaka CityOsaka560-0043 Japan Tsukuba CityIbaraki305-0801 Japan Department of Applied Physics Fukuoka University Jonan Fukuoka CityFukuoka814-0180 Japan Department of Physics Tamkang University Danshui Dist. New Taipei City25137 Taiwan Department of Physics and Institute of Astronomy National Tsing Hua University Hsinchu30013 Taiwan Department of Physics Center for High Energy and High Field Physics National Central University Zhongli District Taoyuan City32001 Taiwan Institute of Physics Academia Sinica Nankang Taipei11529 Taiwan Department of Physics University of Toyama Toyama CityToyama930-8555 Japan Université Savoie Mont Blanc CNRS/IN2P3 AnnecyF-74941 France Department of Astronomy University of Tokyo Mitaka City Tokyo181-8588 Japan Chinese Academy of Sciences Xiaohongshan Wuhan430071 China Tsukuba CityIbaraki305-0801 Japan KAGRA Observatory University of Tokyo Kamioka-cho Hida City Gifu506-1205 Japan College of Industrial Technology Nihon University Narashino CityChiba275-8575 Japan Graduate School of Science and Technology Niigata University Nishi-ku Niigata City Niigata950-2181 Japan Department of Physics National Taiwan Normal University Taipei116 Taiwan University of Tokyo Kashiwa Ci

Modern ground-based gravitational wave (GW) detectors require a complex interferometer configuration with multiple coupled optical cavities. Since achieving the resonances of the arm cavities is the most challenging among the lock acquisition processes, the scheme called arm length stabilization (ALS) had been employed for lock acquisition of the arm cavities. We designed a new type of the ALS, which is compatible with the interferometers having long arms like the next generation GW detectors. The features of the new ALS are that the control configuration is simpler than those of previous ones and that it is not necessary to lay optical fibers for the ALS along the kilometer-long arms of the detector. Along with simulations of its noise performance, an experimental test of the new ALS was performed utilizing a single arm cavity of KAGRA. This paper presents the first results of the test where we demonstrated that lock acquisition of the arm cavity was achieved using the new ALS. We also demonstrated that the root mean square of residual noise was measured to be 8.2 Hz in units of frequency, which is smaller than the linewidth of the arm cavity and thus low enough to lock the full interferometer of KAGRA in a repeatable and reliable manner. Copyright © 2019, The Authors. All rights reserved.

关键词： Interferometers

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：