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

Dress image retrieval based on improvement of deep learning

ICIC Express Letters, Part B: Applications 2016年第6期7卷 1371-1376页

作者： Zhang, Yang Fu, Jinhua College of Mathematics and Information Science Zhengzhou University of Light Industry No. 5 Dongfeng Road Zhengzhou450002 China State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou Information Science and Technology Institute Zhengzhou450000 China School of Computer and Communication Engineering Zhengzhou University of Light Industry No. 5 Dongfeng Road Zhengzhou450002 China

Online dress shopping is becoming an increasingly popular way of shopping and nowadays image-based dress retrieval plays an important role in identifying their favorite items for customers. In this paper, we present an efficient retrieval of dress image via improvement of deep learning. The deep learning is usually realized by convolutional neural networks (CNNs). We design the CNN by four sublayers followed by an output, which gives a retrieval of dress image. Further, we improve CNN by activation function to induce the sparsity in the hidden units. The deep network can be efficiently trained using the improvement. The results show that the matching results can be efficiently acquired, which proves the effectiveness of our method such as accuracy and computation complexity. © 2016 ICIC International.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

A novel genetic algorithm for constructing uniform test forms of cognitive diagnostic models

A novel genetic algorithm for constructing uniform test form...

引用

Congress on Evolutionary Computation

作者： Ye-shi Jiang Ying Lin Jing-Jing Li Zheng-jia Dai Jun Zhang Xinglin Zhang Ministry of Education Key Laboratory of Machine Intelligence - & Sensor Networks P.R. China School of Data & Computer Science Sun Yat-sen University School of Computer Science South China Normal University Department of Psychology Sun Yat-sen University State Key Laboratory of Mathematical Engineering and Advanced Computing School of Comouter Science & Engineering South China University of Technology

Cognitive diagnostic models (CDMs) are a new class of test models developed for educational assessment. They have gained growing attention in recent years for their distinctive ability to provide detailed feedback about examinees' ability. Automatic test assembly (ATA), as in other test models, has been one of the most critical issues in the development and applications of CDMs. However, developing ATA methods for CDMs is especially challenging because no close-form expressions can measure the quality of a test form based on the items used. Although some heuristic methods have been proposed for building a single test form of CDMs, few ATA methods can construct uniform test forms of CDMs, in which each test form contains a different set of items but meets equivalent demand of test quality. In order to fill the gap, this paper proposes a novel genetic algorithm (GA) for constructing uniform test forms of CDMs. The effectiveness and efficiency of the proposed method is validated on a synthetic item pool under different conditions.

关键词： Genetic algorithms Error analysis Biological cells Computational modeling Sociology Statistics Computer science

来源：评论

学校读者我要写书评

暂无评论

A Parallel Line Search Subspace Correction Method for Composite Convex Optimization

引用

Journal of the Operations Research Society of China 2015年第2期3卷 163-187页

作者： Qian Dong Xin Liu Zai-Wen Wen Ya-Xiang Yuan State Key Laboratory of Scientific and Engineering Computing Academy of Mathematics and Systems ScienceChinese Academy of SciencesBeijingChina Beijing International Center for Mathematical Research Peking UniversityBeijingChina

In this paper,we investigate a parallel subspace correction framework for composite convex *** variables are first divided into a few blocks based on certain *** each iteration,the algorithms solve a suitable subproblem on each block simultaneously,construct a search direction by combining their solutions on all blocks,then identify a new point along this direction using a step size satisfying the Armijo line search *** are called PSCLN and PSCLO,respectively,depending on whether there are overlapping regions between two imme-diately adjacent blocks of *** convergence is established under mild *** compare PSCLN and PSCLO with the parallel version of the fast iterative thresholding algorithm and the fixed-point continuation method using the Barzilai-Borwein step size and the greedy coordinate block descent method for solving the l1-regularized minimization *** numerical results showthatPSCLN andPSCLOcan run fast and return solutions notworse than those from the state-of-theart algorithms on most test *** is also observed that the overlapping domain decomposition scheme is helpful when the data of the problem has certain special structures.

关键词： Line search Block coordinate descent method Domain decomposition Jacobian-type iteration Distributed optimization

来源：评论

学校读者我要写书评

暂无评论

Erratum to: Search for diboson resonances in hadronic final states in 139 fb−1 of pp collisions at = 13 TeV with the ATLAS detector

引用

Journal of High Energy Physics 2020年第6期2020卷 1-19页

作者： Aad, G. Abbott, B. Abbott, D. C. Abdinov, O. Abed Abud, A. Abeling, K. Abhayasinghe, D. K. Abidi, S. H. AbouZeid, O. S. Abraham, N. L. Abramowicz, H. Abreu, H. Abulaiti, Y. Acharya, B. S. Achkar, B. Adachi, S. Adam, L. Adam Bourdarios, C. Adamczyk, L. Adamek, L. Adelman, J. Adersberger, M. Adiguzel, A. Adorni, S. Adye, T. Affolder, A. A. Afik, Y. Agapopoulou, C. Agaras, M. N. Aggarwal, A. Agheorghiesei, C. Aguilar-Saavedra, J. A. Ahmadov, F. Ahmed, W. S. Ai, X. Aielli, G. Akatsuka, S. Åkesson, T. P. A. Akilli, E. Akimov, A. V. Al Khoury, K. Alberghi, G. L. Albert, J. Alconada Verzini, M. J. Alderweireldt, S. Aleksa, M. Aleksandrov, I. N. Alexa, C. Alexandre, D. Alexopoulos, T. Alfonsi, A. Alhroob, M. Ali, B. Alimonti, G. Alison, J. Alkire, S. P. Allaire, C. Allbrooke, B. M. M. Allen, B. W. Allport, P. P. Aloisio, A. Alonso, A. Alonso, F. Alpigiani, C. Alshehri, A. A. Alvarez Estevez, M. Álvarez Piqueras, D. Alviggi, M. G. Amaral Coutinho, Y. Ambler, A. Ambroz, L. Amelung, C. Amidei, D. Amor Dos Santos, S. P. Amoroso, S. Amrouche, C. S. An, F. Anastopoulos, C. Andari, N. Andeen, T. Anders, C. F. Anders, J. K. Andreazza, A. Andrei, V. Anelli, C. R. Angelidakis, S. Angerami, A. Anisenkov, A. V. Annovi, A. Antel, C. Anthony, M. T. Antonelli, M. Antrim, D. J. A. Anulli, F. Aoki, M. Aparisi Pozo, J. A. Aperio Bella, L. Arabidze, G. Araque, J. P. Araujo Ferraz, V. Araujo Pereira, R. Arcangeletti, C. Arce, A. T. H. Arduh, F. A. Arguin, J-F. Argyropoulos, S. Arling, J.-H. Armbruster, A. J. Armitage, L. J. Armstrong, A. Arnaez, O. Arnold, H. Artamonov, A. Artoni, G. Artz, S. Asai, S. Asbah, N. Asimakopoulou, E. M. Asquith, L. Assamagan, K. Astalos, R. Atkin, R. J. Atkinson, M. Atlay, N. B. Atmani, H. Augsten, K. Avolio, G. Avramidou, R. Ayoub, M. K. Azoulay, A. M. Azuelos, G. Baca, M. J. Bachacou, H. Bachas, K. Backes, M. Backman, F. Bagnaia, P. Bahmani, M. Bahrasemani, H. Bailey, A. J. Bailey, V. R. Baines, J. T. Bajic, M. Bakalis, C. Baker, O. K. Bakker, P. J. Bakshi Gupta, D. Balaji, S. Baldin, E. M. Balek, P. Balli, F. CPPM Aix-Marseille Université CNRS/IN2P3 Marseille France Homer L. Dodge Department of Physics and Astronomy University of Oklahoma Norman United States of America Department of Physics University of Massachusetts Amherst United States of America Institute of Physics Azerbaijan Academy of Sciences Baku Azerbaijan INFN Sezione di Pavia Pavia Italy Dipartimento di Fisica Università di Pavia Pavia Italy II. Physikalisches Institut Georg-August-Universität Göttingen Göttingen Germany Department of Physics Royal Holloway University of London Egham United Kingdom Department of Physics University of Toronto Toronto Canada Niels Bohr Institute University of Copenhagen Copenhagen Denmark Department of Physics and Astronomy University of Sussex Brighton United Kingdom Raymond and Beverly Sackler School of Physics and Astronomy Tel Aviv University Tel Aviv Israel Department of Physics Technion Israel Institute of Technology Haifa Israel High Energy Physics Division Argonne National Laboratory Argonne United States of America INFN Gruppo Collegato di Udine Sezione di Trieste Udine Italy ICTP Trieste Italy Department of Physics King’s College London London United Kingdom International Center for Elementary Particle Physics and Department of Physics University of Tokyo Tokyo Japan Institut für Physik Universität Mainz Mainz Germany LAL Université Paris-Sud CNRS/IN2P3 Université Paris-Saclay Orsay France AGH University of Science and Technology Faculty of Physics and Applied Computer Science Krakow Poland Department of Physics Northern Illinois University DeKalb United States of America Fakultät für Physik Ludwig-Maximilians-Universität München München Germany Department of Physics Bogazici University Istanbul Turkey Istanbul University Dept. of Physics Istanbul Turkey Département de Physique Nucléaire et Corpusculaire Université de Genève Genève Switzerland Particle Physics Department Rutherford Appleton Laboratory Didcot United Kingdom Santa Cr

A mistake was identified for the paper [1] in the treatment of the radion [2] cross-sections, which resulted in multiple changes.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Prominence of Pairing in Inclusive (p,2p) and (p,pn) Cross Sections from Neutron-Rich Nuclei

引用

Physical Review Letters 2019年第16期122卷 162503-162503页

作者： N. Paul A. Obertelli C. A. Bertulani A. Corsi P. Doornenbal J. L. Rodriguez-Sanchez G. Authelet H. Baba D. Calvet F. Château S. Chen A. Delbart J.-M. Gheller A. Giganon A. Gillibert T. Isobe V. Lapoux M. Matsushita S. Momiyama T. Motobayashi M. Niikura H. Otsu C. Péron A. Peyaud E. C. Pollacco J.-Y. Roussé H. Sakurai C. Santamaria M. Sasano Y. Shiga D. Steppenbeck S. Takeuchi R. Taniuchi T. Uesaka H. Wang K. Yoneda T. Ando T. Arici A. Blazhev F. Browne A. M. Bruce R. Carroll L. X. Chung M. L. Cortés M. Dewald B. Ding Zs. Dombradi F. Flavigny S. Franchoo F. Giacoppo M. Górska A. Gottardo K. Hadynska-Klek Z. Korkulu S. Koyama Y. Kubota A. Jungclaus J. Lee M. Lettmann B. D. Linh J. Liu Z. Liu C. Lizarazo C. Louchart R. Lozeva K. Matsui T. Miyazaki K. Moschner S. Nagamine N. Nakatsuka C. Nita S. Nishimura C. R. Nobs L. Olivier S. Ota Z. Patel Zs. Podolyák M. Rudigier E. Sahin T. Y. Saito C. Shand P.-A. Söderström I. G. Stefan T. Sumikama D. Suzuki R. Orlandi V. Vaquero Zs. Vajta V. Werner K. Wimmer J. Wu Z. Xu IRFU CEA Université Paris–Saclay F-91191 Gif-sur-Yvette France RIKEN Nishina Center 2-1 Hirosawa Wako Saitama 351-0198 Japan Institut für Kernphysik Technische Universität Darmstadt D-64289 Darmstadt Germany Department of Physics and Astronomy Texas A&M University-Commerce Commerce Texas 75429-3011 USA GSI Helmholtzzentrum für Schwerionenforschung GmbH D-64291 Darmstadt Germany School of Physics and State Key Laboratory of Nuclear Physics and Technology Peking University Beijing 100871 People’s Republic of China Center for Nuclear Study The University of Tokyo RIKEN campus Wako Saitama 351-0198 Japan Department of Physics The University of Tokyo 7-3-1 Hongo Bunkyo Tokyo 113-0033 Japan Nuclear Science Division Lawrence Berkeley National Laboratory Berkeley California 94720 USA Department of Physics Rikkyo University 3-34-1 Nishi-Ikebukuro Toshima Tokyo 172-8501 Japan Justus-Liebig-Universität Giessen D-35392 Giessen Germany Institut für Kernphysik Universität zu Köln D-50937 Köln Germany School of Computing Engineering and Mathematics University of Brighton Brighton England BN2 4GJ United Kingdom Department of Physics University of Surrey Guildford England GU2 7XH United Kingdom Institute for Nuclear Science and Technology VINATOM P.O. Box 5T-160 Nghia Do Hanoi Vietnam Institute of Modern Physics Chinese Academy of Sciences Lanzhou 730000 People’s Republic of China MTA Atomki P.O. Box 51 Debrecen H-4001 Hungary Institut de Physique Nucléaire CNRS-IN2P3 Université Paris–Sud Université Paris–Saclay F-91406 Orsay Cedex France Department of Physics University of Oslo N-0316 Oslo Norway Instituto de Estructura de la Materia CSIC 28006 Madrid Spain Department of Physics The University of Hong Kong Pokfulam Hong Kong IPHC CNRS/IN2P3 Université de Strasbourg F-67037 Strasbourg France CSNSM CNRS/IN2P3 Université Paris–Sud F-91405 Orsay Campus France Department of Physics Faculty of Science Kyoto University Kyoto 606-8502 Japan Horia H

Fifty-five inclusive single nucleon-removal cross sections from medium mass neutron-rich nuclei impinging on a hydrogen target at ∼250 MeV/nucleon are measured at the RIKEN Radioactive Isotope Beam Factory. Systematically higher cross sections are found for proton removal from nuclei with an even number of protons as compared to odd-proton number projectiles for a given neutron separation energy. Neutron removal cross sections display no even-odd splitting, contrary to nuclear cascade model predictions. Both effects are understood through simple considerations of neutron separation energies and bound state level densities originating in pairing correlations in the daughter nuclei. These conclusions are supported by comparison with semimicroscopic model predictions, highlighting the enhanced role of low-lying level densities in nucleon-removal cross sections from loosely bound nuclei.

关键词： Direct reactions H & He induced nuclear reactions

来源：评论

学校读者我要写书评

暂无评论

GPU-based simulation of ocean water using fluid dynamics model and displacement mapping

引用

ICIC Express Letters 2016年第6期10卷 1239-1245页

作者： Xu, Jie Fu, Jinhua Zhang, Hongtao School of Software Zhengzhou University of Light Industry No. 5 Dongfeng Road Zhengzhou450002 China State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou450002 China School of Computer and Communication Engineering Zhengzhou University of Light Industry No. 5 Dongfeng Road Zhengzhou450002 China College of Information Engineering Zhengzhou University No. 100 Kexue Ave. Zhengzhou450000 China

Real-time realistic simulation of liquids like ocean water is an important task nowadays in the field of computer graphics. In this paper, we present a novel method to achieve plausible visual results of ocean water at higher rendering rates. Based on evolution of the density and the velocity, we establish the fluid dynamics model to express properties of the fluid and simulate ocean water efficiently. Also we implement the displacement mapping by utilizing the heightmap and design the shading shader on the GPU (Graphics Processing Unit), which gives a realistic appearance in higher rendering speed. The results show that we can acquire realistic rendering effects such as water color, light reflection, caustics and soft shadow, while achieving a relatively faster speed of rendering. © 2016 ISSN.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Ultralight vector dark matter search using data from the KAGRA O3GK run

引用

Physical Review D 2024年第4期110卷 042001页

作者： A. G. Abac R. Abbott H. Abe I. Abouelfettouh F. Acernese K. Ackley C. Adamcewicz S. Adhicary N. Adhikari R. X. Adhikari V. K. Adkins V. B. Adya C. Affeldt D. Agarwal M. Agathos O. D. Aguiar I. Aguilar L. Aiello A. Ain P. Ajith T. Akutsu S. Albanesi R. A. Alfaidi A. Al-Jodah C. Alléné A. Allocca S. Al-Shammari P. A. Altin S. Alvarez-Lopez A. Amato L. Amez-Droz A. Amorosi C. Amra S. Anand A. Ananyeva S. B. Anderson W. G. Anderson M. Andia M. Ando T. Andrade N. Andres M. Andrés-Carcasona T. Andrić J. Anglin S. Ansoldi J. M. Antelis S. Antier M. Aoumi E. Z. Appavuravther S. Appert S. K. Apple K. Arai A. Araya M. C. Araya J. S. Areeda N. Aritomi F. Armato N. Arnaud M. Arogeti S. M. Aronson K. G. Arun G. Ashton Y. Aso M. Assiduo S. Assis de Souza Melo S. M. Aston P. Astone F. Aubin K. AultONeal G. Avallone S. Babak F. Badaracco C. Badger S. Bae S. Bagnasco E. Bagui Y. Bai J. G. Baier R. Bajpai T. Baka M. Ball G. Ballardin S. W. Ballmer S. Banagiri B. Banerjee D. Bankar P. Baral J. C. Barayoga B. C. Barish D. Barker P. Barneo F. Barone B. Barr L. Barsotti M. Barsuglia D. Barta S. D. Barthelmy M. A. Barton I. Bartos S. Basak A. Basalaev R. Bassiri A. Basti M. Bawaj P. Baxi J. C. Bayley A. C. Baylor M. Bazzan B. Bécsy V. M. Bedakihale F. Beirnaert M. Bejger D. Belardinelli A. S. Bell V. Benedetto D. Beniwal W. Benoit J. D. Bentley M. Ben Yaala S. Bera M. Berbel F. Bergamin B. K. Berger S. Bernuzzi M. Beroiz D. Bersanetti A. Bertolini J. Betzwieser D. Beveridge N. Bevins R. Bhandare U. Bhardwaj R. Bhatt D. Bhattacharjee S. Bhaumik S. Bhowmick A. Bianchi I. A. Bilenko G. Billingsley A. Binetti S. Bini O. Birnholtz S. Biscoveanu A. Bisht M. Bitossi M.-A. Bizouard J. K. Blackburn C. D. Blair D. G. Blair F. Bobba N. Bode G. Bogaert G. Boileau M. Boldrini G. N. Bolingbroke A. Bolliand L. D. Bonavena R. Bondarescu F. Bondu E. Bonilla M. S. Bonilla A. Bonino R. Bonnand P. Booker A. Borchers V. Boschi S. Bose V. Bossilkov V. Boudart A. Boumerdassi A. Bozzi C. Bradaschia P. R. Brady M. Braglia A. Branch M. Branchesi M. Breschi T. B Max Planck Institute for Gravitational Physics (Albert Einstein Institute) D-14476 Potsdam Germany LIGO Laboratory California Institute of Technology Pasadena California 91125 USA Graduate School of Science Tokyo Institute of Technology 2-12-1 Ookayama Meguro-ku Tokyo 152-8551 Japan LIGO Hanford Observatory Richland Washington 99352 USA Dipartimento di Farmacia Università di Salerno I-84084 Fisciano Salerno Italy INFN Sezione di Napoli I-80126 Napoli Italy University of Warwick Coventry CV4 7AL United Kingdom OzGrav School of Physics & Astronomy Monash University Clayton 3800 Victoria Australia The Pennsylvania State University University Park Pennsylvania 16802 USA University of Wisconsin-Milwaukee Milwaukee Wisconsin 53201 USA Louisiana State University Baton Rouge Louisiana 70803 USA OzGrav Australian National University Canberra Australian Capital Territory 0200 Australia Max Planck Institute for Gravitational Physics (Albert Einstein Institute) D-30167 Hannover Germany Leibniz Universität Hannover D-30167 Hannover Germany Inter-University Centre for Astronomy and Astrophysics Pune 411007 India University of Cambridge Cambridge CB2 1TN United Kingdom Instituto Nacional de Pesquisas Espaciais 12227-010 São José dos Campos São Paulo Brazil Stanford University Stanford California 94305 USA Cardiff University Cardiff CF24 3AA United Kingdom INFN Sezione di Pisa I-56127 Pisa Italy International Centre for Theoretical Sciences Tata Institute of Fundamental Research Bengaluru 560089 India Gravitational Wave Science Project National Astronomical Observatory of Japan 2-21-1 Osawa Mitaka City Tokyo 181-8588 Japan Advanced Technology Center National Astronomical Observatory of Japan 2-21-1 Osawa Mitaka City Tokyo 181-8588 Japan Dipartimento di Fisica Università degli Studi di Torino I-10125 Torino Italy INFN Sezione di Torino I-10125 Torino Italy SUPA University of Glasgow Glasgow G12 8QQ United Kingdom OzGrav University of Western Austral

Among the various candidates for dark matter (DM), ultralight vector DM can be probed by laser interferometric gravitational wave detectors through the measurement of oscillating length changes in the arm cavities. In this context, KAGRA has a unique feature due to differing compositions of its mirrors, enhancing the signal of vector DM in the length change in the auxiliary channels. Here we present the result of a search for U(1)B−L gauge boson DM using the KAGRA data from auxiliary length channels during the first joint observation run together with GEO600. By applying our search pipeline, which takes into account the stochastic nature of ultralight DM, upper bounds on the coupling strength between the U(1)B−L gauge boson and ordinary matter are obtained for a range of DM masses. While our constraints are less stringent than those derived from previous experiments, this study demonstrates the applicability of our method to the lower-mass vector DM search, which is made difficult in this measurement by the short observation time compared to the auto-correlation timescale of DM.

关键词： Dark matter Particle dark matter Gravitational wave detectors

来源：评论

学校读者我要写书评

暂无评论

Distributed key revocation scheme based on shared binary tree

Distributed key revocation scheme based on shared binary tre...

引用

IEEE International Conference on Progress in Informatics and computing (PIC)

作者： Shaoren Wang Xuehui Du Zhi Yang State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China

Concerning the identity-based binary tree key revocation scheme, the storage and use of binary tree can not be guaranteed in open cloud environment. This paper proposes a distributed key revocation scheme based on shared binary tree. The scheme splits the binary key tree into branches and distributes them to multiple nodes to save. Then multiple nodes work together to rebuild the key. At the same time, this paper optimizes the lookup algorithm during rebuilding. It solves the issues on distributed storage, safe use and fast reconstruction of the binary tree in the open environment. Experiments and analysis show that the scheme has higher efficiency and makes identity-based key revocation scheme run safely in the open environment.

关键词： Peer-to-peer computing Cryptography

来源：评论

学校读者我要写书评

暂无评论

Discussion on heuristic teaching method for arithmetic unit design

Discussion on heuristic teaching method for arithmetic unit ...

引用

International Conference on Computer Science & Education (ICCSE)

作者： Qingbao Li Ping Zhang State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China

ISBN: (纸本)9781479966011

Arithmetic unit design has been one of the important and difficult parts in teaching of principles of computer organization course and is hard for students to understand and master. Because teaching of arithmetic unit design is usually began with examining the process of computer arithmetic, many students are apt to think it as numerical calculation and don't really understand the main idea in computer design of simplification, normalization and rapid processing. In this paper, we reveal the basic idea of computer arithmetic unit design by the analysis of data representation and the process of calculation, taking addition, subtraction and multiplication as example. Based on the background of our many years' teaching and research, we discuss some effective heuristic methods in teaching of arithmetic unit design.

关键词： Computer science Education

来源：评论

学校读者我要写书评

暂无评论

Data layout transformation for structure vectorization on SIMD architectures

Data layout transformation for structure vectorization on SI...

引用

ACIS International Conference on Software engineering, Artificial Intelligence, Networking, and Parallel/Distributed computing (SNPD)

作者： Peng-yuan Li Qing-hua Zhang Rong-cai Zhao Hai-ning Yu State Key Laboratory of Mathematical Engineering and Advanced Computing Zhengzhou China

Structure references are commonly-used at the core of applications in a multitude of domains such as image processing, signal processing, especially the scientific and engineering applications. SIMD instruction sets, as SSE, AVX, AltiVec and 3DNow, provide a promising and widely available avenue for enhancing performance on modern processors. However existing memory accessing shackles limit the achieved performance for structure reference on modern SIMD architectures. In this paper, we propose a novel data layout transformation technology that addresses the accessing obstacles, along with a static analysis technique for detecting the legal loops in where this transformation is suitable. And this approach is implemented in the Optimizing Compiler Open64. The experimental results show that the proposed method can translate application with structure access into vectorizable codes, thereby advancing the execution efficiency adequately.

关键词： Decision support systems Arrays Layout Switches Indexes Transforms Benchmark testing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：