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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

314 篇 会议
100 篇 期刊文献
9 册 图书

馆藏范围

423 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

237 篇 工学
- 201 篇 计算机科学与技术...
- 149 篇 软件工程
- 49 篇 信息与通信工程
- 29 篇 电气工程
- 21 篇 控制科学与工程
- 20 篇 生物工程
- 13 篇 生物医学工程（可授...
- 10 篇 电子科学与技术（可...
- 9 篇 安全科学与工程
- 8 篇 力学（可授工学、理...
- 8 篇 动力工程及工程热...
- 8 篇 环境科学与工程（可...
- 7 篇 建筑学
- 7 篇 交通运输工程
- 5 篇 机械工程
97 篇 理学
- 66 篇 数学
- 23 篇 生物学
- 15 篇 物理学
- 13 篇 系统科学
- 12 篇 统计学（可授理学、...
- 7 篇 化学
69 篇 管理学
- 37 篇 管理科学与工程(可...
- 35 篇 图书情报与档案管...
- 25 篇 工商管理
11 篇 法学
- 9 篇 社会学
9 篇 医学
- 9 篇 基础医学(可授医学...
- 9 篇 临床医学
- 7 篇 公共卫生与预防医...
7 篇 经济学
- 7 篇 应用经济学
7 篇 教育学
- 7 篇 教育学
3 篇 农学
1 篇 文学

主题

63 篇 computer science
30 篇 application soft...
25 篇 computer archite...
24 篇 educational inst...
19 篇 computational mo...
18 篇 protocols
17 篇 distributed comp...
16 篇 middleware
14 篇 hardware
13 篇 peer to peer com...
13 篇 software enginee...
12 篇 runtime
11 篇 real time system...
11 篇 internet
10 篇 concurrent compu...
10 篇 pervasive comput...
10 篇 bandwidth
10 篇 monitoring
10 篇 control systems
9 篇 parallel process...

机构

33 篇 distributed syst...
14 篇 distributed syst...
12 篇 distributed syst...
10 篇 institute of par...
7 篇 distributed syst...
7 篇 parallel and dis...
7 篇 parallel computi...
6 篇 computer network...
6 篇 distributed syst...
6 篇 school of electr...
6 篇 service oriented...
5 篇 distributed and ...
5 篇 distributed syst...
4 篇 center for appli...
4 篇 shanghai key lab...
4 篇 laboratory schoo...
4 篇 faculty of compu...
4 篇 parallel and dis...
4 篇 inst. f. theoret...
4 篇 distributed syst...

作者

22 篇 cahill vinny
22 篇 v. cahill
18 篇 dustdar schahram
11 篇 chen haibo
8 篇 buyya rajkumar
7 篇 middendorf marti...
7 篇 vinny cahill
7 篇 schahram dustdar
7 篇 wang zhaoguo
7 篇 a. boukerche
6 篇 wieseke nicolas
6 篇 rana omer
6 篇 gill sukhpal sin...
6 篇 li jinyang
6 篇 merkle daniel
5 篇 guan haibing
5 篇 clarke siobhán
5 篇 stadler peter f.
5 篇 zang binyu
5 篇 thomas fahringer

语言

415 篇 英文
7 篇 其他
1 篇 中文

检索条件"机构=Parallel and Distributed Systems Group Department of Computer Science"

共 423 条记录，以下是181-190 订阅

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

详细简洁

排序：

BarterCast: A practical approach to prevent lazy freeriding in P2P networks

BarterCast: A practical approach to prevent lazy freeriding ...

引用

International Symposium on parallel and distributed Processing (IPDPS)

作者： M. Meulpolder J.A. Pouwelse D.H.J. Epema H.J. Sips Parallel and Distributed Systems Group Department of Computer Science Delft University of Technnology Netherlands

A well-known problem in P2P systems is freeriding, where users do not share content if there is no incentive to do so. In this paper, we distinguish lazy freeriders that are merely reluctant to share but follow the protocol, versus die-hard freeriders that employ sophisticated methods to subvert the protocol. Existing incentive designs often provide theoretically attractive resistance against die-hard freeriding, yet are rarely deployed in real networks because of practical infeasibility. Meanwhile, real communities benefit greatly from prevention of lazy freeriding, but have only centralized technology available to do so. We present a lightweight, fully distributed mechanism called BARTERCAST that prevents lazy freeriding and is deployed in practice. BarterCast uses a maxflow reputation algorithm based on a peer's private history of its data exchanges as well as indirect information received from other peers. We assess different reputation policies under realistic, trace-based community conditions and show that our mechanism is consistent and effective, even when significant fractions of peers spread false information. Furthermore, we present results of the deployment of BarterCast in the BitTorrent-based Tribler network which currently has thousands of users worldwide.

关键词： Protocols Intelligent networks computer science History Peer to peer computing Proposals Privacy Particle measurements

来源：评论

学校读者我要写书评

暂无评论

Finding All sorting tandem duplication random loss operations

引用

20th Annual Symposium on Combinatorial Pattern Matching, CPM 2009

作者： Bernt, Matthias Chen, Ming-Chiang Merkle, Daniel Wang, Hung-Lung Chao, Kun-Mao Middendorf, Martin Parallel Computing and Complex Systems Group Department of Computer Science University of Leipzig Germany Department of Computer Science and Information Engineering National Taiwan University Taiwan Department of Mathematics and Computer Science University of Southern Denmark Odense Denmark

ISBN: (纸本)3642024408

A tandem duplication random loss (TDRL) operation duplicates a contiguous segment of genes, followed by the loss of one copy of each of the duplicated genes. Although the importance of this operation is founded by several recent biological studies, it has been investigated only rarely from a theoretical point of view. Of particular interest are sorting TDRLs which are TDRLs that, when applied to a permutation representing a genome, reduce the distance towards another given permutation. The identification of sorting genome rearrangement operations in general is a key ingredient of many algorithms for reconstructing the evolutionary history of a set of species. In this paper we present methods to compute all sorting TDRLs for two given gene orders. In addition, a closed formula for the number of sorting TDRLs is derived and further properties of sorting TDRLs are investigated. It is also shown that the theoretical findings are useful for identifying unique sorting TDRL scenarios for mitochondrial gene orders. © 2009 Springer Berlin Heidelberg.

关键词： Genes

来源：评论

学校读者我要写书评

暂无评论

A distributed heuristic for decentralized workflow scheduling in global grids

A distributed heuristic for decentralized workflow schedulin...

引用

2009 10th IEEE/ACM International Conference on Grid Computing, Grid 2009

作者： Rahman, Mustafizur Ranjan, Rajiv Buyya, Rajkumar Grid Computing and Distributed Systems Laboratory Department of Computer Science and Software Engineering University of Melbourne Australia Service Oriented Computing Research Group School of Computer Science and Engineering University of New South Wales Australia

ISBN: (纸本)9781424451494

Efficient scheduling is a key concern for the effectual execution of performance driven Grid applications, such as workflows. Many list heuristics have been developed for scheduling workflows in centralized Grid environment. However, in this paper, we present a distributed list heuristic for decentralized scheduling of workflow applications in global Grids. The simulation results show that the proposed scheduling approach is scalable with respect to increased workload on the system. © 2009 IEEE.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Dependable workflow scheduling in global grids

Dependable workflow scheduling in global grids

引用

2009 10th IEEE/ACM International Conference on Grid Computing, Grid 2009

ISBN: (纸本)9781424451494

In this paper, a reputation-based Grid workflow scheduling algorithm is proposed to counter the effect of inherent unreliability and temporal characteristics of computing resources in large scale, decentralized Grid overlays. The proposed approach builds upon structured peer-to-peer indexing and overlay networking techniques to create a scalable wide-area networking of Grid sites for supporting dependable scheduling of applications. The scheduling algorithm considers reliability of a Grid resource as a statistical property, which is globally computed in the decentralized Grid overlay based on dynamic feedbacks or reputation scores assigned by individual service consumers (Grid Resource Brokers). The proposed algorithm can dynamically adapt to changing resource conditions and offer significant performance gains as compared to traditional approaches in the event of unsuccessful job execution or resource failure. We evaluate and demonstrate the feasibility of our approach through an extensive trace driven simulation. The results show that our scheduling technique can reduce the makespan up to 50% and successfully isolate the failure-prone resources from the system. © 2009 IEEE.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Extending the event-based programming model to support sensor-driven ubiquitous computing applications

Extending the event-based programming model to support senso...

引用

IEEE International Conference on Pervasive Computing and Communications (PerCom)

作者： Sean Reilly Mads Haahr Distributed Systems Group Department of Computer Science Trinity College Dublin Ireland

We propose an extension to the event-based programming model for sensor-driven ubiquitous computing applications. The extension consists of three abstractions: Multi-event handlers, event streams and execution policies. We believe that these additional abstractions simplify the task of writing applications in this domain. In this position paper we present the ex-tensions and demonstrate our prototype middleware implemented in C.

关键词： Ubiquitous computing Application software Filters Middleware Peer to peer computing Scalability computer science Educational institutions Writing Prototypes

来源：评论

学校读者我要写书评

暂无评论

Multi-Event Handlers for sensor-driven ubiquitous computing applications

Multi-Event Handlers for sensor-driven ubiquitous computing ...

引用

IEEE International Conference on Pervasive Computing and Communications (PerCom)

作者： Sean Reilly Distributed Systems Group Department of Computer Science Trinity College Dublin Ireland

We propose an extension to the event-based programming model for sensor-driven ubiquitous computing applications. The extension consists of three abstractions: Multi-event handlers, execution policies and event streams. We believe that these additional abstractions simplify the task of writing applications in this domain. We present the abstractions and describe an example application from the sports domain implemented using our prototype middleware.

关键词： Ubiquitous computing Application software computer science Educational institutions Writing Prototypes Middleware computer applications Filters Large-scale systems

来源：评论

学校读者我要写书评

暂无评论

Towards integration of uncertain sensor data into context-awareworkflows

Towards integration of uncertain sensor data into context-aw...

引用

39th Jahrestagung der Gesellschaft fur Informatik e.V. (GI): Im Focus das Leben, INFORMATIK 2009

作者： Wieland, Matthias Käppeler, Uwe-Philipp Levi, Paul Leymann, Frank Nicklas, Daniela Institute of Architecture of Application Systems Universtät Stuttgart Universitätsstraße 38 70569 Stuttgart Germany Institute of Parallel and Distributed Systems Universität Stuttgart Universitätsstraße 38 70569 Stuttgart Germany Department of Computer Science Carl von Ossietzky Universität Oldenburg Escherweg 2 26121 Oldenburg Germany

ISBN: (纸本)9783885792482

The integration and usage of uncertain sensor data in workflows is a difficult problem. In this paper we describe these difficulties which result from the combination of very distinct areas. On the one hand, applications from area of measurement engineering manage sensors that capture data and annotate the data with technical meta data. On the other hand, context-aware workflows from the BPM area place high level requirements for the quality of context data that is derived from the sensor data. Between those two areas exists a gap that has to be closed by a context management and mediation system, supporting the handling of Quality of Context (QoC). To achieve this the paper presents an QoC aware architecture based on an extension of the existing Nexus Platform and a first approach for matching the workflow requirements with the sensor annotations.

关键词： Data integration

来源：评论

学校读者我要写书评

暂无评论

On the Design of RNA Sequences for Realizing Extended Shapes

On the Design of RNA Sequences for Realizing Extended Shapes

引用

International Joint Conference on Bioinformatics, systems Biology and Intelligent Computing, IJCBS

作者： Marc Hellmuth Daniel Merkle Martin Middendorf Interdisciplinary Centre of Bioinformatics Department of Computer Science University of Leipzig Leipzig Germany Department of Mathematics and Computer Science University of Southern Denmark Odense Denmark Parallel Computing and Complex Systems Group Department of Computer Science University of Leipzig Leipzig Germany

It is known that for two given secondary structures (defined by position of base pairings) an RNA string can easily be found that can fold into both structures. But for more than two secondary structures this is not necessarily possible. Moreover, when four or more secondary structures are given the problem to determine the least number of positions, such that after the removal of all incident base pairs, a compatible RNA sequence can be found, is known to be NP-complete (\cite{real_shapes}). In this paper we introduce pseudo edges that are used to forbid that certain base pairs can bind and therefore can be used to define the properties of possible RNA secondary structures. We study the complexity of the problem to design an RNA sequence that can fold into different secondary structures each of them is described by a set of required and forbidden base pairs. We refine the NP-completeness results of \cite{real_shapes} and show an analoguous NP-completeness result for the realization problem concerning the removal of (pseudo) edges. We also present a polynomial time method for checking the realizability of extended shape graphs. Furthermore, we empirically analyze the influence of pseudo edges on the realizability for sets of random RNA sequences and for sets of aptamers.

关键词： RNA Shape Switches computer science Bioinformatics Sequences systems biology Intelligent systems Biology computing Concurrent computing

来源：评论

学校读者我要写书评

暂无评论

A distributed heuristic for decentralized workflow scheduling in global Grids

A distributed heuristic for decentralized workflow schedulin...

引用

International Workshop on Grid Computing

作者： Mustafizur Rahman Rajiv Ranjan Rajkumar Buyya Grid Computing and Distributed Systems Laboratory Department of Computer Science and Software Engineering University of Melbourne Australia Service Oriented Computing Research Group School of Computer Science and Engineering University of New South Wales Australia

关键词： Processor scheduling Grid computing Resource management computer science Scheduling algorithm Laboratories Software engineering distributed computing Application software Peer to peer computing

来源：评论

学校读者我要写书评

暂无评论

Dependable workflow scheduling in global Grids

Dependable workflow scheduling in global Grids

引用

International Workshop on Grid Computing

关键词： Processor scheduling Scheduling algorithm Grid computing Counting circuits Large-scale systems Peer to peer computing Indexing Feedback Heuristic algorithms Performance gain

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共43页 << < 15 16 17 18 19 20 21 22 23 24 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：