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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

46 篇 会议
10 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

41 篇 工学
- 35 篇 计算机科学与技术...
- 24 篇 软件工程
- 6 篇 电子科学与技术（可...
- 5 篇 信息与通信工程
- 4 篇 电气工程
- 3 篇 控制科学与工程
- 2 篇 机械工程
- 2 篇 化学工程与技术
- 1 篇 材料科学与工程（可...
- 1 篇 动力工程及工程热...
- 1 篇 水利工程
16 篇 理学
- 12 篇 数学
- 3 篇 物理学
- 2 篇 化学
- 2 篇 统计学（可授理学、...
- 1 篇 天文学
- 1 篇 大气科学
- 1 篇 海洋科学
- 1 篇 地质学
- 1 篇 系统科学
8 篇 管理学
- 7 篇 图书情报与档案管...
- 3 篇 管理科学与工程(可...
- 1 篇 工商管理
2 篇 法学
- 1 篇 法学
- 1 篇 社会学
1 篇 经济学
- 1 篇 应用经济学

主题

3 篇 computational mo...
2 篇 parallel process...
2 篇 collaborative fi...
2 篇 task analysis
2 篇 sorting
2 篇 graphics process...
2 篇 load modeling
2 篇 wireless sensor ...
2 篇 algorithm design...
2 篇 load management
2 篇 protocols
2 篇 vehicular ad hoc...
2 篇 kernel
2 篇 graphics process...
2 篇 prediction algor...
2 篇 mathematical mod...
2 篇 data models
2 篇 open source soft...
2 篇 training
1 篇 software systems

机构

3 篇 parallel computi...
3 篇 key lab. of para...
3 篇 key lab. of para...
3 篇 graduate univers...
3 篇 lab. of parallel...
2 篇 state key labora...
2 篇 parallel computi...
2 篇 key lab. of para...
2 篇 key lab. of para...
2 篇 school of comput...
2 篇 mediatron lab. s...
2 篇 architecture key...
2 篇 lab. of parallel...
2 篇 parallel process...
1 篇 parallel robot a...
1 篇 department of el...
1 篇 school of design...
1 篇 university of ap...
1 篇 ieee computer so...
1 篇 taiwan

作者

7 篇 wang tao
7 篇 wang huaimin
6 篇 dubey pradeep
5 篇 yin gang
3 篇 satish nadathur
3 篇 yang cheng
3 篇 zang binyu
3 篇 zhang yunquan
3 篇 smelyanskiy mikh...
2 篇 imen achour
2 篇 chhugani jatin
2 篇 park jongsoo
2 篇 chen haibo
2 篇 thiele lothar
2 篇 colmenares juan ...
2 篇 jia haipeng
2 篇 long guoping
2 篇 sami tabbane
2 篇 anthony busson
2 篇 yu yue

语言

56 篇 英文

检索条件"机构=Lab. of Parallel Computing"

共 56 条记录，以下是21-30 订阅

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

详细简洁

排序：

To INT-MAX... and Beyond! Exploring Large-Count Support in MPI

To INT-MAX... and Beyond! Exploring Large-Count Support in M...

引用

2014 Workshop on Exascale MPI at Supercomputing Conference, ExaMPI 2014

作者： Hammond, Jeff R. Schafer, Andreas Latham, Rob Parallel Computing Lab Intel Corp. Switzerland Friedrich-Alexander-Universitat Erlangen-Nurnberg Germany Mathmatics and Computer Science Division Argonne National Lab. United States

ISBN: (纸本)9781479970322

In order to describe a structured region of memory, the routines in the MPI standard use a (count, datatype) pair. The C specification for this convention uses an int type for the count. Since C int types are nearly always 32 bits large and signed, counting more than 231 elements poses a challenge. Instead of changing the existing MPI routines, and all consumers of those routines, the MPI Forum asserts that users can build up large datatypes from smaller types. To evaluate this hypothesis and to provide a user-friendly solution to the large-count issue, we have developed BigMPI, a library on top of MPI that maps large-count MPI-like functions to MPI-3 standard features. BigMPI demonstrates a way to perform such a construction, reveals shortcomings of the MPI standard, and uncovers bugs in MPI implementations. © 2014 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

CloudRAMSort: Fast and efficient large-scale distributed RAM sort on shared-nothing cluster 12

CloudRAMSort: Fast and efficient large-scale distributed RAM...

引用

2012 ACM SIGMOD International Conference on Management of Data, SIGMOD '12

作者： Kim, Changkyu Park, Jongsoo Satish, Nadathur Lee, Hongrae Dubey, Pradeep Chhugani, Jatin Parallel Computing Lab. Intel Labs. Santa Clara CA United States Structured Data Group Google Research Mountain View United States

ISBN: (纸本)9781450312479

Sorting is a fundamental kernel used in many database operations. The total memory availab.e across cloud computers is now sufficient to store even hundreds of terabytes of data in-memory. Applications requiring high-speed data analysis typically use in-memory sorting. The two most important factors in designing a high-speed in-memory sorting system are the single-node sorting performance and inter-node communication. In this paper, we present CloudRAMSort, a fast and efficient system for large-scale distributed sorting on shared-nothing clusters. CloudRAMSort performs multi-node optimizations by carefully overlapping computation with inter-node communication. The system uses a dynamic multi-stage random sampling approach for improved load-balancing between nodes. CloudRAMSort maximizes per-node efficiency by exploiting modern architectural features such as multiple cores and SIMD (Single-Instruction Multiple Data) units. This holistic combination results in the highest performing sorting performance on distributed shared-nothing platforms. CloudRAMSort sorts 1 Terabyte (TB) of data in 4.6 seconds on a 256-node Xeon X5680 cluster called the Intel Endeavor system. CloudRAMSort also performs well on heavily skewed input distributions, sorting 1 TB of data generated using Zipf distribution in less than 5 seconds. We also provide a detailed analytical model that accurately projects (within avg. 7%) the performance of CloudRAMSort with varying tuple sizes and interconnect bandwidths. Our analytical model serves as a useful tool to analyze performance bottlenecks on current systems and project performance with future architectural advances. With architectural trends of increasing number of cores, bandwidth, SIMD width, cache-sizes, and interconnect bandwidth, we believe CloudRAMSort would be the system of choice for distributed sorting of large-scale in-memory data of current and future systems. © 2012 ACM.

关键词： Sorting

来源：评论

学校读者我要写书评

暂无评论

Efficient sparse matrix-vector multiplication on x86-based many-core processors 13

Efficient sparse matrix-vector multiplication on x86-based m...

引用

27th ACM International Conference on Supercomputing, ICS 2013

作者： Liu, Xing Smelyanskiy, Mikhail Chow, Edmond Dubey, Pradeep School of Computational Science and Engineering Georgia Institute of Technology Atlanta GA United States Parallel Computing Lab. Intel Corporation Santa Clara CA United States

ISBN: (纸本)9781450321303

Sparse matrix-vector multiplication (SpMV) is an important kernel in many scientific applications and is known to be memory bandwidth limited. On modern processors with wide SIMD and large numbers of cores, we identify and address several bottlenecks which may limit performance even before memory bandwidth: (a) low SIMD efficiency due to sparsity, (b) overhead due to irregular memory accesses, and (c) load-imbalance due to non-uniform matrix structures. We describe an efficient implementation of SpMV on the Intel® Xeon Phi™ Coprocessor, codenamed Knights Corner (KNC), that addresses the above challenges. Our implementation exploits the salient architectural features of KNC, such as large caches and hardware support for irregular memory accesses. By using a specialized data structure with careful load balancing, we attain performance on average close to 90% of KNC's achievable memory bandwidth on a diverse set of sparse matrices. Furthermore, we demonstrate that our implementation is 3.52x and 1.32x faster, respectively, than the best availab.e implementations on dual Intel® Xeon™ Processor E5-2680 and the NVIDIA Tesla K20X architecture. © 2013 ACM.

关键词： Bandwidth

来源：评论

学校读者我要写书评

暂无评论

Linking stack overflow to issue tracker for issue resolution 2014

Linking stack overflow to issue tracker for issue resolution

引用

6th Asia-Pacific Symposium on Internetware, Internetware 2014

作者： Wang, Tao Yin, Gang Wang, Huaimin Yang, Cheng Zou, Peng Key Lab. of Parallel and Distributed Computing Colledge of Computer National University of Defence Technology ChangSha Hunan China Academy of Equipment Command and Technology Beijing100000 China

ISBN: (纸本)9781450334013

Issue resolution is a central task for software development. The efficiency of issue fixing largely relies on the issue report quality. Stack Overflow, which hosts rich and real-Time posts about programming-specific problems, is a valuable external source of knowledge for issue resolution. In this paper, we present CrossLink, an analysis framework that automatically introduce related posts in Stack Overflow to issues in Android Issue Tracker. This helps developers to leverage the abundant and professional knowledge from massive programmers in Stack Overflow for issue resolution. CrossLink explores the semantic similarities as well as the temporal associations between the two types of repositories to recommend Stack Overflow posts to Android issues. The internal links in Stack Overflow are also employed to improve the linking accuracy. The experiments prove the effectiveness of CrossLink with precision of 62.51% for top-10 recommendations, which is significantly higher than the state-of-Art method. © 2014 ACM.

关键词： Android (operating system)

来源：评论

学校读者我要写书评

暂无评论

A Multi-Dimensional Assessment Model and Its Application in E-learning Courses of Computer Science 20

A Multi-Dimensional Assessment Model and Its Application in ...

引用

21st Annual Conference of the Special Interest Group in Information Technology Education, SIGITE 2020

作者： Luo, Jiwen Lu, Feng Wang, Tao Key Lab. of Parallel and Distributed Computing College of Computer National University of Defense Technology Changsha China National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

ISBN: (纸本)9781450370455

Computer science is a practical discipline. It is always a great challenge to evaluate students' computer practice using computer-aided means for large scale students. We always need to address problems such as suspected plagiarism and deviation of the overall difficulty factor. In this paper, a multi-dimensional assessment model is designed for CS courses based on the detailed practice processing data in an E-learning system. The model comprehensively evaluates the students' learning process and results in three aspects of correctness, originality, and quality detection. Besides, the teacher can easily participate in the assessment according to their needs. The correctness is an essential requirement, and the originality is based on the clustering results of students' behaviors after clone detection to curb homework plagiarism. SonarQube is used to detect code quality and put forward higher requirements for codes. Manual participation intelligence has improved the flexibility and applicability of the model to a certain extent. We applied this model on the EduCoder online education platform and carried out a comprehensive analysis of 485 students in the parallel Programming Principles and Practice Class of Huazhong University of Science and Technology. Experiment results confirm the distinction, rationality, and fairness of the model in assessing student performance. It not only gives students a credible, comprehensive score in large-scale online practical programming courses but also gives teachers and students corresponding suggestions based on the evaluation results. Furthermore, the model can be extended to other online education platforms. © 2020 ACM.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Performance evaluation of allgather algorithms on terascale Linux cluster with Fast Ethernet

Performance evaluation of allgather algorithms on terascale ...

引用

8th International Conference on High-Performance computing in Asia-Pacific Region

作者： Chen, Jing Zhang, Linbo Zhang, Yunquan Yuan, Wei Department of Computer Science University of Science and Technology of China China Lab. of Parallel Computing Institute of Software CAS China State Key Laboratory of Computer Science China Academy of Mathematics and Systems Sciences CAS China

ISBN: (纸本)0769524869

We report our work on evaluating performance of several MPI Allgather algorithms on Fast Ethernet. These algorithms are ring, recursive doubling, Bruck, and neighbor exchange. The first three algorithms are widely used today. The neighbor exchange algorithm which was recently proposed by the authors incorporates pair-wise exchange, and is expected to perform better with certain configurations, mainly when using TCP/IP over Ethernet. We tested the four algorithms on terascale Linux clusters DeepComp 6800 and DAWNING 4000A using TCP/IP over Fast Ethernet. Results show that our neighbor exchange algorithm performs the best for long messages, the ring algorithm performs the best for medium-size messages and the recursive doubling algorithm performs the best for short messages.

关键词： Computer networks

来源：评论

学校读者我要写书评

暂无评论

Three dimensional and thermal transient analysis of sedimentary rocks

Three dimensional and thermal transient analysis of sediment...

引用

Eighth International Conference on Advanced Computational Methods in Heat Transfer, HEAT TRANSFER VIII

作者： King, V.P.S. Landau, L. Alves, J.L.D. Martins, M.A.D. Lab. for Compl. Methods in Eng. COPPE Fed. University of Rio de Janeiro Brazil Centre for Parallel Computing COPPE Federal University of Rio de Janeiro Brazil

This work presents the implementation of a finite element code for the thermal transient analysis of sedimentary rocks. This analysis provides a means to assess the thermal history in sedimentary rocks, assisting the studies of hydrocarbon generation and migration processes. The unstructured 3D mesh of tetrahedral elements provides the discrete model. An iterative driver using an edge-by-edge data structure solves the resulting system of equations at each time step. This strategy provides considerable improvements in terms of CPU time and memory demand. This combination enables the study of complex 3D problems, a key issue to basin analysis.

关键词： Sedimentary rocks

来源：评论

学校读者我要写书评

暂无评论

Exploiting flexibly assignable work to improve load balance 02

Exploiting flexibly assignable work to improve load balance

引用

Fourteenth Annual ACM Symposium on parallel Algorithms and Architectures

作者： Pinar, Ali Hendrickson, Bruce NERSC Lawrence Berkeley National Lab. Berkeley CA 94720 United States Parallel Computing Sciences Dept. Sandia National Laboratories Albuquerque NM 87185-1110 United States

ISBN: (纸本)9781581135299

In many applications of parallel computing, distribution of the data unambiguously implies distribution of work among processors. But there are exceptions where some tasks can be assigned to one of several processors without altering the total volume of communication. In this paper, we study the problem of exploiting this flexibility in assignment of tasks to improve load balance. We first model the problem in terms of network flow and use combinatorial techniques for its solution. Our parametric search algorithms use maximum flow algorithms for probing on a candidate optimal solution value. We describe two algorithms to solve the assignment problem with log WT and |P| probe calls, where WT and |P|, respectively, denote the total workload and number of processors. We also define augmenting paths and cuts for this problem, and show that any algorithm based on augmenting paths can be used to find an optimal solution for the task assignment problem. We then consider a continuous version of the problem, and formulate it as a linearly constrained optimization problem, i.e., min Ax∞, s.t. Bx = d. To avoid solving an intractable ∞-norm optimization problem, we show that in this case minimizing the 2-norm is sufficient to minimize the ∞-norm, which reduces the problem to the well-studied linearly-constrained least squares problem. The continuous version of the problem has the advantage of being easily amenable to parallelization.

关键词： Algorithms

来源：评论

学校读者我要写书评

暂无评论

Real-time-component based software architecture for QoS-adaptive networked multimedia applications

Real-time-component based software architecture for QoS-adap...

引用

13th IEEE International Symposium on Object, Component, and Service-Oriented Real-Time Distributed computing, ISORC 2010

作者： Colmenares, Juan A. Kim, K.H. Zhang, Zhen Lim, Chadeok Rim, Kee-Wook Parallel Computing Lab. CS Division University of California Berkeley United States EECS Department DREAM Lab. University of California Irvine United States Electronics and Telecom Research Institute Daejeon Korea Republic of Department of Computer Science Sunmoon University Korea Republic of

ISBN: (纸本)9780769540375

Highly desirable types of networked multimedia applications should adapt to changes in the environmental conditions in which they operate, such as communication bandwidth, availab.e memory, and battery lifetime, while providing the best possible quality of service (QoS). In this paper we present a software architecture that facilitates the development of adaptive networked multimedia applications which meet this requirement. The proposed software architecture is based on the Time-triggered Message-triggered Object (TMO) programming scheme and it is implemented as a thin layer on top of the TMO Support Middleware (TMOSM). The new layer, called the QoS Adaptation Support Layer (QASL), includes monitoring and runtime reconfiguration facilities that allow us to easily incorporate QoS-adaptation capabilities into TMO-based multimedia applications. In addition, we introduce a novel, practical approach for establishing the QoS configurations that guide the adaptive behavior of a networked multimedia application. A QoS configuration contains a set of parameters that specify the quality-related characteristics of the media streams which a receiver expects from a sender. We also present a strategy used in QASL for selecting, from a given set of QoS configurations, an optimal configuration by reflecting currently observed environmental conditions. Finally, the effectiveness of the QoS-adaptation mechanisms implemented in QASL is evaluated with the use of a heterogeneous network based multi-party videoconference application. © 2010 IEEE.

关键词： Middleware

来源：评论

学校读者我要写书评

暂无评论

Predicting Programming Behavior in OSS Communities: A Case Study of NLP-based Approach

Predicting Programming Behavior in OSS Communities: A Case S...

引用

Artificial Intelligence and Computer Engineering (ICAICE), International Conference on

作者： Manyan Huo Yue Yu Zhixing Li Junsheng Chang Key Lab. of Parallel and Distributed Computing Lab. College of Computer National University of Defence Technology ChangSha China

ISBN: (数字)9781728191461

ISBN: (纸本)9781728191478

Prediction of developers' programming behaviors is an effective way to improve their development efficiency and optimize the organization of project modules and files. However, little research exists investigating on this direction. In order to address this knowledge gap, we proposed a NLP-based approach to predict the programming behaviors in OSS (Open Source Software) communities. The proposed approach i) embeds the historical programming behavior data of a project into a multi-dimensional vector space to capture the potential laws in the data, ii) forms an eigenvector matrix reflecting the semantic relationship of the development behavior data, and iii) predicts the next programming behavior of a specific developer based on the eigenvector matrix. Our experiments on five OSS projects show that the prediction accuracy rate of the proposed prediction approach can reach up to about 50%, indicating that it can summarize the development behavior data law and effectively predict the programming behavior of developers. Our work can provide valuable assistance for developers' programming and projects' maintenance in practice.

关键词： Training Semantics Programming Predictive models Prediction algorithms Data models Context modeling

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：