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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,133 篇 会议
24 篇 期刊文献
20 册 图书

馆藏范围

1,177 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

976 篇 工学
- 909 篇 计算机科学与技术...
- 419 篇 软件工程
- 228 篇 信息与通信工程
- 147 篇 电气工程
- 67 篇 电子科学与技术（可...
- 42 篇 控制科学与工程
- 39 篇 生物工程
- 29 篇 机械工程
- 29 篇 动力工程及工程热...
- 24 篇 测绘科学与技术
- 19 篇 生物医学工程（可授...
- 15 篇 安全科学与工程
- 11 篇 光学工程
- 9 篇 建筑学
- 9 篇 网络空间安全
- 8 篇 仪器科学与技术
- 8 篇 材料科学与工程（可...
- 8 篇 化学工程与技术
210 篇 理学
- 138 篇 数学
- 42 篇 生物学
- 35 篇 系统科学
- 34 篇 统计学（可授理学、...
- 19 篇 物理学
133 篇 管理学
- 98 篇 管理科学与工程(可...
- 62 篇 工商管理
- 43 篇 图书情报与档案管...
17 篇 经济学
- 17 篇 应用经济学
17 篇 农学
- 15 篇 作物学
14 篇 法学
- 10 篇 社会学
13 篇 医学
- 9 篇 临床医学
2 篇 教育学
2 篇 军事学
1 篇 艺术学

主题

36 篇 cloud computing
33 篇 parallel process...
27 篇 parallel computi...
24 篇 network topology
22 篇 neural networks
19 篇 machine learning
17 篇 deep learning
17 篇 network security
16 篇 grid computing
15 篇 scalability
15 篇 computer archite...
15 篇 cluster computin...
14 篇 parallel program...
14 篇 computational mo...
14 篇 network architec...
14 篇 edge computing
13 篇 mapreduce
13 篇 high performance...
12 篇 monitoring
12 篇 topology

机构

17 篇 university of ch...
14 篇 institute of com...
9 篇 national univers...
6 篇 college of compu...
6 篇 shandong univ in...
5 篇 university of sc...
5 篇 school of comput...
5 篇 services computi...
5 篇 college of intel...
4 篇 college of physi...
4 篇 qingdao univ col...
4 篇 school of comput...
4 篇 univ bologna dei...
4 篇 jilin univ coll ...
4 篇 imperial vision ...
4 篇 institute of com...
3 篇 college of compu...
3 篇 national enginee...
3 篇 tsinghua univers...
3 篇 department of co...

作者

14 篇 jin hai
7 篇 li daxing
6 篇 liu yang
6 篇 dvorsky jiri
6 篇 shi xuanhua
6 篇 hsu ching-hsien
6 篇 vojacek lukas
5 篇 qian depei
5 篇 xiao limin
4 篇 man ka lok
4 篇 liu jie
4 篇 drazdilova pavla
4 篇 rossi davide
4 篇 benini luca
4 篇 tan guangming
4 篇 zhang jie
4 篇 daxing li
4 篇 beferull-lozano ...
4 篇 li wei
4 篇 tong tong

语言

1,170 篇 英文
5 篇 中文
3 篇 其他

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

共 1177 条记录，以下是571-580 订阅

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

详细简洁

排序：

A parallel Algorithm of Association Rules Based on Cloud computing

A Parallel Algorithm of Association Rules Based on Cloud Com...

引用

8th international ICST conference on Communications and networking in China (CHINACOM)

作者： Wang Yong Zhang Zhe Wang Fang Guilin Univ Elect Technol Dept Comp Sci & Engn Guilin Peoples R China Guilin Univ Elect Technol Sch Informat & Commun Guilin Peoples R China

ISBN: (纸本)9781479914067

In view of the traditional parallel FP-growth algorithm (PFP) that suffers from two major limitations, namely, multiple database scans requirement (i.e., high I/O cost) and high inter-processor communications cost, therefore we design and implement a parallel association rules mining method based on cloud computing. the algorithm adopts the separation strategy to simply visit a local database only once, thus, the inter-processor communication I/O overhead is reduced. What's more, the MapReduce model is used to solve the problem of huge amounts of data mining, as well as the calculated execution taking place in the local data storage node, which can avoid large amounts of data on the network transmission and reduce the communication overhead. By using ordinary PC structures, Hadoop cluster experimental results verify that the proposed algorithm based on cloud computing offers higher efficiency and has a good speedup.

关键词： FP-growth parallel computing Cloud computing MapReduce Association Rules

来源：评论

学校读者我要写书评

暂无评论

A Synchronous parallel Max-Flow Algorithm for Real-World networks

A Synchronous Parallel Max-Flow Algorithm for Real-World Net...

引用

IEEE international conference on High Performance computing and Communications (HPCC)

作者： Guojing Cong IBM T.J. Watson Research Center Yorktown Heights NY

ISBN: (纸本)9781479961245

We study computing maximum flows for real-world networks. In contrast to prior studies, our implementation is bulk synchronous. Our algorithm applies push and relabel operations on all active vertices in parallel, and maintains a preflow through a delayed flow update approach with handshakes between flow pushing and flow receiving. In our implementation the heuristics are no longer entangled with the push and relabel operations as in prior implementations. We apply two heuristics well known for the sequential algorithm, that is, global relabel and gap relabel, to our parallel implementation. Experiments on networks constructed for computer vision images show that our parallel implementation on the target 8-core machine is up to 8.6 times faster than the best sequential implementation. We also propose a new augmenting path based heuristic for small-world graphs. On large social networks with up to billions of edges our implementation achieves close to 40 times parallel speedup.

关键词： Program processors Social network services Approximation algorithms Heuristic algorithms Computer vision Algorithm design and analysis Communities

来源：评论

学校读者我要写书评

暂无评论

Distributed Applications and Interoperable Systems - 13th ifip WG 6.1 international conference, DAIS 2013, Held as Part of the 8th international Federated conference on Distributed computing Techniques, DisCoTec 2013, Proceedings

Distributed Applications and Interoperable Systems - 13th IF...

引用

13th ifip WG 6.1 international conference on Distributed Applications and Interoperable Systems, DAIS 2013, Held as Part of the 8th international Federated conference on Distributed computing Techniques, DisCoTec 2013

ISBN: (纸本)9783642385407

the proceedings contain 18 papers. the topics discussed include: semantically aware contention management for distributed applications;FITCH: supporting adaptive replicated services in the cloud;network forensics for cloud computing;dynamic deployment of sensing experiments in the wild using smartphones;AJITTS: adaptive just-in-time transaction scheduling;strategies for generating and evaluating large-scale powerlaw-distributed P2P overlays;ambient clouds: reactive asynchronous collections for mobile ad hoc network applications;bandwidth prediction in the face of asymmetry;a scalable benchmark as a service platform;failure analysis and modeling in large multi-site infrastructures;evaluating the price of consistency in distributed file storage services;an effective scalable SQL Engine for N0SQL databases;and EZ: towards efficient asynchronous protocol gateway construction.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Dynamic Trust conference Algorithm for Social network

A Dynamic Trust Conference Algorithm for Social Network

引用

8th international conference on P2P, parallel, Grid, Cloud and Internet computing (3PGCIC)

作者： Liu Xin Shi Leyi Wang Yao Xin Zhaojun Fu Wenjing China Univ Petr East China Coll Comp & Commun Engn Qingdao Peoples R China

ISBN: (纸本)9780769550947

More and more users joined in social network. the precise social trust value is critical for application system such as recommendation system. To a user, the egocentric network is formed by the user, his friends and social relationships between him and other users. We proposed an algorithm for inferring dynamic trust based on trust chains and interactions. Indirect trust values are calculated depending on direct trust values and trust chains in the egocentric network. As the social network evolves, the dynamic trust values can be resulted from the interactions between a user and his friends and trust reference. By statistical analysis of trust value in social network, this algorithm improved the accuracy of trust transitivity and trust value computing compared with a classical trust algorithm.

关键词： social network IM tools egocentric network social trus trust chain

来源：评论

学校读者我要写书评

暂无评论

Design of Cloud-based parallel Exclusive Signature Matching Model in Intrusion Detection

Design of Cloud-based Parallel Exclusive Signature Matching ...

引用

15th IEEE international conference on High Performance computing and Communications (HPCC) /11th IEEE/ifip international conference on Embedded and Ubiquitous computing (EUC)

作者： Meng, Yuxin Li, Wenjuan Kwok, Lam-For City Univ Hong Kong Dept Comp Sci Hong Kong Hong Kong Peoples R China

ISBN: (纸本)9780769550886

Signature-based intrusion detection systems have been widely deployed in current network environments to defend against various attacks, but the expensive process of signature matching is a major suffering problem for these detection systems. thus, a high-performance signature matching scheme is of great importance for a signature-based IDS. In our previous work, we have developed an exclusive signature matching scheme that aims to identify a mismatch instead of locating an accurate match and achieved good results in the experiments. With the advent of Cloud computing, IDS as a service (IDSaaS) has been proposed as an alternative by offloading the expensive operations such as the process of signature matching to the cloud. In this paper, we attempt to design a parallel model to conduct the exclusive signature matching in a cloud. In the evaluation, we implemented our model in a cloud environment and investigated its performance compared with Snort. the experimental results indicate that our proposed model can achieve promising performance in such a cloud environment.

关键词： Intrusion Detection Exclusive Signature Matching parallel Model Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Conditional Diagnosability of Complete Josephus Cubes

Conditional Diagnosability of Complete Josephus Cubes

引用

10th ifip international conference on network and parallel computing (NPC)

作者： Lu, Lishan Zhou, Shuming Fujian Normal Univ Sch Math & Comp Sci Fuzhou 350007 Fujian Peoples R China Fujian Normal Univ Key Lab Network Secur & Cryptol Fuzhou 350007 Peoples R China

ISBN: (纸本)9783642408199;9783642408205

the growing size of the multiprocessor system increases its vulnerability to component failures. the fault diagnosis is the process of identifying faulty processors in a system through self-testing, and the diagnosability is an important parameter to measure the reliability of an interconnection network. As a new measure of fault tolerance, conditional diagnosability can better evaluate the real diagnosability of interconnection networks. In this paper, we derive the conditional diagnosability of the multiprocessor systems in terms of Complete Josephus Cubes CJC(n) (n >= 8) under the comparison model.

关键词： Comparison diagnosis conditional diagnosability Complete Josephus Cubes

来源：评论

学校读者我要写书评

暂无评论

Coordinating phased activities while maintaining progress

引用

15th international conference on Coordination Models and Languages, COORDINATION 2013, Held as Part of the 8th international Federated conference on Distributed computing Techniques, DisCoTec 2013

作者： Cogumbreiro, Tiago Martins, Francisco thudichum Vasconcelos, Vasco LaSIGE Faculty of Sciences University of Lisbon Portugal

ISBN: (纸本)9783642384929

In order to develop reliable applications for parallel machines, programming languages and systems need to provide for flexible parallel programming coordination techniques. Barriers, clocks and phasers constitute promising synchronisation mechanisms, but they exhibit intricate semantics and allow writing programs that can easily deadlock. We present an operational semantics and a type system for a fork/join programming model equipped with a flexible variant of phasers. Our proposal allows for a precise control over the maximum number of synchronisation steps each task can be ahead of others. A type system ensures that programs do not deadlock, even when they use multiple phasers. © 2013 ifip international Federation for Information Processing.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

QbDJ: A Novel Framework for Handling Skew in parallel Join Processing on Distributed Memory

QbDJ: A Novel Framework for Handling Skew in Parallel Join P...

引用

15th IEEE international conference on High Performance computing and Communications (HPCC) /11th IEEE/ifip international conference on Embedded and Ubiquitous computing (EUC)

作者： Cheng, Long Kotoulas, Spyros Ward, Tomas E. theodoropoulos, Georgios Natl Univ Ireland Maynooth Kildare Ireland IBM Res Dublin Ireland Univ Durham Durham DH1 3HP England

ISBN: (纸本)9780769550886

the performance of parallel distributed data management systems becomes increasingly important with the rise of Big Data. parallel joins have been widely studied both in the parallel processing and the database communities. Nevertheless, most of the algorithms so far developed do not consider the data skew, which naturally exists in various applications. State of the art methods designed to handle this problem are based on extensions to either of the two prevalent conventional approaches to parallel joins - the hash-based and duplication-based frameworks. In this paper, we introduce a novel parallel join framework, query-based distributed join (QbDJ), for handling data skew on distributed architectures. Further, we present an efficient implementation of the method based on the asynchronous partitioned global address space (APGAS) parallel programming model. We evaluate the performance of our approach on a cluster of 192 cores (16 nodes) and datasets of 1 billion tuples with different skews. the results show that the method is scalable, and also runs faster with less network communication compared to state-of-art PRPD approach in [1] under high data skew.

关键词： Distributed join parallel join data skew high performance X10

来源：评论

学校读者我要写书评

暂无评论

network forensics for cloud computing

Network forensics for cloud computing

引用

作者： Gebhardt, Tobias Reiser, Hans P. TÜV SÜD AG Embedded Systems Barthstr. 16 80339 Munich Germany University of Passau Innstr. 43 94032 Passau Germany

ISBN: (纸本)9783642385407

Computer forensics involves the collection, analysis, and reporting of information about security incidents and computer-based criminal activity. Cloud computing causes new challenges for the forensics process. this paper addresses three challenges for network forensics in an Infrastructure-as-a-Service (IaaS) environment: First, network forensics needs a mechanism for analysing network traffic remotely in the cloud. this task is complicated by dynamic migration of virtual machines. Second, forensics needs to be targeted at the virtual resources of a specific cloud user. In a multi-tenancy environment, in which multiple cloud clients share physical resources, forensics must not infringe the privacy and security of other users. third, forensic data should be processed directly in the cloud to avoid a costly transfer of huge amounts of data to external investigators. this paper presents a generic model for network forensics in the cloud and defines an architecture that addresses above challenges. We validate this architecture with a prototype implementation based on the OpenNebula platform and the Xplico analysis tool. © 2013 ifip international Federation for Information Processing.

关键词： network architecture

来源：评论

学校读者我要写书评

暂无评论

A network-Aware Virtual Machine Allocation in Cloud Datacenter

A Network-Aware Virtual Machine Allocation in Cloud Datacent...

引用

10th ifip international conference on network and parallel computing (NPC)

作者： Yao, Yan Cao, Jian Li, Minglu Shanghai Jiao Tong Univ Dept Comp Sci & Engn Shanghai 200030 Peoples R China

ISBN: (纸本)9783642408199;9783642408205

In a cloud computing environment, virtual machine allocation is an important task for providing infrastructure services. Generally, the datacenters, on which a cloud computing platform runs, are distributed over a wide area network. therefore, communication cost should be taken into consideration when allocating VMs across servers of multiple datacenters. A network-aware VM allocation algorithm for cloud is developed. It tries to minimize the communication cost and latency between servers, with the number of VMs, VM configurations and communication bandwidths are satisfied to users. Specifically, a two-dimensional knapsack algorithm is applied to solve this problem. the algorithm is evaluated and compared with other ones through experiments, which shows satisfying results.

关键词： VM allocation cloud datacenter Two dimensional knapsack algorithm

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共118页 << < 54 55 56 57 58 59 60 61 62 63 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：