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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

10,925 篇 会议
277 篇 期刊文献
26 册 图书

馆藏范围

11,228 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

5,461 篇 工学
- 5,202 篇 计算机科学与技术...
- 2,309 篇 软件工程
- 883 篇 电气工程
- 569 篇 信息与通信工程
- 252 篇 控制科学与工程
- 221 篇 电子科学与技术（可...
- 137 篇 网络空间安全
- 91 篇 机械工程
- 60 篇 生物工程
- 58 篇 动力工程及工程热...
- 52 篇 生物医学工程（可授...
- 46 篇 环境科学与工程（可...
- 45 篇 仪器科学与技术
- 41 篇 安全科学与工程
- 40 篇 建筑学
- 40 篇 测绘科学与技术
- 34 篇 化学工程与技术
- 33 篇 土木工程
- 32 篇 交通运输工程
1,034 篇 理学
- 814 篇 数学
- 121 篇 系统科学
- 116 篇 统计学（可授理学、...
- 83 篇 物理学
- 70 篇 生物学
- 48 篇 化学
- 41 篇 地球物理学
988 篇 管理学
- 843 篇 管理科学与工程(可...
- 285 篇 工商管理
- 176 篇 图书情报与档案管...
57 篇 经济学
- 54 篇 应用经济学
36 篇 法学
26 篇 医学
21 篇 农学
9 篇 教育学
6 篇 文学
3 篇 艺术学
2 篇 军事学

主题

1,705 篇 concurrent compu...
1,582 篇 distributed comp...
1,152 篇 parallel process...
985 篇 computer science
950 篇 computational mo...
873 篇 computer archite...
860 篇 application soft...
719 篇 grid computing
596 篇 hardware
589 篇 high performance...
523 篇 processor schedu...
487 篇 computer network...
454 篇 resource managem...
428 篇 scalability
407 篇 costs
395 篇 bandwidth
394 篇 runtime
386 篇 parallel program...
366 篇 peer to peer com...
350 篇 delay

机构

47 篇 college of compu...
40 篇 institute of com...
30 篇 oak ridge natl l...
29 篇 ibm thomas j. wa...
25 篇 institute of com...
23 篇 inria
23 篇 oak ridge nation...
22 篇 school of comput...
21 篇 mathematics and ...
18 篇 argonne natl lab...
18 篇 department of co...
18 篇 department of co...
18 篇 tokyo institute ...
17 篇 department of co...
17 篇 georgia inst tec...
17 篇 iit dept comp sc...
16 篇 univ chinese aca...
16 篇 lawrence berkele...
16 篇 department of co...
15 篇 department of co...

作者

32 篇 dongarra jack
30 篇 jack dongarra
23 篇 p. sadayappan
21 篇 a. choudhary
21 篇 david a. bader
19 篇 feng wu-chun
19 篇 maciejewski anth...
18 篇 dhabaleswar k. p...
18 篇 hoefler torsten
18 篇 panda dhabaleswa...
17 篇 p. banerjee
17 篇 h. casanova
17 篇 bader david a.
17 篇 howard jay siege...
17 篇 schulz martin
16 篇 hai jin
15 篇 s.k. das
15 篇 h.j. siegel
15 篇 casanova henri
14 篇 gopalakrishnan g...

语言

11,093 篇 英文
125 篇 其他
10 篇 中文

检索条件"任意字段=International Symposium on Parallel and Distributed Computing"

共 11228 条记录，以下是4131-4140 订阅

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

详细简洁

排序：

Evaluating the performance of a parallel multiobjective artificial bee colony algorithm for inferring phylogenies on multicore architectures

Evaluating the performance of a parallel multiobjective arti...

引用

2012 10th IEEE international symposium on parallel and distributed Processing with Applications, ISPA 2012

作者： Santander-Jiménez, Sergio Vega-Rodríguez, Miguel A. Gómez-Pulido, Juan A. Sánchez-Pérez, Juan M. University of Extremadura Department of Technologies of Computers and Communications ARCO Research Group 10003. Cáceres Spain

ISBN: (纸本)9780769547015

A wide variety of optimization problems requires the combination of Bioinspired and parallel computing to address the complexity needed to get optimal solutions in reduced times. The multicore era allows the researcher to exploit modern arqitectures to resolve these NP-Hard problems. Inferring phylogenetic trees which describe a hypothesis of the evolution of species is a well-known example of this kind of problems. As the space of possible tree topologies increases exponentially with the number of species, exhaustive searches cannot be applied. Also, additional difficulties arise when we must consider simultaneously multiple optimality measures to resolve the problem. In this paper, we report a performance study on multicore machines of a parallel multiobjective adaptation of the Artificial Bee Colony algorithm for inferring phylogenies according to the maximum parsimony and maximum likelihood criteria. Experimental results reveal that our proposal can improve other approaches based on advanced High Performance computing techniques on large data sets. © 2012 IEEE.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Smoothlink: Towards a web-based media context migration environment

Smoothlink: Towards a web-based media context migration envi...

引用

2012 10th IEEE international symposium on parallel and distributed Processing with Applications, ISPA 2012

作者： Serrano, Urko Osmani, Flutra Knutsson, Bjorn TSLab - Royal Institute of Technology Isafjordsgatan 39 Kista Sweden

ISBN: (纸本)9780769547015

Current migration mechanisms for multimedia content in ubiquitous environments lack simplicity and wide deployment across user personal devices. To address this concern, we focus on prospects of wider adoption by designing and implementing a mechanism that enables the user to easily migrate media context between her Internet-enabled devices, regardless of the networks they access. Our proposed architecture employs open web standards while highly prioritizing modularity and sketches a path to increase device compatibility. © 2012 IEEE.

关键词： Ubiquitous computing

来源：评论

学校读者我要写书评

暂无评论

Banking on Decoupling: Budget-driven Sustainability for HPC Applications on EC2 Spot Instances

Banking on Decoupling: Budget-driven Sustainability for HPC ...

引用

31st IEEE international symposium on Reliable distributed Systems (SRDS)

作者： Taifi, Moussa Temple Univ Comp & Informat Sci Dept Philadelphia PA 19122 USA

ISBN: (纸本)9780769547848;9781467323970

Cloud providers are auctioning their excess capacity using dynamically priced virtual instances. These spot instances provide significant savings compared to on-demand or fixed price instances. The users willing to use these resources are asked to provide a maximum bid price per hour, and the cloud provider runs the instances as long as the market price is below the user's bid price. By using such resources, the users are exposed explicitly to failures and need to adapt their applications to provide some level of fault tolerance. In this paper we expose the effect of bidding in the case of virtual HPC clusters composed of spot instances. We describe the interesting effect of uniform versus non-uniform bidding, in terms of failure rate and failure model. We propose an initial attempt to deal with the problem of predicting the runtime of a parallel application under various bidding strategies and various system parameters. We describe the relationship between bidding strategies and programming models. We build a preliminary optimization model that uses real price traces from Amazon Web Services as inputs, as well as instrumented values related to the processing and network capacities of clusters instances on the EC2 services. Our results show preliminary insights into the relationship between non-uniform bidding and application scaling strategies.

关键词： Spot Instances Cloud-based Fault Tolerance Cloud virtual clusters Auction-based cloud computing Decoupling parallel Programming Models Cost-aware Optimization models

来源：评论

学校读者我要写书评

暂无评论

Web services allocation guided by reputation in distributed SOA-based environments

Web services allocation guided by reputation in distributed ...

引用

2012 11th international symposium on parallel and distributed computing, ISPDC 2012

作者： Serbanescu, Vlad Nicolae Pop, Florin Cristea, Valentin Achim, Ovidiu-Marian University POLITEHNICA of Bucharest Faculty of Automatic Control and Computers Romania Oracle TSBU Bucharest Romania

ISBN: (纸本)9780769548050

Web services have become one of the easiest ways to fulfill a wide range of tasks in multiple domains of work. Their availability has increased significantly through Service-Oriented distributed Environments that have become standard platforms for their deployment. At the same time, the clients impose their own constraints and expectations from services and require from the service providers the best replica to satisfy these constraints. The main objective of this paper is implementing a model that can effectively and accurately determine the best endpoint of a web service deployed in a distributed environment depending on the constraints of the client that invoked it and the capabilities of each replica. While each service offers different functions and each client may have different preferences for these functions, our method is independent from the services' features and computes the best replica using properties that define quality (processing time), business constraints (service price) and client's feedback (reputation), properties available for every service. The model is purely mathematical and will produce the same results for the same values of these criteria regardless of the particular functionality of the service invoked. The algorithm behind the model also takes into account the properties specific to distributed environments such as the client's location or the load limitations of the system on which the replica is deployed. This paper describes this algorithm, along with its architecture of the system that implements the model and the tests conducted. © 2012 IEEE.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Towards an infrastructure description language for modeling computing infrastructures

Towards an infrastructure description language for modeling ...

引用

2012 10th IEEE international symposium on parallel and distributed Processing with Applications, ISPA 2012

作者： Ghijsen, Mattijs Van Der Ham, Jeroen Grosso, Paola De Laat, Cees System and Network Engineering Research Group Informatics Institute University of Amsterdam Netherlands

ISBN: (纸本)9780769547015

This paper describes the Infrastructure and Network Description Language (INDL). The aim of INDL is to provide technology independent descriptions of computing infrastructures. These descriptions include the physical resources and the network infrastructure that connects these resources. The description language also provides the necessary vocabulary to describe virtualization of resources and the services offered by these resources. Furthermore, the language can be easily extended to describe federation of different existing computing infrastructures, specific types of (optical) equipment and also behavioral aspects of resources, for example, their energy consumption. Before we introduce INDL we first discuss a number of modeling efforts that have lead to the development of INDL, namely the Network Description Language, the Network Markup Language and the CineGrid Description Language. We also show current applications of INDL in two EU-FP7 projects: NOVI and GEYSERS. We demonstrate the flexibility and extensibility of INDL to cater the specific needs of these two projects. © 2012 IEEE.

关键词： Semantic Web

来源：评论

学校读者我要写书评

暂无评论

A parallel high-order fictitious domain approach for biomechanical applications

A parallel high-order fictitious domain approach for biomech...

引用

2012 11th international symposium on parallel and distributed computing, ISPDC 2012

作者： Ruess, Martin Varduhn, Vasco Rank, Ernst Yosibash, Zohar Technische Universität München Department of Computation in Engineering Munich Germany Ben-Gurion University of the Negev Dept. of Mechanical Engineering Beer Sheva Israel

ISBN: (纸本)9780769548050

The focus of this contribution is on the parallelization of the Finite Cell Method (FCM) applied for biomechanical simulations of human femur bones. The FCM is a high-order fictitious domain method that combines the simplicity of Cartesian grids with the beneficial properties of hierarchical approximation bases of higher order for an increased accuracy and reliablility of the simulation model. A pre-computation scheme for the numerically expensive parts of the finite cell model is presented that shifts a significant part of the analysis update to a setup phase of the simulation, thus increasing the update rate of linear analyses with time-varying geometry properties to a range that even allows user interactive simulations of high quality. Paralellization of both parts, the pre-computation of the model stiffness and the update phase of the simulation is simplified due to a simple and undeformed cell structure of the computation domain. A shared memory parallelized implementation of the method is presented and its performance is tested for a biomedical application of clinical relevance to demonstrate the applicability of the presented method. © 2012 IEEE.

关键词： Biomechanics

来源：评论

学校读者我要写书评

暂无评论

parallel simulation of peer-to-peer systems 12

Parallel simulation of peer-to-peer systems

引用

12th IEEE/ACM international symposium on Cluster, Cloud and Grid computing, CCGrid 2012

作者： Quinson, Martin Rosa, Cristian Thiéry, Christophe LORIA Université de Lorraine France

ISBN: (纸本)9780769546919

Discrete Event Simulation (DES) is one of the major experimental methodologies in several scientific and engineering domains. parallel Discrete Event Simulation (PDES) constitutes a very active research field for at least three decades, to surpass speed and size limitations. In the context of Peer-to-Peer (P2P) protocols, most studies rely on simulation. Surprisingly enough, none of the mainstream P2P discrete event simulators allows parallel simulation although the tool scalability is considered as the major quality metric by several authors. This paper revisits the classical PDES methods in the light of distributed system simulation and proposes a new parallelization design specifically suited to this context. The constraints posed on the simulator internals are presented, and an OS-inspired architecture is proposed. In addition, a new thread synchronization mechanism is introduced for efficiency despite the very fine grain parallelism inherent to the target scenarios. This new architecture was implemented into the general-purpose open-source simulation framework SimGrid. We show that the new design does not hinder the tool scalability. In fact, the sequential version of SimGrid remains orders of magnitude more scalable than state of the art simulators, while the parallel execution saves up to 33% of the execution time on Chord simulations. © 2012 IEEE.

关键词： Simulators

来源：评论

学校读者我要写书评

暂无评论

distributed Ranking in Networks with Limited Memory and Communication

Distributed Ranking in Networks with Limited Memory and Comm...

引用

IEEE international symposium on Information Theory

作者： Jung, Kyomin Kim, Bo Young Vojnovic, Milan Korea Adv Inst Sci & Technol Taejon 305701 South Korea Microsoft Res Cambridge England

ISBN: (纸本)9781467325790

We study a basic information ranking problem in networks where each node holds an individual preference over a set of items and the goal for each node is to identify a sorted list of items with the largest aggregate preference. We would like to achieve this with a fully decentralized algorithm that uses a limited per-node memory and limited pair-wise communications. We show how this problem can be reduced to a plurality selection problem where the goal for each node is to identify an item with the largest aggregate ranking score, and show that solving the reduced problem solves the original ranking problem with high probability. Then we introduce a simple and natural plurality selection algorithm for the selection over m > 1 items that uses only log(2) (m) + 1 bits of per-node memory and per pair-wise communication. We prove correctness of the algorithm with high probability as the number of nodes grows large for the case when each node communicates with any other node, and establish tight convergence time bounds. The information ranking problem studied in this paper is a basic ranking problem that arises in various applications such as sorting elements in distributed computing systems, parallel databases, and may as well serve as a model of decentralized inference and opinion formation in distributed environments.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

parallelized Force-Directed Edge Bundling on the GPU

Parallelized Force-Directed Edge Bundling on the GPU

引用

11th international symposium on distributed computing and Applications to Business, Engineering and Science (DCABES)

作者： Zhu, Delu Wu, Kaichao Guo, Danhuai Chen, Yuanmin Chinese Acad Sci Comp Network Informat Ctr Grad Univ Beijing 100190 Peoples R China Chinese Acad Sci Comp Network Informat Ctr Beijing 100190 Peoples R China DNSLAB China Internet Network Informat Ctr Beijing 100190 Peoples R China

ISBN: (纸本)9780769548180

How to draw large scale spatial interaction data clearly and quickly is a challenge in high performance data visualization research and application field. Force-Directed Edge Bundling (FDEB) helps display graph clearly with significant clutter reduction, but with high time complexity. This paper presents a parallelized FDEB on the GPU (GPU-FDEB), which reforms FDEB and achieves a balanced partitioning of data and calculation to suit computation on the GPU. GPU-FDEB addresses the problem of high time complexity and accelerates FDEB by an order of magnitude.

关键词： GPU parallel FDEB visualization CUDA

来源：评论

学校读者我要写书评

暂无评论

distributed Multimedia Content Analysis with MapReduce

Distributed Multimedia Content Analysis with MapReduce

引用

IEEE international symposium on Personal, Indoor and Mobile Radio Communications

作者： Arto Heikkinen Jouni Sarvanko Mika Rautiainen Mika Ylianttila Department of Communications Engineering University of Oulu Finland Center for Internet Excellence University of Oulu Finland Department of Computer Science and Engineering University of Oulu Finland

ISBN: (纸本)9781467362337

This paper introduces a scalable solution for distributing content-based video analysis tasks using the emerging MapReduce programming model. Scalable and efficient solutions are needed for this type of tasks, as the number of multimedia content is growing at an increasing rate. We present a novel implementation utilizing the popular Apache Hadoop MapReduce framework for both analysis job scheduling and video data distribution. We employ face detection as a case example because it represents a popular visual content analysis task. The main contribution of this paper is the performance evaluation of distribution models for video content processing in various configurations. In our experiments, we have compared the performance of our video data distribution method against two alternatives solutions on a seven node cluster. Hadoop's performance overhead in video content analysis was also evaluated. We found Hadoop to be a data efficient solution with minimal computational overhead for the face detection task.

关键词： MapReduce distributed video analysis Face detection parallel computing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 410 411 412 413 414 415 416 417 418 419 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：