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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

3,404 篇 会议
126 篇 期刊文献
6 册 图书

馆藏范围

3,536 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,759 篇 工学
- 2,601 篇 计算机科学与技术...
- 1,584 篇 软件工程
- 533 篇 信息与通信工程
- 427 篇 电气工程
- 267 篇 控制科学与工程
- 188 篇 电子科学与技术（可...
- 174 篇 网络空间安全
- 44 篇 机械工程
- 43 篇 生物医学工程（可授...
- 37 篇 动力工程及工程热...
- 31 篇 生物工程
- 28 篇 力学（可授工学、理...
- 26 篇 建筑学
- 23 篇 安全科学与工程
- 22 篇 材料科学与工程（可...
- 21 篇 化学工程与技术
- 20 篇 仪器科学与技术
- 19 篇 土木工程
- 19 篇 交通运输工程
1,100 篇 理学
- 982 篇 数学
- 135 篇 统计学（可授理学、...
- 98 篇 物理学
- 72 篇 系统科学
- 38 篇 生物学
- 26 篇 化学
420 篇 管理学
- 326 篇 管理科学与工程(可...
- 202 篇 工商管理
- 121 篇 图书情报与档案管...
37 篇 经济学
- 37 篇 应用经济学
27 篇 法学
- 26 篇 社会学
20 篇 医学
15 篇 农学
12 篇 教育学
3 篇 文学
1 篇 军事学
1 篇 艺术学

主题

494 篇 parallel process...
276 篇 distributed comp...
216 篇 parallel process...
195 篇 distributed comp...
178 篇 concurrent compu...
170 篇 parallel algorit...
167 篇 computer science
117 篇 application soft...
112 篇 computer archite...
89 篇 parallel program...
89 篇 hardware
80 篇 computational mo...
76 篇 computer network...
72 篇 costs
72 篇 algorithm design...
65 篇 processor schedu...
64 篇 delay
55 篇 grid computing
49 篇 fault tolerance
48 篇 scalability

机构

12 篇 syracuse univ sy...
12 篇 pacific northwes...
11 篇 georgia inst of ...
9 篇 new jersey inst ...
9 篇 univ of maryland...
9 篇 national laborat...
8 篇 univ of californ...
8 篇 michigan state u...
8 篇 univ ottawa site...
7 篇 texas a&m univ c...
7 篇 ibm thomas j. wa...
7 篇 purdue univ west...
7 篇 ieee
6 篇 carleton univ sc...
6 篇 school of comput...
6 篇 shanghai jiao to...
6 篇 univ of minnesot...
6 篇 univ of central ...
6 篇 univ of illinois...
6 篇 carleton univ ot...

作者

15 篇 boukerche azzedi...
13 篇 bader david a.
11 篇 das sajal k.
9 篇 ranka sanjay
9 篇 li keqin
8 篇 sohn andrew
7 篇 panda dhabaleswa...
7 篇 prasanna viktor ...
7 篇 choudhary alok
7 篇 sato mitsuhisa
6 篇 taura kenjiro
6 篇 ibarra oscar h.
6 篇 zomaya albert y.
6 篇 yang laurence t.
6 篇 welch lonnie r.
6 篇 zhang xiaodong
6 篇 cristea valentin
6 篇 nakano koji
6 篇 sun xian-he
6 篇 boukerche a

语言

3,522 篇 英文
12 篇 其他
2 篇 中文

检索条件"任意字段=Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing"

共 3536 条记录，以下是601-610 订阅

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

详细简洁

排序：

distributed throughput maximization for multi-channel ALOHA networks

Distributed throughput maximization for multi-channel ALOHA ...

引用

ieee International Workshop on Computational Advances in Multi-Sensor Adaptive processing (CAMSAP)

作者： Kobi Cohen Amir Leshem Faculty of Engineering Bar-Ilan University Ramat-Gan Israel

We consider the problem of distributed throughput maximization for multi-channel ALOHA networks. We focus on networks containing a large number of users that transmit over a low number of channels. First, we consider the problem of constrained distributed rate maximization, where user rates are subject to total transmission probability constraints. We propose a distributed best-response algorithm to solve the rate maximization problem, where each user updates its strategy using its local channel state information (CSI) and by monitoring the channel utilization. We then consider the case where users are not restricted by transmission probability constraints. distributed optimization of the network throughput under uncertainty is mandatory since the transmission probabilities of other users are unknown. We propose a distributed scheme to solve the throughput optimization problem under uncertainty, where users adjust their transmission probability to maximize their rates, but maintain the desired load on the channels. We propose sequential and parallel algorithms for this purpose.

关键词： throughput Optimization Games Conferences Monitoring Protocols Wireless networks

来源：评论

学校读者我要写书评

暂无评论

Anti-windup design for saturation management during piezo-actuated vibration attenuation of the high-speed parallel robot Par2

Anti-windup design for saturation management during piezo-ac...

引用

5th IFAC symposium on System Structure and Control, SSSC 2013

作者： Douat, Luiz R. Queinnec, Isabelle Garcia, Germain Michelin, Micaël Pierrot, François Tarbouriech, Sophie CNRS LAAS 7 Avenue du Colonel Roche F-31077 Toulouse France Univ. de Toulouse INSA LAAS F-31077 Toulouse France Tecnalia France - Tecnalia Research and Innovation France LIRMM Univ. Montpellier 2 - CNRS F-34392 Montpellier France

ISBN: (纸本)9783902823250

the two degrees of freedom parallel robot Par2 is designed for high-speed and high-accuracy industrial pick-and-place operation tasks. As a result of high acceleration trajectories, its end-effector undergoes some undesirable vibrations after reaching the stop position, compromising precision and leading to an increase in the operation cycle time. Accelerometer sensors placed on the end-effector and piezoelectric patch actuators wrapped around the robot arms are employed in order to actively reduce these vibrations. Without taking into account saturation limitations, a robust controller is designed, minimizing vibrations for the robot nominal operating point but failing for some extreme operating points, due to high control efforts. An anti-windup strategy is then employed to deal with the saturation of the actuator. Such a strategy presents the advantage, with respect to the strategy which would consider a controller with smoother control efforts, to maintain a good level of vibration attenuation on the whole operation domain. Simulations and experimental results attest the adequacy of the proposed solution. © 2013 IFAC.

关键词： End effectors

来源：评论

学校读者我要写书评

暂无评论

Mining and recommending software features across multiple web repositories 13

Mining and recommending software features across multiple we...

引用

5th Asia-Pacific symposium on Internetware, Internetware 2013

作者： Yu, Yue Wang, Huaimin Yin, Gang Liu, Bo School of Computer Science National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China

ISBN: (纸本)9781450323697

the Internetware" paradigm is fundamentally changing the traditional way of software development. More and more software projects are developed, maintained and shared on the Internet. However, a large quantity of heterogeneous software resources have not been organized in a reasonable and efficient way. Software feature is an ideal material to characterize software resources. the effectiveness of feature- related tasks will be greatly improved, if a multi-grained feature repository is available. In this paper, we propose a novel approach for organizing, analyzing and recommend- ing software features. Firstly, we construct a Hierarchical rEpository of Software feAture (HESA). then, we mine the hidden affnities among the features and recommend relevant and high-quality features to stakeholders based on HESA. Finally, we conduct a user study to evaluate our approach quantitatively. the results show that HESA can organize software features in a more reasonable way compared to the traditional and the state-of-the-art approaches. the result of feature recommendation is effective and interesting. Categories and Subject Descriptors D.2.9 [Software Engineering]: Mining Software Reposi- tory;H.3.3 [Information Storage and retrieval]: Fea- ture Model, Clustering, Query formulation General Terms Algorithms, Human Factors.

关键词： Software design

来源：评论

学校读者我要写书评

暂无评论

Exploring SIMD for Molecular Dynamics, Using Intel® Xeon® Processors and Intel® Xeon Phi Coprocessors

Exploring SIMD for Molecular Dynamics, Using Intel® Xeon® ...

引用

International symposium on parallel and distributed processing (IPDPS)

作者： Simon J. Pennycook Chris J. Hughes M. Smelyanskiy S.A. Jarvis Department of Computer Science University of Warwick Coventry UK Parallel Computing Laboratory Intel Corporation Santa Clara CA USA

We analyse gather-scatter performance bottlenecks in molecular dynamics codes and the challenges that they pose for obtaining benefits from SIMD execution. this analysis informs a number of novel code-level and algorithmic improvements to Sandia's miniMD benchmark, which we demonstrate using three SIMD widths (128-, 256and 512bit). the applicability of these optimisations to wider SIMD is discussed, and we show that the conventional approach of exposing more parallelism through redundant computation is not necessarily best. In single precision, our optimised implementation is up to 5x faster than the original scalar code running on Intel®Xeon®processors with 256-bit SIMD, and adding a single Intel®Xeon Phi™coprocessor provides up to an additional 2x performance increase. these results demonstrate: (i) the importance of effective SIMD utilisation for molecular dynamics codes on current and future hardware; and (ii) the considerable performance increase afforded by the use of Intel®Xeon Phi™coprocessors for highly parallel workloads.

关键词： Optimization Registers Force Coprocessors Hardware Instruction sets

来源：评论

学校读者我要写书评

暂无评论

A Self-Organizing Architecture for Cloud by Means of Infrastructure Performance and Event Data

A Self-Organizing Architecture for Cloud by Means of Infrast...

引用

ieee International Conference on Cloud Computing Technology and Science (CloudCom)

作者： Martin Serrano Manfred Hauswirth Nikos Kefalakis John Soldatos Digital Enterprise Research Institute DERI - NUI Galway Galway Ireland Athens Institute of Technology AIT Athens Greece

the management performance of cloud systems is measured by the capacity of the cloud for controlling virtual infrastructures and their capability to run parallel-computing applications and distributed-processing services independently. the challenge about how this management performance can be done more dynamically (self-organization) by means of distributed user data and application data demands is yet an area to explore. this paper introduces first a functional architecture design, following the principles for cloud-based service lifecycle control and service composition in cloud, and second an in-house approach enabling self-organization for cloud services controlling the installation of virtual machines by using event-driven management operations acting as a proof of concept implementation. From a management point of view in cloud, enabling control of virtual infrastructures as a response to performance protocols by means of event(s) data processing is fundamental. Likewise managing cloud services lifecycle by enabling scalable applications and using distributed information systems and linked data processing, guarantee the self-organizing feature for cloud systems. Finally multiple advantages arise when infrastructure performance and end user data are used in cloud service management as it is discussed in this paper.

关键词： Cloud computing Data models Computer architecture Service-oriented architecture Adaptation models distributed databases Data processing

来源：评论

学校读者我要写书评

暂无评论

LIGHTWEIGHT WORKFLOW ENGINE BASED ON HADOOP AND OSGI

LIGHTWEIGHT WORKFLOW ENGINE BASED ON HADOOP AND OSGI

引用

2013 5th ieee International Conference on Broadband Network & Multimedia Technology

作者： Shengmei LUO Lixia LIU Juan YANG Di ZHANG Department of Computer Science and Technology Tsinghua University

ISBN: (纸本)9781479900961

the growth of data used by data-intensive computations has out-paced the growth of the power of a single processor. In this paper, we propose a high performance and scalability workflow engine, a lightweight parallel and distributed computing platform based on HADOOP and OSGI. Workflow engine provides flexible and scalable OSGI-based interfaces which user can implement to define data processing functions and expand functions in HADOOP ecosystem. Workflow engine consists of invoking interfaces, scheduler engine, optimizer and fault-tolerance manager. Given a workflow process, the engine analyzes data dependencies among nodes, then dispatches them to Map Reduce clusters based on the current status of the system. this paper also describes the design and strategy in detail on implementation processes, key points, relationships of each participants and etc. Our experiment demonstrates that workflow engine can significantly improve the performance of workflow execution.

关键词： Workflow Engine HADOOP OSGI RPC Scheduler Fault-tolerance

来源：评论

学校读者我要写书评

暂无评论

Sparse Matrix-Vector Multiplication Based on Network-on-Chip: On Data Mapping

Sparse Matrix-Vector Multiplication Based on Network-on-Chip...

引用

5th International symposium on parallel Architectures, Algorithms and Programming (PAAP)

作者： Mansour, Ahmad Goetze, Juergen TU Dortmund Informat Proc Lab Dortmund Germany

ISBN: (纸本)9780769548982;9781467345668

Sparse Matrix-Vector Multiplication (SMVM) on parallel hardware is a very sophisticated problem because of the irregular data communication requirements. the communication volume in the parallel hardware is determined by how data is distributed among the processing elements. In this paper we introduce two methods of data mapping for SMVM based on Network-on-Chip (NoC) in order to spread the load among its components. Later, we introduce the effect of recordering of the sparse matrix on those mapping methods. Simulations are performed using an OMNet++ based NoC simulator.

关键词： data communication network-on-chip parallel processing public domain software sparse matrices

来源：评论

学校读者我要写书评

暂无评论

Scheduling of tasks in the parareal algorithm for heterogeneous cloud platforms

Scheduling of tasks in the parareal algorithm for heterogene...

引用

26th ieee International parallel and distributed processing symposium (IPDPS) / Workshop on High Performance Data Intensive Computing

作者： Xiao, Hongtao Aubanel, Eric Univ New Brunswick Fac Comp Sci Fredericton NB E3B 5A3 Canada

ISBN: (纸本)9780769546766

parallelization of time-dependent partial differential equations (PDEs) can be accomplished by time decomposition using the parareal algorithm. While the parareal algorithm was designed to enable real-time simulations, it holds particular promise for long time simulations on computational grids and clouds, due its low communication overhead and potential for adaptation to heterogeneous processors. this contribution extends previous work on the scheduling of tasks of the parareal algorithm to resources with heterogeneous CPU performance. Experiments on Amazon's EC2 show the suitability of this algorithm for execution on a heterogeneous cloud platform and its insensitivity to network latency.

关键词： Religious Missions network delay PARA computational grids real-time simulation parallelization Platform algorithms Legal Executions Real number

来源：评论

学校读者我要写书评

暂无评论

parallel Simulated Annealing for Fragment Based Sequence Alignment

Parallel Simulated Annealing for Fragment Based Sequence Ali...

引用

26th ieee International parallel and distributed processing symposium (IPDPS) / Workshop on High Performance Data Intensive Computing

作者： Correa, Jan Mendonca Magalhaes Alves de Melo, Alba Cristina Jacobi, Ricardo P. Boukerche, Azzedine Univ Brasilia Dept Comp Sci Brasilia DF Brazil Univ Ottawa SITE Ottawa ON K1N 6N5 Canada Kuwait Univ Safat 13060 Kuwait

ISBN: (纸本)9780769546766

Finding a biologically relevant sequence alignment may be difficult since several sequence alignments are possible, taking different parameters in consideration. A perceptron neuron can be used to associate weights to a set of alignment characteristics and then deciding if two residues should be aligned. Finding a good set of weights can be a hard problem and simulated annealing can be used to find a good set but can take a long time. In this paper, we propose a parallelization strategy for simulated annealing optimizing a Fragment Based Alignment in Linear Space (FBALS). the results were superior to the competing algorithm and the obtained speedups were compatible with the number of processing cores, indicating a good parallel strategy.

关键词： Sequence Alignment Linear Space Algorithms Simulated Annealing Perceptron

来源：评论

学校读者我要写书评

暂无评论

Aparallel procedure for dynamic multi-objective TSP

Aparallel procedure for dynamic multi-objective TSP

引用

2012 10th ieee International symposium on parallel and distributed processing with Applications, ISPA 2012

作者： Li, Weiqi Feng, Mingyuan University of Michigan - Flint Flint MI United States Nanjing University of Posts and Telecommunications Nanjing China

ISBN: (纸本)9780769547015

this paper proposes a new parallel search procedure for dynamic multi-objective traveling salesman problem. We design a multi-objective TSP in a stochastic dynamic environment. the proposed procedure first uses parallel processors to identify the extreme solutions of the search space for each of k objectives individually at the same time. these solutions are merged into a matrix E. the solutions in E are then searched by parallel processors and evaluated for dominance relationship. the proposed procedure was implemented in two different ways: a master-worker architecture and a pipeline architecture. © 2012 ieee.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共354页 << < 57 58 59 60 61 62 63 64 65 66 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：