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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

40 篇 会议
16 篇 期刊文献
1 册 图书

馆藏范围

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

日期分布

学科分类号

35 篇 工学
- 30 篇 计算机科学与技术...
- 22 篇 软件工程
- 4 篇 机械工程
- 4 篇 控制科学与工程
- 4 篇 化学工程与技术
- 3 篇 力学（可授工学、理...
- 3 篇 信息与通信工程
- 2 篇 光学工程
- 2 篇 材料科学与工程（可...
- 2 篇 动力工程及工程热...
- 2 篇 矿业工程
- 2 篇 交通运输工程
- 2 篇 生物工程
- 1 篇 冶金工程
- 1 篇 电气工程
- 1 篇 电子科学与技术（可...
- 1 篇 水利工程
- 1 篇 船舶与海洋工程
23 篇 理学
- 16 篇 数学
- 6 篇 物理学
- 4 篇 化学
- 3 篇 生物学
- 3 篇 系统科学
- 3 篇 统计学（可授理学、...
- 1 篇 海洋科学
10 篇 管理学
- 6 篇 管理科学与工程(可...
- 6 篇 图书情报与档案管...
- 3 篇 工商管理
2 篇 法学
- 2 篇 社会学
1 篇 经济学
- 1 篇 应用经济学
1 篇 农学
1 篇 医学

主题

5 篇 computer science
3 篇 laboratories
2 篇 routing
2 篇 interoperability
2 篇 traffic control
2 篇 big data
2 篇 compressors
2 篇 history
2 篇 computational ge...
2 篇 databases
2 篇 costs
2 篇 algorithm design...
2 篇 cities and towns
2 篇 codes
2 篇 entropy
2 篇 system recovery
2 篇 interpolation
2 篇 mesh generation
2 篇 distributed comp...
1 篇 parallel algorit...

机构

7 篇 math. and comput...
3 篇 courant inst. of...
3 篇 math. and comput...
3 篇 computer science...
2 篇 math. & computer...
2 篇 department of co...
2 篇 department of co...
2 篇 math. and comp. ...
2 篇 department of co...
2 篇 department of co...
2 篇 computer science...
2 篇 dept. of compute...
2 篇 oak ridge nation...
2 篇 division of math...
2 篇 computer science...
2 篇 school of comput...
2 篇 math. and comput...
2 篇 mathematics and ...
1 篇 computer electri...
1 篇 plant engineer d...

作者

3 篇 klasky scott
3 篇 gong qian
3 篇 sharir micha
3 篇 archibald rick
3 篇 reshniak viktor
3 篇 thakur rajeev
3 篇 koltun vladlen
2 篇 jaechun no
2 篇 balaji pavan
2 篇 podhorszki norbe...
2 篇 pavan balaji
2 篇 rajeev thakur
2 篇 rick archibald
2 篇 freitag lori
2 篇 aronov boris
2 篇 r.v. boppana
2 篇 scott klasky
2 篇 s. chalasani
2 篇 viktor reshniak
2 篇 no jaechun

语言

56 篇 英文
1 篇 其他

检索条件"机构=Division of Math. and Computer Science"

共 57 条记录，以下是11-20 订阅

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

详细简洁

排序：

Portable, MPI-interoperable coarray fortran

Portable, MPI-interoperable coarray fortran

引用

作者： Yang, Chaoran Bland, Wesley Mellor-Crummey, John Balaji, Pavan Department of Computer Science Rice University United States Math. and Comp. Sci. Division Argonne National Laboratory United States Mathematics and Computer Science Division Argonne National Laboratory United States

The past decade has seen the advent of a number of parallel programming models such as Coarray Fortran (CAF), Unified Parallel C, X10, and Chapel. Despite the productivity gains promised by these models, most parallel scientific applications still rely on MPI as their data movement model. One reason for this trend is that it is hard for users to incrementally adopt these new programming models in existing MPI applications. Because each model use its own runtime system, they duplicate resources and are potentially error-prone. Such independent runtime systems were deemed necessary because MPI was considered insufficient in the past to play this role for these languages. The recently released MPI-3, however, adds several new capabilities that now provide all of the functionality needed to act as a runtime, including a much more comprehensive one-sided communication framework. In this paper, we investigate how MPI-3 can form a runtime system for one example programming model, CAF, with a broader goal of enabling a single application to use both MPI and CAF with the highest level of interoperability. © 2014 ACM.

关键词： Interoperability

来源：评论

学校读者我要写书评

暂无评论

Steal Tree: Low-Overhead Tracing of Work Stealing Schedulers 13

Steal Tree: Low-Overhead Tracing of Work Stealing Schedulers

引用

ACM SIGPLAN Conference on Programming Language Design and Implementation

作者： Jonathan Lifflander Sriram Krishnamoorthy Laxmikant V. Kale Dept. of Computer Science University of Illinois Urbana-Champaign Comp. Sci. & Math. Division Pacific Northwest National Lab

ISBN: (纸本)9781450320146

Work stealing is a popular approach to scheduling task-parallel programs. The flexibility inherent in work stealing when dealing with load imbalance results in seemingly irregular computation structures, complicating the study of its runtime behavior. In this paper, we present an approach to efficiently trace async-finish parallel programs scheduled using work stealing. We identify key properties that allow us to trace the execution of tasks with low time and space overheads. We also study the usefulness of the proposed schemes in supporting algorithms for data-race detection and retentive stealing presented in the literature. We demonstrate that the perturbation due to tracing is within the variation in the execution time with 99% confidence and the traces are concise, amounting to a few tens of kilobytes per thread in most cases. We also demonstrate that the traces enable significant reductions in the cost of detecting data races and result in low, stable space overheads in supporting retentive stealing for async-finish programs.

关键词： Work-stealing schedulers Tracing Async-finish parallelism

来源：评论

学校读者我要写书评

暂无评论

On the Sum of Squared η-μ Random Variates With Application to the Performance of Wireless Communication Systems

On the Sum of Squared η-μ Random Variates With Application...

引用

IEEE Vehicular Technology Conference

作者： Imran Shafique Ansari Ferkan Yilmaz Mohamed-Slim Alouini Computer Electrical and Mathematical Sciences and Engineering (CEMSE) Division at King Abdullah University of Science and Technology (KAUST) Al-Khawarizmi Applied Math. Building (Bldg. #1) Thuwal 23955-6900 Makkah Province Kingdom of Saudi Arabia

ISBN: (纸本)9781467363365

The probability density function (PDF) and cumulative distribution function of the sum of L independent but not necessarily identically distributed squared η-μ variates, applicable to the output statistics of maximal ratio combining (MRC) receiver operating over η-μ fading channels that includes the Hoyt and the Nakagami-m models as special cases, is presented in closed-form in terms of the Fox's H function. Further analysis, particularly on the bit error rate via PDF-based approach, is also represented in closed form in terms of the extended Fox's H function (H). The proposed new analytical results complement previous results and are illustrated by extensive numerical and Monte Carlo simulation results.

关键词： η-μ variates cellular mobile radio systems non-integer parameters diversity maximal ratio combining binary modulation schemes bit error rate Fox's H function Meijer's G function and extended Fox's H function Bit error rate diversity reception Wireless communication systems Mobile radio systems closed forms sums Cumulative distribution function Hydrogen

来源：评论

学校读者我要写书评

暂无评论

CLARM: An integrative approach for functional modules discovery

CLARM: An integrative approach for functional modules discov...

引用

2011 ACM Conference on Bioinformatics, Computational Biology and Biomedicine, ACM-BCB 2011

作者： Salem, Saeed Alroobi, Rami Banitaan, Shadi Seridi, Loqmane Brewer, James Aljarah, Ibrahim Department of Computer Science North Dakota State University Fargo ND 58102 United States Math. and Comp. Sci. and Eng. Division KAUST 23955-6900 Saudi Arabia

ISBN: (纸本)9781450307963

Functional module discovery aims to find well-connected subnetworks which can serve as candidate protein complexes. Advances in High-throughput proteomic technologies have enabled the collection of large amount of interaction data as well as gene expression data. We propose, CLARM, a clustering algorithm that integrates gene expression profiles and protein protein interaction network for biological modules discovery. The main premise is that by enriching the interaction network by adding interactions between genes which are highly co-expressed over a wide range of biological and environmental conditions, we can improve the quality of the discovered modules. Protein protein interactions, known protein complexes, and gene expression profiles for diverse environmental conditions from the yeast Saccharomyces cerevisiae were used for evaluate the biological significance of the reported modules. Our experiments show that the CLARM approach is competitive to wellestablished module discovery methods. Copyright © 2011 ACM.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Communication analysis of parallel 3D FFT for flat cartesian meshes on large Blue Gene systems 08

引用

Proceedings of the 15th international conference on High performance computing

作者： Anthony Chan Pavan Balaji William Gropp Rajeev Thakur ASCI FLASH Center University of Chicago Math. and Comp. Sci. Division Argonne National Laboratory Dept. of Computer Science University of Illinois Urbana-Champaign

ISBN: (纸本)9783540898931

Parallel 3D FFT is a commonly used numerical method inscientific computing. P3DFFT is a recently proposed implementationof parallel 3D FFT that is designed to allow scalability to massivelylarge systems such as Blue Gene. While there has been recent workthat demonstrates such scalability on regular cartesian meshes (equallength in each dimension), its performance and scalability for flat cartesianmeshes (much smaller length in one dimension) is still a concern. Inthis paper, we perform studies on a 16-rack (16384-node) Blue Gene/Lsystem that demonstrates that a combination of the network topologyand the communication pattern of P3DFFT can result in early networksaturation and consequently performance loss. We also show that remappingprocesses on nodes and rotating the mesh by taking the communicationproperties of P3DFFT into consideration, can help alleviate thisproblem and improve performance by up to 48% in some special cases.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Virtual sensor networks - A resource efficient approach for concurrent applications

Virtual sensor networks - A resource efficient approach for ...

引用

4th International Conference on Information Technology-New Generations, ITNG 2007

作者： Jayasumana, Anura P. Qi, Han Illangasekare, Tissa H. Dept. of Electrical and Computer Engineering Colorado State University Dept. of Math. and Computer Sciences Colorado School of Mines Division of Environmental Science and Engineering Colorado School of Mines

ISBN: (纸本)0769527760

Current focus of sensor networks is on systems dedicated for a specific application. Wide variety of circumstances point to the need for sensor network deployments capable of sharing the physical network resources. We introduce the concept of Virtual Sensor Networks (VSN) to provide protocol support for the formation, usage, adaptation and maintenance of subsets of sensors collaborating on specific tasks. VSN concept also promises to enhance applications that involve dynamically varying subsets of sensor nodes collaborating tightly to achieve the desired outcomes, while relying on the remaining nodes to achieve connectivity and overcome the deployment and resource constraints. This article explores the concept, mechanisms, and benefits of using VSN. Examples of VSN support functionality include support for nodes to join and leave VSNs, broadcast within a VSN, and merging of VSNs. VSNs will simplify application deployment, enhance performance and scalability, facilitate resource sharing, and provide a degree of physical topology independence in wireless sensor networks. Deployment of overlapping sensor networks aimed at different tasks, especially in harsh environments, will also significantly benefit when organized as VSNs over a shared infrastructure © 2007 IEEE.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

A time division multiplexing (TDM) logic mapping method for computational applications

A time division multiplexing (TDM) logic mapping method for ...

引用

International Conference on Computational science and Its Applications (ICCSA 2007)

作者： Jeong, Taikyeong Kang, Jinsuk John, Youngjun Choi, Inhwa Choi, Sungsoo Yang, Hyosik Park, Gyngleen Yoo, Sehwan Dept. of Communications Eng. Myongji University South Korea Dept. of Computer Science and Eng. University of Incheon College of Information and Media Seoul Woman's University Fusion Technology Division Korea Electrotechnology Research Institute Dept. of Information and Telecommunication Eng. Sejong University Dept. of Computer and Statistics Cheju National University Dept. of Math. and Computer Science University of Maryland Eastern Shore United States

ISBN: (纸本)9783540744689

This paper discusses a large number of logic circuit mapping methods for complex systems, focusing on network hardware system designs. This logic mapping technique enables significant logic simulation time savings by mapping identical logic processor modules. Under the logic mapping method which is called the time division multiplexing (TDM) logic mapping method, the speed of the required to simulate it is significantly reduced, compared with conventional mapping methods, when folding the identical modules into a single module copy is done at the hardware description language (HDL) level. In principle, this method can be applied to any type of a network design platform, e.g., communication data stream through physical channel (fiber optic line), video signal transfer logic display environment, etc. In this paper, we demonstrate this method using several configurations of the IBM Serial Link architecture.

关键词： Logic circuits

来源：评论

学校读者我要写书评

暂无评论

Probabilistic Strategies for Pursuit in Cluttered Environments with Multiple Robots

Probabilistic Strategies for Pursuit in Cluttered Environmen...

引用

IEEE International Conference on Robotics and Automation (ICRA)

作者： Geoffrey Hollinger Athanasios Kehagias Sanjiv Singh The Robotics Institute School of Computer Science Carnegie Mellon University Pittsburgh PA USA Division of Mathematics Department of Math. Phys. and Computer Science s Faculty of Engineering Aristotle University of Thessaloniki Thessaloniki Greece

In this paper, we describe a method for coordinating multiple robots in a pursuit-evasion domain. We examine the problem of multiple robotic pursuers attempting to locate a non-adversarial mobile evader in an indoor environment. Unlike many other approaches to this problem, our method seeks to minimize expected time of capture rather than guaranteeing capture. This allows us to examine the performance of our algorithm in complex and cluttered environments where guaranteed capture is difficult or impossible with limited pursuers. We present a probabilistic formulation of the problem, discretize the environment, and define cost heuristics for use in planning. We then propose a scalable algorithm using an entropy cost heuristic that searches possible movement paths to determine coordination strategies for the robotic pursuers. We present simulated results describing the performance of our algorithm against state of the art alternatives in a complex office environment. Our algorithm successfully reduces capture time with limited pursuers in an environment beyond the scope of many other approaches.

关键词： Robot kinematics Robotics and automation Costs Robot sensing systems Mobile robots Indoor environments Entropy Humans Game theory Environmental economics

来源：评论

学校读者我要写书评

暂无评论

A real-space parallel optimization model reduction approach for electronic structure computation in large nanostructures using orbital-free density functional theory

A real-space parallel optimization model reduction approach ...

引用

2006 ASME International Mechanical Engineering Congress and Exposition, IMECE2006

作者： Negrut, Dan Anitescu, Mihai El-Azab, Anter Benson, Steve Constantinescu, Emil Heyn, Toby Zapol, Peter Dept. Mechanical Engineering University of Wisconsin Madison WI 53706 United States Math. and Comp. Sc. Division Argonne National Laboratory Argonne IL 60439 United States Materials Theory Group College of Engineering Florida State University Tallahassee FL 32310 United States Computer Science Department Viginia Tech. Blacksburg VA 24061 United States Mat. Sc. and Chem. Divisions Argonne National Laboratory Argonne IL 60439 United States

ISBN: (纸本)0791837904

The goal of this work is the development of a highly parallel approach to computing the electron density in nanostructures. In the context of orbital-free density functional theory, a model reduction approach leads to a parallel algorithm that mirrors the subdomain partitioning of the problem. The resulting form of the energy functional that is subject to the minimization process is compact and simple. Computation of gradient and hessian information is immediate. The salient attribute of the proposed methodology is the use of model reduction (reconstruction) within the framework of electronic structure computation. Copyright © 2006 by ASME.

关键词： Nanostructures

来源：评论

学校读者我要写书评

暂无评论

The globus extensible input/output system (XIO): A protocol independent IO system for the Grid

The globus extensible input/output system (XIO): A protocol ...

引用

19th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2005

作者： Allcock, William Bresnahan, John Kettimuthu, Rajkumar Link, Joseph Math. and Computer Science Division Argonne National Laboratory Argonne IL 60439

ISBN: (纸本)0769523129

In distributed heterogeneous Grid environments the protocols used to exchange bits are crucial. As researchers work hard to discover the best new protocol for the Grid, application developers struggle with ways to use these new protocols. A stable, consistent, and intuitive framework is needed to aid in the implementation and use of these protocols. While the application must not be burdened with the protocol details some of it may need to be exposed to take advantage of potential optimizations. In this paper we examine how the Globus XIO API provides this framework. We will explore the performance implications of using this abstraction layer and the benefits gained in application as well as protocol development.

关键词： Distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共6页 << < 1 2 3 4 5 6 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：