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

arXiv 2023年

作者： Shao, Shuai Guan, Yu Zhai, Bing Missier, Paolo Plötz, Thomas Department of Computer Science University of Warwick Coventry United Kingdom Computer and Information Sciences Northumbria University Newcastle upon Tyne United Kingdom School of Computing Newcastle University Newcastle upon Tyne United Kingdom School of Interactive Computing Georgia Institute of Technology Atlanta United States

Human activity recognition (HAR) is one of the core research themes in ubiquitous and wearable computing. With the shift to deep learning (DL) based analysis approaches, it has become possible to extract high-level features and perform classification in an end-to-end manner. Despite their promising overall capabilities, DL-based HAR may suffer from overfitting due to the notoriously small, often inadequate, amounts of labeled sample data that are available for typical HAR applications. In response to such challenges, we propose ConvBoost – a novel, three-layer, structured model architecture and boosting framework for convolutional network based HAR. Our framework generates additional training data from three different perspectives for improved HAR, aiming to alleviate the shortness of labeled training data in the field. Specifically, with the introduction of three conceptual layers–Sampling Layer, Data Augmentation Layer, and Resilient Layer–we develop three "boosters"–R-Frame, Mix-up, and C-Drop–to enrich the per-epoch training data by dense-sampling, synthesizing, and simulating, respectively. These new conceptual layers and boosters, that are universally applicable for any kind of convolutional network, have been designed based on the characteristics of the sensor data and the concept of frame-wise HAR. In our experimental evaluation on three standard benchmarks (Opportunity, PAMAP2, GOTOV) we demonstrate the effectiveness of our ConvBoost framework for HAR applications based on variants of convolutional networks: vanilla CNN, ConvLSTM, and Attention Models. We achieved substantial performance gains for all of them, which suggests that the proposed approach is generic and can serve as a practical solution for boosting the performance of existing ConvNet-based HAR models. This is an open-source project, and the code can be found at https://***/sshao2013/ConvBoost © 2023, CC BY.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Evolutionary Multitasking Based on Team Learning Strategy

Evolutionary Multitasking Based on Team Learning Strategy

引用

Artificial Intelligence technology (ACAIT), Asian Conference on

作者： Wei Li Xinyu Gao Lei Wang Qingzheng Xu School of Computer Science and Engineering Xi’an University of Technology Xi’an China Shaanxi Key Laboratory for Network Computing and Security Technology Xi’an China College of Information and Communication National University of Defense Technology Wuhan China

Multi-factorial optimization (MFO) is a popular optimization mechanism recently, which aims to optimize multiple tasks in a single run. Generally, the multi-factorial optimization algorithm uses the random learning strategy to generate offspring, which leads to an inefficient exploration ability of the algorithm. To address this problem, this paper proposed a simple and effective strategy called team learning strategy (TLS). The proposed learning strategy divided the population into excellent team and ordinary team. Different teams employ different learning strategies. Moreover, nine MFO problems were used to assess the effectiveness of the proposed strategy. The experimental results show that the team learning strategy can improve the performance of the algorithm.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Enhanced Framework for MRI Brain Tumor Recognition with Residual Learning and Intuitive Heatmap Visualization

Enhanced Framework for MRI Brain Tumor Recognition with Resi...

引用

Innovative computing, Intelligent Communication and Smart Electrical Systems (ICSES), International Conference on

作者： L. Velmurugan R. K Maheswari K. Janani K. Agalya M. Poornima K.C. Gayathri School of Computing Science and Engineering (SCOPE VIT Bhopal University Sehore Madhya Pradesh India Artificial Intelligence and Data Science M.A.M College of Enginnering and Technology Trichy Tamilnadu India Department of Data science and computer applications Manipal institute of Technology Manipal Academy of Higher Education Manipal India Department of Computer Science Engineering Sri Eshwar College of Engineering Coimbatore India Department of Information Technology OASYS Institute of Technology Trichy Tamil Nadu India Chettinad School of physiotherapy (CSP Chettinad Hospital and Research Institute (CHRI) Chettinad Academy of Research and Education (CARE) Chennai India

ISBN: (数字)9798331543624

ISBN: (纸本)9798331543631

Early detection of brain tumors is crucial for effective treatment, yet it poses a significant challenge due to the rapid nature of the disease's progression. This study explores the application of ResNet, aimed at improving the accuracy of brain tumor diagnosis in magnetic resonance imaging (MRI) scans. Our model was trained on a dataset comprising 253 MRI images, which included 155 confirmed cases of tumors. The residual learning framework of ResNet effectively captures intricate features and mitigates issues such as vanishing gradients. The results indicate that the ResNet model achieved an impressive accuracy rate of 97%, surpassing traditional detection methods. We evaluated the model's performance using metrics like accuracy and F1-score, demonstrating its robustness. To improve the interpretability of our model's predictions, we utilized Grad-CAM (Gradient-weighted Class Activation Mapping), which highlighted critical areas in the MRI scans that influenced the model's decisions. Our findings confirm ResNet’ s effectiveness in medical imaging and stress the importance of model interpretability in healthcare, allowing radiologists to make informed diagnostic choices.

关键词： Deep learning Accuracy Magnetic resonance imaging Brain tumors Medical services Predictive models Brain modeling Robustness Stress Biomedical imaging

来源：评论

学校读者我要写书评

暂无评论

Concatenation of the Gottesman-Kitaev-Preskill code with the XZZX surface code

引用

Physical Review A 2023年第6期107卷 062408-062408页

作者： Jiaxuan Zhang Yu-Chun Wu Guo-Ping Guo Key Laboratory of Quantum Information Chinese Academy of Sciences School of Physics University of Science and Technology of China Hefei Anhui 230026 People's Republic of China CAS Center For Excellence in Quantum Information and Quantum Physics University of Science and Technology of China Hefei Anhui 230026 People's Republic of China Hefei National Laboratory University of Science and Technology of China Hefei 230088 People's Republic of China Institute of Artificial Intelligence Hefei Comprehensive National Science Center Hefei Anhui 230088 People's Republic of China Origin Quantum Computing Hefei Anhui 230026 People's Republic of China

Bosonic codes provide an alternative option for quantum error correction. An important category of bosonic codes called the Gottesman-Kitaev-Preskill (GKP) code has aroused much interest recently. Theoretically, the error correction ability of the GKP code is limited since it can only correct small shift errors in position and momentum quadratures. A natural approach to promote the GKP error correction for large-scale, fault-tolerant quantum computation is concatenating encoded GKP states with a stabilizer code. The performance of the XZZX surface-GKP code, i.e., the single-mode GKP code concatenated with the XZZX surface code is investigated in this paper under two different noise models. Firstly, in the code-capacity noise model, the asymmetric rectangular GKP code with parameter λ is introduced. Using the minimum weight perfect matching decoder combined with the continuous-variable GKP information, the optimal threshold of the XZZX-surface GKP code reaches σ≈0.67 when λ=2.1, compared with the threshold σ≈0.60 of the standard surface-GKP code. Secondly, we analyze the shift errors of two-qubit gates in the actual implementation and build the full circuit-level noise model. By setting the appropriate bias parameters, the logical error rate is reduced by several times in some cases. These results indicate the XZZX surface-GKP codes are more suitable for asymmetric concatenation under the general noise models. We also estimate the overhead of the XZZX-surface GKP code which uses about 291 GKP states with the noise parameter 18.5 dB (κ/g≈0.71%) to encode a logical qubit with the error rate 2.53×10−7, compared with the qubit-based surface code using 3041 qubits to achieve almost the same logical error rate.

关键词： Quantum error correction

来源：评论

学校读者我要写书评

暂无评论

A Reference Vector-Assisted Many-Objective Optimization Algorithm with Adaptive Niche Dominance Relation

引用

Intelligent Automation & Soft computing 2024年第2期39卷 189-211页

作者： Fangzhen Ge Yating Wu Debao Chen Longfeng Shen School of Computer Science and Technology Huaibei Normal UniversityHuaibei340604China School of Physic and Electronic Information Huaibei Normal UniversityHuaibei340604China Anhui Engineering Research Center for Intelligent Computing and Application on Cognitive Behavior(ICACB) Huaibei Normal UniversityHuaibei340604China Anhui Province Key Laboratory of Intelligent Computing and Applications Huaibei Normal UniversityHuaibei340604China Institute of Artificial Intelligence Hefei Comprehensive National Science CenterHefei230000China

It is still a huge challenge for traditional Pareto-dominatedmany-objective optimization algorithms to solve manyobjective optimization problems because these algorithms hardly maintain the balance between convergence and diversity and can only find a group of solutions focused on a small area on the Pareto front,resulting in poor performance of those *** this reason,we propose a reference vector-assisted algorithmwith an adaptive niche dominance relation,for short *** new dominance relation forms a niche based on the angle between candidate *** comparing these solutions,the solutionwith the best convergence is found to be the non-dominated solution to improve the selection *** reproduction,a mutation strategy of k-bit crossover and hybrid mutation is used to generate high-quality *** 23 test problems with up to 15-objective,we compared the proposed algorithm with five state-of-the-art *** experimental results verified that the proposed algorithm is competitive.

关键词： Many-objective optimization evolutionary algorithm Pareto dominance reference vector adaptive niche

来源：评论

学校读者我要写书评

暂无评论

LHAASO-KM2A detector simulation using Geant4

引用

Radiation Detection technology and Methods 2024年第3期8卷 1437-1447页

作者： Zhen Cao F.Aharonian Q.An Axikegu Y.X.Bai Y.W.Bao D.Bastieri X.J.Bi Y.J.Bi J.T.Cai Q.Cao W.Y.Cao Zhe Cao J.Chang J.F.Chang A.M.Chen E.S.Chen Liang Chen Lin Chen Long Chen M.J.Chen M.L.Chen Q.H.Chen S.H.Chen S.Z.Chen T.L.Chen Y.Chen N.Cheng Y.D.Cheng M.Y.Cui S.W.Cui X.H.Cui Y.D.Cui B.Z.Dai H.L.Dai Z.G.Dai Danzengluobu X.Q.Dong K.K.Duan J.H.Fan Y.Z.Fan J.Fang K.Fang C.F.Feng L.Feng S.H.Feng X.T.Feng Y.L.Feng S.Gabici B.Gao C.D.Gao L.Q.Gao Q.Gao W.Gao W.K.Gao M.M.Ge L.S.Geng G.Giacinti G.H.Gong Q.B.Gou M.H.Gu F.L.Guo X.L.Guo Y.Q.Guo Y.Y.Guo Y.A.Han H.H.He H.N.He J.Y.He X.B.He Y.He Y.K.Hor B.W.Hou C.Hou X.Hou H.B.Hu Q.Hu S.C.Hu D.H.Huang T.Q.Huang W.J.Huang X.T.Huang X.Y.Huang Y.Huang Z.C.Huang X.L.Ji H.Y.Jia K.Jia K.Jiang X.W.Jiang Z.J.Jiang M.Jin M.M.Kang T.Ke D.Kuleshov K.Kurinov B.B.Li Cheng Li Cong Li D.Li F.Li H.B.Li H.C.Li H.Y.Li J.Li Jian Li Jie Li K.Li W.L.Li W.L.Li X.R.Li Xin Li Y.Z.Li Zhe Li Zhuo Li E.W.Liang Y.F.Liang S.J.Lin B.Liu C.Liu D.Liu H.Liu H.D.Liu J.Liu J.L.Liu J.Y.Liu M.Y.Liu R.Y.Liu S.M.Liu W.Liu Y.Liu Y.N.Liu R.Lu Q.Luo H.K.Lv B.Q.Ma L.L.Ma X.H.Ma J.R.Mao Z.Min W.Mitthumsiri H.J.Mu Y.C.Nan A.Neronov Z.W.Ou B.Y.Pang P.Pattarakijwanich Z.Y.Pei M.Y.Qi Y.Q.Qi B.Q.Qiao J.J.Qin D.Ruffolo A.Sáiz D.Semikoz C.Y.Shao L.Shao O.Shchegolev X.D.Sheng F.W.Shu H.C.Song Yu.V.Stenkin V.Stepanov Y.Su Q.N.Sun X.N.Sun Z.B.Sun P.H.T.Tam Q.W.Tang Z.B.Tang W.W.Tian C.Wang C.B.Wang G.W.Wang H.G.Wang H.H.Wang J.C.Wang K.Wang L.P.Wang L.Y.Wang P.H.Wang R.Wang W.Wang X.G.Wang X.Y.Wang Y.Wang Y.D.Wang Y.J.Wang Z.H.Wang Z.X.Wang Zhen Wang Zheng Wang D.M.Wei J.J.Wei Y.J.Wei T.Wen C.Y.Wu H.R.Wu S.Wu X.F.Wu Y.S.Wu S.Q.Xi J.Xia J.J.Xia G.M.Xiang D.X.Xiao G.Xiao G.G.Xin Y.L.Xin Y.Xing Z.Xiong D.L.Xu R.F.Xu R.X.Xu W.L.Xu L.Xue D.H.Yan J.Z.Yan T.Yan C.W.Yang F.Yang F.F.Yang H.W.Yang J.Y.Yang L.L.Yang M.J.Yang R.Z.Yang S.B.Yang Y.H.Yao Z.G.Yao Y.M.Ye L.Q.Yin N.Yin X.H.You Z.Y.You Y.H.Yu Q.Yuan H.Yue H.D.Zeng T.X.Zeng W.Zeng M.Zha B.B.Zhang F.Zhang H.M.Zhang H.Y.Zhang J.L.Zhang L.X.Zhang Li Zhang P.F.Zhang P.P.Zhang R.Zhang S.B.Zh Key Laboratory of Particle Astrophysics&Experimental Physics Division&Computing Center Institute of High Energy PhysicsChinese Academy of SciencesBeijing100049China University of Chinese Academy of Sciences Beijing100049China TIANFU Cosmic Ray Research Center ChengduSichuanChina Dublin Institute for Advanced Studies 31 Fitzwilliam Place2 DublinIreland Max-Planck-Institute for Nuclear Physics 69029Heidelberg103980Germany State Key Laboratory of Particle Detection and Electronics BeijingChina University of Science and Technology of China Hefei230026AnhuiChina School of Physical Science and Technology&School of Information Science and Technology Southwest Jiaotong UniversityChengdu610031SichuanChina School of Astronomy and Space Science Nanjing UniversityNanjing210023JiangsuChina Center for Astrophysics Guangzhou UniversityGuangzhou510006GuangdongChina Hebei Normal University Shijiazhuang050024HebeiChina Key Laboratory of Dark Matter and Space Astronomy&Key Laboratory of Radio Astronomy Purple Mountain ObservatoryChinese Academy of SciencesNanjing 210023JiangsuChina Tsung-Dao Lee Institute&School of Physics and Astronomy Shanghai Jiao Tong UniversityShanghai 200240China Key Laboratory for Research in Galaxies and Cosmology Shanghai Astronomical ObservatoryChinese Academy of SciencesShanghai 200030China Key Laboratory of Cosmic Rays(Tibet University) Ministry of EducationLhasa 850000TibetChina National Astronomical Observatories Chinese Academy of SciencesBeijing 100101China School of Physics and Astronomy(Zhuhai)&School of Physics(Guangzhou)&Sino-French Institute of Nuclear Engineering and Technology(Zhuhai) Sun Yat-sen UniversityGuangzhouZhuhai 510275519000GuangdongChina School of Physics and Astronomy Yunnan UniversityKunming 650091YunnanChina Institute of Frontier and Interdisciplinary Science Shandong UniversityQingdao 266237ShandongChina APC UniversitéParis CitéCNRS/IN2P3CEA/IRFUObservatoire de ParisParis 11975205France Department of Engineering Phys

KM2A is one of the main sub-arrays of LHAASO,working on gamma ray astronomy and cosmic ray physics at energies above 10 *** simulation is the important foundation for estimating detector performance and data *** is a big challenge to simulate the KM2A detector in the framework of Geant4 due to the need to track numerous photons from a large number of detector units(>6000)with large altitude difference(30)and huge coverage(1.3).In this paper,the design of the KM2A simulation code G4KM2A based on Geant4 is *** process of G4KM2A is optimized mainly in memory consumption to avoid memory *** simplifications are used to significantly speed up the execution of *** running time is reduced by at least 30 times compared to full detector *** particle distributions and the core/angle resolution comparison between simulation and experimental data of the full KM2A array are also presented,which show good agreement.

关键词： LHAASO KM2A Simulation GEANT4

来源：评论

学校读者我要写书评

暂无评论

Texture-Guided Saliency Distilling for Unsupervised Salient Object Detection

Texture-Guided Saliency Distilling for Unsupervised Salient ...

引用

Conference on Computer Vision and Pattern Recognition (CVPR)

作者： Huajun Zhou Bo Qiao Lingxiao Yang Jianhuang Lai Xiaohua Xie School of Computer Science and Engineering Sun Yat-sen University China Guangdong Province Key Laboratory of Information Security Technology China Ministry of Education Key Laboratory of Machine Intelligence and Advanced Computing China

Deep Learning-based Unsupervised Salient Object Detection (USOD) mainly relies on the noisy saliency pseudo labels that have been generated from traditional handcraft methods or pre-trained networks. To cope with the noisy labels problem, a class of methods focus on only easy samples with reliable labels but ignore valuable knowledge in hard samples. In this paper, we propose a novel USOD method to mine rich and accurate saliency knowledge from both easy and hard samples. First, we propose a Confidence-aware Saliency Distilling (CSD) strategy that scores samples conditioned on samples' confidences, which guides the model to distill saliency knowledge from easy samples to hard samples progressively. Second, we propose a Boundary-aware Texture Matching (BTM) strategy to refine the boundaries of noisy labels by matching the textures around the predicted boundaries. Extensive experiments on RGB, RGB-D, RGB-T, and video SOD benchmarks prove that our method achieves state-of-the-art USOD performance. Code is available at ***/moothes/A2S-v2.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Novel Temporal Attentive-Pooling based Convolutional Recurrent Architecture for Acoustic Signal Enhancement

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2022年第5期3卷 833-842页

作者： Hussain, Tassadaq Wang, Wei-Chien Gogate, Mandar Dashtipour, Kia Tsao, Yu Lu, Xugang Ahsan, Adeel Hussain, Amir Edinburgh Napier University School of Computing Edinburgh EH11 4BN United Kingdom National Cheng Kung University Institute of Computer and Communication Engineering Tainan 701 Taiwan Academia Sinica Research Center for Information Technology Innovation Taipei 11529 Taiwan Chung Yuan Christian University Department of Electrical Engineering Taoyuan 32023 Taiwan National Institute of Information and Communications Technology Tokyo 187-0021 Japan University of Wolverhampton School of Mathematics and Computer Science Wolverhampton WV1 1LY United Kingdom

Removing background noise from acoustic observations to obtain clean signals is an important research topic regarding numerous real acoustic applications. Owing to their strong model capacity in function mapping, deep neural network-based algorithms have been successfully applied in target signal enhancement in acoustic applications. As most target signals carry semantic information encoded in a hierarchal structure in short-and long-term contexts, noise may distort such structures nonuniformly. In most deep neural network-based algorithms, such local and global effects are not explicitly considered in a modeling architecture for signal enhancement. In this article, we propose a temporal attentive pooling (TAP) mechanism combined with a conventional convolutional recurrent neural network (CRNN) model, called TAP-CRNN, which explicitly considers both global and local information for acoustic signal enhancement (ASE). In the TAP-CRNN model, we first use a convolution layer to extract local information from acoustic signals and a recurrent neural network (RNN) architecture to characterize temporal contextual information. Second, we exploit a novel attention mechanism to contextually process salient regions of noisy signals. We evaluate the proposed ASE system using an infant cry dataset. The experimental results confirm the effectiveness of the proposed TAP-CRNN, compared with related deep neural network models, and demonstrate that the proposed TAP-CRNN can more effectively reduce noise components from infant cry signals with unseen background noises at different signal-to-noise levels. We further tested the TAP-CRNN ASE system on a downstream infant cry detection (ICD) system, which determines whether a sound segment is involved in an infant cry event. Experimental results show that TAP-CRNN ASE can effectively reduce the noise components, thereby improving the performance of ICD under noisy conditions. © 2020 IEEE.

关键词： Acoustic signal enhancement (ASE) bidirectional long-short term memory convolu-tional neural networks recurrent neural networks (RNN)

来源：评论

学校读者我要写书评

暂无评论

A 3D Memristive Cubic Map with Dual Discrete Memristors: Design, Implementation, and Application in Image Encryption

引用

IEEE Transactions on Circuits and Systems for Video technology 2025年

作者： Gao, Suo Iu, Herbert Ho-Ching Erkan, Ugur Simsek, Cemaleddin Toktas, Abdurrahim Cao, Yinghong Wu, Rui Mou, Jun Li, Qi Wang, Chunpeng Dalian Polytechnic University School of Information Science and Engineering Dalian116034 China The University of Western Australia School of Electrical Electronic and Computer Engineering Perth6009 Australia Faculty of Engineering Electrical and Electronics Engineering Respectively Karamanoglu Mehmetbey University Karaman70200 Turkey Ankara University Engineering Faculty Department of Artificial Intelligence and Data Engineering Ankara06830 Turkey Harbin Institute of Technology School of Computer Science and Technology Harbin150001 China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center National Supercomputer Center in Jinan Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan250000 China

Discrete chaotic systems based on memristors exhibit excellent dynamical properties and are more straightforward to implement in hardware, making them highly suitable for generating cryptographic keystreams. However, most existing memristor-based chaotic systems rely on a single memristor. This paper introduces a novel discrete chaotic system employing dual memristors, named the 3D memristive cubic map with dual discrete memristors (3D-MCM). The 3D-MCM system demonstrates richer and more intricate dynamical behaviors compared to its single-memristor counterparts, as verified through bifurcation diagrams, Lyapunov exponent spectra, and complexity analyses. Notably, the system exhibits coexisting attractors, substantially enhancing its dynamical complexity. Hardware implementation of the 3D-MCM attractors confirms its feasibility for industrial applications. To illustrate the system's potential in encryption tasks, this study integrates the quaternary-based permutation and dynamic emanating diffusion (QPDED-IE) scheme for image encryption with the *** results demonstrate that the QPDED-IE scheme based on the 3D-MCM exhibits strong diffusion and confusion properties, effectively resisting cryptanalytic attacks. © 1991-2012 IEEE.

关键词： Bifurcation (mathematics)

来源：评论

学校读者我要写书评

暂无评论

A Glove CNN-Bilstm Sentiment Classification 18

A Glove CNN-Bilstm Sentiment Classification

引用

18th International Computer Conference on Wavelet Active Media technology and information Processing, ICCWAMTIP 2021

作者： Atandoh, Peter Feng, Zhang Adu-Gyamfi, Daniel Leka, Habte Lejebo Atandoh, Paul Hakeem University of Electronic Science and Technology of China School of Information and Software Engineering Chengdu610054 China University of Technology and Applied Sciences School of Computing Information Sciences Department of Cyber Security and Computer Engineering CK Tedam Navrongo Ghana Western Michigan University Department of Statistics KalamazooMI49008-5278 United States

ISBN: (纸本)9781665413640

Reviewing products online has become an increasingly popular way for consumers to voice their opinions and feelings about a product or service. Analyzing this Big data of online reviews would help to discern and extract useful facts and information that could provide a competitive and economic advantage to merchants and other organizations that are interested. Text classification organizes documents according to a variety of predefined categories. In other to solve the aforementioned problems, we employed Glove embeddings for our review sentiment analysis. We further integrate this embedding layer into a deep convolutional neural network (CNN)-bidirectional LSTM model. We further train our model on the IMDB and movie review dataset to extract the polarity as positive or negative and subsequently compare our model with other state-of- the-art models. The aforementioned experiments validate the efficacy and superiority of our proposed approach. © 2021 IEEE.

关键词： Sentiment analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：