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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

594 篇 会议
9 篇 期刊文献
1 册 图书

馆藏范围

604 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

456 篇 工学
- 410 篇 计算机科学与技术...
- 209 篇 软件工程
- 117 篇 信息与通信工程
- 68 篇 电气工程
- 37 篇 控制科学与工程
- 31 篇 电子科学与技术（可...
- 17 篇 机械工程
- 14 篇 网络空间安全
- 13 篇 动力工程及工程热...
- 13 篇 生物工程
- 10 篇 生物医学工程（可授...
- 7 篇 光学工程
- 7 篇 化学工程与技术
- 7 篇 交通运输工程
- 6 篇 安全科学与工程
- 5 篇 材料科学与工程（可...
- 5 篇 土木工程
- 5 篇 农业工程
109 篇 理学
- 69 篇 数学
- 17 篇 生物学
- 15 篇 物理学
- 15 篇 统计学（可授理学、...
- 12 篇 系统科学
- 6 篇 化学
- 4 篇 地球物理学
62 篇 管理学
- 39 篇 管理科学与工程(可...
- 28 篇 图书情报与档案管...
- 12 篇 工商管理
38 篇 医学
- 36 篇 临床医学
5 篇 农学
4 篇 法学
4 篇 教育学
- 4 篇 教育学
2 篇 经济学
1 篇 文学

主题

26 篇 computer network...
23 篇 parallel process...
17 篇 distributed comp...
17 篇 cloud computing
16 篇 neural networks
16 篇 mobile computing
15 篇 peer to peer com...
15 篇 parallel computi...
13 篇 concurrent compu...
13 篇 wireless sensor ...
12 篇 routing
12 篇 network topology
12 篇 computational mo...
11 篇 computer archite...
11 篇 costs
11 篇 delay
10 篇 computer science
10 篇 hardware
9 篇 throughput
9 篇 data mining

机构

7 篇 university of ch...
6 篇 institute of com...
4 篇 key laboratory o...
4 篇 school of comput...
3 篇 tianjin key lab....
3 篇 bulgarian acad s...
3 篇 univ elect sci &...
3 篇 bulgarian acad s...
2 篇 simula research ...
2 篇 school of inform...
2 篇 northwest minzu ...
2 篇 school of comput...
2 篇 computer network...
2 篇 department of co...
2 篇 school of inform...
2 篇 univ chinese aca...
2 篇 department of co...
2 篇 huazhong univ sc...
2 篇 guizhou universi...
2 篇 research center ...

作者

4 篇 margenov svetoza...
4 篇 wu d
4 篇 jin hai
3 篇 zhang degan
3 篇 zhang jie
3 篇 zhang l
3 篇 wang xin
3 篇 xin wang
3 篇 xiao nong
3 篇 bilel ben romdha...
2 篇 dimov ivan
2 篇 cho sungchol
2 篇 xiang yang
2 篇 johansen dag
2 篇 liu yang
2 篇 tomforde sven
2 篇 xia mq
2 篇 nan li
2 篇 rui shan
2 篇 zhang bu-han

语言

601 篇 英文
2 篇 其他
1 篇 中文

检索条件"任意字段=NPC 2009 - 6th International Conference on Network and Parallel Computing"

共 604 条记录，以下是1-10 订阅

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

详细简洁

排序：

npc 2009 - 6th international conference on network and parallel computing

NPC 2009 - 6th International Conference on Network and Paral...

引用

npc 2009 - 6th international conference on network and parallel computing

ISBN: (纸本)9780769538372

the proceedings contain 35 papers. the topics discussed include: the Nornir run-time system for parallel programs using Kahn process networks;network performance of pruned hierarchical Torus network;super-peer availability prediction strategy in unstructured P2P network;VirtualNet: mapping distributed communication on a single node;DPM: a demand-driven virtual disk prefetch mechanism for mobile personal computing environments;explorations of honeycomb topologies for network-on-chip;adaptive energy-efficient packet transmission for voice delivering in wireless sensor networks;sleep scheduling and gradient query in sensor networks for target monitoring;re-exploring the potential of using tree structure in P2P live streaming networks;reliable downloading algorithms for BitTorrent-like systems;a theoretical model of lock-keeper data exchange and its practical verification;and system level speedup oriented cache partitioning for multi-programmed systems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

EAMTI: A Novel Method Toward Early and Accurate Malicious Traffic Identification 20th

EAMTI: A Novel Method Toward Early and Accurate Malicious Tr...

引用

20th IFIP WG 10.3 international conference on network and parallel computing, npc 2024

作者： Shen, Yuyang Tao, Jun Yu, Linxiao Luo, Yuantu School of Cyber Science and Engineering Southeast University Nanjing210096 China Purple Mountain Laboratories for Network and Communication Security Nanjing211111 China

ISBN: (纸本)9789819628636

Malicious traffic constantly threatens the security and stability of networks. However, most existing identification methods based on traditional machine learning and deep learning leverage statistical features of an entire flow, which delays the identification. Although a few studies have started to focus on early identification, they do not make full use of flow information, resulting in issues with performance or timeliness. In this paper, we propose EAMTI, a novel method toward Early and Accurate Malicious Traffic Identification. We construct feature sequences based on byte frequency vectorization and directional information of bidirectional flows to represent network flows. Our representation method preserves rich packet-level information and flow-level sequential characteristics. A bidirectional Gated Recurrent Unit (GRU) model is constructed to process feature sequence samples and perform accurate identification. Our experimental results on the CICIDS2017 dataset show that EAMTI can construct representative feature sequences using only 6 initial packets, and it outperforms the existing methods in terms of accuracy, recall, precision, and F1-score. © IFIP international Federation for Information Processing 2025.

关键词： network security

来源：评论

学校读者我要写书评

暂无评论

DTuner: A Construction-Based Optimization Method for Dynamic Tensor Operators Accelerating 20th

DTuner: A Construction-Based Optimization Method for Dynam...

引用

20th IFIP WG 10.3 international conference on network and parallel computing, npc 2024

作者： Chen, Wenxin Diao, Boyu Liu, Hangda Wang, RuiSheng Xu, Yongjun Institute of Computing Technology Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China

ISBN: (纸本)9789819628292

Auto-optimization of tensor programs is a crucial technique in deep learning compilers. Traditional tensor program optimization methods rely on the known fixed shape of the tensor, but when inputs of tensor program are only determined at runtime, these traditional methods cannot optimize in advance. To overcome this challenge, we introduce DTuner, a dynamic shape tensor program optimization method based on a constructive algorithmic. By optimizing for a broad variety of potential input forms, DTuner leverages highly focused and quick optimization methods to increase the efficiency of dynamic shape tensor programs, resulting in notable gains in average performance. Specifically, modern advanced GPUs are composed of general-purpose computing cores and specialized computing cores. Since different input shapes can yield varying performance outcomes across different cores, we incorporate a sampling and prediction method in the optimizer to guide the selection of computing cores. Evaluation results demonstrate that our method is 2 to 3 orders of magnitude faster in tuning time compared to the existing state-of-the-art dynamic tensor program optimization methods (Dietcode). Additionally, the optimization performance of the algorithm is comparable to that of state-of-the-art methods. On the Nvidia A100 and Orin platforms, DTuner can enhance the inference performance of commonly used NLP models by up to 27.5%, with average performance improvements of 6% to 7% for dynamic inputs. For typical single dynamic tensor programs, our method can also achieve a maximum performance improvement of 25.7% and an average improvement of 9%. © IFIP international Federation for Information Processing 2025.

关键词： Tensors

来源：评论

学校读者我要写书评

暂无评论

Efficient Implementation of the LOBPCG Algorithm on a CPU-GPU Cluster 20th

Efficient Implementation of the LOBPCG Algorithm on a CP...

引用

20th IFIP WG 10.3 international conference on network and parallel computing, npc 2024

作者： Liu, Yang Zhao, Yonghua Wang, Zexin Huang, Rongfeng Zhang, Dingye Zhang, Xinyin Computer Network Information Center Chinese Academy of Science Beijing China University of Chinese Academy of Sciences Beijing China School of Information Science and Technology Shijiazhuang Tiedao University Hebei Shijiazhuang China

ISBN: (纸本)9789819628292

the Locally Optimal Block Preconditioned Conjugate Gradient (LOBPCG) algorithm is an effective algorithm for solving large-scale sparse eigenvalue problems in various scientific and engineering applications. Based on a distributed CPU-GPU heterogeneous environment, this paper presents an optimized approach for the efficient solution of sparse eigenvalue problems utilizing the LOBPCG algorithm. To conceal intra-node data transfer and reduce the influence of the cross-node MPI communication overhead, we employ a sparse matrix regular two-dimensional partitioning scheme. To enhance GPU data throughput and data reuse, we consolidate multiple sparse matrix-vector multiplications (SPMV) into a single sparse matrix-matrix multiplication (SPMM). Furthermore, for the irregular dense matrix-matrix multiplication (GEMM) involved in the LOBPCG algorithm, we design an adaptive batched GEMM technique for GPU execution. Extensive experimental results demonstrate the computational efficiency and scalability of our approach. Our implementation achieves a significant speedup in solving typical matrices compared to the SLEPc library. the strong scalability performance exceeds 58%. © IFIP international Federation for Information Processing 2025.

关键词： Scalability

来源：评论

学校读者我要写书评

暂无评论

Formal Modeling of parallel System based on TCPN

Formal Modeling of Parallel System based on TCPN

引用

6th IFIP international conference on network and parallel computing

作者： Cheng, Bin Wang, Xingang Tong, Weiqin Shanghai Univ Sch Comp Engn & Sci Shanghai Peoples R China

ISBN: (纸本)9781424449903

Correctness and performance are the principal requirement of a parallel system. Due to the complicated and uncertainty, it is necessary to model it. A hierarchical TCPN model proposed in this paper can investigate on various levels of abstraction and analyze concerning performance, functional validity and correctness. It describes the parallel program and the resources respectively to bring less effect to modify the program structure because of running environment changes.

关键词： Timed Coloured Petri Net parallel system formal method

来源：评论

学校读者我要写书评

暂无评论

A network Emergent computing Model Based on Cellular Automaton

A Network Emergent Computing Model Based on Cellular Automat...

引用

6th IFIP international conference on network and parallel computing

作者： Tang, Hong Wang, Ying Wang, Haitao Wu, Yu Chongqing Univ Posts & Telecommun Network & Computat Res Ctr Chongqing 400065 Peoples R China

ISBN: (纸本)9781424449903

Emergent computation is a relatively new approach for understanding the behaviors of complex systems. Central to this approach is the idea that system-level behavior emerges from interaction among individual elements. this paper proposes a network emergent cotnputation model based on cellular automaton, which introduces network operating mechanism, such as store-and-forward, adjacency interaction, rate adjustment, resource competition and delayed feedback as the interactions among individual cells. the simulation results show that the system-level behaviors, such as power-law, self-similarity and 1/f(r) noise, can be generated spontaneously by local nonlinear interaction among cells, which have led to a better understanding of the macro-behavior of the system from the perspective of microscopic mechanism.

关键词： Cellular automata

来源：评论

学校读者我要写书评

暂无评论

network Performance of Pruned Hierarchical Torus network

Network Performance of Pruned Hierarchical Torus Network

引用

6th IFIP international conference on network and parallel computing

作者： Rahman, M. M. Hafizur Jiang, Xiaohong Masud, Md. Shahin-Al Horiguchi, Susumu Tohoku Univ GSIS Aobayama 6-3-09 Sendai Miyagi 9808579 Japan KUET Dept CSE Khulna 9203 Bangladesh

ISBN: (纸本)9781424449903

the complexity of an interconnection network often determines the size of the parallel computer and thus the attainable performance of a parallel computer is limited by the characteristics of the interconnection network. Pruning technique reduces the complexity and hence increases the performance. In this paper, we apply the pruning technique on Hierarchical Torus network (HTN) and study the architectural details of the pruned HTN. We have explored the network diameter, average distance, bisection width, peak number of vertical links, and VLSI layout area of different HTN. It is shown that the pruned HTN possesses several attractive features including small diameter, small average distance, small number of wires, a particularly small number of vertical links, and economic layout area as compared to its non-pruned counterpart.

关键词： Pruning Technique network Performance Peak Number of Vertical Links Layout Area

来源：评论

学校读者我要写书评

暂无评论

the Nornir run-time system for parallel programs using Kahn process networks

The Nornir run-time system for parallel programs using Kahn ...

引用

npc 2009 - 6th international conference on network and parallel computing

作者： Vrba, Željko Halvorsen, Pål Griwodz, Carsten Beskow, Paul Johansen, Dag Simula Research Laboratory Oslo Norway Department of Informatics University of Oslo Norway Dept. of Computer Science University of Tromsø Norway Fast Search and Transfer Norway

ISBN: (纸本)9780769538372

Shared-memory concurrency is the prevalent paradigm used for developing parallel applications targeted towards small- and middle-sized machines, but experience has shown that it is hard to use. this is largely caused by synchronization primitives which are low-level, inherently nondeterministic, and, consequently, non-intuitive to use. In this paper, we present the Nornir run-time system. Nornir is comparable to well-known frameworks like MapReduce and Dryad, but has additional support for process structures containing cycles. It is based on the formalism of Kahn process networks, which we deem as a simple and deterministic alternative to shared-memory concurrency. Experiments with real and synthetic benchmarks on up to 8 CPUs show that performance in most cases improves almost linearly with the number of CPUs, when not limited by data dependencies. © 2009 IEEE.

关键词： Program processors

来源：评论

学校读者我要写书评

暂无评论

Explorations of Honeycomb Topologies for network-on-Chip

Explorations of Honeycomb Topologies for Network-on-Chip

引用

6th IFIP international conference on network and parallel computing

作者： Yin, Alexander Wei Xu, thomas Canhao Liljeberg, Pasi Tenhunen, Hannu Univ Turku Dept Informat Technol Turku Finland

ISBN: (纸本)9781424449903

Rectangular mesh and torus are the mostly used topologies in network-on-chip (NoC) based systems. In this paper, we quantitatively illustrate that the honeycomb topology is an advantageous design alternative in terms of network cost which is one of the most important parameters that reflects both network performance and implementation cost. Comparing with the rectangular mesh and torus, honeycomb mesh and torus topologies lead to 40% decrease of the network cost. then we explore the NoC related topological properties of both honeycomb mesh and torus topologies. By transforming the honeycomb topologies into rectangular brick shapes, we demonstrate that the honeycomb topologies are feasible to be implemented with rectangular devices. We also propose a 3D honeycomb topology since 3D IC has become an emerging and promising technique. Another contribution of this paper is the proposal of deadlock free routing algorithms. Based on either the concept of turn model or the logical network, deadlock free routing for all the discussed honeycomb topologies can be achieved.

关键词： Topology

来源：评论

学校读者我要写书评

暂无评论

DPM: A Demand-driven Virtual Disk Prefetch Mechanism for Mobile Personal computing Environments

DPM: A Demand-driven Virtual Disk Prefetch Mechanism for Mob...

引用

6th IFIP international conference on network and parallel computing

作者： Chen, Bin Xiao, Nong Cai, Zhiping Wang, Ji Natl Univ Def Technol Sch Comp Changsha Hunan Peoples R China

ISBN: (纸本)9781424449903

In this paper, we propose a demand-driven virtual disk (VD) prefetch mechanism-DPM to improve the performance of virtual machine (VM) at destination site for mobile personal computing environments. DPM uses an optimized COW (Copy-on-Write) virtual block device to split the traditional one-piece large-sized VD image into multiple small-sized SVDs (Software Virtual Disk) at a basic granularity of a single kind of software. Based on the fine-grained VD splitting, DPM uses an access frequency and priority-based prefetch target identifying-APTI algorithm to identify the SVDs of the being-used software by the user in real-time mode at destination site, and prefetches those SVDs by utilizing P2P transportation mechanism at background. We have built a prototype to realize DPM on Xen virtual machine monitor (VMM). Experiments on the prototype show that DPM can effectively improve the VM performance at an unexpected destination site without any cached VD state, supporting agile mobility of personal computing environments.

关键词： virtual machine virtual disk prefetch personal computing environment peer-to-peer

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共61页 << < 1 2 3 4 5 6 7 8 9 10 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：