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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

238 篇 工学
- 202 篇 计算机科学与技术...
- 148 篇 软件工程
- 50 篇 信息与通信工程
- 30 篇 电气工程
- 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
18 篇 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 篇 英文
8 篇 其他
1 篇 中文

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

共 424 条记录，以下是131-140 订阅

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

详细简洁

排序：

SYNC or ASYNC: Time to fuse for distributed graph-parallel computation 2015

SYNC or ASYNC: Time to fuse for distributed graph-parallel c...

引用

20th ACM SIGPLAN Symposium on Principles and Practice of parallel Programming, PPoPP 2015

作者： Xie, Chenning Chen, Rong Guan, Haibing Zang, Binyu Chen, Haibo Shanghai Key Laboratory of Scalable Computing and Systems Institute of Parallel and Distributed Systems Shanghai Jiao Tong University China Shanghai Key Laboratory of Scalable Computing and Systems Department of Computer Science Shanghai Jiao Tong University China

ISBN: (纸本)9781450332057

Large-scale graph-structured computation usually exhibits iterative and convergence-oriented computing nature, where input data is computed iteratively until a convergence condition is reached. Such features have led to the development of two different computation modes for graph-structured programs, namely synchronous (Sync) and asynchronous (Async) modes. Unfortunately, there is currently no in-depth study on their execution properties and thus programmers have to manually choose a mode, either requiring a deep understanding of underlying graph engines, or suffering from suboptimal performance. This paper makes the first comprehensive characterization on the performance of the two modes on a set of typical graph-parallel applications. Our study shows that the performance of the two modes varies significantly with different graph algorithms, partitioning methods, execution stages, input graphs and cluster scales, and no single mode consistently outperforms the other. To this end, this paper proposes Hsync, a hybrid graph computation mode that adaptively switches a graph-parallel program between the two modes for optimal performance. Hsync constantly collects execution statistics on-the-fly and leverages a set of heuristics to predict future performance and determine when a mode switch could be profitable. We have built online sampling and offline profiling approaches combined with a set of heuristics to accurately predicting future performance in the two modes. A prototype called PowerSwitch has been built based on PowerGraph, a state-of-the-art distributed graph-parallel system, to support adaptive execution of graph algorithms. On a 48-node EC2-like cluster, PowerSwitch consistently outperforms the best of both modes, with a speedup ranging from 9% to 73% due to timely switch between two modes. Copyright 2015 ACM.

关键词： Graphic methods

来源：评论

学校读者我要写书评

暂无评论

The impact of an Ada run-time system’s performance characteristics on scheduling models 12th

The impact of an Ada run-time system’s performance characte...

引用

12th Ada-Europe International Conference, 1993

作者： Burns, A. Wellings, A.J. Hutcheon, A.D. Real-time and Distributed Systems Research Group Department of Computer Science University of York United Kingdom York Software Engineering Ltd United Kingdom

ISBN: (纸本)9783540568025

When analysing hard real-time systems for their performance properties, most scheduling models either ignore the timing characteristics of the underlying run-time support kernel entirely or have a very simple model of its behaviour. However, when engineering an actual implementation, it is necessary to tailor the scheduling theory so that the actual performance characteristics of the run-time system are adequately addressed. Failure to do this may result in a "guaranteed" task missing its deadline. In this paper we investigate an actual Ada run-time kernel and give performance measures for clock handling and delay queue manipulation. The impact these measures have on the scheduling models are discussed. © Springer-Verlag Berlin Heidelberg 1993.

关键词： Real time systems

来源：评论

学校读者我要写书评

暂无评论

Transaction specification for object-oriented realtime systems in HRT-HOOD 2nd

Transaction specification for object-oriented realtime syste...

引用

2nd International Eurospace-Ada-Europe Symposium, Ada in Europe 1995

作者： Cornwell, Pete Wellings, Andy Distributed Objects Research Group Department of Computing Bournemouth University Dorset United Kingdom Real-Time Systems Research Group Department of Computer Science University of York York United Kingdom

ISBN: (纸本)3540607579

Object-oriented development is a structuring paradigm. It does not provide substantial support for the specification of ‘end to end’ control and data flow. This has implications for hard real-time system development, where applications may specify ‘end to end’ response times, also known as transactions. This paper introduces a graphical notation for the specification of transactions in HRT-HOOD, an object-oriented design technique for hard real-time system development. It provides an overview of the notation, and its practical application as part of a ‘top-down’ development process. This is illustrated through a case study, based on a naval command-control system. © Springer-Verlag Berlin Heidelberg 1996.

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

Self-organizing hierarchical cluster timestamps 7

引用

7th European Conference on parallel Computing, Euro-Par 2001

作者： Ward, Paul A. S. Taylor, David J. Shoshin Distributed Systems Group Department of Computer Science University of Waterloo WaterlooONN2L 3G1 Canada

ISBN: (纸本)3540424954

distributed-system observation tools require an efficient data structure to store and query the partial-order of execution. Such data structures typically use vector timestamps to efficiently answer precedence queries. Many current vector-timestamp algorithms either have a poor time/space complexity tradeoff or are static. This limits the scalability of such observation tools. One algorithm, centralized hierarchical cluster timestamps, has potentially a good time/space tradeoff provided that the clusters accurately capture communication locality. However, that algorithm, as described, uses pre-determined, contiguous clusters. In this paper we extend that algorithm to enable a dynamic selection of clusters. We present experimental results that demonstrate that our extension is more stable with cluster size and provides timestamps whose average size is consistently superior to the pre-determined cluster approach. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Data structures

来源：评论

学校读者我要写书评

暂无评论

A hierarchical particle swarm optimizer for dynamic optimization problems

引用

European Workshop on Applications of Evolutionary Computation, EvoWorkshops 2004: EvoBIO, EvoCOMNET, EvoHOT, EvoIASP, EvoMUSART, and EvoSTOC

作者： Janson, Stefan Middendorf, Martin Parallel Computing and Complex Systems Group Department of Computer Science University of Leipzig Augustusplatz 10/11 LeipzigD-04109 Germany

ISBN: (纸本)9783540213789

Particle Swarm Optimization (PSO) methods for dynamic function optimization are studied in this paper. We compare dynamic variants of standard PSO and Hierarchical PSO (H-PSO) on different dynamic benchmark functions. Moreover, a new type of hierarchical PSO, called Partitioned H-PSO (PH-PSO), is proposed. In this algorithm the hierarchy is partitioned into several sub-swarms for a limited number of generations after a change occurred. Different methods for determining the time when to rejoin the hierarchy and how to handle the topmost sub-swarm are discussed. The test results show that H-PSO performs significantly better than PSO on all test functions and that the PH-PSO algorithms often perform best on multimodal functions where changes are not too severe. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Particle swarm optimization (PSO)

来源：评论

学校读者我要写书评

暂无评论

A Simulative Approach to AMR Fleet Sizing in Decentralized Multi-Robot Task Allocation 28

A Simulative Approach to AMR Fleet Sizing in Decentralized M...

引用

28th IEEE International Conference on Emerging Technologies and Factory Automation, ETFA 2023

作者： Gödeke, Jana Detzner, Peter Fraunhofer Institute for Material Flow and Logistics Department for AI and Autonomous Systems Dortmund Germany Ruhr University Bochum Faculty of Computer Science Distributed and Networked Systems Group Bochum Germany

ISBN: (纸本)9798350339918

As the Industry 4.0 shifts towards the adoption of autonomous mobile robots (AMRs) in warehouses, decentralized decision-making has become a key design principle. Multi-robot task allocation (MRTA) is a problem that involves assigning tasks to AMRs while optimizing the performance of the system. However, modeling decentralized MRTA applications for optimization without a central instance poses significant challenges due to the autonomy and flexibility of AMRs. In this paper, we propose a simulative approach to address the fleet sizing problem combined with decentralized MRTA applications for AMRs. Based on simulation data, models have been developed that predict key performance indicators (KPIs) for different warehouse layouts and requirements, using techniques from machine learning and mathematical optimization. The model represents KPIs such as constraint satisfaction and utilization rates in a decentralized MRTA scenario including a self-organizing material flow application. Based on this model, we introduce a fleet size selection mechanism. This research contributes to the field of Industry 4.0 by providing a generalizable simulative approach that is adaptable to flexible warehouse environments, allowing for the application of any MRTA algorithm. Moreover, this approach allows the integration of different KPIs, facilitating the adaptation of requirements. © 2023 IEEE.

关键词： Warehouses

来源：评论

学校读者我要写书评

暂无评论

A search-based approach for architectural design of feedback control concerns in Self-Adaptive systems

A search-based approach for architectural design of feedback...

引用

2013 IEEE 7th International Conference on Self-Adaptive and Self-Organizing systems, SASO 2013

作者： Andrade, Sandro S. De A. Macedo, Raimundo Jose GSORT Distributed Systems Group Federal Institute of Education Science and Technology of Bahia Salvador-Ba Brazil Department of Computer Science Federal University of Bahia Salvador-Ba Brazil

ISBN: (纸本)9780769551296

A number of approaches for endowing systems with self-Adaptive behavior have been proposed over the past years. Among such efforts, architecture-centric solutions with explicit representation of feedback loops have currently been advocated as a promising research landscape. Although noteworthy results have been achieved on some fronts, the lack of systematic representations of architectural knowledge and effective support for well-informed trade-off decisions still poses significant challenges when designing modern self-Adaptive systems. In this paper, we present a systematic and flexible representation of design dimensions related to feedback control concerns, a set of metrics which estimate quality attributes of resulting automated designs, and a search-based approach to find out a set of Pareto-optimal candidate architectures. The proposed approach has been fully implemented in a supporting tool and a case study with a self-Adaptive cloud computing environment has been undertaken. The results indicate that our approach effectively captures the most prominent degrees of freedom when designing self-Adaptive systems, helps to elicit effective subtle designs, and provides useful support for early analysis of trade-off decisions. © 2013 IEEE.

关键词： Economic and social effects

来源：评论

学校读者我要写书评

暂无评论

Towards a Unified Flow Description Language for CPPSs: An Example with Material Flows 29

Towards a Unified Flow Description Language for CPPSs: An Ex...

引用

29th IEEE International Conference on Emerging Technologies and Factory Automation, ETFA 2024

作者： Gödeke, Jana Hörstrup, Maximilian Detzner, Peter Fraunhofer Institute for Material Flow and Logistics Department for Ai and Autonomous Systems Dortmund Germany Ruhr University Bochum Faculty of Computer Science Distributed and Networked Systems Group Bochum Germany

ISBN: (纸本)9798350361230

This paper presents a unified approach for repre-senting multiple domains alongside production in cyber-physical production systems (CPPSs) through domain-specific languages (DSLs). The approach is illustrated using material flows (MFs) as an example. The paper identifies requirements for DSLs in CPPSs and MFs, including concurrency, synchronization, constraints, and heterogeneity support. Subsequently, a plugin system is in-troduced for the existing Production Flow Description Language (PFDL), which allows users to incorporate additional domain-specific functionality in the form of plugins. To demonstrate this approach, we present the MF plugin, resulting in the combined PFDLMF. This showcases the reusability of such an approach and the easy integration of new CPPS domains. We envision the convergence of the PFDL with plugins towards a unified flow description language for CPPSs. A practical CPPS use-case demonstrates the expressiveness of the PFDLMF in modeling and executing complex MFs in an agent-based architecture. © 2024 IEEE.

关键词： Reusability

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Applications and Theory of Petri Nets 2003 1

引用

丛书名： Lecture Notes in computer science

1000年

作者： Wil M. P. Aalst Eike Best

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共43页 << < 10 11 12 13 14 15 16 17 18 19 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：