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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

1,079 篇 工学
- 1,016 篇 计算机科学与技术...
- 377 篇 软件工程
- 174 篇 电气工程
- 102 篇 信息与通信工程
- 49 篇 控制科学与工程
- 48 篇 电子科学与技术（可...
- 17 篇 动力工程及工程热...
- 16 篇 机械工程
- 14 篇 网络空间安全
- 11 篇 生物医学工程（可授...
- 10 篇 生物工程
- 8 篇 材料科学与工程（可...
- 7 篇 建筑学
- 7 篇 土木工程
- 7 篇 石油与天然气工程
- 6 篇 力学（可授工学、理...
- 6 篇 光学工程
- 6 篇 仪器科学与技术
- 6 篇 安全科学与工程
220 篇 理学
- 172 篇 数学
- 33 篇 系统科学
- 24 篇 物理学
- 24 篇 统计学（可授理学、...
- 15 篇 生物学
120 篇 管理学
- 84 篇 管理科学与工程(可...
- 48 篇 图书情报与档案管...
- 32 篇 工商管理
14 篇 医学
- 14 篇 临床医学
8 篇 教育学
- 8 篇 教育学
7 篇 经济学
- 7 篇 应用经济学
7 篇 法学
4 篇 农学

主题

127 篇 distributed comp...
106 篇 distributed comp...
95 篇 grid computing
91 篇 concurrent compu...
73 篇 parallel process...
66 篇 computer science
60 篇 application soft...
60 篇 computer archite...
55 篇 computer network...
50 篇 cloud computing
46 篇 parallel algorit...
46 篇 computational mo...
42 篇 parallel process...
36 篇 hardware
35 篇 delay
32 篇 costs
30 篇 real time system...
30 篇 high performance...
29 篇 workstations
28 篇 algorithm design...

机构

8 篇 shanghai jiao to...
8 篇 national laborat...
6 篇 argonne natl lab...
4 篇 national laborat...
4 篇 mathematics and ...
3 篇 tech univ munich...
3 篇 rhein westfal th...
3 篇 ibm thomas j. wa...
3 篇 oak ridge nation...
3 篇 rwth aachen univ...
3 篇 univ sci & techn...
3 篇 high performance...
3 篇 argonne natl lab...
3 篇 school of comput...
3 篇 pacific northwes...
3 篇 university of so...
3 篇 czestochowa univ...
3 篇 inst rech inform...
3 篇 department of co...
3 篇 university of te...

作者

7 篇 boukerche azzedi...
7 篇 yang laurence t.
5 篇 tudruj marek
5 篇 yang chao-tung
4 篇 wang jing
4 篇 s. ranka
4 篇 jack dongarra
4 篇 berenbrink petra
4 篇 li ml
4 篇 cristea valentin
4 篇 yong dou
4 篇 buyya rajkumar
4 篇 roman wyrzykowsk...
3 篇 see s
3 篇 fahringer thomas
3 篇 ertl christoph
3 篇 cong guojing
3 篇 zhang lei
3 篇 kamei sayaka
3 篇 vishwanath venka...

语言

1,500 篇 英文
9 篇 其他
7 篇 中文

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

共 1516 条记录，以下是491-500 订阅

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

详细简洁

排序：

Enzymatic numerical P systems - A new class of membrane computing systems

Enzymatic numerical P systems - A new class of membrane comp...

引用

2010 IEEE 5th international Conference on Bio-Inspired computing: theories and Applications, BIC-TA 2010

作者： Pavel, Ana Arsene, Octavian Buiu, Catalin Laboratory of Natural Computing and Robotics POLITEHNICA University of Bucharest 060042 Bucharest Romania Faculty of Biology University of Bucharest Romania

ISBN: (纸本)9781424464388

A P system represents a distributed and parallel computing model in which basic data structures are multi-sets, strings or numerical variables. Numerical P systems have been introduced for possible applications in economics. A simulator for numerical P systems (SNUPS) has been designed, implemented and made available to the scientific community by the authors of this paper. SNUPS allows the development of a wide range of applications, from modeling and simulation of ordinary differential equations, to design and simulation of computational blocks for cognitive architectures and of membrane controllers for autonomous mobile robots. this paper introduces a new class of membrane computing systems, that of enzymatic numerical P systems, in which enzyme-like variables allow the existence of more than one production function in each membrane. the way this new type of deterministic numerical P systems works and the corresponding implementation in SNUPS are detailed, together with an illustrative example. © 2010 IEEE.

关键词： Enzymes

来源：评论

学校读者我要写书评

暂无评论

DMAL-BPIDE: A distributed multi-abstraction-level business process IDE

DMAL-BPIDE: A distributed multi-abstraction-level business p...

引用

5th international Conference on P2P, parallel, Grid, Cloud and Internet computing, 3PGCIC 2010

作者： Xu, Xiaotian Sun, Hailong Wang, Xu School of Computer Science and Engineering Beihang University Beijing China

ISBN: (纸本)9780769542379

How to raise the efficiency of collaboration of modelers and bring down the cost of reusing processes are key problems in modern process developing activities. In the role-oriented way to organize modelers and the single-instance-based way to organize processes, traditional practices failed to tackle the problems. this paper describes an abstraction-level-based solution which organizes modelers and processes in the context of the top-down modeling hierarchy, and introduces a distributed BPMN based business process IDE called DMAL-BPIDE, with which enterprises could regulate and optimize modeling activities, effectively organize modelers through task distributing mechanism, and facilitate the reuse of processes. © 2010 IEEE.

关键词： Abstracting

来源：评论

学校读者我要写书评

暂无评论

Location privacy in processing location dependent queries in mobile database systems

Location privacy in processing location dependent queries in...

引用

international symposium on Telecommunications

作者： Tarafdar, Mehrnoosh Haghjoo, Mostafa S. Department of Computer Engineering Iran University of Science and Technology IUST Tehran Iran

ISBN: (纸本)9781424481835

Emergence of the mobile computing paradigm helps people to work in a much more convenient and efficient way, anywhere and anytime. Today its application areas such as traffic reports, weather forecast, bill paying and healthcare are so popular. the field of data management is also extended with such new services and applications. A mobile database system is a special heterogonous distributed system that supports mobile computing. One of the most important types of queries in mobile environments is location dependant query. Its answer is dependent to the mobile user's location. However, revealing location information raises privacy concerns. this paper concentrates on query processing in this paradigm. © 2010 IEEE.

关键词： Mobile computing

来源：评论

学校读者我要写书评

暂无评论

Towards a graph grammar based verification approach for runtime constrained evolution of service-oriented architectures

Towards a graph grammar based verification approach for runt...

引用

5th IEEE international symposium on Service-Oriented System Engineering, SOSE 2010

作者： Zhao, Yongwang Zhao, Bingyang Liu, Min Hu, Chunyang Ma, Dianfu Institute of Advanced Computing Technology School of Computer Science and Engineering Beihang University Beijing China

ISBN: (纸本)9780769540818

Service Oriented Architecture(SOA) is a new form of distributed software architecture. It promotes loose coupling, services distribution, dynamicity and agility. Runtime architecture of new generation service based system should be evolutional for flexible application requirement, instability of composing service nodes and Internet environment. Modeling of runtime SOA and verifying consistency of evolution could improve system dependability and adaptability. the main contribution of this paper is a graph grammar based modeling and verification approach for constrained evolution of SOA at runtime. System specification described by SOA style and structural constraints and their satisfaction checking algorithms are proposed. We have implemented an initial constrained evolution verification tool that allow us to model runtime SOA, SOA style and constraints and verify consistency. © 2010 IEEE.

关键词： Service oriented architecture (SOA)

来源：评论

学校读者我要写书评

暂无评论

Granularity-aware work-stealing for computationally-uniform Grids 10

Granularity-aware work-stealing for computationally-uniform ...

引用

10th IEEE/ACM international symposium on Cluster, Cloud, and Grid computing, CCGrid 2010

作者： Janjic, Vladimir Hammond, Kevin School of Computer Science University of St Andrews United Kingdom

ISBN: (纸本)9781424469871

Good scheduling is important for ensuring effective use of Grid resources, while maximising parallel performance. In this paper, we show how a basic "Random-Stealing" load balancing algorithm for computational Grids can be improved by using information about the task granularity of parallel programs. We propose several strategies (SSL,SLL and LLL) for using granularity information to improve load balancing, presenting results both from simulations and from a real implementation (the Grid-GUM Runtime System for parallel Haskell). We assume a common model of task creation which subsumes both master/worker and data-parallel programming paradigms under a task-stealing work distribution strategy. Overall, we achieve improvement in runtime of up to 19.4% for irregular problems in the real implementation, and up to 40% for the simulations (typical improvements of more that 15% for irregular programs, and from 5-10% for regular ones). Our results show that, for computationally-uniform Grids, advanced load balancing methods that exploit granularity information generally have the greatest impact on reducing the runtimes of irregular parallel programs. Moreover, the more irregular the program is, the better the improvements that can be achieved. © 2010 IEEE.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

Peer-to-peer networks and collective intelligence: the case for agency

Peer-to-peer networks and collective intelligence: The case ...

引用

5th international Conference on P2P, parallel, Grid, Cloud and Internet computing, 3PGCIC 2010

作者： Hill, Richard Antonopoulos, Nikos Distributed and Intelligent Systems Research Group University of Derby Derby United Kingdom

ISBN: (纸本)9780769542379

the vast quantity of data contributed and consumed via the Internet provides an environment where Collective Intelligence (CI) can emerge. this article considers CI in relation to the Peer-to-Peer (P2P) paradigm, an environment that has the necessary conditions for the generation of large data sets through frequent peer interactions. We then examine the characteristics of agency and relate agent computing to the conditions required to facilitate CI in P2P systems. Furthermore, we present a key research challenge for the community and propose an approach to scrutinise CI in a P2P scenario that makes use of local primitive behaviours to infer the likely collective emergent behaviours for a particular system. © 2010 IEEE.

关键词： Peer to peer networks

来源：评论

学校读者我要写书评

暂无评论

Proceedings of the 5th ACM Workshop on Challenged Networks, CHANTS '10, Co-located with MobiCom'10 and 11th ACM international symposium on Mobile Ad Hoc Networking and computing, MobiHoc'10

Proceedings of the 5th ACM Workshop on Challenged Networks, ...

引用

5th ACM Workshop on Challenged Networks, CHANTS '10

ISBN: (纸本)9781450301398

the proceedings contain 15 papers. the topics discussed include: similarity analysis and modeling in mobile societies: the missing link;distributed stochastic optimization in opportunistic networks: the case of optimal relay selection;the state of DTN evaluation;cellular traffic offloading through opportunistic communications: a case study;locus: a location-based data overlay for disruption-tolerant networks;DTN routing in urban public transport systems;achieving anycast in DTNs by enhancing existing unicast protocols;a new mobility trace for realistic large-scale simulation of bus-based DTNs;dynamic, non-interactive key management for the bundle protocol;DTN experiments on the virtual meshtest testbed;making bundle protocol into a game;a relative time implementation for delay-tolerant networks.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An opportunistic authority evaluation scheme for data security in crisis management scenarios 10

An opportunistic authority evaluation scheme for data securi...

引用

5th ACM symposium on Information, Computer and Communication Security, ASIACCS 2010

作者： Scalavino, Enrico Russello, Giovanni Ball, Rudi Gowadia, Vaibhav Lupu, Emil C. Department of Computing Imperial College London 180 Queen's Gate London SW72AZ United Kingdom 38123 Italy

ISBN: (纸本)9781605589367

We propose a novel version and implementation of the Policy-based Authority Evaluation Scheme (PAES) to protect data disseminated amongst the responders to an emergency situation when no network connectivity is available. In such situations Delay Tolerant Networks (DTN) are used to disseminate the data by exploiting the peers' mobility in the area. However, existing DTN protection models require recipients to be known in advance. In emergency situations the data may instead be received by unknown responders who might need it while carrying out their duties. Existing data dissemination solutions such Enterprise Rights Management (ERM) systems rely on centralized architectures where recipients must contact the authorities that can grant access to data. Such centralized solutions cannot be deployed when connectivity cannot be guaranteed. Our solution combines data protection schemes such as ERM systems with DTNs. the result allows us to implement a distributed policy evaluation procedure for DTNs. Simulations demonstrate that the approach permits recipients to obtain fast access to protected data even when no authority can be contacted. this is particularly important in crisis situations where timely access to data is necessary. © 2010 ACM.

关键词： Delay tolerant networks

来源：评论

学校读者我要写书评

暂无评论

A New Game theoretical Resource Allocation Algorithm for Cloud computing

A New Game Theoretical Resource Allocation Algorithm for Clo...

引用

5th international Conference on Grid and Pervasive computing

作者： Teng, Fei Magoules, Frederic Ecole Cent Paris Appl Math & Syst Lab F-92295 Chatenay Malabry France

ISBN: (纸本)9783642130663

Cloud computing and other computing paradigms share the similar visions which aim to implement parallel computations on large distributed resources. However, this cloud computing is more involved in purchasing and consuming manners between providers and users than others. So how to allocate resources reasonably to cater requirements from both sides attracts wide attentions. Based on game theory, we introduce a new Bayesian Nash Equilibrium Allocation algorithm to solve resource management problem in cloud computing. this algorithm fully considers several criteria such as the heterogeneous distribution of resources, rational exchange behaviors of cloud users, incomplete common information and dynamic successive allocation. Compared to former researches, experimental results presented in this paper show that even though rivals' information is uncertain, cloud users can receive Nash equilibrium allocation solutions by gambling stage by stage. Furthermore, the resource price evaluated by the algorithm will converge to the optimal price at the end of the gambling sequence.

关键词： cloud computing resource allocation game theory Nash equilibrium

来源：评论

学校读者我要写书评

暂无评论

Balls into non-uniform bins

Balls into non-uniform bins

引用

24th IEEE international parallel and distributed Processing symposium, IPDPS 2010

作者： Berenbrink, Petra Brinkmann, André Friedetzky, Tom Nagel, Lars School of Computing Science Simon Fraser University Burnaby BC V5A 1S6 Canada Paderborn Center for Parallel Computing University of Paderborn 33102 Paderborn Germany School of Engineering and Computing Sciences Durham University Durham DH1 3LE United Kingdom

ISBN: (纸本)9781424464432

Balls-into-bins games for uniform bins are widely used to model randomized load balancing strategies. Recently, balls-into-bins games have been analysed under the assumption that the selection probabilities for bins are not uniformly distributed. these new models are motivated by properties of many peer-to-peer (P2P) networks, which are not able to perfectly balance the load over the bins. While previous evaluations try to find strategies for uniform bins under nonuniform bin selection probabilities, this paper investigates heterogeneous bins, where the "capacities" of the bins might differ significantly. We show that heterogeneous environments can even help to distribute the load more evenly, and that the load difference between bins can be bounded by O(log log n) if each ball has two random choices, where n is the number of bins. Our analysis and simulation results show, for the first time, that the maximum load in heterogeneous balls-into-bins games is independent from the overall system capacity C and that bigger bins therefore can help to achieve good load balancing properties. © 2010 IEEE.

关键词： Peer to peer networks

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共152页 << < 46 47 48 49 50 51 52 53 54 55 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：