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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 生物工程
- 8 篇 电气工程
- 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 条记录，以下是51-60 订阅

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

详细简洁

排序：

On the Reconfiguration Costs of Models for Partially Reconfigurable FPGAs

On the Reconfiguration Costs of Models for Partially Reconfi...

引用

Southern Conference on Programmable Logic

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

ISBN: (纸本)9781424419920

There exists several FPGA architectures that can be partially reconfigured at run-time. The advantage of partial run-time reconfiguration is that it allows to develop new algorithmic solutions for many applications. But a limiting factor for using frequent dynamic reconfiguration could be the reconfiguration overhead. In order to study the potential of frequent run-time reconfiguration it is interesting to investigate its costs and benefits from an abstract point of view and to develop new architectural concepts. In this paper, we provide a formal treatment of the reconfiguration costs and compare them for models of standard partially reconfigurable FPGAs and 2-level reconfigurable FPGAs.

关键词： Costs Field programmable gate arrays Switches Runtime computer architecture Reconfigurable architectures Reconfigurable logic parallel processing computer science Application software

来源：评论

学校读者我要写书评

暂无评论

Granularity aspects for the design of multi-level reconfigurable architectures

Granularity aspects for the design of multi-level reconfigur...

引用

IEEE International Conference on Field-Programmable Technology (FPT)

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

Dynamically reconfigurable hardware has already been deployed for accelerating computationally demanding applications. Some of these hardware architectures allow run time reconfiguration but this leads usually to a large reconfiguration overhead. The advantage of run time reconfiguration is that it allows new algorithmic solutions for many applications. To study the potential of frequent run time reconfiguration it is interesting to investigate its costs and benefits from an abstract point of view and to develop new architectural concepts. Multilevel reconfigurable architectures are one such concept that introduce several levels of reconfiguration. This paper deals with new types of multi-level reconfigurable architectures. The corresponding problem of finding the best granularity for different reconfiguration levels is formulated and investigated. Although this problem is shown to be NP-complete, an interesting restricted subcase is solved optimally in polynomial time. For the general case, a good heuristic is proposed that is based on solutions for the restricted case. Results on three example applications show that the reconfiguration cost can be reduced with the new architectures. Based on a proposed measure of relative efficiency it is also shown that the new architectures are more efficient so that they obtain a larger reconfiguration cost reduction with less additional hardware

关键词： Reconfigurable architectures Hardware Switches computer architecture Costs Polynomials Random access memory parallel processing computer science Acceleration

来源：评论

学校读者我要写书评

暂无评论

Self-organized task allocation for computing systems with reconfigurable components 06

Self-organized task allocation for computing systems with re...

引用

International Symposium on parallel and Distributed Processing (IPDPS)

作者： D. Merkle M. Middendorf A. Scheidler Parallel Computing and Complex Systems Group Department of Computer Science University of Leipzig Leipzig Germany

ISBN: (纸本)9781424400546

A self-organized allocation scheme for service tasks in computing systems is proposed in this paper. Usually components of a computing system need some service from time to time in order perform their work efficiently. In adaptive computing systems the components and the necessary tasks adapt to the needs of users or the environment. Since in such cases the type of service tasks will often change it is attractive to use reconfigurable hardware to perform the service tasks. The studied system consists of normal worker components and helper components which have reconfigurable hardware and can perform different service tasks. The speed with which a service tasks is executed by a helper depends on its actual configuration. Different strategies for the helpers to decide about service task acceptance and reconfiguration are proposed. These strategies are inspired by stimulus-threshold models that are used to explain task allocation in social insects

关键词： Insects Hardware parallel processing computer science Concurrent computing Adaptive systems Centralized control Communication system control Control systems Processor scheduling

来源：评论

学校读者我要写书评

暂无评论

Flexible particle swarm optimization tasks for reconfigurable processor arrays

Flexible particle swarm optimization tasks for reconfigurabl...

引用

International Symposium on parallel and Distributed Processing (IPDPS)

作者： S. Janson M. Middendorf Parallel Computing and Complex Systems Group Department of Computer Science University of Leipzig Leipzig Germany

Multi-task parallel processor arrays are a common machine architecture in which, typically, the tasks running in parallel occupy disjoint subarrays of the machine. On dynamically and partially reconfigurable processor arrays the tasks can be changed during run time. This is useful for online scenarios when the relative importance of tasks might change and therefore the assignment of computational resources to the tasks should be changed. Examples are optimization tasks in an online scenario in which the results of some tasks are needed earlier than expected at initialization. For such tasks the size of their subarrays must be increased because they need more computational resources to speed up. In this paper we design flexible particle swarm optimization (PSO) algorithms for 2-dimensional reconfigurable processor arrays where the algorithms can change their size and have good optimization behaviour. Since PSO is an iterative, individual-based optimization algorithm that relies upon interactions of neighbouring particles suitable for fine-grained parallel architectures. We propose a dynamic 2-dimensional hierarchical ordering of the particles within a tasks subarray so that the best particles are concentrated in the center. This gives the best particles the strongest influence on the swarm. A further advantage is that size reductions of the tasks can easily be done by cutting off the outer parts of the swarm which contain mainly the less good particles. It is experimentally shown that the proposed algorithms perform better than standard PSO algorithms under conditions with varying supply of computing resources that are available for the tasks. Moreover, also for conditions with constant supply of processing resources and no need for size changes the proposed algorithms perform well.

关键词： Particle swarm optimization Iterative algorithms Algorithm design and analysis Ant colony optimization parallel processing computer science computer architecture Design optimization parallel architectures Adaptive arrays

来源：评论

学校读者我要写书评

暂无评论

Music2Share - Copyright-compliant music sharing in P2P systems

Music2Share - Copyright-compliant music sharing in P2P syste...

引用

作者： Kalker, Ton Epema, Dick H. J. Hartel, Pieter H. Lagendijk, R.L. Van Steen, Maarten Philips Research Eindhoven Eindhoven 5656 AA Netherlands Technical University Eindhoven Eindhoven 5612 AZ Netherlands Parallel and Distributed Systems Group Faculty of Electrical Engineering Mathematics and Computer Science Delft University of Technology Delft 2600 GA Netherlands Distributed and Embedded Systems Group Department of Computer Science University of Twente Enschede 7500 AE Netherlands Delft University of Technology Delft 2628 CD Netherlands Department of Computer Science Vrije Universiteit Amsterdam 1081 HV Netherlands

Peer-to-peer (P2P) networks are generally considered to be free havens for pirated content, in particular with respect to music. We describe a solution for the problem of copyright infringement in P2P networks for music sharing. In particular, we propose a P2P protocol that integrates the functions of identification, tracking, and sharing of music with those of licensing, monitoring, and payment. This highly decentralized music-aware P2P protocol will allow access to large amounts of music of guaranteed quality;it merges in a natural way the policing functions for copyright protection·and an efficient music-management infrastructure for the benefit of the user. © 2004 IEEE.

关键词： Copyrights

来源：评论

学校读者我要写书评

暂无评论

Forbidden time travel: Characterization of time-consistent tree reconciliation maps 17

Forbidden time travel: Characterization of time-consistent t...

引用

17th International Workshop on Algorithms in Bioinformatics, WABI 2017

作者： Nøjgaard, Nikolai Geiß, Manuela Merkle, Daniel Stadler, Peter F. Wieseke, Nicolas Hellmuth, Marc Department of Mathematics and Computer Science University of Greifswald Greifswald Germany Department of Mathematics and Computer Science University of Southern Denmark Denmark Bioinformatics Group Department of Computer Science Interdisciplinary Center of Bioinformatics University of Leipzig Leipzig Germany Max-Planck-Institute for Mathematics in the Sciences Leipzig Germany Institute for Theoretical Chemistry University of Vienna Vienna Austria Santa Fe Institute Santa FeNM United States Parallel Computing and Complex Systems Group Department of Computer Science Leipzig University Leipzig Germany Saarland University Center for Bioinformatics Saarbrücken Germany

ISBN: (纸本)9783959770507

Motivation: In the absence of horizontal gene transfer it is possible to reconstruct the history of gene families from empirically determined orthology relations, which are equivalent to eventlabeled gene trees. Knowledge of the event labels considerably simplifies the problem of reconciling a gene tree T with a species trees S, relative to the reconciliation problem without prior knowledge of the event types. It is well-known that optimal reconciliations in the unlabeled case may violate time-consistency and thus are not biologically feasible. Here we investigate the mathematical structure of the event labeled reconciliation problem with horizontal transfer. Results: We investigate the issue of time-consistency for the event-labeled version of the reconciliation problem, provide a convenient axiomatic framework, and derive a complete characterization of time-consistent reconciliations. This characterization depends on certain weak conditions on the event-labeled gene trees that reflect conditions under which evolutionary events are observable at least in principle. We give an O(|V (T)| log(|V (S)|))-time algorithm to decide whether a time-consistent reconciliation map exists. It does not require the construction of explicit timing maps, but relies entirely on the comparably easy task of checking whether a small auxiliary graph is acyclic. Significance: The combinatorial characterization of time consistency and thus biologically feasible reconciliation is an important step towards the inference of gene family histories with horizontal transfer from orthology data, i.e., without presupposed gene and species trees. The fast algorithm to decide time consistency is useful in a broader context because it constitutes an attractive component for all tools that address tree reconciliation problems. © Nikolai Nøjgaard, Manuela Geiß, Daniel Merkle, Peter F. Stadler, Nicolas Wieseke, and Marc Hellmuth.

关键词： Genes

来源：评论

学校读者我要写书评

暂无评论

Periodic real-time scheduling for FPGA computers

Periodic real-time scheduling for FPGA computers

引用

Workshop on Intelligent Solutions in Embedded systems

作者： K. Danne M. Platzner Design of Parallel Systems Group Heinz Nixdorf Institute University of Paderborn Germany Computer Engineering Group Department of Computer Science University of Paderborn Germany

Todays reconfigurable hardware devices, such as FPGAs, have high densities and allow for the execution of several hardware tasks in parallel. This paper deals with scheduling periodic real-time tasks to such an architecture, a problem which has not been considered before. We formalize the real-time scheduling problem and propose two preemptive scheduling algorithms. The first is an adaption of the well-known earliest deadline first (EDF) technique to the FPGA execution model. The algorithm reveals good scheduling performance; task sets with system utilizations of up to 85% can be feasibly scheduled. However, the EDF approach is practical only for a small number of tasks, since there is no efficient schedulability test. The second algorithm uses the concept of servers that reserve area and execution time for other tasks. Tasks are successively merged into servers, which are then scheduled sequentially. While this method can only feasibly schedule task sets with a system utilization of up to some 50%, it is applicable to large tasks sets as the schedulability test runs in polynomial time. Equally important, the method requires only a small number of FPGA configurations which directly translates into reduced memory requirements.

关键词： Processor scheduling Field programmable gate arrays Hardware computer architecture Scheduling algorithm Concurrent computing Testing Silicon Design engineering computer science

来源：评论

学校读者我要写书评

暂无评论

Quantifying the quality of indoor maps 4

Quantifying the quality of indoor maps

引用

4th ISPRS Geospatial Week 2019

作者： Assali, M. Pipelidis, G. Podolskiy, V. Iwaszczuk, D. Heinen, L. Gerndt, M. Dept. of Computer Architecture and Parallel Systems Dept. of Informatics Technical University of Munich Munich Germany Software and Systems Engineering Research Group Dept. of Informatics Technical University of Munich Munich Germany Remote Sensing and Image Analysis Group Dept. of Civil and Environmental Engineering Science Technische Universität Darmstadt Germany BMW Group IT Munich Germany

Indoor maps are required for multiple applications, such as, navigation, building maintenance and robotics. One of common methods for map generation is laser scanning. In such maps, not only geometry of the map is of interest, but also its quality. This study aims at developing methods for real-time generation of indoor maps using features extracted from pointclouds obtained by a robot with their simultaneous quality assessment. We investigate, how this quality can be quantified for feature-based maps. First, we introduce a method for modeling 2D maps into 3D models that enable their usage for localization. Second, we review and evaluate a number of algorithms that can enable us to address features in a map. Hence, we enable the generation of objects from a pointcloud that has been sensed. Finally, we study several aspects of the map quality and we formalize them into metrics that can be applied to quantify their quality. © Authors 2019.

关键词： Robots

来源：评论

学校读者我要写书评

暂无评论

Self-Organization in Community Mesh Networks The Berlin RoofNet

Self-Organization in Community Mesh Networks The Berlin Roof...

引用

Workshop on Operator-Assisted (Wireless Mesh) Community Networks

作者： Robert Sombrutzki Anatolij Zubow Mathias Kurth Jens-Peter Redlich Computer Science Department Systems Architecture Group Humboldt University of Berlin Berlin Germany

A community network must be usable for inexperienced end users; thus self-organization is essential. On the one hand, we propose an approach for self-organization in ad-hoc wireless multi-hop mesh networks, where the client is fully freed from such mundane tasks as IP configuration, etc. On the other hand, the community mesh network itself is fully self-organized thus no operator or provider is required. We present the architecture of the Berlin RoofNet (BRN) and a distributed realization of services like DHCP, ARP and Internet gateway discovery and selection. In addition, results of a detailed simulation and experimental evaluation comparing our distributed hash table based approach to traditional methods are presented. We show that our approach is more reliable, efficient and responsive

关键词： Mesh networks computer architecture Spread spectrum communication IP networks Cities and towns Protocols Web and internet services computer network reliability Telecommunication network reliability Wireless mesh networks

来源：评论

学校读者我要写书评

暂无评论

An ant colony optimizer for melody creation with baroque harmony

An ant colony optimizer for melody creation with baroque har...

引用

Congress on Evolutionary Computation

作者： Michael Geis Martin Middendorf Bioinformatics Group Department of Computer Science and Interdisciplinary Center for Bioinformatics University of Leipzig Leipzig Germany Parallel Computing and Complex Systems Group Department of Computer Science University of Leipzig Leipzig Germany

We propose an algorithm that is based on the Ant Colony Optimization (ACO) metaheuristic for producing harmonized melodies. The algorithm works in two stages. In the first stage it creates a melody. This melody is then harmonized according to the rules of Baroque harmony in the second stage. This is the first ACO algorithm to create music that uses domain knowledge and the first employed for harmonization of a melody.

关键词： Ant colony optimization Frequency Bioinformatics computer science Genetic algorithms Evolutionary computation parallel processing Multiple signal classification computer networks Artificial neural networks

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共14页 << < 2 3 4 5 6 7 8 9 10 11 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：