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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

16,951 篇 会议
194 篇 期刊文献
107 册 图书

馆藏范围

17,252 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

10,579 篇 工学
- 9,463 篇 计算机科学与技术...
- 3,957 篇 软件工程
- 2,481 篇 电气工程
- 2,149 篇 信息与通信工程
- 638 篇 控制科学与工程
- 608 篇 电子科学与技术（可...
- 329 篇 生物工程
- 289 篇 机械工程
- 213 篇 仪器科学与技术
- 201 篇 动力工程及工程热...
- 168 篇 生物医学工程（可授...
- 117 篇 光学工程
- 113 篇 材料科学与工程（可...
- 105 篇 网络空间安全
- 104 篇 建筑学
- 103 篇 交通运输工程
- 93 篇 土木工程
2,059 篇 理学
- 1,286 篇 数学
- 386 篇 生物学
- 364 篇 物理学
- 257 篇 统计学（可授理学、...
- 232 篇 系统科学
- 95 篇 化学
1,298 篇 管理学
- 975 篇 管理科学与工程(可...
- 383 篇 图书情报与档案管...
- 380 篇 工商管理
197 篇 医学
- 151 篇 临床医学
162 篇 农学
- 123 篇 作物学
123 篇 经济学
- 123 篇 应用经济学
118 篇 法学
- 94 篇 社会学
32 篇 教育学
24 篇 文学
21 篇 军事学
5 篇 艺术学
1 篇 历史学

主题

1,296 篇 parallel process...
1,021 篇 concurrent compu...
960 篇 computer network...
787 篇 distributed comp...
763 篇 computer archite...
677 篇 cloud computing
670 篇 computational mo...
648 篇 network topology
598 篇 routing
570 篇 computer science
505 篇 neural networks
478 篇 peer to peer com...
466 篇 bandwidth
415 篇 application soft...
370 篇 protocols
364 篇 scalability
345 篇 hardware
317 篇 network servers
313 篇 grid computing
305 篇 parallel computi...

机构

66 篇 university of ch...
56 篇 institute of com...
36 篇 univ chinese aca...
31 篇 computer network...
30 篇 shandong provinc...
25 篇 school of comput...
24 篇 tsinghua univ de...
23 篇 school of comput...
23 篇 institute of inf...
22 篇 chinese acad sci...
22 篇 institute of com...
21 篇 department of co...
20 篇 school of comput...
20 篇 college of intel...
19 篇 tsinghua univers...
19 篇 shanghai jiao to...
19 篇 department of co...
19 篇 beijing univ pos...
18 篇 college of compu...
17 篇 chinese acad sci...

作者

19 篇 liu yang
19 篇 li dongsheng
19 篇 koibuchi michihi...
17 篇 liu jie
16 篇 shietung peng
15 篇 yang yang
14 篇 dhabaleswar k. p...
14 篇 wang guojun
14 篇 xiao limin
13 篇 m. takizawa
13 篇 li qiang
13 篇 wanlei zhou
13 篇 wang wei
12 篇 depei qian
12 篇 li xin
12 篇 yang jun
12 篇 hoefler torsten
12 篇 wu jie
12 篇 yamin li
12 篇 qian depei

语言

17,124 篇 英文
72 篇 其他
57 篇 中文
2 篇 俄文
1 篇 西班牙文
1 篇 法文
1 篇 葡萄牙文
1 篇 乌克兰文

检索条件"任意字段=IFIP International Conference on Network and Parallel Computing"

共 17252 条记录，以下是61-70 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

A Large-Scale Study of Abnormal Recursive DNS 20th

A Large-Scale Study of Abnormal Recursive DNS

引用

20th ifip WG 10.3 international conference on network and parallel computing, NPC 2024

作者： Hu, Anlei Gong, Liangyi Xie, Jieling Li, Yufu Xie, Gaogang China Internet Network Information Center Beijing China Computer Network Information Center Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China

ISBN: (纸本)9789819628636

Recursive DNS plays a pivotal role in safeguarding the security and reliability of users’ access to diverse Internet services. A malfunctioning recursive DNS may impair users’ online experience and pose a grave threat to the security and integrity of the domain name system. Nevertheless, the huge scale and scattered distribution characteristics of recursive DNS make the measurement of abnormal recursive DNS very difficult. In this study, we will take an in-depth look at how top-level domain resolution logs can be used to evaluate and dissect large-scale recursive DNS query patterns. Precisely, we adopt a passive measurement approach, analyzing a massive dataset comprising 1.3 billion resolution logs gathered from. CN top-level domain name servers and also encompassing 110,599 source IPs. Leveraging our profound domain knowledge, we have identified and extracted 12 key features of aberrant recursive DNS query behaviors. Furthermore, we developed a t-SNE-based density clustering model, which has successfully pinpointed 1,417 anomalous recursive DNS servers. Finally, based on our domain expertise and authoritative experts’ insights, we classify these abnormal recursive DNS query behaviors into four categories. Through an in-depth analysis of the intrinsic driving mechanisms of four abnormal behaviors, we provide a comprehensive foundation for recursive DNS safety governance and thus enhance users’ online security. © ifip international Federation for Information Processing 2025.

关键词： network security

来源：评论

学校读者我要写书评

暂无评论

AsymFB: Accelerating LLM Training Through Asymmetric Model parallelism 20th

AsymFB: Accelerating LLM Training Through Asymmetric Model P...

引用

20th ifip WG 10.3 international conference on network and parallel computing, NPC 2024

作者： Zhang, Jiawei Shao, En Wang, Leping Tan, Guangming Sun, Ninghui Institution of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China

ISBN: (纸本)9789819628292

Transformer-based large language models (LLMs) have become a dominant force in natural language processing, advancing both research and industry. As model sizes have grown from billions to hundreds of billions of parameters, training them on a single GPU is no longer feasible, making distributed training essential. Existing distributed training methods partition models into non-overlapping segments of equal-size to cut memory usage on each device, but this creates cross-device data dependencies. These dependencies lead to delays and reduced throughput, particularly during the forward phase. This paper introduces AsymFB, a novel model parallelism algorithm designed to address these limitations. By adopting an asymmetric partitioning approach, AsymFB assigns varying numbers of devices to different training phases—forward, recompute, and backward—optimizing resource allocation and minimizing performance penalties. Our approach demonstrates up to a 1.25× speedup compared to traditional methods, significantly improving the efficiency of training large-scale LLMs and mitigating common performance bottlenecks. © ifip international Federation for Information Processing 2025.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

MTEE: Multiscale Temporal Entropy Evaluation Paradigm for Heterogeneous Complex Datasets 20th

MTEE: Multiscale Temporal Entropy Evaluation Paradigm for H...

引用

20th ifip WG 10.3 international conference on network and parallel computing, NPC 2024

作者： An, Ledong Wang, Chenyang Huang, Shaoyuan Guo, Yang Zhang, Cheng Qiu, Chao Wang, Xiaofei College of Intelligent and Computing Tianjin University Tianjin China College of Computer Science and Software Engineering Shenzhen University Guangdong Shenzhen518060 China Tianjin University of Finance and Economics Tianjin China Software Technology Company Limited Suzhou215163 China

ISBN: (纸本)9789819628292

The rapid advancements in time-series forecasting have led to the emergence of datasets with increasingly diverse characteristics. Researchers typically focus on designing robust algorithms to handle these datasets. However, model performance can vary across different datasets. Existing studies commonly use Mean Absolute Error (MAE) and Mean Squared Error (MSE) to evaluate model performance. These metrics often need to fully account for the impact of dataset quality on forecast accuracy and reliability, leading to insufficient explanations of model forecasts and even dataset dependence. Furthermore, the lack of dataset evaluation makes it difficult to determine whether forecast results are influenced by data characteristics or model architecture, significantly hindering model improvement. To address this problem, this study proposes a new dataset evaluation paradigm-Multiscale Temporal Entropy Evaluation Paradigm. This paradigm aims to tackle the problem of data feature ambiguity affecting model forecast interpretability. By evaluating nine time-series datasets from domains such as weather, economics, transportation, and networks and comparing these evaluations with the forecast results from six different models, this study demonstrates the effectiveness of this method in explaining the relationship between dataset features and model performance. © ifip international Federation for Information Processing 2025.

关键词： Spatio-temporal data

来源：评论

学校读者我要写书评

暂无评论

A Utility-Adjustable Reverse Auction Mechanism for UAV Data Collection Task Allocation 20th

A Utility-Adjustable Reverse Auction Mechanism for UAV Data...

引用

20th ifip WG 10.3 international conference on network and parallel computing, NPC 2024

作者： Chen, Peng Zhang, Jixian School of Information Science and Engineering Yunnan University Kunming China Yunnan Key Laboratory of Intelligent Systems and Computing Yunnan University Kunming China

ISBN: (纸本)9789819628636

Due to their low cost, easy deployment, and high flexibility, unmanned aerial vehicles(UAV) have become widely utilized for various data collection tasks across different fields. In particular, virtual service providers(VSP) recruit UAVs to collect data in their regions of interest(ROI), and leverage this data to offer a range of services, such as metaverse, traffic management, etc. To attract UAV owners to participate in the recruitment activities, VSP need to provide participating users with payments as rewards to motivate their participation. However, the recruitment demands of different VSPs for UAVs can vary significantly. For instance, time-sensitive tasks require timely recruitment of sufficient UAVs to ensure prompt completion of data collection tasks, necessitating higher payments to increase user enthusiasm. Conversely, in other types of tasks, the VSP’s objective might be to maximize its own utility. However, designing a general incentive mechanism for VSPs with different tasks that satisfies incentive compatibility(IC) and individual rationality(IR) to address the issues of UAV task allocation and payment is challenging. If VSP offer insufficient payments to users, it will be difficult to attract enough users to share their UAVs;conversely, offering excessive payments to users will harm the VSP’ profits. To address this problem, we propose a utility-adjustable reverse auction mechanism based on reverse Vickrey-Clarke-Groves(VCG) auction and affine maximizer auction(AMA) theory to cope with different task scenarios. This incentive mechanism can maximize social welfare while flexibly adjusting the utility allocation between VSP and users, ensuring non-negative utility for both parties. Experimental results show that the mechanism has excellent performance. © ifip international Federation for Information Processing 2025.

关键词： Unmanned aerial vehicles (UAV)

来源：评论

学校读者我要写书评

暂无评论

SC-TSDRL: A Cloud-Edge Collaboration Framework for Diffusion Model Inference Acceleration 20th

SC-TSDRL: A Cloud-Edge Collaboration Framework for Diffusio...

引用

20th ifip WG 10.3 international conference on network and parallel computing, NPC 2024

作者： Wang, Huiyu Liu, Zhicheng Wang, Xiaofei Qiu, Chao Zhang, Cheng Wang, Wenyu Ye, Qianwen College of Intelligent and Computing Tianjin University Tianjin China Tianjin University of Finance and Economics Tianjin China Shanghai Zhuichu Networking Technologies Co. Ltd. Shanghai China Hubei Central China Technology Development of Electric Power Co. Ltd. Wuhan China

ISBN: (纸本)9789819628636

In recent years, the rapid rise of Artificial Intelligence Generated Content (AIGC) has been accompanied by a surge in demand for generative AI application services. This trend has not only driven the diversified deployment of large-scale models but also posed more significant challenges to the efficient inference of these models. Current computing solutions have struggled to solely keep pace with growing user demands, which results in insufferable latency and inefficient performance. Integrating cloud computing and edge computing for the inference process of large models is deemed a promising solution, while related resource scheduling issues are still pending. To address this challenge, we focus our research on diffusion models, a representative model in the field of generative artificial intelligence, and propose a cloud-edge collaborative framework to accelerate the inference pipeline of text-to-image diffusion models. Our optimization goal is to minimize the average completion time of inference tasks while maintaining image quality. Considering that the inference for each image is an iterative process, we propose a step clipping strategy to save and reuse intermediate results to reduce iterations, compressing the calculation amount of inference tasks. Above this, we design a task scheduling strategy using proximal policy optimization, which can make efficient resource decisions. Experiments demonstrate the superiority of our strategy over local execution, greedy task scheduling strategy, and learning-based task scheduling strategies. Compared with the three baselines, the average task completion time under different system configurations is reduced by 1.093 s, 1.024 s, and 0.481 s, respectively. © ifip international Federation for Information Processing 2025.

关键词： Cloud platforms

来源：评论

学校读者我要写书评

暂无评论

Comparative Analysis of Lightweight Kubernetes Distributions for Edge computing: Security, Resilience and Maintainability 11th

Comparative Analysis of Lightweight Kubernetes Distribution...

引用

11th ifip WG 6.12 European conference on Service-Oriented and Cloud computing, ESOCC 2025

作者： Yakubov, Diyaz Hästbacka, David Tampere University Tampere33014 Finland

ISBN: (纸本)9783031846168

The increasing demand for real-time data processing in Internet of Things (IoT) devices has elevated the importance of edge computing, necessitating efficient and secure deployment of applications on resource-constrained devices. Kubernetes and its lightweight distributions—k0s, k3s, KubeEdge, and OpenYurt—extend container orchestration to edge environments, but their security, reliability, and maintainability have not been comprehensively analyzed. This study compares Kubernetes and these lightweight distributions by evaluating security compliance using kube-bench, simulating network outages to assess resiliency, and documenting maintainability. Results indicate that while k3s and k0s offer superior ease of development due to their simplicity, they have lower security compliance compared to Kubernetes, KubeEdge, and OpenYurt. Kubernetes provides a balanced approach but may be resource-intensive for edge deployments. KubeEdge and OpenYurt enhance security features and reliability under network outages but increase complexity and resource consumption. The findings highlight trade-offs between performance, security, resiliency, and maintainability, offering insights for practitioners deploying Kubernetes in edge environments. © ifip international Federation for Information Processing 2025.

关键词： Outages

来源：评论

学校读者我要写书评

暂无评论

DaCP: Accelerating Synchronization-Free SpTRSV via GPU-Friendly Data Communication and parallelism Strategies 20th

DaCP: Accelerating Synchronization-Free SpTRSV via GPU-Frie...

引用

20th ifip WG 10.3 international conference on network and parallel computing, NPC 2024

作者： Guo, Mingfeng Deng, Liang Dai, Zhe Li, Ruitian Lin, Gaofeng Liu, Jie Computational Aerodynamics Institute China Aerodynamics Research and Development Center Mianyang China Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha China

ISBN: (纸本)9789819628292

Sparse triangular solve (SpTRSV) is a vital component in various scientific applications, and numerous GPU-based SpTRSV algorithms have been proposed. Synchronization-free SpTRSV is currently the mainstream algorithm on GPU due to its short preprocessing time and outstanding performance. However, we observed that this algorithm still has two performance bottlenecks. Firstly, the thread-level parallel mode can introduce to thread divergence issues within GPU warps during the writing phase. Secondly, the thread-level and warp-level fusion mode may struggles to fully exploit GPU resources due to suboptimal mapping relationships between rows and threads. To address these issues, this paper proposes DaCPSpTRSV, a new synchronization-free algorithm with GPU-friendly data communication and parallelism strategies. Specifically, we first develop a fast-forward thread-level approach, incorporating an efficient global memory access pattern and a light-weight dependency control mechanism, to optimize data communication and alleviate thread divergence. A fine-grained fusion strategy is then proposed to maximize GPU parallelism by adaptively selecting the suitable thread-level or warp-level modes. Moreover, the commonly-used compressed sparse row (CSR) format is employed in our DaCPSpTRSV, enhancing the versatility of our algorithm. We evaluate our approach using 245 matrices from the SuiteSparse Matrix Collection on two NVIDIA GPUs, demonstrating speedup ratios of up to 4.77×, 4.94×, 1.67×, and 1.62× compared to cuSPARSE, Sync-Free, CapelliniSpTRSV, and YuenyeungSpTRSV, respectively. The project is open-sourced at https://***/gmfff12334/DaCP. © ifip international Federation for Information Processing 2025.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Time Series Forecasting for COVID-19 Confirmed Cases Using Transformer Based Stacked LSTM Model 8th

Time Series Forecasting for COVID-19 Confirmed Cases Using T...

引用

8th ifip TC 12 international conference on Computer, Communication and Signal Processing, ICCCSP 2024

作者： Penumadi, Sri Naga Jathin Nambiar, Vaishakh Vignesh, G.S. Singh, Rimjhim Padam Kanchan, Sneha Department of Computer Science and Engineering Amrita School of Computing Bengaluru Amrita Vishwa Vidyapeetham Bengaluru India Department of Internet Engineering and Computer Science Universiti Tunku Abdul Rahman Perak Malaysia

ISBN: (纸本)9783031736162

The worldwide impact of COVID-19 necessitates accurate forecasting for informed decision-making by governments and health entities. This study proposes neural network architectures for time series forecasting of confirmed COVID-19 cases based on historical data. The models, including variants of LSTM networks, CNN-GRU hybrids, RBMs, DBNs, and self-attention mechanisms, are trained on comprehensive datasets of confirmed cases, deaths, recoveries, and other variables across various countries. Comparative analysis indicates that CNN-GRU and LSTM models exhibit superior performance in forecasting accuracy, surpassing RBM, DBN, and self-attention models across metrics like Mean Absolute Error and Root Mean Squared Error. This research emphasizes the viability of employing advanced neural networks for precise COVID-19 spread predictions, pivotal in shaping public health policies during global crises. © ifip international Federation for Information Processing 2025.

关键词： Time series

来源：评论

学校读者我要写书评

暂无评论

LBoDSN: An In-network Load Balancing Mechanism for Lossless Data Center networks Based on Direct Switch Notification 20th

LBoDSN: An In-Network Load Balancing Mechanism for Lossless...

引用

20th ifip WG 10.3 international conference on network and parallel computing, NPC 2024

作者： Shi, Qingyu Jiang, Fangxue Huang, Huang Li, Xiaocui Li, Chuang Cao, Wenzhi Liu, Limei School of Advanced Interdisciplinary Studies Hunan University of Technology and Business Changsha China Xiangjiang Laboratory Changsha China

ISBN: (纸本)9789819628292

With the extensive deployment of Remote Direct Memory Access (RDMA) in lossless data center networks (DCNs), enhancing the RDMA load balancing performance for distributed AI training and HPC applications becomes particularly critical. However, existing load balancing schemes either suffer difficulty in responding to congestion in sub-RTT time, or cannot accurately detect and reroute flows that are on the verge of creating path congestion for Priority-based Flow Control (PFC) enabled lossless DCNs. In this paper, we propose LBoDSN, an in-network load balancing mechanism for lossless DCNs based on direct swtich notification, to address above challenges. LBoDSN monitors ingress queue length evolution at destination switches to predict the triggering time of PFC pause, and accurately identifies congested flows based on the congestion contribution level before PFC pause, then further proactively sends the flow congestion notification (FCN) to source switches for fast rerouting. The FCN contains a flow ID that identifies the congested flow, and a path ID that identifies the target path to which the congested flow will be rerouted. And after rerouting, the Congestion Notification Packet (CNP) of the old path is selectively discarded at source switches to improve transmission performance, while out-of-order packets are reordered at the destination switch. The experimental results show that under realistic workloads, LBoDSN achieves 9–64% and 20–80% better than CONGA for the average and tail Flow Completion Times (FCTs), respectively. Compared with ConWeave, LBoDSN achieves around 8% better performance for the average and tail FCTs while significantly reducing switch queue usage for reordering. © ifip international Federation for Information Processing 2025.

关键词： Time switches

来源：评论

学校读者我要写书评

暂无评论

A Satellite-Ground Link Handover Strategy in LEO networks Using Advantage Actor-Critic Algorithm 20th

A Satellite-Ground Link Handover Strategy in LEO Networks U...

引用

20th ifip WG 10.3 international conference on network and parallel computing, NPC 2024

作者： Chen, Chen Tong, Chenqiang Cong, Li Wang, Zhiyi Jin, Fan Zhou, Xiaobo Pei, Qingqi School of Telecommunication Engineering Xidian University Xi’an710071 China Xidian Guangzhou Institute of Technology Xidian University Guangzhou China Xidian Hangzhou Institute of Technology Xidian University Hangzhou China The State Grid Jilin Province Electric Power Company Changchun130000 China National Key Laboratory of Science and Technology on Space Microwave CAST Xi’an710100 China College of Intelligence and Computing Tianjin University Tianjin300350 China

ISBN: (纸本)9789819628636

Low Earth Orbit (LEO) satellite network is a crucial component of the Space-Air-Ground Integrated network (SAGIN) architecture and Non-Terrestrial networks (NTN). It can provide global, real-time, and seamless broadband data services to many users, playing a critical role in emergencies such as disaster relief. This paper proposes an LEO satellite networks satellite-ground link handover strategy based on Advantage Actor-Critic (A2C) to tackle challenges associated with high handover frequency among ground users, data transmission blocking, and access selection post-handover due to the high-speed cyclic motion of satellites. The strategy considers three handover factors: signal reception strength, satellite potential service time, and service quality. At first, the handover problem is modeled as a combinatorial optimization problem, subsequently transformed into a Markovian Action-Value Function (MAVF) based Multi-Agent Markov Decision Process (MAMDP), and solved in the framework of the A2C algorithm proposed in this paper. The results of simulations illustrate the superior performance of the proposed handover strategy compared to three alternative strategies, namely, Random Handover (RH), Maximum number of Free Channels (MFC), and Maximum Service Time (MST), in terms of both convergence and practicality. The average number of handover occurrences can be reduced by up to 58%, consequently lowering the probability of blocking data transmission. Moreover, signal quality exhibits more excellent stability and can be enhanced by up to 39%, thereby ensuring user communication quality. © ifip international Federation for Information Processing 2025.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共500页 << < 3 4 5 6 7 8 9 10 11 12 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：