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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

1,298 篇 工学
- 1,197 篇 计算机科学与技术...
- 536 篇 软件工程
- 235 篇 电气工程
- 203 篇 信息与通信工程
- 72 篇 控制科学与工程
- 45 篇 电子科学与技术（可...
- 31 篇 机械工程
- 31 篇 生物工程
- 19 篇 动力工程及工程热...
- 17 篇 力学（可授工学、理...
- 16 篇 网络空间安全
- 14 篇 仪器科学与技术
- 13 篇 化学工程与技术
- 13 篇 石油与天然气工程
- 12 篇 建筑学
- 12 篇 生物医学工程（可授...
- 11 篇 土木工程
- 10 篇 材料科学与工程（可...
- 10 篇 交通运输工程
243 篇 理学
- 172 篇 数学
- 33 篇 生物学
- 33 篇 系统科学
- 31 篇 物理学
- 20 篇 化学
- 19 篇 统计学（可授理学、...
165 篇 管理学
- 116 篇 管理科学与工程(可...
- 59 篇 图书情报与档案管...
- 49 篇 工商管理
65 篇 医学
- 60 篇 临床医学
18 篇 经济学
- 18 篇 应用经济学
11 篇 法学
5 篇 教育学
4 篇 农学
3 篇 文学
1 篇 军事学

主题

155 篇 distributed comp...
84 篇 distributed comp...
77 篇 parallel process...
68 篇 cloud computing
51 篇 artificial intel...
50 篇 computational mo...
46 篇 computer archite...
46 篇 software enginee...
46 篇 distributed data...
44 篇 parallel program...
38 篇 parallel computi...
35 篇 application soft...
32 篇 big data
31 篇 parallel algorit...
31 篇 optimization
31 篇 intelligent netw...
31 篇 protocols
30 篇 concurrent compu...
30 篇 fault tolerance
29 篇 grid computing

机构

7 篇 chinese acad sci...
6 篇 univ adelaide sc...
5 篇 zhejiang univ co...
5 篇 shanghai jiao to...
4 篇 school of comput...
4 篇 harbin inst tech...
4 篇 univ stuttgart i...
4 篇 univ otago dept ...
4 篇 univ stuttgart i...
4 篇 institute of com...
4 篇 national laborat...
3 篇 huazhong univ sc...
3 篇 univ sydney sch ...
3 篇 univ chinese aca...
3 篇 reutlingen univ ...
3 篇 centre for distr...
3 篇 chinese acad sci...
3 篇 lomonosov moscow...
3 篇 huazhong univ sc...
3 篇 university of el...

作者

14 篇 zomaya albert y.
11 篇 shen hong
11 篇 rothermel kurt
7 篇 jack dongarra
6 篇 li y
6 篇 albert y. zomaya
6 篇 roman wyrzykowsk...
5 篇 fahringer thomas
5 篇 duerr frank
5 篇 jerzy waśniewski
5 篇 leymann frank
5 篇 kopp oliver
5 篇 li kuan-ching
5 篇 nakayama shigeru
5 篇 konrad karczewsk...
5 篇 huang z.
5 篇 lee young choon
4 篇 leung k.
4 篇 yang yang
4 篇 prodan radu

语言

1,724 篇 英文
30 篇 俄文
9 篇 其他
4 篇 中文
1 篇 乌克兰文

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

共 1767 条记录，以下是1101-1110 订阅

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

详细简洁

排序：

ParaCube: A scalable OLAP model based on distributed aggregate computing with sibling cubes

ParaCube: A scalable OLAP model based on distributed aggrega...

引用

12th international Asia Pacific Web conference, APWeb 2010

作者： Zhang, Yansong Wang, Shan Huang, Wei Key Laboratory of the Ministry of Education for Data Engineering and Knowledge Engineering Beijing 100872 China School of Information Renmin University of China Beijing 100872 China Department of Computer Harbin Financial College Harbin Helongjiang 150030 China

ISBN: (纸本)9780769540122

the requirements of OLAP applications increase rapidly by dramatically increased data volume, users, query volume and query complexity. the requirement for shortening update period in data warehouse is another crucial factor for a scalable OLAP application. In this paper, we propose a scalable OLAP prototype to support the query processing with increasing data volume by distributing the whole fact tuples to multiple servers to construct a set of sibling cubes which can be merged together to obtain the whole cube. We employ a light weight distribution policy with fully duplicated dimension tables in each sibling server on the observation of very low proportion of space cost for dimension tables. OLAP query with distributed aggregate functions can be transformed into queries to be performed parallel in sibling servers. For non-distributed computing aggregate functions, such as median, the optimized median aggregate computing algorithm is proposed to reduce transmission volume between servers while computing the global median values. We also present a three-level framework in data warehouse to meet the requirement of shorter update period in "operational business intelligence". An asynchronous tunnel model is proposed to reduce update latency by pre-fetching updated tuples to OLAP processing server. Finally, we set up prototype system ParaCube to evaluate performance in SN (shared-nothing) system and multi-core platforms. © 2010 IEEE.

关键词： Data warehouses

来源：评论

学校读者我要写书评

暂无评论

parallel Numerical Algorithms

Parallel Numerical Algorithms

引用

16th international Euro-Par conference on parallel Processing

作者： Amestoy, Patrick di Serafino, Daniela Bisseling, Rob Quintana-Orti, Enrique S. Vajtersic, Marian Univ Toulouse Toulouse France Univ Naples 2 Naples Italy CNR ICAR Naples Italy Univ Utrecht Utrecht Netherlands Univ Jaime I Castellon de La Plana Spain Salzburg Univ A-5020 Salzburg Austria

ISBN: (纸本)9783642152900

Robust and efficient parallel numerical algorithms and their implementation in easy-to-use portable software components are crucial for computational science and engineering applications. they are strongly influenced by the remarkable progress in the development of parallel computer systems. this imposes to adapt or re-design already existing algorithms, or to find new algorithmic approaches, in order to effectively exploit the power that is offered by emerging parallel architectures. On the other hand, the use of numerical algorithms and software in more and more complex applications, to make simulations and computational experiments with a very high level of detail, demands for increasing computing power, thus giving new stimulating impulses to parallel computer developers. the aim of Topic 10 is to provide a forum for the presentation and discussion of recent advances in the field of parallel and distributed numerical algorithms. Different aspects of their design and implementation are addressed, ranging from fundamental algorithmic concepts, through their efficient implementation on modern parallel architectures, up to software design and prototyping in scientific computing and simulation software environments, and to performance analysis. © 2010, Springer-Verlag Berlin Heidelberg.

关键词： parallel architectures

来源：评论

学校读者我要写书评

暂无评论

Packet content matching with packetC searchsets

Packet content matching with packetC searchsets

引用

16th IEEE international conference on parallel and distributed Systems, ICPADS 2010

作者： Duncan, Ralph Jungck, Peder Ross, Kenneth Tillman, Scott CloudShield Technologies SAIC company Sunnyvale CA United States

ISBN: (纸本)9780769543079

Increasing speeds and volumes push network packet applications to use parallel processing to boost performance. Examining the packet payload (message content) is a key aspect of packet processing. applications search payloads to find strings that match a pattern described by regular expressions (regex). Searching for multiple strings that may start anywhere in the payload is a major obstacle to performance. Commercial systems often employ multiple network processors to provide parallel processing in general and use regex software engines or special regex processors to speed up searching performance via parallelism. Typically, regex rules are prepared separately from the application program and compiled into a binary image to be read by a regex processor or software engine. Our approach integrates specifying search rules with specifying network application code written in packet C, a C dialect that hides host-machine specifics, supports coarse-grain parallelism and supplies high-level data type and operator extensions for packet processing. packetC provides a search set data type, as well as match and find operations, to support payload searching. We show that our search set operator implementation, using associative memory and regex processors, lets users enjoy the performance benefits of parallel regex technology without learning hardware-specifics or using a separate regex toolchain's use. © 2010 IEEE.

关键词： Application programs

来源：评论

学校读者我要写书评

暂无评论

parallel implementation of the finite-difference time-domain method in open computing language

Parallel implementation of the finite-difference time-domain...

引用

2010 12th international conference on Electromagnetics in Advanced applications, ICEAA'10

作者： Stefański, T.P. Benkler, S. Chavannes, N. Kuster, N. Integrated Systems Laboratory Swiss Federal Institute of Technology Gloriastrasse 35 8092 Zurich Switzerland Foundation for Research on Information Technologies in Society Zeughausstrasse 43 8004 Zurich Switzerland SPEAG Software R and D Zeughausstrasse 43 8004 Zurich Switzerland

ISBN: (纸本)9781424473687

In this paper we evaluate the usability and performance of Open computing Language (OpenCL) targeted for implementation of the Finite-Difference Time-Domain (FDTD) method. the simulation speed was compared to implementations based on alternative techniques of parallel processor programming. Moreover, the portability of OpenCL FDTD code between modern computing architectures was assessed. the average speed of OpenCL FDTD simulations on a GPU was about 1.1 times lower than a comparable CUDA based solver for domains with sizes varying from 503 to 4003 cells. Although OpenCL code dedicated to GPUs can be executed on multi-core CPUs, a direct porting does not provide satisfactory performance due to an application of architecture specific features in GPU code. therefore, the OpenCL kernels of the developed FDTD code were optimized for multi-core CPUs. However, this improved OpenCL FDTD code was still about 1.5 to 2.5 times slower than the FDTD solver developed in the OpenMP parallel programming standard. the study concludes that, despite current performance drawbacks, the future potential of OpenCL is significant due to its flexibility and portability to various architectures. ©2010 IEEE.

关键词： Program processors

来源：评论

学校读者我要写书评

暂无评论

Improving accuracy and coverage in an internet-deployed reputation mechanism

Improving accuracy and coverage in an internet-deployed repu...

引用

2010 IEEE 10th international conference on Peer-to-Peer computing, P2P 2010

作者： Delaviz, Rahim Andrade, Nazareno Pouwelse, Johan A. Parallel and Distributed Systems Group Department of Computer Science Delft University of Technology Netherlands

ISBN: (纸本)9781424471416

P2P systems can benefit from reputation mechanisms to promote cooperation and help peers to identify good service providers. However, in spite of a large number of proposed reputation mechanisms, few have been investigated in real situations. BarterCast is a distributed reputation mechanism used by our Internet-deployed Bittorent-based file-sharing client Tribler. In BarterCast, each peer uses messages received from other peers to build a weighted, directed subjective graph that represents the upload and download activity in the system. A peer calculates the reputations of other peers by applying the maxflow algorithm to its subjective graph. For efficiency reasons, only paths of at most two hops are considered in this calculation. In this paper, we identify and assess three potential modifications to BarterCast for improving its accuracy and coverage (fraction of peers for which a reputation value can be computed). First, a peer executes maxflow from the perspective of the node with the highest betweenness centrality in its subjective graph instead of itself. Second, we assume a gossiping protocol that gives each peer complete information about upload and download activities in the system, and third, we lift the path length restriction in the maxflow algorithm. To assess these modifications, we crawl the Tribler network and collect the upload and download actions of the peers for three months. We apply BarterCast with and without the modifications on the collected data and measure accuracy and coverage. ©2010 IEEE.

关键词： Peer to peer networks

来源：评论

学校读者我要写书评

暂无评论

Performing real-time image processing on distributed computer systems

Performing real-time image processing on distributed compute...

引用

作者： Dobrescu, Radu Dobrescu, Matei Popescu, Dan Politehnica University of Bucharest Faculty of Control and Computers 313 Splaiul Independentei Bucharest Romania

ISBN: (纸本)9789604741762

the aim of the paper is to validate a software architecture that allows an image processing researcher to develop parallel applications. the challenge was to develop algorithms that perform real-time low level operations on digital images able to be executed on a cluster of desktop PCs. the experiments show how to use parallelizable patterns and how to optimize the load balancing between the workstations.

关键词： Application programs

来源：评论

学校读者我要写书评

暂无评论

What about collaboration in ubiquitous environments?

What about collaboration in ubiquitous environments?

引用

international conference on New technologies of distributed Systems (NOTERE)

作者： Germán Sancho Ismael Bouassida Rodriguez thierry Villemur Saïd Tazi LAAS CNRS Toulouse France UT1 UT2 UPS INSA INP ISAE LAAS Université de Toulouse Toulouse France

Ubiquitous computing environments provide a wide range of new challenges and possibilities in distributed Systems. Among these, collaborative activities involving several users present some complex issues. these activities are very dynamic and imply heterogeneous communications and devices, and therefore adaptive solutions are required. Moreover, context has to be taken into account in order to provide a satisfactory service. It is necessary to consider both high-level requirements and low-level constraints to adapt the system to context changes. this paper claims that collaborative applications for ubiquitous environments represent a very challenging and promising research field. It also proves the requirements of adaptability and context-awareness of such applications by exploring the state of the art in this field.

关键词： Collaboration Pervasive computing Ubiquitous computing Context distributed computing Context-aware services Humans Temperature sensors Prototypes Uninterruptible power systems

来源：评论

学校读者我要写书评

暂无评论

Scalable Co-clustering Algorithms

Scalable Co-clustering Algorithms

引用

10th international conference on Algorithms and Architectures for parallel Processing

作者： Kwon, Bongjune Cho, Hyuk Univ Texas Austin Biomed Engn Austin TX 78712 USA Sam Houston State Univ Comp Sci Huntsville TX 77340 USA

ISBN: (纸本)9783642131189

Co-clustering has been extensively used in varied applications because of its potential to discover latent local patterns that are otherwise unapparent by usual unsupervised algorithms such as k-means. Recently, a unified view of co-clustering algorithms, called Bregman co-clustering (BCC), provides a general framework that even contains several existing co-clustering algorithms, thus we expect to have more applications of this framework to varied data types. However, the amount of data collected from real-life application domains easily grows too big to fit in the main memory of a single processor machine. Accordingly, enhancing the scalability of BCC can be a critical challenge in practice. To address this and eventually enhance its potential for rapid deployment to wider applications with larger data, we parallelize all the twelve co-clustering algorithms in the BCC framework using message passing interface (MPI). In addition, we validate their scalability on eleven synthetic datasets as well as one real-life dataset, where we demonstrate their speedup performance in terms of varied parameter settings.

关键词： Co-clustering Message Passing Interface distributed Co-clustering Scalable Co-clustering parallel Co-clustering

来源：评论

学校读者我要写书评

暂无评论

Adapting Market-Oriented Scheduling Policies for Cloud computing

Adapting Market-Oriented Scheduling Policies for Cloud Compu...

引用

10th international conference on Algorithms and Architectures for parallel Processing

作者： Salehi, Mohsen Amini Buyya, Rajkumar Univ Melbourne Dept Comp Sci & Software Engn Cloud Comp & Distributed Syst CLOUDS Lab Melbourne Vic 3010 Australia

ISBN: (纸本)9783642131189

Provisioning extra resources is necessary when the local resources are not sufficient to meet the user requirements. Commercial Cloud providers offer the extra resources to users in an on demand manner and in exchange of a fee. therefore, scheduling policies are required that consider resources' prices as well as user's available budget and deadline. Such scheduling policies are known as market-oriented scheduling policies. However, existing market-oriented scheduling policies cannot be applied for Cloud providers because of the difference in the way Cloud providers charge users. In this work, we propose two market-oriented scheduling policies that aim at satisfying the application deadline by extending the computational capacity of local resources via hiring resource from Cloud providers. the policies do not have any prior knowledge about the application execution time. the proposed policies are implemented in Gridbus broker as a user-level broker. Results of the experiments achieved in real environments prove the usefulness of the proposed policies.

关键词： Budget control

来源：评论

学校读者我要写书评

暂无评论

Towards an empirical reuse approach for the software evolution: A case study

Towards an empirical reuse approach for the software evoluti...

引用

10th international conference on Quality Software, QSIC 2010

作者： Wang, Ziyou Zhou, Minghui Mei, Hong Laboratory of High Confidence Software Technologies School of Electronics Engineering and Computer Science Peking University Beijing 100871 China

ISBN: (纸本)9780769541310

Software systems must evolve, or they risk losing market share to competitors. However, evolving such a system is extraordinarily difficult, complicated, and time consuming. In this case, how to reuse the existing features of the previous version and reduce the code redundancy is a really appealing problem. For example, in order to support EJB3.0, many application server vendors have to evolve their existing EJB2.x containers to comply with the new standards. However, the code redundancy between both of the container versions not only increases the development cost, but also increases the maintenance cost when the software are modified because of potential problems or new requirements. In this paper, we propose an empirical reuse approach for software evolution and demonstrate it in a real EJB container evolution project. © 2010 IEEE.

关键词： Containers

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共177页 << < 107 108 109 110 111 112 113 114 115 116 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：