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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,750 篇 会议
29 册 图书
25 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

1,388 篇 工学
- 1,272 篇 计算机科学与技术...
- 598 篇 软件工程
- 238 篇 信息与通信工程
- 218 篇 电气工程
- 87 篇 控制科学与工程
- 53 篇 电子科学与技术（可...
- 44 篇 机械工程
- 41 篇 生物工程
- 33 篇 动力工程及工程热...
- 26 篇 石油与天然气工程
- 20 篇 化学工程与技术
- 19 篇 环境科学与工程（可...
- 18 篇 仪器科学与技术
- 17 篇 生物医学工程（可授...
- 17 篇 网络空间安全
- 15 篇 材料科学与工程（可...
- 15 篇 测绘科学与技术
- 14 篇 力学（可授工学、理...
- 14 篇 安全科学与工程
307 篇 理学
- 202 篇 数学
- 48 篇 生物学
- 41 篇 物理学
- 39 篇 系统科学
- 30 篇 统计学（可授理学、...
- 25 篇 化学
198 篇 管理学
- 130 篇 管理科学与工程(可...
- 77 篇 图书情报与档案管...
- 57 篇 工商管理
72 篇 医学
- 64 篇 临床医学
16 篇 法学
15 篇 经济学
- 15 篇 应用经济学
15 篇 教育学
6 篇 农学
3 篇 文学
2 篇 军事学

主题

105 篇 distributed comp...
101 篇 distributed comp...
74 篇 parallel process...
59 篇 cloud computing
44 篇 computational mo...
44 篇 parallel computi...
38 篇 distributed data...
37 篇 parallel program...
37 篇 grid computing
36 篇 parallel algorit...
33 篇 computer archite...
31 篇 big data
31 篇 parallel process...
28 篇 application soft...
26 篇 fault tolerance
26 篇 machine learning
25 篇 resource managem...
24 篇 scalability
24 篇 middleware
23 篇 concurrent compu...

机构

9 篇 laboratory of in...
8 篇 zhejiang univ co...
7 篇 plekhanov russia...
7 篇 chinese acad sci...
7 篇 science and tech...
6 篇 univ adelaide sc...
6 篇 institute of com...
5 篇 department of in...
5 篇 shanghai jiao to...
4 篇 college of compu...
4 篇 school of comput...
4 篇 harbin inst tech...
4 篇 school of inform...
4 篇 univ otago dept ...
3 篇 huazhong univ sc...
3 篇 fuyang rongda co...
3 篇 key laboratory o...
3 篇 department of co...
3 篇 university of el...
3 篇 school of comput...

作者

13 篇 zomaya albert y.
10 篇 shen hong
8 篇 todorov venelin
8 篇 rothermel kurt
7 篇 li kuan-ching
6 篇 leymann frank
6 篇 li y
6 篇 liu jie
6 篇 kopp oliver
5 篇 dimov ivan
5 篇 nakayama shigeru
5 篇 huang z.
5 篇 gankevich ivan
5 篇 albert y. zomaya
5 篇 breitenbuecher u...
5 篇 yang chao-tung
4 篇 li kenli
4 篇 blochinger wolfg...
4 篇 liu yang
4 篇 leung k.

语言

1,730 篇 英文
56 篇 其他
15 篇 中文
10 篇 俄文

检索条件"任意字段=8th International Conference on Parallel and Distributed Computing, Applications and Technologies"

共 1804 条记录，以下是1031-1040 订阅

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

详细简洁

排序：

A partitioning algorithm for parallel sorting on distributed memory systems

A partitioning algorithm for parallel sorting on distributed...

引用

13th IEEE international Workshop on FTDCS 2011, the 8th international conference on ATC 2011, the 8th international conference on UIC 2011 and the 13th IEEE international conference on HPCC 2011

作者： Hofmann, Michael Runger, Gudula Department of Computer Science Chemnitz University of Technology Germany

ISBN: (纸本)9780769545387

parallel sorting methods for distributed memory systems often use partitioning algorithms to prepare the redistribution of data items. this article proposes a partitioning algorithm that calculates a redistribution specified by the number of data items to be finally located on each process. this partitioning algorithm can also be used for data items with weights, which might express a computational load to be expected, and to produce a redistribution with an individual accumulated weight of data items specified for each process. Another important feature is that data sets with duplicated data keys can be handled. parallel sorting with those properties is often needed for parallel scientific application codes, such as particle simulations, in which the dynamics of the simulated system may destroy locality and load balance required for an efficient computation. It is applied to random sample data and to a particle simulation code requiring a sorting. Performance results have been obtained on an IBM Blue Gene/P platform with up to 32768 cores. the results show that the proposed parallel sorting method performs well in comparison to other existing algorithms. © 2011 IEEE.

关键词： Sorting

来源：评论

学校读者我要写书评

暂无评论

An XML data placement strategy for distributed XML storage and parallel query

An XML data placement strategy for distributed XML storage a...

引用

2011 12th international conference on parallel and distributed computing, applications and technologies, PDCAT 2011

作者： Zhang, Jing Lang, Bo Duan, Yawei Development Environment State Key Laboratory of Software Beihang University Beijing China

ISBN: (纸本)9780769545646

Since there has been significant amount of XML documents generated in various application domains, efficient XML management has become an important problem. distributed XML storage and parallel query based on MapReduce can be an effective solution to this problem. As XML data placement strategy is a key factor of parallel system performance, in this paper we present an XML placement strategy, which is Query Workload Estimation based XML Placement strategy (QWEXP) for efficient distributed XML storage and parallel query. To achieve query workload balance, it partitions XML based on query workload estimation which is calculated by XML structure without knowing of user queries, considering that in common application scenarios user queries are unknown in advance. the partitioned XML segments are around an XML storage unit W0, to support scalability of parallel XML database. Finally segments are distributed to each processing node evenly to ensure workload balance on parallel query execution. Experimental results have shown that QWEXP promotes the speedup and scaleup properties of parallel XML system greatly. © 2011 IEEE.

关键词： XML

来源：评论

学校读者我要写书评

暂无评论

A MapReduce based parallel SVM for large scale spam filtering

A MapReduce based parallel SVM for large scale spam filterin...

引用

2011 8th international conference on Fuzzy Systems and Knowledge Discovery, FSKD 2011, Jointly with the 2011 7th international conference on Natural Computation, ICNC'11

作者： Caruana, Godwin Li, Maozhen Qi, Man School of Engineering and Design Brunel University Uxbridge Middlesex UB8 3PH United Kingdom Department of Computing Canterbury Christ Church University Canterbury Kent CT1 1QU United Kingdom Key Laboratory of Embedded Systems and Service Computing Ministry of Education Tongji University China

ISBN: (纸本)9781612841816

Spam continues to inflict increased damage. Varying approaches including Support Vector Machine (SVM) based techniques have been proposed for spam classification. However, SVM training is a computationally intensive process. this paper presents a parallel SVM algorithm for scalable spam filtering. By distributing, processing and optimizing the subsets of the training data across multiple participating nodes, the distributed SVM reduces the training time significantly. Ontology based concepts are also employed to minimize the impact of accuracy degradation when distributing the training data amongst the SVM classifiers. © 2011 IEEE.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

Supporting strong reliability for distributed complex event processing systems

Supporting strong reliability for distributed complex event ...

引用

13th IEEE international Workshop on FTDCS 2011, the 8th international conference on ATC 2011, the 8th international conference on UIC 2011 and the 13th IEEE international conference on HPCC 2011

作者： Völz, Marco Koldehofe, Boris Rothermel, Kurt Universität Stuttgart Institute of Parallel and Distributed Systems Universitätsstr. 38 70569 Stuttgart Germany

ISBN: (纸本)9780769545387

Many application classes such as monitoring applications, involve processing a massive amount of data from a possibly huge number of data sources. Complex Event Processing (CEP) has evolved as the paradigm of choice to determine meaningful situations (complex events) by performing stepwise correlation over event streams. To keep up with the high scalability demands of growing input streams, recent approaches distribute event correlation over several correlation nodes. However, already a failure of a single correlation node impacts the correctness of the final correlation result. In this paper, we illustrate the importance of a strong reliability semantics for CEP in the context of a monitoring application in a distributed production environment. Strong reliability ensures each complex event is detected and delivered exactly once to each application entity, and cannot be guaranteed by the naive application of established replication principles. We present a replication scheme which ensures strong reliability in an asynchronous system model and can be applied to an arbitrary distributed CEP system. the algorithm tolerates f simultaneous failures by introducing f additional replicas for each correlation node. We prove correctness as well as evaluate the overhead introduced by the algorithm. Results show, that the overhead scales linearly with the number of deployed replicas and the node failure rate. © 2011 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Research of the mining algorithm based on distributed database

Research of the mining algorithm based on distributed databa...

引用

2011 8th international conference on Fuzzy Systems and Knowledge Discovery, FSKD 2011, Jointly with the 2011 7th international conference on Natural Computation, ICNC'11

作者： Cao, Wenliang Hu, Xuanzi Dong, Chongjie Department of Computer Engineering DongGuan Polytechnic Dongguan Guangdong China

ISBN: (纸本)9781612841816

Data mining acquires knowledge and rules that is connotative, unknown and having potential value for decision-making from large databases or data warehouses. Existing association rule mining algorithms and modules cater to a centralized environment, such as database or data warehouse. With the development of distributed database and network technology, they don't meet the needs of mining rules from distributed data sets. In this paper, we provide a mining model based on the distributed database and a corresponding effective mining algorithm. Using association rules of market basket analysis, integrate every database file, then get the mining result, and make a further mining upon the mining method, transport the rules which are not fit with the requirements back to each distributed station to make a more accurate mining process, thus avoiding the frequent network communication. this algorithm can reduce frequent communication burden, they has an distinguish virtue in parallel arithmetic computing and asynchronous operation & heterogeneous mining. © 2011 IEEE.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Agent based system architecture for network security monitoring

Agent based system architecture for network security monitor...

引用

8th international conference on Advances and Trends in Engineering Materials and their applications, AES-ATEMA'2011

作者： Paulins, Nauris Faculty of Information Technologies Latvia University of Agriculture Jelgava LV-3000 Latvia

ISBN: (纸本)9780986650468

the paper presents an agent based security system approach for intrusion detection in distributed computer networks. the work introduces intrusion detection frame and detection approaches. Intelligent and mobile agent technologies are discussed. Such agent issues as agent intelligence, autonomy, cooperation, mobile agents move and security are introduced. these characteristics are enough to construct architecture for distributed computer networks monitoring in a controlled way. In this paper new intrusion detection system architecture based on mobile agents and hybrid detection which includes anomaly and misuse detection methods is proposed. In these architecture agents are used as coordination and organization units for data analysis between several network segments. Such system provides flexible integration of different agent types and can detect intrusions more accurately and reduce the system load by making computing on local network nodes. Finally, this work discusses the main challenges for agent based intrusion detectors, with special emphasis on new research directions. © 2011, Advanced Engineering Solutions.

关键词： Intrusion detection

来源：评论

学校读者我要写书评

暂无评论

Efficient and distributed rule placement in heavy constraint-driven event systems

Efficient and distributed rule placement in heavy constraint...

引用

13th IEEE international Workshop on FTDCS 2011, the 8th international conference on ATC 2011, the 8th international conference on UIC 2011 and the 13th IEEE international conference on HPCC 2011

作者： Schilling, Björn Koldehofe, Boris Rothermel, Kurt Institute of Parallel and Distributed Systems Universitätsstr. 38 Stuttgart Germany

ISBN: (纸本)9780769545387

Complex Event Processing (CEP) is of increasing importance in many industrial applications to integrate a huge number of events in a scalable manner. A core challenge towards scalable CEP is to efficiently distribute the rules which define how correlations between events can be detected within an event processing network. Although significant progress has been made recently, there remains a fundamental gap in supporting requirements that emerge from deploying CEP over heterogeneous and independent processing environments. Heterogeneity typically imposes many constraints on the placement of rules, which increases the complexity of the underlying optimization problem and cannot be handled efficiently by existing solutions. In this paper we examine the distributed placement, migration and optimization of rules in the context of the constraint optimization problem to minimize network usage. We propose and evaluate a placement algorithm that efficiently finds valid solutions in scenarios where the solution space is heavily restricted by constraints. the algorithm operates in a decentralized way and is adaptive to dynamic changes of processing nodes, rules, and load characteristics of the event processing network. the proposed rule migration policies resolve invalid placements quickly and thus ensure high availability. the evaluations show that the proposed algorithm is able to efficiently find near optimum solutions within heavy constraint-driven network conditions. © 2011 IEEE.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

Slot Selection and Co-allocation for Economic Scheduling in distributed computing

Slot Selection and Co-allocation for Economic Scheduling in ...

引用

11th international conference on parallel computing technologies

作者： Toporkov, Victor Bobchenkov, Alexander Toporkova, Anna Tselishchev, Alexey Yemelyanov, Dmitry Moscow Power Engn Inst Dept Comp Sci Ul Krasnokazarmennaya 14 Moscow 111250 Russia Moscow State Inst Elect & Math Moscow 109028 Russia CERN CH-1211 Geneva Switzerland

ISBN: (纸本)9783642231773

In this paper, we present slot selection algorithms for job batch scheduling in distributed computing with non-dedicated resources. Jobs are parallel applications and these applications are independent. Existing approaches towards resource co-allocation and job scheduling in economic models of distributed computing are based on search of time-slots in resource occupancy schedules. A launch of a parallel job requires a co-allocation of a specified number of slots. the sought time-slots must match requirements of necessary span, computational resource properties, and cost. Usually such scheduling methods consider only one suited variant of time-slot set. this paper discloses a scheduling scheme that features multi-variant search. Two algorithms of linear complexity for search of alternative variants are proposed. Having several optional resource configurations for each job makes an opportunity to perform an optimization of execution of the whole batch of jobs and to increase overall efficiency of scheduling.

关键词： Scheduling co-allocation slot resource request job batch task

来源：评论

学校读者我要写书评

暂无评论

TRUSTIE: Design of a Trustworthy Software Production Environment

TRUSTIE: Design of a Trustworthy Software Production Environ...

引用

Int Joint conference of 10th IEEE Int Conf on Trust, Security and Privacy in computing and Communications (TrustCom) / 8th IEEE Int Conf on Embedded Software and Systems (ICESS) / 6th Int Conf on Frontier of Computer Science and Technology (FCST)

作者： Wang, Huaimin Natl Univ Def Technol Sch Comp Natl Lab Parallel & Distributed Proc Changsha 410073 Hunan Peoples R China

ISBN: (纸本)9780769546001

Internet fundamentally changes the model of software development, the demands of software quality, and the process of software resource sharing. Internetbased environment for trustworthy software production is recognized as a key topic of software engineering in both academic and software industry. In this paper, the concepts and models of trustworthy software are introduced which dominate the design of Trustie environment. Trustie provides trustworthy software components sharing by an evolving software repository, and provides collaborative software development in a customizable development platform powered by a software production line framework. Finally the layered practices of research and application based on Trustie preliminarily demonstrate the effectiveness as well as the promising future of this environment.

关键词： Collaboration Development Production Environment Trustworthy Software

来源：评论

学校读者我要写书评

暂无评论

Towards network-aware divisible load theory for optical grids

Towards network-aware divisible load theory for optical grid...

引用

13th IEEE international Workshop on FTDCS 2011, the 8th international conference on ATC 2011, the 8th international conference on UIC 2011 and the 13th IEEE international conference on HPCC 2011

作者： Abouelela, Mohamed El-Darieby, Mohamed Software Systems Engineering Department University of Regina Regina SK Canada

ISBN: (纸本)9780769545387

Most grid applications require the processing of large amounts of data stored at different locations across the network which makes optical grid infrastructures optimal for such applications. the increase in intensity of data- and communications of these applications calls for new mechanisms and theories on how to optimally allocate optical grid resources. Typical Divisible Load theory (DLT) makes optimal allocation of computational resources. In this paper, we introduce Network Aware Divisible Load Algorithm (NADLA) that extends DLT to optimally allocate both the computational and networking resources of an optical grid. We assume a data- and communications-intensive application where data is stored at different sites across the optical grid and can be divided into independent subsets to be processed in parallel at different sites. the algorithm defines an optimal data transfer schedule that defines when to transfer what data subsets to which sites across the optical grid in order to minimize the overall application completion time. It consists of two phases. In the first phase, NADLA provide load distribution that minimizes application completion time taking into account network connectivity and computational and networking resources availability. Site connectivity is estimated by considering the bandwidth and the expected free time of all the links connecting this site to other sites. In the second phase, a simple greedy algorithm is used to allocate computational and networking resources. Extensive Simulations are conducted to examine the performance of the proposed algorithm for different application types and sizes, and different optical grid topologies. Simulation results show the advantages of the proposed algorithm over the traditional DLT approach for the category of applications considered. © 2011 IEEE.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共181页 << < 100 101 102 103 104 105 106 107 108 109 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：