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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

972 篇 工学
- 891 篇 计算机科学与技术...
- 487 篇 软件工程
- 377 篇 信息与通信工程
- 114 篇 电气工程
- 89 篇 控制科学与工程
- 39 篇 电子科学与技术（可...
- 31 篇 生物工程
- 28 篇 动力工程及工程热...
- 21 篇 机械工程
- 20 篇 仪器科学与技术
- 19 篇 生物医学工程（可授...
- 18 篇 网络空间安全
- 16 篇 环境科学与工程（可...
- 15 篇 建筑学
- 10 篇 安全科学与工程
- 8 篇 化学工程与技术
218 篇 管理学
- 164 篇 管理科学与工程(可...
- 78 篇 工商管理
- 75 篇 图书情报与档案管...
203 篇 理学
- 124 篇 数学
- 43 篇 系统科学
- 34 篇 生物学
- 25 篇 统计学（可授理学、...
- 24 篇 物理学
- 11 篇 化学
18 篇 法学
- 14 篇 社会学
10 篇 经济学
- 10 篇 应用经济学
10 篇 医学
- 10 篇 临床医学
- 8 篇 基础医学(可授医学...
9 篇 教育学
- 9 篇 教育学
2 篇 军事学
1 篇 农学

主题

112 篇 distributed comp...
92 篇 distributed comp...
55 篇 computer science
55 篇 cloud computing
50 篇 application soft...
48 篇 peer to peer com...
44 篇 computer network...
41 篇 computer archite...
41 篇 mobile computing
40 篇 conferences
40 篇 costs
40 篇 middleware
35 篇 protocols
33 篇 quality of servi...
33 篇 computational mo...
30 篇 software enginee...
30 篇 bandwidth
29 篇 internet
29 篇 hardware
28 篇 resource managem...

机构

6 篇 college of compu...
5 篇 seikei universit...
5 篇 ibm thomas j. wa...
5 篇 inria rennes
5 篇 3-30-1 wajiro-hi...
4 篇 nanyang technol ...
4 篇 universidad carl...
4 篇 tokyo denki univ...
4 篇 rissho universit...
4 篇 school of electr...
3 篇 college of compu...
3 篇 school of big da...
3 篇 department of co...
3 篇 zhejiang univers...
3 篇 department of co...
3 篇 school of cybers...
3 篇 ohio state univ ...
3 篇 university of pi...
3 篇 tennessee tech u...
3 篇 rwth aachen univ...

作者

8 篇 michael alexande...
6 篇 stephen l. scott
6 篇 barolli leonard
6 篇 mario cannataro
6 篇 takizawa makoto
4 篇 xhafa fatos
4 篇 alexandru costan
4 篇 liu yh
4 篇 emmanuel jeannot
4 篇 shibata yoshitak...
4 篇 marco danelutto
4 篇 uehara minoru
4 篇 mikkilineni rao
4 篇 r. guerraoui
4 篇 beniamino martin...
4 篇 josef weidendorf...
4 篇 durresi arjan
3 篇 li zengxiang
3 篇 alfredo cuzzocre...
3 篇 m. takizawa

语言

1,481 篇 英文
5 篇 其他
2 篇 俄文
1 篇 中文

检索条件"任意字段=Proceedings - 24th International Conference on Distributed Computing Systems Workshops"

共 1489 条记录，以下是361-370 订阅

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

详细简洁

排序：

Towards a General Framework for Ensuring and Reusing Proofs of Termination Detection in distributed computing 24

Towards a General Framework for Ensuring and Reusing Proofs ...

引用

24th Euromicro international conference on Parallel, distributed, and Network-Based Processing (PDP)

作者： Boussabbeh, Maha Tounsi, Mohamed Kacem, Ahmed Hadj Mosbah, Mohamed Univ Bordeaux LaBRI Lab Bordeaux France Univ Sfax ReDCAD Lab Sfax Tunisia

ISBN: (纸本)9781467387767

distributed algorithms are designed to run on interconnected autonomous computing entities for achieving a common task: each entity executes asynchronously the same code and interacts locally with its immediate neighbours. It is widely agreed that the lack of knowledge of the global state makes termination detection one of the most important and complex problems in distributed computing. By relying on refinement, we prove that an algorithm computing a spanning tree with Local Termination Detection (each entity is able to determine only its own termination condition), can be reused and adapted in order to compute the same algorithm with Global Termination Detection (at least one entity is aware that the entire computation is achieved in the network). the main idea relies upon specifying a combination of a well known algorithm namely SSP and the spanning tree algorithm, following a top/down approach. this paper is a starting point towards a general framework for enhancing termination detection property of distributed algorithms and reusing their proofs.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Evaluating systems on Chip through HPC bioinformatic and astrophysic applications 24

Evaluating Systems on Chip through HPC bioinformatic and ast...

引用

24th Euromicro international conference on Parallel, distributed, and Network-Based Processing (PDP)

作者： Morganti, Lucia Cesini, Daniele Ferraro, Andrea Italian Inst Nucl Phys INFN CNAF Sect Bologna Italy

ISBN: (纸本)9781467387767

Low power systems-on-Chip (SoCs), originally developed in the context of mobile and embedded technologies, are becoming attractive for the scientific community given their increasing computing performances, coupled with relatively low cost and power demand. In this work, we investigate the potential of SoCs for realistic scientific workloads, in particular taken from the bioinformatics and astrophysics domains. We selected a series of parallel, computationally intensive scientific applications and ported them to a cluster of development boards based on low power SoCs. the performance results obtained for the different applications are reported and compared with those obtained on a typical x86 HPC node.

关键词： SoC system on chip gromacs namd hpc gadget

来源：评论

学校读者我要写书评

暂无评论

Using nested graphs to distribute Parallel and distributed Multi-Agent systems 24

Using nested graphs to distribute Parallel and Distributed M...

引用

24th Euromicro international conference on Parallel, distributed, and Network-Based Processing (PDP)

作者： Rousset, Alban Herrmann, Benedicte Lang, Christophe Philippe, Laurent Bride, Hadrien Univ Franche Comte Femto ST Inst CNRS Besancon France

ISBN: (纸本)9781467387767

Simulation has become an indispensable tool for researchers to explore systems without having recourse to real experiments. In this context multi-agent systems are often used to model and simulate complex systems. Depending on the characteristics of the modelled system, methods used to represent the system may vary. Whatever the modelling techniques used, increasing the size and the precision of a model increases the amount of computation needed, requiring the use of parallel systems when it becomes too large. Usually, to efficiently run on parallel resources, the model must be adapted to be distributed. In this paper, we propose a new modelling approach, based on nested graphs, that allows the design of large, complex and multi scale multi-agent models which can be efficiently distributed on parallel resources. A PDMAS (Parallel and distributed Multi Agent Platform) that supports this approach and efficiently run parallel multi-agent models is introduced.

关键词： distributed computing multi-agent Nested Graphs PDMAS

来源：评论

学校读者我要写书评

暂无评论

Assessing Big Data SQL Frameworks for Analyzing Event Logs 24

Assessing Big Data SQL Frameworks for Analyzing Event Logs

引用

24th Euromicro international conference on Parallel, distributed, and Network-Based Processing (PDP)

作者： Hinkka, Markku Lehto, Teemu Heljanko, Keijo Aalto Univ Sch Sci Dept Comp Sci Aalto Finland QPR Software Plc Helsinki Finland Aalto Univ Helsinki Finland

ISBN: (纸本)9781467387767

Performing Process Mining by analyzing event logs generated by various systems is a very computation and I/O intensive task. distributed computing and Big Data processing frameworks make it possible to distribute all kinds of computation tasks to multiple computers instead of performing the whole task in a single computer. this paper assesses whether contemporary structured query language (SQL) supporting Big Data processing frameworks are mature enough to be efficiently used to distribute computation of two central Process Mining tasks to two dissimilar clusters of computers providing BPM as a service in the cloud. Tests are performed by using a novel automatic testing framework detailed in this paper and its supporting materials. As a result, an assessment is made on how well selected Big Data processing frameworks manage to process and to parallelize the analysis work required by Process Mining tasks.

关键词： automatic business process discovery distributed computing framework distributed SQL event log analysis Hadoop Hive Presto process mining Spark

来源：评论

学校读者我要写书评

暂无评论

Optimal Time and Energy Efficient Work Distributions in Heterogeneous systems 24

Optimal Time and Energy Efficient Work Distributions in Hete...

引用

24th Euromicro international conference on Parallel, distributed, and Network-Based Processing (PDP)

作者： Raca, Valon Mehofer, Eduard Hudec, Marcus Univ Vienna Fac Comp Sci A-1010 Vienna Austria

ISBN: (纸本)9781467387767

Heterogeneous cluster architectures with different types of compute devices are wide-spread in the field of high performance computing introducing new kind of challenges. Time-efficient distribution of work onto heterogeneous devices is much more intricate than in the homogeneous case. Moreover, the use of heterogeneous devices makes it necessary to address energy efficiency as well. this results in bi-criteria optimization problems whereby often time efficiency and energy efficiency are conflicting objectives pushing in different directions. In this paper we define four optimization problems which are of particular interest for developers, give a formal description of these problems, and try to find optimal solutions for them efficiently with minimal effort. Essential is the fact that a user may specify time or energy constraints for which optimal work distributions onto the devices are determined. In addition, we raise the question how to recommend reasonable solutions, if no constraints have been specified. An experimental section examines the solutions obtained from our algorithms.

关键词： bi-criteria optimizations heterogeneous computing OpenCL

来源：评论

学校读者我要写书评

暂无评论

Design of a New Fasten-Able Linear Motor for Smart distributed Robot System 13

Design of a New Fasten-Able Linear Motor for Smart Distribut...

引用

13th IEEE international conference on Ubiquitous Intelligence and computing, 13th IEEE international conference on Advanced and Trusted computing, 16th IEEE international conference on Scalable computing and Communications, IEEE international conference on Cloud and Big Data computing, IEEE international conference on Internet of People and IEEE Smart World Congress and workshops, UIC-ATC-ScalCom-CBDCom-IoP-SmartWorld 2016

作者： Zhu, Li Baz, Didier El Ning, Huangsheng LAAS-CNRS Université de Toulouse CNRS Toulouse France University of Science and Technology Beijing 30th Road Haidian District Beijing China

ISBN: (纸本)9781509027705

distributed robot often contains two systems. One is for moving, another one is for fastening. In this paper, we focus on a new linear motor, in addition to motion function, it can provide suction force, does not require continuous energy supply for suction. A basic circuit for the new linear motor was designed, tested, which can freely control the length of dead-time. Design guide for initial design are also summed up. © 2016 IEEE.

关键词： Permanent magnets

来源：评论

学校读者我要写书评

暂无评论

MILP-based Deadline Assignment for End-to-End Flows in distributed Real-Time systems 16

MILP-based Deadline Assignment for End-to-End Flows in Distr...

引用

24th international conference on Real-Time Networks and systems (RTNS)

作者： Peng, Bo Fisher, Nathan Chantem, thidapat Wayne State Univ Dept Comp Sci Detroit MI 48202 USA Virginia Tech Dept Elect & Comp Engn Arlington VA USA

ISBN: (纸本)9781450347877

End-to-end flows, which have a set of chainlike subtasks, are widely used in distributed real-time systems. For instance, multimedia and automative applications require that subtasks finish executing on a chain of processors before their end-to-end deadlines. the scheduling of such chained subtasks decides the schedulability of a distributed real-time system. Since the subtask priority assignment problem is NP-hard in general, most heuristics are presented to schedule end-to-end flows in two separate steps. the first step calculates intermediate relative deadlines for frames, and the second step makes scheduling decisions under EDF scheduling. Because the quality of the priority assignment of subtasks will directly affect the schedulability of the distributed systems, the two separate steps may cause pessimism in schedulability analysis. To reduce potential pessimism, we combine the two steps in our novel dGMF-PA (distributed generalized multiframe tasks with parameter adaption) model. We present an algorithm based on mixed-integer linear programming for optimally selecting frame relative deadlines in the dGMF-PA model. An approximation algorithm is also proposed to reduce computational running time. Our approximation algorithm has a tunable speed-up factor of 1 + epsilon where epsilon can be arbitrarily small, with respect to the exact schedulability test of dGMF-PA tasks under EDF scheduling. Extensive experiments have shown that our approximation algorithm (which is a sufficient schedulability test) can schedule at most 44 % more than HOSPA, an existing state-of-the-art algorithm.

关键词： distributed generalized multiframe tasks with parameter adaption model distributed real-time system scheduling mixed-integer linear programming approximation algorithms EDF scheduling end-to-end flows

来源：评论

学校读者我要写书评

暂无评论

Evaluating distributed methods for CBR systems for monitoring business process workflows 24

Evaluating distributed methods for CBR systems for monitorin...

引用

24th international conference on Case-Based Reasoning workshops, ICCBR-WS 2016

作者： Agorgianitis, Ioannis Petridis, Miltos Kapetanakis, Stelios Fish, Andrew School of Computing Engineering and Mathematical Sciences University of Brighton Watts Building Lewes Road BrightonBN2 4GJ United Kingdom

this paper evaluates the potential for distributed business process workflow monitoring and management using the CBR paradigm. Recent developments in distributed computing technologies have shown capable for efficiency gains from effective distribution. Current models of CBR distribution are discussed and an extension is proposed focusing on the challenge posed from large data volumes. this is shown to be also associated with more challenges in the quality of data and the requirement for real time processing. the proposed approach is presented and a novel architecture for distribution of CBR systems is proposed. An evaluation of the approach and architecture is conducted and presented based on a set of experiments in the area of business process workflow management. the experiments establish a serial execution baseline and show promising high speedup gains, especially at large volumes (exceeding millions) of cases. It is shown that at high enough data volumes, there is a clear benefit of distributing some of the early parts of the CBR life cycle to a finer data and process granularity level. Such approach seems to maximise the benefit from the use of modern distribution technologies. Concluding, this paper signposts future areas of research leading to a more generic model that can maximise the efficiency gains of distribution in CBR systems. Copyright © 2016 for this paper by its authors.

关键词： Case based reasoning

来源：评论

学校读者我要写书评

暂无评论

Model-Driven Engineering and Elicitation Techniques: A Systematic Literature Review 24

Model-Driven Engineering and Elicitation Techniques: A Syste...

引用

24th IEEE international Requirements Engineering conference workshops (RWE)

作者： He, Chuan Mussbacher, Gunter McGill Univ Dept Elect & Comp Engn Montreal PQ Canada

ISBN: (纸本)9781509036943

Model-Driven Engineering (MDE) aims to describe a system with the help of a series of models. More abstract models are refined into more concrete models by model transformations that ensure that the information from higher-level models is retained in lower-level models. this reduces the effort required to build lower-level models. the quality of lower-level models is also improved because they are partly based on well-tested model transformations. A key prerequisite for MDE is the definition of formal modeling languages, for which metamodeling is typically used. Formally defined modeling languages capture an evergrowing number of aspects of the software development process from requirements to architecture, design, and implementation details. A commonly held sentiment in the requirements modeling community is that requirements elicitation techniques have received less attention in terms of MDE. We perform a systematic literature review to either refute or confirm this sentiment by exploring the use of metamodels in papers on five well-known elicitation techniques: Cognitive Work Analysis, Complex Adaptive systems theory, Contextual Inquiry and Design, distributed Cognition, and Emergent Knowledge Process design. the result of the survey indicates -within the limitations of the survey -that there is very little research applying metamodeling to the definition of these elicitation techniques.

关键词： Elicitation Metamodel Cognitive Work Analysis Complex Adaptive systems theory Contextual Inquiry and Design distributed Cognition Emergent Knowledge Process Activity theory Model-Driven Engineering MDE

来源：评论

学校读者我要写书评

暂无评论

Suitability of the random topology for HPC applications 24

Suitability of the random topology for HPC applications

引用

24th Euromicro international conference on Parallel, distributed, and Network-Based Processing (PDP)

作者： Chaix, Fabien Fujiwara, Ikki Koibuchi, Michihiro FORTH ICS CARV Lab Iraklion Greece Natl Inst Informat Tokyo Japan

ISBN: (纸本)9781467387767

With each technology improvement, parallel systems get larger, and the impact of interconnection networks becomes more prominent. Random topologies and their variants received more and more attention lately due to their low diameter, low average shortest path length and high scalability. However, existing supercomputers still prefer torus and fat-tree topologies, because a number of existing parallel algorithms are optimized for them and the interconnect implementation is more straight-forward in terms of floor layout. In this paper, we investigate the performance of traditional and emerging parallel workloads on these network topologies, using a event discrete simulation called SimGrid. We observe that random topology is better for Fourier Transform (FT), Graph500, Himeno benchmarks, and its improvement over the counterpart torus is 18 percent in average. through this study, our recommendation is to use random topology in current and future supercomputers for these scientific and big-data analysis parallel applications.

关键词： Topology interconnection networks high performance computing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共149页 << < 33 34 35 36 37 38 39 40 41 42 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：