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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是451-460 订阅

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

详细简洁

排序：

Using Physical Stigmergy in Decentralized Optimization Under Multiple Non-separable Constraints: Formal Methods and an Intelligent Lighting Example 28

Using Physical Stigmergy in Decentralized Optimization Under...

引用

28th ieee International parallel & distributed processing symposium Workshops (IPDPSW)

作者： Pavlic, theodore P. Arizona State Univ Sch Life Sci Tempe AZ 85287 USA

ISBN: (纸本)9781479941162

In this paper, a distributed asynchronous algorithm for intelligent lighting is presented that minimizes collective power use while meeting multiple user lighting constraints simultaneously and requires very little communication among agents participating in the distributed computation. Consequently, the approach is arbitrarily scalable, adapts to exogenous disturbances, and is robust to failures of individual agents. this algorithm is an example of a decentralized primal-space algorithm for constrained non-linear optimization that achieves coordination between agents using stigmergic memory cues present in the physical system as opposed to explicit communication and synchronization. Not only does this work make of stigmergy, a property first used to describe decentralized decision making in eusocial insects, but details of the algorithm are inspired by classic social foraging theory and more recent results in eusocial-insect macronutrient regulation. this theoretical analysis in this paper guarantees that the decentralized stigmergically coupled system converges to within a finite neighborhood of the optimal resource allocation. these results are validated using a hardware implementation of the algorithm in a small-scale intelligent lighting scenario. there are other real-time distributed resource allocation applications that are amenable to these methods, like distributed power generation;in general, this paper means to provide proof of concept that physical variables in cyberphysical systems can be leveraged to reduce the communication burden of algorithms.

关键词： Optimization algorithms Resource allocation Pareto optimality Constrained optimization Intelligent lighting Bioinspiration Agents and autonomous systems Decentralized control distributed optimization Stigmergy

来源：评论

学校读者我要写书评

暂无评论

2014 ieee 5th International symposium on Power Electronics for distributed Generation Systems, PEDG 2014

2014 IEEE 5th International Symposium on Power Electronics f...

引用

2014 ieee 5th International symposium on Power Electronics for distributed Generation Systems, PEDG 2014

ISBN: (纸本)9781479951154

the proceedings contain 91 papers. the topics discussed include: multi-level converter for high power-high frequency IPT systems;a novel power control strategy of modular multi-level converter in HVDC-AC hybrid transmission systems for passive networks;modular multilevel converter with high-frequency transformers for interfacing hybrid DC and AC microgrid systems;parameters sensitivity analysis of the controller based on unified control strategy in a photovoltaic microgrid;challenges of grid integration of distributed generation in the interdisciplinary research project smart Nord;impedance based analysis and design of harmonic resonant controller for a wide range grid impedance;short circuit calculation in networks with a high share of inverter based distributed generation;and control-strategy design for frequency control in autonomous smart microgrids.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Scalable System Environment Caching and Sharing for distributed Virtual Machines 28

Scalable System Environment Caching and Sharing for Distribu...

引用

28th ieee International parallel & distributed processing symposium Workshops (IPDPSW)

作者： Long, Teng Yoon, Ilchul Sussman, Alan Porter, Adam Memon, Atif Univ Maryland Dept Comp Sci College Pk MD 20742 USA State Univ New York Dept Comp Sci Incheon South Korea

ISBN: (纸本)9781479941162

Virtual machines have become very widely used in many software development communities. Developers can conveniently provision specific machine configurations using VMs, and those VMs can contain operating systems, libraries, and other applications required to build and execute their software under development. However, the size of full VM images and network bandwidth limitations makes large-scale reuse of VMs among distributed groups of developers extremely difficult. In this paper we address the problem of provisioning software configurations realized as virtual machine images rapidly and incrementally from a set of pristine VM states, by caching and sharing configuration fragments between developer groups. We first formally model the entire configuration space that might be cached and shared between groups, describe the design of our infrastructure to incrementally provision configurations from its fragments, and finally evaluate the performance of our approach with an example scenario common in software testing. Our experimental results show that our approach can help developers reduce the time and resource requirements for provisioning software configurations.

关键词： Software testing

来源：评论

学校读者我要写书评

暂无评论

A New parallel Algorithm for Two-Pass Connected Component Labeling 28

A New Parallel Algorithm for Two-Pass Connected Component La...

引用

28th ieee International parallel & distributed processing symposium Workshops (IPDPSW)

作者： Gupta, Siddharth Palsetia, Diana Patwary, Md. Mostofa Ali Agrawal, Ankit Choudhary, Alok Northwestern Univ Dept Elect Engn & Comp Sci Evanston IL 60208 USA

ISBN: (纸本)9781479941162

Connected Component Labeling (CCL) is an important step in pattern recognition and image processing. It assigns labels to the pixels such that adjacent pixels sharing the same features are assigned the same label. Typically, CCL requires several passes over the data. We focus on two-pass technique where each pixel is given a provisional label in the first pass whereas an actual label is assigned in the second pass. We present a scalable parallel two-pass CCL algorithm, called PAREMSP, which employs a scan strategy and the best union-find technique called REMSP, which uses REM's algorithm for storing label equivalence information of pixels in a 2-D image. In the first pass, we divide the image among threads and each thread runs the scan phase along with REMSP simultaneously. In the second phase, we assign the final labels to the pixels. As REMSP is easily parallelizable, we use the parallel version of REMSP for merging the pixels on the boundary. Our experiments show the scalability of PAREMSP achieving speedups up to 20.1 using 24 cores on shared memory architecture using OpenMP for an image of size 465.20 MB. We find that our proposed parallel algorithm achieves linear scaling for a large resolution fixed problem size as the number of processing elements are increased. Additionally, the parallel algorithm does not make use of any hardware specific routines, and thus is highly portable.

关键词： CCL Image processing OpenMP Pattern Recognition Union-FInd

来源：评论

学校读者我要写书评

暂无评论

A distributed Speech Algorithm for Large Scale Data Communication Systems 28

A Distributed Speech Algorithm for Large Scale Data Communic...

引用

28th ieee International parallel & distributed processing symposium Workshops (IPDPSW)

作者： Xiong, Naixue Tong, Guoxiang Guo, Wenzhong Tan, Jian Wu, Guanning Hubei Univ Educ Hubei Coinnovat Ctr Basic Educ Technol Serv Sch Comp Sci Wuhan Hubei Peoples R China Univ Shanghai Sci & Technol Sch Optelect & Comp Engn Shanghai Key Lab Modern Opt Syst Shanghai Peoples R China Fuzhou Univ Coll Math & Comp Sci Fuzhou 350108 Peoples R China Univ Shanghai Sci & Technol Sch Opt Elect & Comp Engn Shanghai Peoples R China

ISBN: (纸本)9781479941162

Data-driven computing and using data for strategic advantages are exemplified by communication systems, and the speech intelligibility in communication systems is generally interrupted by interfering noise. this interference comes from the environmental noise, so we can reduce them intelligibility by masking the interested signal [1, 2]. An important work in communication systems is to extract speech from noisy speech and inhibiting background noise. In this paper, the subspace algorithm theory is introduced into a speech noise reduction system. We first analyze the principle of LMS adaptive speech noise reduction algorithm with the subspace algorithm, and then, we merge the subspace algorithm into the VS-LMS algorithm and propose a combined algorithm for an adaptive speech noise reduction system. Furthermore, we analyze the combined algorithm, which can decrease musical noise, as well as generate a suitable step-size factor to resolve the contradiction. this issue cannot be resolved by the current LMS algorithm [31], which has less convergence speed and larger residual noise than our system. Our simulation results demonstrate that our algorithm can get 3 to 10 times better than original algorithm in low SNR (-5 similar to 0db) and high SNR (0 similar to + 5db).

关键词： Adaptive Filter Subspace noise reduction algorithm Speech noise reduction system digital signal processing (DSP) LMS (least mean square)

来源：评论

学校读者我要写书评

暂无评论

Topology-aware Optimization of Communications for parallel Matrix Multiplication on Hierarchical Heterogeneous HPC Platforms 28

Topology-aware Optimization of Communications for Parallel M...

引用

28th ieee International parallel & distributed processing symposium Workshops (IPDPSW)

作者： Malik, Tania Rychkov, Vladimir Lastovetsky, Alexey Quintin, Jean-Noel Univ Coll Dublin Sch Comp Sci & Informat Dublin 4 Ireland Bull SAS Extreme Comp R&D Paris France

ISBN: (纸本)9781479941162

Communications on hierarchical heterogeneous HPC platforms can be optimized based on topology information. For MPI, as a major programming tool for such platforms, a number of topology-aware implementations of collective operations have been proposed for optimal scheduling of messages. this approach improves communication performance and does not require to modify application source code. However, it is applicable to collective operations only and does not affect the parts of the application that are based on point-to-point exchanges. In this paper, we address the problem of efficient execution of data-parallel applications on interconnected clusters and present a topology-aware optimization that improves data partition by taking into account the entire communication flow of the application. this approach is also non-intrusive to the source code but application-specific. For illustration, we use parallel matrix multiplication, where the matrices are partitioned into irregular 2D rectangles assigned to different processors and arranged in columns, and the processors communicate over this partitioning vertically and horizontally. By rearranging the rectangles, we can minimize communications between different levels of the network hierarchy. Finding the optimal arrangement is NP-complete, therefore, we propose a heuristic based on evaluation of the communication flow on the given topology. We demonstrate the correctness and efficiency of the proposed approach by experimental results on multicore nodes and interconnected heterogeneous clusters.

关键词： heterogeneous clusters topology-aware communications data partitioning matrix multiplication

来源：评论

学校读者我要写书评

暂无评论

Stack-tagged dataflow 26

Stack-tagged dataflow

引用

26th ieee International symposium on Computer Architecture and High Performance Computing Workshops, SBAC-PADW 2014

作者： Santiago, Leandro Marzulo, Leandro A.J. Goldstein, Brunno F. Alves, Tiago A.O. França, Felipe M.G. Dep. de Informática e Ciência da Computação Instituto de Matemática e Estatística - IMe Universidade Do Estado Do Rio de Janeiro - UERJ Rio de Janeiro Brazil Programa de Engenharia de Sistemas e Computação COPPE Universidade Federal Do Rio de Janeiro Rio de Janeiro Brazil

ISBN: (纸本)9781479970148

Dynamic Dataflow allows simultaneous execution of instructions in different iterations of a loop, boosting parallelism exploitation. In this model, operands are tagged with their associated instance number, incremented as they go through the loop. Instruction execution is triggered when all input operand with the same tag become available. However, this traditional tagging mechanism often requires the generation of several control instructions to manipulate tags and guarantee the correct matching. To address this problem, this work presents Stack- Tagged Dataflow, a tagging mechanism that uses stacks of tags to reduce control overheads in dataflow, while isolating context from different nested loops. Push instructions at the beginning of loops will create a new context, while Pop instructions, at the end of the loop, will restore the original context tags. Experimental results show that Stack-Tagged Dataflow is a viable solution, suggesting that a hybrid compiling approach can be used to enable Stack- Tags only when needed. © 2014 ieee.

关键词： data flow computing program control structures context isolation dataflow control overhead reduction nested loops pop instructions push instructions stack-tagged dataflow tagging mechanism Assembly Computer architecture Context Libraries parallel processing Tagging Virtual machining Dataflow parallel Programming Stack Tag data flow TAGGING program control structures virtual machines parallel programming Computer Architecture Furnace conveyors parallel processing (COMPUTERS) Loops Libraries assemblies NESTED LOOPS virtual machining instruction

来源：评论

学校读者我要写书评

暂无评论

distributed cooperative Q-learning for mobility-sensitive handover optimization in LTE SON 19

Distributed cooperative Q-learning for mobility-sensitive ha...

引用

ISCC 2014 Workshop - 5th ieee International Workshop on Performance Evaluation of Communications in distributed Systems and Web based Service Architectures, PEDISWESA 2014

作者： Mwanje, Stephen S. Mitschele-thiel, Andreas Integrated Communications Systems Techniche Universität Ilmenau Germany

ISBN: (纸本)9781479942770

Optimal settings for Handover parameters (Hysteresis and Time-to-Trigger) depend on user velocities in the network. the Self-Organization Networks (SON) standard defines the Mobility Robustness Optimization (MRO) use case for the autonomous methods of configuring the parameters in congruence to the mobility pattern. State of the art MRO solutions have relied on expert knowledge, rule based algorithms to search the parameter space;yet it is unwieldy to design rules for all possible mobility patterns in any network. In this work, we present a Q-learning MRO solution, QMRO, which learns the required parameter values appropriate for specific velocity conditions in the individual cells. We compare QMRO against the best static reference configuration (Ref) that is obtained by sweeping the parameter space. Our results show that QMRO is able to learn parameter settings that achieve similar performance to Ref in a realistic network environment where users have dynamically varying velocities. © 2014 ieee.

关键词： Cities and towns Convergence Delays Interference Iron Signal to noise ratio Handover LTE MRO Q-Learning SON Local thermodynamic equilibrium congruences Mars Reconnaissance Orbiter configuration parameter state of the art parameter setting parameter space methods Long Term Evolution

来源：评论

学校读者我要写书评

暂无评论

Construction of Porous Networks subjected to Geometric Restrictions by using OpenMP 28

Construction of Porous Networks subjected to Geometric Restr...

引用

28th ieee International parallel & distributed processing symposium Workshops (IPDPSW)

作者： Gonzalez-Mendez, A. Roman-Alonso, G. Rojas-Gonzalez, F. Castro-Garcia, M. A. Aguilar-Cornejo, M. Cordero-Sanchez, S. Univ Autonoma Metropolitana Izt Dept Elect Engn Iztapalapa CDMX Mexico Univ Autonoma Metropolitana Izt Dept Chem Iztapalapa CDMX Mexico

ISBN: (纸本)9781479941162

the study of porous materials involves great importance for a vast number of industrial applications. In order to study some specific characteristics of materials, in-silico simulations can be employed. the particular simulation of pore networks described in this work finds its basis in the Dual Site-Bond Model (DSBM). Under this approach, a porous material is thought to be made of sites (cavities, bulges) interconnected to each other through bonds (throats, capillaries);while every site is connected to a number of bonds each bond is the link between two sites. At present, several computing algorithms have been implemented for the simulation of pore networks;nevertheless, only a few of these methods take into account the geometric restrictions that arise during the interconnection of a set of bonds to every site of the network. It is likely that introducing restrictions of this sort in the computing algorithms would lead to the implementation of more realistic pore networks. In this work, a sequential algorithm and its parallel computing version are proposed to construct pore networks, allowing geometrical restrictions among hollow entities. Our parallel approach uses OpenMP to create a set of threads (computing tasks) that work simultaneously on independent and random pore network regions. We discuss the obtained results.

关键词： Porous Networks parallel Computing Dual Site-Bond Model Multi-Core Programming OpenMP

来源：评论

学校读者我要写书评

暂无评论

Evaluating GPU Passthrough in Xen for High Performance Cloud Computing 28

Evaluating GPU Passthrough in Xen for High Performance Cloud...

引用

28th ieee International parallel & distributed processing symposium Workshops (IPDPSW)

作者： Younge, Andrew J. Walters, John Paul Crago, Stephen Fox, Geoffrey C. Indiana Univ Pervas Technol Inst 2719 E 10th St Bloomington IN 47408 USA Univ Southern Calif Informat Sci Inst Arlington VA 22203 USA

ISBN: (纸本)9781479941162

With the advent of virtualization and Infrastructure-as-a-Service (IaaS), the broader scientific computing community is considering the use of clouds for their technical computing needs. this is due to the relative scalability, ease of use, advanced user environment customization abilities clouds provide, as well as many novel computing paradigms available for data-intensive applications. However, there is concern about a performance gap that exists between the performance of IaaS when compared to typical high performance computing (HPC) resources, which could limit the applicability of IaaS for many potential scientific users. Most recently, general-purpose graphics processing units (GPGPUs or GPUs) have become commonplace within high performance computing. We look to bridge the gap between supercomputing and clouds by providing GPU-enabled virtual machines (VMs) and investigating their feasibility for advanced scientific computation. Specifically, the Xen hypervisor is utilized to leverage specialized hardware-assisted I/O virtualization and PCI passthrough in order to provide advanced HPC-centric Nvidia GPUs directly in guest VMs. this methodology is evaluated by measuring the performance of two Nvidia Tesla GPUs within Xen VMs and comparing to bare-metal hardware. Results show PCI passthrough of GPUs within virtual machines is a viable use case for many scientific computing workflows, and could help support high performance cloud infrastructure in the near future.

关键词： Cloud computing GPUs HPC IaaS Scientific Computing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共354页 << < 42 43 44 45 46 47 48 49 50 51 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：