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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

77 篇 会议
54 篇 期刊文献
6 册 图书

馆藏范围

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

日期分布

学科分类号

78 篇 工学
- 52 篇 计算机科学与技术...
- 38 篇 软件工程
- 14 篇 信息与通信工程
- 9 篇 电气工程
- 9 篇 生物工程
- 8 篇 船舶与海洋工程
- 8 篇 生物医学工程（可授...
- 7 篇 土木工程
- 6 篇 控制科学与工程
- 5 篇 电子科学与技术（可...
- 3 篇 仪器科学与技术
- 3 篇 水利工程
- 2 篇 力学（可授工学、理...
- 2 篇 光学工程
- 2 篇 冶金工程
- 2 篇 动力工程及工程热...
53 篇 理学
- 27 篇 数学
- 14 篇 生物学
- 11 篇 物理学
- 8 篇 海洋科学
- 3 篇 系统科学
- 2 篇 统计学（可授理学、...
15 篇 管理学
- 9 篇 管理科学与工程(可...
- 9 篇 工商管理
- 6 篇 图书情报与档案管...
6 篇 医学
- 5 篇 基础医学(可授医学...
- 5 篇 临床医学
- 3 篇 药学(可授医学、理...
5 篇 法学
- 4 篇 社会学
2 篇 经济学
- 2 篇 应用经济学
2 篇 教育学
2 篇 农学
1 篇 哲学
1 篇 历史学
1 篇 艺术学

主题

15 篇 computer science
14 篇 computer archite...
7 篇 parallel process...
7 篇 peer to peer com...
7 篇 hardware
6 篇 bandwidth
5 篇 protocols
4 篇 runtime
4 篇 application soft...
4 篇 analytical model...
4 篇 steady-state
3 篇 thin film transi...
3 篇 concurrent compu...
3 篇 genes
3 篇 reconfigurable a...
3 篇 data mining
3 篇 processor schedu...
3 篇 switches
3 篇 internet
3 篇 control systems

机构

7 篇 parallel and dis...
7 篇 parallel computi...
4 篇 inst. f. theoret...
4 篇 bioinformatics g...
4 篇 saarland univers...
4 篇 max-planck-insti...
3 篇 parallel and dis...
3 篇 parallel computi...
3 篇 parallel applica...
3 篇 parallel computi...
3 篇 computer archite...
3 篇 parallel computi...
3 篇 santa fe institu...
3 篇 department of ma...
3 篇 dpt. of mathemat...
2 篇 universidad iber...
2 篇 department of ne...
2 篇 riken aip japan.
2 篇 ieee computer so...
2 篇 ozyegin universi...

作者

7 篇 middendorf marti...
6 篇 wieseke nicolas
6 篇 merkle daniel
5 篇 stadler peter f.
5 篇 martin middendor...
5 篇 hellmuth marc
3 篇 johan a. pouwels...
3 篇 langlois-rémilla...
3 篇 pouwelse johan a...
3 篇 oste roy
3 篇 l.o. hertzberger
3 篇 c.j. harris
3 篇 adele l. jia
3 篇 geiß manuela
3 篇 janson stefan
3 篇 m. middendorf
3 篇 jindal anshul
3 篇 gerndt michael
3 篇 sebastian lange
3 篇 hertzberger l.o.

语言

136 篇 英文
1 篇 其他

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

共 137 条记录，以下是71-80 订阅

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

详细简洁

排序：

Performance evaluation of a Python implementation of the new LEDBAT congestion control algorithm

Performance evaluation of a Python implementation of the new...

引用

IEEE International Conference on Automation, Quality and Testing, Robotics, AQTR

作者： Mugurel Ionuţ Andreica Nicolae Ţăpuş Johan Pouwelse Computer Science Department Politehnica University of Bucharest Romania Parallel and Distributed Systems Group Delft University of Technology Netherlands

LEDBAT is a new congestion control algorithm which was proposed in an IETF draft in March 2009. LEDBAT's goal is to provide a less-than-best-effort data transport service, i.e. a LEDBAT flow should back-off in the presence of other competing flows (TCP flows in particular). Because of its intended friendliness to competing flows, LEDBAT has already been implemented in the popular Bittorrent client uTorrent. In this paper we present performance evaluation results for our Python implementation of LEDBAT. We ran tests both in emulated networks as well as in real world networks. One of the tests involved approximately 300 volunteers spread throughout the world.

关键词： Peer to peer computing Testing Control systems Delay estimation Delay effects Streaming media computer science Radio access networks Performance evaluation Time measurement

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Modeling and analysis of bandwidth-inhomogeneous swarms in BitTorrent

Modeling and analysis of bandwidth-inhomogeneous swarms in B...

引用

International Conference on Peer-to-Peer Computing

作者： 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

ISBN: (纸本)9781424450664

A number of analytical models exists that capture various properties of the BitTorrent protocol. However, until now virtually all of these models have been based on the assumption that the peers in the system have homogeneous bandwidths. As this is highly unrealistic in real swarms, these models have very limited applicability. Most of all, these models implicitly ignore BitTorrent's most important property: peer selection based on the highest rate of reciprocity. As a result, these models are not suitable for understanding or predicting the properties of real BitTorrent networks. Furthermore, they are hardly of use in the design of realistic BitTorrent simulators and new P2P protocols. In this paper, we extend existing work by presenting a model of a swarm in BitTorrent where peers have arbitrary upload and download bandwidths. In our model we group peers with (roughly) the same bandwidth in classes, and then analyze the allocation of upload slots from peers in one class to peers in another class. We show that our model accurately predicts the bandwidth clustering phenomenon observed experimentally in other work, and we analyze the resulting data distribution in swarms. We validate our model with experiments using real BitTorrent clients. Our model captures the effects of BitTorrent's well-known `tit-for-tat' mechanism in bandwidth-inhomogeneous swarms and provides an accurate mathematical description of the resulting dynamics.

关键词： Bandwidth Protocols Predictive models Mathematical model Peer to peer computing computer science Internet Mechanical factors Fluid dynamics Analytical models

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Flexible hardware acceleration for instruction-grain lifeguards

Flexible hardware acceleration for instruction-grain lifegua...

引用

作者： Chen, Shimin Kozuch, Michael Gibbons, Phillip B. Ryan, Michael Strigkos, Theodoros Mowry, Todd C. Ruwase, Olatunji Vlachos, Evangelos Falsafi, Babak Ramachandran, Vijaya Intel Research Pittsburgh 4720 Forbes Ave. Pittsburgh PA 15213 United States Computer Science Department Carnegie Mellon University Pittsburgh PA United States Parallel Systems Architecture Laboratory École Polytechnique Fédérale de Lausanne Lausanne Switzerland Deartment of Computer Science University of Texas at Austin Austin TX United States

Instruction-grain lifeguards monitor executing programs at the granularity of individual instructions to quickly detect bugs and security attacks, but their fine-grain nature incurs high monitoring overheads. This article identifies three common sources of these overheads and proposes three techniques that together constitute a general-purpose hardware acceleration framework for lifeguards. © 2009 IEEE.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Improving Task-driven Software Development Approaches for Creating Service-Based Interactive Applications by Using Annotated Web Services

Improving Task-driven Software Development Approaches for Cr...

引用

International Conference on Next Generation Web Services Practices (NWeSP)

作者： Marius Feldmann Gerald Hubsch Thomas Springer Alexander Schill Department of Computer Science Institute of Systems Architecture Computer Networks Group Technische Universität Dresden Dresden Germany

The aspect of human interaction becomes more and more relevant for service-oriented applications. On one hand, current development approaches support the composition of services but neglect the creation of user interfaces. On the other hand, task-based modeling of user interactions is well established but poorly integrated into service-oriented development. In this paper we propose an integrated modelling approach for the task-driven development of interactive service-oriented applications. Our central concept is the introduction of annotations as part of the Web service description. These annotations cover information relevant for the semi-automatic generation of task models and user interfaces. We present the annotation concept as well as concepts for the integration of the annotations into a task-driven software development methodology.

关键词： Programming Application software Web services Logic User interfaces Skeleton Inference mechanisms Next generation networking computer science computer architecture

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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 Influence of Thread Allocation for Irregular Codes in NUMA systems

On the Influence of Thread Allocation for Irregular Codes in...

引用

IEEE International Conference on parallel and Distributed Computing, Applications and Technologies (PDCAT)

作者： Juan A. Lorenzo Francisco F. Rivera Peter Tuma Juan C. Pichel Computer Architecture Group Electronics and Computer Science Department University of Santiago de Compostela Spain Distributed Systems Research Group Department of Software Engineering Charles University Prague Czech Republic Galicia Supercomputing Centre Santiago de Compostela Spain

This work presents a study undertaken to characterise the FINISTERRAE supercomputer, one of the biggest NUMA systems in Europe. The main objective was to determine the performance effect of bus contention and cache coherency as well as the suitability of porting strategies regarding irregular codes in such a complex architecture. Results show that: (1) cores which share a socket can be considered as independent processors in this context; (2) for big data sizes, the effect of sharing a bus degrades the final performance but masks the cache coherency effects; (3) the NUMA factor (remote to local memory latency ratio) is an important factor on irregular codes and (4) the default kernel allocation policy is not optimal in this system. These results allow us to understand the behaviour of thread-to-core mappings and memory allocation policies.

关键词： Yarn Supercomputers Delay Europe Sockets Kernel Sparse matrices Distributed computing Application software computer architecture

来源：评论

学校读者我要写书评

暂无评论

SPP1148 booth: Hyperreconfigurable architectures

SPP1148 booth: Hyperreconfigurable architectures

引用

International Conference on Field Programmable Logic and Applications

作者： Sebastian Lange Martin Middendorf Parallel Computing and Complex Systems Group Department of Computer Science University of Leipzig Germany

ISBN: (纸本)9781424419606

Dynamically reconfigurable hardware offers promising possibilities for flexible, computation intensive applications. With the technological advance of reconfigurable hardware came a rapid growth in the number of resources per chip requiring large amounts of data transfer per reconfiguration. Especially run-time reconfigurable applications, which make frequent use of reconfiguration, suffer from the growing overhead induced thereby. In this project, we investigate novel concepts for reconfigurable architectures that can dynamically reconfigure the actual reconfiguration potential to reduce the total amount of reconfiguration data that is necessary for a computation.

关键词： computer architecture Computational modeling Hardware Reconfigurable architectures Polynomials Control systems Conferences

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共14页 << < 4 5 6 7 8 9 10 11 12 13 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：