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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

486 篇 会议
16 篇 期刊文献
9 册 图书

馆藏范围

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

日期分布

学科分类号

209 篇 工学
- 195 篇 计算机科学与技术...
- 97 篇 软件工程
- 42 篇 电气工程
- 12 篇 电子科学与技术（可...
- 8 篇 信息与通信工程
- 6 篇 控制科学与工程
- 6 篇 生物工程
- 4 篇 机械工程
- 3 篇 力学（可授工学、理...
- 3 篇 化学工程与技术
- 1 篇 材料科学与工程（可...
- 1 篇 冶金工程
- 1 篇 动力工程及工程热...
- 1 篇 土木工程
- 1 篇 水利工程
- 1 篇 生物医学工程（可授...
54 篇 理学
- 34 篇 数学
- 6 篇 生物学
- 4 篇 系统科学
- 3 篇 物理学
- 3 篇 化学
- 1 篇 大气科学
- 1 篇 统计学（可授理学、...
16 篇 管理学
- 9 篇 管理科学与工程(可...
- 7 篇 图书情报与档案管...
- 5 篇 工商管理
2 篇 经济学
- 2 篇 应用经济学
2 篇 法学
- 2 篇 社会学

主题

97 篇 programming
82 篇 parallel process...
79 篇 parallel archite...
71 篇 parallel program...
63 篇 concurrent compu...
59 篇 computer archite...
46 篇 hardware
43 篇 computational mo...
39 篇 programming prof...
39 篇 algorithm design...
36 篇 parallel algorit...
34 篇 computer science
26 篇 dynamic programm...
24 篇 runtime
24 篇 heuristic algori...
22 篇 program processo...
22 篇 partitioning alg...
21 篇 costs
21 篇 instruction sets
21 篇 clustering algor...

机构

6 篇 school of comput...
5 篇 school of comput...
4 篇 school of comput...
3 篇 department of co...
3 篇 department of co...
3 篇 college of infor...
3 篇 school of electr...
2 篇 department of co...
2 篇 univ minnesota d...
2 篇 school of scienc...
2 篇 soochow univ sch...
2 篇 college of optoe...
2 篇 school of comput...
2 篇 beijing research...
2 篇 department of co...
2 篇 school of comput...
2 篇 department of co...
2 篇 department of co...
2 篇 department of co...
2 篇 vision computing...

作者

9 篇 zhong cheng
6 篇 cheng zhong
6 篇 jigang wu
5 篇 hui li
4 篇 shikai guo
4 篇 yeh-cheng chen
4 篇 zhang jinxiong
4 篇 yidong li
4 篇 rong chen
4 篇 sivasankaran raj...
4 篇 hong shen
3 篇 chen danyang
3 篇 wei liu
3 篇 liu jun
3 篇 ruey-shun chen
3 篇 wang shunxu
3 篇 rajamanickam siv...
3 篇 naixue xiong
3 篇 guangzhong sun
3 篇 tonglai liu

语言

508 篇 英文
2 篇 其他
1 篇 中文

检索条件"任意字段=Seventh International Symposium on Parallel Architectures, Algorithms and Programming"

共 511 条记录，以下是381-390 订阅

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

详细简洁

排序：

An operation placement and scheduling scheme for cache and communication localities in fine-grain parallel architectures

An operation placement and scheduling scheme for cache and c...

引用

international symposium on parallel architectures, algorithms and Networks (ISPAN)

作者： Yen-Kuang Chen S.Y. Kung Department of Electrical Engineering Princeton University USA

With increasing on-chip hardware, concurrency is a way to bridge the gap between the computational power demanded by the applications and that afforded by the computer platforms. Although parallel systems are increasingly popular they remain very difficult to program. In fact, most compilers require the programmer to specify how to partition data or map program code to the system's processors. To ensure an effective program, cache locality is important because of the large speed gap between microprocessors and memory systems. It is also important to make use of local communication whenever possible, since it is cheaper faster and less power hungry than global communication. In order to exploit these locality properties, we present a systematic operation placement and scheduling scheme for fine-grain parallel architectures. The key advantages are twofolds: (1) This multiprojection method, which deals with multidimensional parallelism systematically, can alleviate the burden of the programmer in coding and data partitioning. (2) it addresses the memory/communication bandwidth bottleneck, and can lend to faster program execution. On a special design example of the motion estimation block-matching algorithm, which requires the most intensive computation and memory accesses in video coding, our method lends to a reduction of external memory accesses by two to three orders of magnitude.

关键词： Processor scheduling programming profession Hardware Concurrent computing Bridges Application software Program processors Microprocessors Global communication parallel architectures

来源：评论

学校读者我要写书评

暂无评论

Deep Just-In-Time Consistent Comment Update via Source Code Changes

Deep Just-In-Time Consistent Comment Update via Source Code ...

引用

international symposium on parallel architectures, algorithms and programming (PAAP)

作者： Shikai Guo Xihui Xu Hui Li Rong Chen The College of Information Science and Technology Dalian Maritime University Dalian China

ISBN: (纸本)9781665452199

During software development and maintenance, code comments are often missing, inadequate, or they do not match the actual code content. In response to this problem, the research community has proposed a method for updating natural language comments based on code changes. However, there are two major limitations of this method that must be addressed: the long-term and non-temporal dependencies in the source code. To address these limitations, we propose a new model called code semantic learning–comment update (CSL2CU). The code semantic learning component of CSL2CU uses a self-attention mechanism and a positional encoding mechanism. It also uses a relative positional representation to model pairwise relationships between source code tags, thereby improving its ability to capture long-term dependencies and non-temporal dependencies of source code tagging ability. The comment-update component of CSL2CU is used to generate new comments based on old comments and code editing. The experimental results show that the CSL2CU model outperforms the three baselines used in exact match, BLEU, METEOR, and SARI.

关键词： Codes Source coding Semantics Natural languages Tagging programming Maintenance engineering

来源：评论

学校读者我要写书评

暂无评论

GPU-ABiSort: optimal parallel sorting on stream architectures 06

GPU-ABiSort: optimal parallel sorting on stream architecture...

引用

international symposium on parallel and Distributed Processing (IPDPS)

作者： A. Greb G. Zachmann Institute of Computer Science II Rhein Friedr.-Wilh.-Universität Bonn Bonn Germany Institute of Computer Science Clausthal University of Technology Clausthal Germany

ISBN: (纸本)9781424400546

In this paper, we present a novel approach for parallel sorting on stream processing architectures. It is based on adaptive bitonic sorting. For sorting n values utilizing p stream processor units, this approach achieves the optimal time complexity O((n log n)/p). While this makes our approach competitive with common sequential sorting algorithms not only from a theoretical viewpoint, it is also very fast from a practical viewpoint. This is achieved by using efficient linear stream memory accesses (and by combining the optimal time approach with algorithms optimized for small input sequences). We present an implementation on modern programmable graphics hardware (GPUs). On GPUs, our optimal parallel sorting approach has shown to be remarkably faster than sequential sorting on the CPU, and it is also faster than previous non-optimal sorting approaches on the GPU for sufficiently large input sequences. Because of the excellent scalability of our algorithm with the number of stream processor units p (up to n/log/sup 2/ n or even n/log n units, depending on the stream architecture), our approach profits heavily from the trend of increasing number of fragment processor units on GPUs, so that we can expect further speed improvement with upcoming GPU generations.

关键词： Sorting Hardware Computer architecture Computer science Graphics Scalability parallel architectures parallel algorithms parallel programming programming profession

来源：评论

学校读者我要写书评

暂无评论

Optimal architecture-independent scheduling of fine-grain tree-sweep computations

Optimal architecture-independent scheduling of fine-grain tr...

引用

international symposium on parallel and Distributed Processing (IPDPS)

作者： Lixin Gao A.L. Rosenberg R.K. Sitaraman Department of Computer Science University of Massachusetts Amherst MA USA

We present algorithms for optimally scheduling computations that comprise a sequence of complete up- and/or down-sweeps on a complete binary tree, on a parallel architecture in which the communication delay between any two processors is uniform. Such computations include, for instance, those that implement broadcast, accumulation, and the parallel-prefix operator; such architectures include, for instance, networks of workstations. Our schedules are optimal in the sense of having the actual minimum time-to-completion-not just on approximation thereof-considering the time for both computation and communication. We concentrate on schedules for fine-grain tree-sweep computations-wherein communication costs are rather large relative to per-task computation cost.

关键词： Processor scheduling Concurrent computing Computational efficiency Scheduling algorithm Binary trees parallel architectures Delay Computer networks Broadcasting Computer architecture

来源：评论

学校读者我要写书评

暂无评论

Cover model: a framework for design and execution of distributed applications

Cover model: a framework for design and execution of distrib...

引用

international symposium on parallel architectures, algorithms and Networks (ISPAN)

作者： V.P. Ivannikov K.V. Dyshlevoi V.E. Kamensky A.V. Klimov S.G. Manzheley V.A. Omelchenko L.B. Solovskaya A.A. Vinokurov Institute for System Programming Russian Academy of Science Moscow Russia

Many problems of distributed object-oriented applications can be uniformly resolved in the frame of approach based on the concept of cover. The cover is defined as an environment that transparently controls all aspects of object's community, life: creation, interaction etc. To enable transparency, an object-oriented application must obey a principle of late binding, a reference to server object being obtained by the client at run time from a system environment. To implement cover services, the technique of metaobject control is applied, which provides extensions of program's semantics without changing the program code, by means of attaching additional method calls to each application object invocation. A special language (TL) in which the user can incrementally define new metaservices is described and illustrated by numerous examples.

关键词： Computer languages Runtime Control systems Dynamic programming Object oriented programming Object oriented modeling Joining processes Context Debugging Communication system control

来源：评论

学校读者我要写书评

暂无评论

Differential Privacy Protection and Game Analysis of Intelligent Transportation Data

Differential Privacy Protection and Game Analysis of Intelli...

引用

international symposium on parallel architectures, algorithms and programming (PAAP)

作者： Junming Zhang Jingru Wang Shigong Long Lun Wang Xuejiao Wang Renrui Zhang Guizhou Polytechnic of Construction Guiyang China College of Computer Science and Technology Guizhou University Guiyang China

ISBN: (纸本)9781665496407

With the informatization and intelligentization of the Internet of Vehicle (IoV), location-based services have brought great convenience to users, but it has also brought about the security problem of privacy exposure. Vehicle users hope that their private data will be protected and at the same time they will be able to obtain good road service quality. In response to the above problems, this paper proposes a location privacy protection method based on local differential privacy. Firstly, we use the Voronoi diagram to divide and number the road network space; then, we perform K-RR random perturbation on the user's location data to make the result meet the local differential privacy. Thirdly, we set up an incentive mechanism, build a game model, and define the user's payment matrix under the verification strategy and the server's cheating strategy is analyzed, and the user's expected revenue is analyzed. The experimental results show that the user's benefit first decreases and then increases with the increase of the privacy protection parameters. The benefit is linear, and the road condition service quality has a relatively large impact on the benefit of users' shared location.

关键词： Differential privacy Privacy Roads Perturbation methods Games programming Smart transportation

来源：评论

学校读者我要写书评

暂无评论

High performance computing using ProActive environment and the asynchronous iteration model

High performance computing using ProActive environment and t...

引用

international symposium on parallel and Distributed Processing (IPDPS)

作者： Raphael Couturier David Laiymani Sebastien Miquee Laboratoire d'Informatique de Franche-Comté (LIFC) University of Franche-Comté Belfort France

This paper presents a new library for the ProActive environment, called AIL-PA (asynchronous iterative library for ProActive). This new library allows to execute programs for solving large scale problems on various architectures. Two models of algorithm can be used: the synchronous iteration model which is efficient on single clusters; the asynchronous iteration model which is more efficient on distributed clusters. Both approaches are tested on both architectures, using Kernel CG of the NAS parallel Benchmarks on the Grid'5000 platform. These tests also allow us to compare ProActive with AIL-PA and with the Jace programming environment. The results show that the asynchronous iteration model with AIL-PA is more efficient on distributed clusters than the synchronous iteration model. Moreover, these experiments also show that AIL-PA does not involve additional overhead to ProActive.

关键词： High performance computing Libraries Large-scale systems Computer architecture Clustering algorithms Iterative algorithms Kernel Character generation Benchmark testing programming environments

来源：评论

学校读者我要写书评

暂无评论

Process Groups: a mechanism for the coordination of and communication among processes in the Venus collective communication library

Process Groups: a mechanism for the coordination of and comm...

引用

international symposium on parallel Processing

作者： V. Bala S. Kipnis Computer Sciences Department IBM Thomas J. Watson Research Center Yorktown Heights NY USA

In programming massively parallel computers, it is often necessary to have sets of processes cooperate in performing certain computations and communications. Most run-time libraries require that such sets of processes be explicitly specified in the program. In the Venus run-time communication library however, a Process Group abstraction is used to enable implicit coordination of and communication over dynamically determined sets of processes. The Process Groups mechanism in Venus offers an object-oriented approach for handling sets of processes and enhances the debugging and monitoring of programs. The authors describe the Process Groups mechanism in Venus, illustrate its use on the class of N-body problems, and outline some of the data structures and algorithms used to implement this mechanism in Venus.< >

关键词： Venus Concurrent computing Runtime library parallel programming Distributed computing Monitoring Application software Debugging Data structures Buildings

来源：评论

学校读者我要写书评

暂无评论

Do Not Have Enough Data? An Easy Data Augmentation for Code Summarization

Do Not Have Enough Data? An Easy Data Augmentation for Code ...

引用

international symposium on parallel architectures, algorithms and programming (PAAP)

作者： Zixuan Song Xiuwei Shang Mengxuan Li Rong Chen Hui Li Shikai Guo Dalian Maritime University The College of Information Science and Technology Dalian China

ISBN: (纸本)9781665452199

Code comments improve the readability and intelligibility of codes, which can help developers understand programs and improve the efficiency of the software maintenance and evolution process. Unfortunately, code comments are often mismatched, missing, or outdated in software projects, which negatively affects the efficiency of developers to infer the functionality from source code and affect the efficiency of software maintenance and evolution. To solve this problem, many source code summarization algorithms have been proposed. However, these methods usually try to collect a large data set which contains the mapping between code comments and source code to train models. Hence, the effectiveness of the models often rely on the quality of the training data. There are two limitations for the training sets: the insufficient data collection limitation (i.e., generate a large amount of noises-free training data) and data distribution bias limitation (i.e., generate training data for infrequently used methods). To address this issues, we have proposed a data augmentation method for code comments, named CDA-CS. Extensive experiments on Java and Python projects collected from GitHub are conducted to evaluate the performance of CDA-CS. Training models on the augmented dataset, the state-of-the-art algorithms can easily get a further 1.37% to 2.24% improvement in terms of different evaluation metrics (i.e., BLEU-4, METEOR, ROUGH_L) with no additional cost.

关键词： Training Software maintenance Codes Source coding Software algorithms Training data programming

来源：评论

学校读者我要写书评

暂无评论

An MPI library which uses polling, interrupts and remote copying for the Fujitsu AP1000+

An MPI library which uses polling, interrupts and remote cop...

引用

international symposium on parallel architectures, algorithms and Networks (ISPAN)

作者： D. Sitsky E. Hayashi Department of Computer Science CAP Research Program Australian National University Canberra ACT Australia High Performance Computing Group Fujitsu Laboratories Limited Kawasaki Japan

A complete implementation of MPI for the Fujitsu AP1000+ is presented. The library can employ a number of different mechanisms in implementing the send and receive message passing operations. The method of detecting the arrival of new messages can be realized through interrupt-driven and polling techniques. Transferring message data is achieved by either sending the message data directly to the receiver "in-place", or using a rendezvous method which allows the use of a fast noncopying nonblocking remote-fetching operation. The MPI library exhibits good performance compared to the native message passing library, and allows the user to decide at runtime which mechanisms will be used in order to achieve the best performance on a per-application basis.

关键词： Message passing Broadcasting Routing Computer science Runtime library parallel programming Standards organizations Workstations National electric code High performance computing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共52页 << < 35 36 37 38 39 40 41 42 43 44 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：