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

11th International Conference on Information Assurance and Security, IAS 2015

作者： Hussien, Zaid Alaa Jin, Hai Abduljabbar, Zaid Ameen Yassin, Ali A. Hussain, Mohammed Abdulridha Abbdal, Salah H. Zou, Deqing Cluster and Grid Computing Laboratory Services Computing Technology and System Laboratory School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China University of Basrah Basrah Iraq

ISBN: (纸本)9781467387156

Outsourced data in cloud and computation results are not always trustworthy because data owners lack physical possession and control over the data as a result of virtualization, replication, and migration techniques. Protecting outsourced data from security threats has become a challenging and potentially formidable task in cloud computing;hence, many schemes have focused on ameliorating this problem and on enabling public auditability for cloud data storage security. These schemes drop into two categories: total computation cost and burden on client side. Researchers have used bilinear map technology with public key cryptography. Although this technology is highly efficient, computation time is long and overhead cost is high. The client needs to perform numerous computations to ensure the integrity of data storage. To reduce auditing cost, we propose an efficient and robust scheme to maintain data integrity in cases that involve public auditing. Our scheme adopts modern cipher cryptography with a cryptographic hash function. We consider allowing a third party auditor to preprocess data on behalf of cloud users before uploading them to cloud service providers and then verifying data integrity afterward. Our proposed scheme has important security characteristics, such as privacy, key management, low cost computation, key exchange, low overhead cost, no burden on client side, inability of cloud service providers to create correct verifier respond without data, and one-time key. Finally, efficiency analysis shows that our scheme is faster and more cost-efficient than the bilinear map-based scheme. © 2015 IEEE.

关键词： Public key cryptography

来源：评论

学校读者我要写书评

暂无评论

Towards Cloudware Paradigm for Cloud computing

Towards Cloudware Paradigm for Cloud Computing

引用

IEEE International Conference on Cloud computing, CLOUD

作者： Dong Guo Wei Wang Jingxuan Zhang Guosun Zeng Qiao Xiang Zerong Wei The Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai China Department of Computer Science and Technology Tongji University Shanghai China Department of Computer Science Yale University

The rise of cloud computing and the Internet not only bring change on the data center, but also lead to transformation in software development, deployment, operation and maintenance. With the continuous improvement of the current cloud computing and the internet environment, how to make better use of cloud computing platform, and how to serve the users is a popular field of computer software is a big challenge. In recent years, with the further development of concepts like micro-services and containers, software will further step forward to the Cloudware. This paper discusses how to deploy Cloudware in cloud environment, and proposes a new method to construct the PaaS platform which can directly deploy software on the cloud without any modification, while achieving a new model by the browser services. By using micro-service architecture, we achieving good performance of extension, scalable deployment, faults tolerance and flexible configuration. Finally, we evaluate this method by constructing a complete framework and carrying out an interactive delay experiment that directly focuses on users' experience, which also shows the effectiveness of this method.

关键词： Cloud computing Containers Browsers Computer architecture Rendering (computer graphics)

来源：评论

学校读者我要写书评

暂无评论

Genome-wide association study of lung adenocarcinoma in East Asia and comparison with a European population

引用

Nature communications 2023年第1期14卷 3043页

作者： Jianxin Shi Kouya Shiraishi Jiyeon Choi Keitaro Matsuo Tzu-Yu Chen Juncheng Dai Rayjean J Hung Kexin Chen Xiao-Ou Shu Young Tae Kim Maria Teresa Landi Dongxin Lin Wei Zheng Zhihua Yin Baosen Zhou Bao Song Jiucun Wang Wei Jie Seow Lei Song I-Shou Chang Wei Hu Li-Hsin Chien Qiuyin Cai Yun-Chul Hong Hee Nam Kim Yi-Long Wu Maria Pik Wong Brian Douglas Richardson Karen M Funderburk Shilan Li Tongwu Zhang Charles Breeze Zhaoming Wang Batel Blechter Bryan A Bassig Jin Hee Kim Demetrius Albanes Jason Y Y Wong Min-Ho Shin Lap Ping Chung Yang Yang She-Juan An Hong Zheng Yasushi Yatabe Xu-Chao Zhang Young-Chul Kim Neil E Caporaso Jiang Chang James Chung Man Ho Michiaki Kubo Yataro Daigo Minsun Song Yukihide Momozawa Yoichiro Kamatani Masashi Kobayashi Kenichi Okubo Takayuki Honda Dean H Hosgood Hideo Kunitoh Harsh Patel Shun-Ichi Watanabe Yohei Miyagi Haruhiko Nakayama Shingo Matsumoto Hidehito Horinouchi Masahiro Tsuboi Ryuji Hamamoto Koichi Goto Yuichiro Ohe Atsushi Takahashi Akiteru Goto Yoshihiro Minamiya Megumi Hara Yuichiro Nishida Kenji Takeuchi Kenji Wakai Koichi Matsuda Yoshinori Murakami Kimihiro Shimizu Hiroyuki Suzuki Motonobu Saito Yoichi Ohtaki Kazumi Tanaka Tangchun Wu Fusheng Wei Hongji Dai Mitchell J Machiela Jian Su Yeul Hong Kim In-Jae Oh Victor Ho Fun Lee Gee-Chen Chang Ying-Huang Tsai Kuan-Yu Chen Ming-Shyan Huang Wu-Chou Su Yuh-Min Chen Adeline Seow Jae Yong Park Sun-Seog Kweon Kun-Chieh Chen Yu-Tang Gao Biyun Qian Chen Wu Daru Lu Jianjun Liu Ann G Schwartz Richard Houlston Margaret R Spitz Ivan P Gorlov Xifeng Wu Ping Yang Stephen Lam Adonina Tardon Chu Chen Stig E Bojesen Mattias Johansson Angela Risch Heike Bickeböller Bu-Tian Ji H-Erich Wichmann David C Christiani Gadi Rennert Susanne Arnold Paul Brennan James McKay John K Field Sanjay S Shete Loic Le Marchand Geoffrey Liu Angeline Andrew Lambertus A Kiemeney Shan Zienolddiny-Narui Kjell Grankvist Mikael Johansson Angela Cox Fiona Taylor Jian-Min Yuan Philip Lazarus Matthew B Schabath Melinda C Aldrich Hyo-Sung Jeon Shih Sheng Jiang Jae Sook Sung C Division of Cancer Epidemiology and Genetics National Cancer Institute Rockville MD USA. jianxin.shi@nih.gov. Division of Genome Biology National Cancer Research Institute Tokyo Japan. Division of Cancer Epidemiology and Genetics National Cancer Institute Rockville MD USA. Division of Cancer Epidemiology and Prevention Aichi Cancer Center Research Institute Nagoya Japan. Institute of Population Health Sciences National Health Research Institutes Zhunan Taiwan. Department of Epidemiology School of Public Health Nanjing Medical University Nanjing China. Jiangsu Key Lab of Cancer Biomarkers Prevention and Treatment Collaborative Innovation Center for Cancer Medicine Nanjing Medical University Nanjing China. Prosserman Centre for Population Health Research Lunenfeld-Tanenbaum Research Institute Sinai Health Toronto ON Canada. Department of Epidemiology and Biostatistics National Clinical Research Center for Cancer Key Laboratory of Molecular Cancer Epidemiology of Tianjin Tianjin Medical University Cancer Institute and Hospital Tianjin Medical University Tianjin China. Division of Epidemiology Department of Medicine Vanderbilt University Medical Center and Vanderbilt-Ingram Cancer Center Nashville TN USA. Cancer Research Institute Seoul National University College of Medicine Seoul Republic of Korea. Department of Etiology & Carcinogenesis and State Key Laboratory of Molecular Oncology Cancer Institute and Hospital Chinese Academy of Medical Sciences and Peking Union Medical College Beijing China. Department of Epidemiology School of Public Health China Medical University Shenyang China. Department of Clinical Epidemiology and Center of Evidence Based Medicine The First Hospital of China Medical University Shenyang China. Department of Oncology Shandong Cancer Hospital and Institute Shandong Academy of Medical Sciences Jinan China. Ministry of Education Key Laboratory of Contemporary Anthropology School of Life Sciences Fudan University Shanghai China. S

Lung adenocarcinoma is the most common type of lung cancer. Known risk variants explain only a small fraction of lung adenocarcinoma heritability. Here, we conducted a two-stage genome-wide association study of lung adenocarcinoma of East Asian ancestry (21,658 cases and 150,676 controls; 54.5% never-smokers) and identified 12 novel susceptibility variants, bringing the total number to 28 at 25 independent loci. Transcriptome-wide association analyses together with colocalization studies using a Taiwanese lung expression quantitative trait loci dataset (n = 115) identified novel candidate genes, including FADS1 at 11q12 and ELF5 at 11p13. In a multi-ancestry meta-analysis of East Asian and European studies, four loci were identified at 2p11, 4q32, 16q23, and 18q12. At the same time, most of our findings in East Asian populations showed no evidence of association in European populations. In our studies drawn from East Asian populations, a polygenic risk score based on the 25 loci had a stronger association in never-smokers vs. individuals with a history of smoking (P = 0.0058). These findings provide new insights into the etiology of lung adenocarcinoma in individuals from East Asian populations, which could be important in developing translational applications.

关键词：

来源：评论

学校读者我要写书评

暂无评论

F-CNN: An FPGA-based framework for training Convolutional Neural Networks

F-CNN: An FPGA-based framework for training Convolutional Ne...

引用

International Conference on Application Specific systems (ASAP), Architectures and Processors

作者： Wenlai Zhao Haohuan Fu Wayne Luk Teng Yu Shaojun Wang Bo Feng Yuchun Ma Guangwen Yang Ministry of Education Key Laboratory for Earth System Modeling and Center for Earth System Science Tsinghua University China Tsinghua National Laboratory for Information Science and Technology China Department of Computing Imperial college London UK Department of Automatic Test and Control Harbin Institute of Technology China Department of Computer Science and Technology Tsinghua University China

ISBN: (纸本)9781509015047

This paper presents a novel reconfigurable framework for training Convolutional Neural Networks (CNNs). The proposed framework is based on reconfiguring a streaming datapath at runtime to cover the training cycle for the various layers in a CNN. The streaming datapath can support various parameterized modules which can be customized to produce implementations with different trade-offs in performance and resource usage. The modules follow the same input and output data layout, simplifying configuration scheduling. For different layers, instances of the modules contain different computation kernels in parallel, which can be customized with different layer configurations and data precision. The associated models on performance, resource and bandwidth can be used in deriving parameters for the datapath to guide the analysis of design trade-offs to meet application requirements or platform constraints. They enable estimation of the implementation specifications given different layer configurations, to maximize performance under the constraints on bandwidth and hardware resources. Experimental results indicate that the proposed module design targeting Maxeler technology can achieve a performance of 62.06 GFLOPS for 32-bit floating-point arithmetic, outperforming existing accelerators. Further evaluation based on training LeNet-5 shows that the proposed framework achieves about 4 times faster than CPU implementation of Caffe and about 7.5 times more energy efficient than the GPU implementation of Caffe.

关键词： Training Field programmable gate arrays Convolution Computational modeling Bandwidth Neural networks Runtime

来源：评论

学校读者我要写书评

暂无评论

Wind speed prediction using a cooperative coevolution genetic algorithm based on back propagation neural network

Wind speed prediction using a cooperative coevolution geneti...

引用

Congress on Evolutionary Computation

作者： Jie Li Rui Wang Tao Zhang College of Information System and Management National University of Defense Technology Changsha P.R. China State Key Laboratory of High Performance Computing National University of Defense Technology Changsha P.R. China

Wind speed prediction plays a crucial role in energy system planning and management. This study proposes to predict wind speed using a cooperative coevolution (CC) genetic algorithm based on back propagation (GABP) neural network. A decomposition method is provided to decompose decision variables into several subcomponents, simultaneously, independence among variables in different subcomponents are kept to a minimum. With neuron-based sub-population (NSP), the simulation results show that the proposed method CC-GABP achieves higher prediction precision.

关键词： Neurons Biological neural networks Genetic algorithms Wind speed Optimization Genetics

来源：评论

学校读者我要写书评

暂无评论

Total variation constrained graph regularized NMF for medical image registration

Total variation constrained graph regularized NMF for medica...

引用

IEEE IVMSP Workshop

作者： Chengcai Leng Zhen Chen Guorong Cai Irene Cheng Zhihui Xiong Jie Tian Anup Basu Key Laboratory of Nondestructive Testing Nanchang Hangkong University Nanchang China Department of Computing Science University of Alberta Edmonton Canada College of Information System and Management National University of Defense Technology Changsha China

ISBN: (纸本)9781509019304

Non-negative matrix factorization (NMF) is a good partsbased representation in computer vision. However, it fails to preserve or enhance the features and details of the data. To resolve this problem, we propose a novel sparse matrix factorization method for medical image registration, called Total Variation constrained Graph regularized Nonnegative Matrix Factorization (TV-GNMF). We incorporate total variation (TV) to control the speed of diffusion based on the gradient information, to preserve or enhance the features and details of the data. Manifold graph regularization is also incorporated to discover intrinsic geometric and structural information in the data. Experimental results demonstrate the effectiveness of our approach compared to state-of-the-art algorithms on medical images.

关键词： TV Biomedical imaging Image registration Feature extraction Sparse matrices Linear programming Laplace equations

来源：评论

学校读者我要写书评

暂无评论

MR-COF: A genetic MapReduce configuration optimization framework 15th

MR-COF: A genetic MapReduce configuration optimization frame...

引用

15th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2015

作者： Liu, Chao Zeng, Deze Yao, Hong Hu, Chengyu Yan, Xuesong Fan, Yuanyuan Hubei Key Laboratory of Intelligent Geo-Information Processing China University of Geosciences Wuhan430074 China China Services Computing Technology and System Lab and Cluster and Grid Computing Lab Huazhong University of Science and Technology Wuhan430074 China

ISBN: (纸本)9783319271392

Hadoop/MapReduce has emerged as a de facto programming framework to explore cloud-computing resources. Hadoop has many configuration parameters, some of which are crucial to the performance of MapReduce jobs. In practice, these parameters are usually set to default or inappropriate values. This severely limits system performance (e.g., execution time). Therefore, it is essential but also challenging to investigate how to automatically tune these parameters to optimize MapReduce job performance. In this paper, we propose an automatic MapReduce configuration optimization framework named as MR-COF. By monitoring and analyzing the runtime behavior, the framework adopts a cost-based performance prediction model that predicts the MapReduce job performance. In addition, we design a genetic search algorithm which iteratively tunes parameters in order to find out the best one. Testbed-based experimental results show that the average MapReduce job performance is increased by 35% with MR-COF compared to the default configuration. © Springer International Publishing Switzerland 2015.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

Search for anisotropic gravitational-wave backgrounds using data from Advanced LIGO and Advanced Virgo’s first three observing runs

引用

Physical Review D 2021年第2期104卷 022005-022005页

作者： R. Abbott T. D. Abbott S. Abraham F. Acernese K. Ackley A. Adams C. Adams R. X. Adhikari V. B. Adya C. Affeldt D. Agarwal M. Agathos K. Agatsuma N. Aggarwal O. D. Aguiar L. Aiello A. Ain P. Ajith T. Akutsu K. M. Aleman G. Allen A. Allocca P. A. Altin A. Amato S. Anand A. Ananyeva S. B. Anderson W. G. Anderson M. Ando S. V. Angelova S. Ansoldi J. M. Antelis S. Antier S. Appert Koya Arai Koji Arai Y. Arai S. Araki A. Araya M. C. Araya J. S. Areeda M. Arène N. Aritomi N. Arnaud S. M. Aronson H. Asada Y. Asali G. Ashton Y. Aso S. M. Aston P. Astone F. Aubin P. Aufmuth K. AultONeal C. Austin S. Babak F. Badaracco M. K. M. Bader S. Bae Y. Bae A. M. Baer S. Bagnasco Y. Bai L. Baiotti J. Baird R. Bajpai M. Ball G. Ballardin S. W. Ballmer M. Bals A. Balsamo G. Baltus S. Banagiri D. Bankar R. S. Bankar J. C. Barayoga C. Barbieri B. C. Barish D. Barker P. Barneo F. Barone B. Barr L. Barsotti M. Barsuglia D. Barta J. Bartlett M. A. Barton I. Bartos R. Bassiri A. Basti M. Bawaj J. C. Bayley A. C. Baylor M. Bazzan B. Bécsy V. M. Bedakihale M. Bejger I. Belahcene V. Benedetto D. Beniwal M. G. Benjamin T. F. Bennett J. D. Bentley M. BenYaala F. Bergamin B. K. Berger S. Bernuzzi D. Bersanetti A. Bertolini J. Betzwieser R. Bhandare A. V. Bhandari D. Bhattacharjee S. Bhaumik J. Bidler I. A. Bilenko G. Billingsley R. Birney O. Birnholtz S. Biscans M. Bischi S. Biscoveanu A. Bisht B. Biswas M. Bitossi M.-A. Bizouard J. K. Blackburn J. Blackman C. D. Blair D. G. Blair R. M. Blair F. Bobba N. Bode M. Boer G. Bogaert M. Boldrini F. Bondu E. Bonilla R. Bonnand P. Booker B. A. Boom R. Bork V. Boschi N. Bose S. Bose V. Bossilkov V. Boudart Y. Bouffanais A. Bozzi C. Bradaschia P. R. Brady A. Bramley A. Branch M. Branchesi J. E. Brau M. Breschi T. Briant J. H. Briggs A. Brillet M. Brinkmann P. Brockill A. F. Brooks J. Brooks D. D. Brown S. Brunett G. Bruno R. Bruntz J. Bryant A. Buikema T. Bulik H. J. Bulten A. Buonanno R. Buscicchio D. Buskulic R. L. Byer L. Cadonati M. Caesar G. Cagnoli C. Cahillane H. W. Cain, III J. Calderón Bustillo J. LIGO Laboratory California Institute of Technology Pasadena California 91125 USA Louisiana State University Baton Rouge Louisiana 70803 USA Inter-University Centre for Astronomy and Astrophysics Pune 411007 India Dipartimento di Farmacia Università di Salerno I-84084 Fisciano Salerno Italy INFN Sezione di Napoli Complesso Universitario di Monte S.Angelo I-80126 Napoli Italy OzGrav School of Physics & Astronomy Monash University Clayton 3800 Victoria Australia Christopher Newport University Newport News Virginia 23606 USA LIGO Livingston Observatory Livingston Louisiana 70754 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 University of Cambridge Cambridge CB2 1TN United Kingdom Theoretisch-Physikalisches Institut Friedrich-Schiller-Universität Jena D-07743 Jena Germany University of Birmingham Birmingham B15 2TT United Kingdom Center for Interdisciplinary Exploration & Research in Astrophysics (CIERA) Northwestern University Evanston Illinois 60208 USA Instituto Nacional de Pesquisas Espaciais 12227-010 São José dos Campos São Paulo Brazil Gravity Exploration Institute Cardiff University Cardiff CF24 3AA United Kingdom Gran Sasso Science Institute (GSSI) I-67100 L’Aquila Italy INFN Laboratori Nazionali del Gran Sasso I-67100 Assergi Italy INFN Sezione di Pisa I-56127 Pisa Italy Università 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 (NAOJ) Mitaka City Tokyo 181-8588 Japan Advanced Technology Center National Astronomical Observatory of Japan (NAOJ) Mitaka City Tokyo 181-8588 Japan California State University Fullerton Fullerton California 92831 USA NCSA University of Illinois

We report results from searches for anisotropic stochastic gravitational-wave backgrounds using data from the first three observing runs of the Advanced LIGO and Advanced Virgo detectors. For the first time, we include Virgo data in our analysis and run our search with a new efficient pipeline called pystoch on data folded over one sidereal day. We use gravitational-wave radiometry (broadband and narrow band) to produce sky maps of stochastic gravitational-wave backgrounds and to search for gravitational waves from point sources. A spherical harmonic decomposition method is employed to look for gravitational-wave emission from spatially-extended sources. Neither technique found evidence of gravitational-wave signals. Hence we derive 95% confidence-level upper limit sky maps on the gravitational-wave energy flux from broadband point sources, ranging from Fα,Θ<(0.013–7.6)×10−8 erg cm−2 s−1 Hz−1, and on the (normalized) gravitational-wave energy density spectrum from extended sources, ranging from Ωα,Θ<(0.57–9.3)×10−9 sr−1, depending on direction (Θ) and spectral index (α). These limits improve upon previous limits by factors of 2.9–3.5. We also set 95% confidence level upper limits on the frequency-dependent strain amplitudes of quasimonochromatic gravitational waves coming from three interesting targets, Scorpius X-1, SN 1987A and the Galactic Center, with best upper limits range from h0<(1.7–2.1)×10−25, a factor of ≥2.0 improvement compared to previous stochastic radiometer searches.

关键词： Experimental studies of gravity General relativity Gravitational waves

来源：评论

学校读者我要写书评

暂无评论

A Third Searching Bias during Visual Attention: Evidence from Eye Movement

A Third Searching Bias during Visual Attention: Evidence fro...

引用

2016心理学国际会议(CPSY 2016)

作者： Lijuan Duan Haiyan Zhou Jun Miao Zhen Yang Jili Gu College of Computer Science Beijing University of Technology Institute of Computing Technology Chinese Academy of Sciences The International WIC Institute Beijing University of Technology Beijing International Collaboration Base on Brain Informatics and Wisdom Services Beijing Key Laboratory of Magnetic Resonance Imaging and Brain Informatics

The predominant attention models have asserted that attention is determined by the bottom-up physical salience or the top-down selection goals. But new evidences are emerged that both of the current goal and the physical features are hard to explain, such as the experience. Here with the technique of eye tracking, we used a new searching paradigm, searching target in a high predictable environment, to investigate the role of the experience of concept. Participants were demanded to search the left or the right eyes on a face from a pre-given starting point. Although the searching targets located symmetrically in a familiar background of a face, more search time and fixations were needed for searching the left eye. It suggested that a third source of searching bias, not the experience of face concept as expected, but might be the reading habit, to integrate with the searching goal and physical features. In addition, such kind of experience source could override the effect of searching distance, but it was limited to the familiar situation. When searching the left eye from the right part, more search time and fixations were needed, indicating the effect of searching distance, although it was short-haul with high predictability.

关键词： Evidence from Eye Movement A Third Searching Bias during Visual Attention Visual

来源：评论

学校读者我要写书评

暂无评论

Fuzzy H∞ Filtering for Nonlinear Networked systems with Multiple Stochastic Time-Varying Delays, Packet Dropouts and Sensor Saturation 34

Fuzzy H∞ Filtering for Nonlinear Networked Systems with Mul...

引用

第三十四届中国控制会议

作者： XU Xiaoli YAN Huaicheng ZHANG Hao SHI Hongbo Key Laboratory of Advanced Control and Optimization for Chemical Process of Ministry of Education School of information Science and Engineering East China University of Science and Technology Key Laboratory of Embedded System and Service Computing Ministry of Education

ISBN: (纸本)9781467374439

This paper investigates the problem of H∞ filter design for a class of nonlinear networked system based on T-S fuzzy model. Multiple stochastic time-varying delays and some incomplete information are considered simultaneously. Incomplete information includes randomly occurring sensor saturation and packet dropouts. Stochastic time-varying delays are depicted as a sequence of stochastic and independent variables, which take values on 0 and 1. Two sets of Bernoulli distributed white noises are introduced to describe randomly occurring sensor saturation and packet dropouts. system conservatism is reduced due to introduce an approach of piecewise quadratic Lyapunov function. By solving a set of linear matrix inequalities(LMIs), the filter parameters are obtained. Finally, a simulation example is provided to illustrate the effectiveness of the proposed filter design approach.

关键词： H ∞ filtering,multiple time-varying delays,randomly occurring sensor saturation,packet dropouts,piecewise quadratic Lyapunov function

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：