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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

211 篇 工学
- 197 篇 计算机科学与技术...
- 98 篇 软件工程
- 42 篇 电气工程
- 12 篇 电子科学与技术（可...
- 8 篇 信息与通信工程
- 6 篇 控制科学与工程
- 6 篇 生物工程
- 4 篇 机械工程
- 3 篇 力学（可授工学、理...
- 3 篇 化学工程与技术
- 1 篇 材料科学与工程（可...
- 1 篇 冶金工程
- 1 篇 动力工程及工程热...
- 1 篇 土木工程
- 1 篇 水利工程
- 1 篇 生物医学工程（可授...
55 篇 理学
- 35 篇 数学
- 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

语言

510 篇 英文
2 篇 其他
2 篇 中文

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

共 513 条记录，以下是91-100 订阅

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

详细简洁

排序：

Proceedings of the 11th Workshop on parallel programming and Run-Time Management Techniques for Many-Core architectures / 9th Workshop on Design Tools and architectures for Multicore Embedded Computing Platforms, PARMA-DITAM 2020

Proceedings of the 11th Workshop on Parallel Programming and...

引用

8th international symposium on Highly-Efficient Accelerators and Reconfigurable Technologies, HEART 2017

ISBN: (纸本)9781450375450

The proceedings contain 5 papers. The topics discussed include: sparse matrix-dense matrix multiplication on heterogeneous CPU+FPGA embedded system;run-time power modeling in embedded GPUs with dynamic voltage and frequency scaling;fault-tolerant online scheduling algorithms for CubeSats;an OpenMP parallel genetic algorithm for design space exploration of heterogeneous multi-processor embedded systems;and automated precision tuning in activity classification systems: a case study.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Automatic generation and assessment of student assignments for parallel programming learning 10th

Automatic generation and assessment of student assignments f...

引用

10th international symposium on parallel architectures, algorithms and programming, PAAP 2019

作者： Luo, Zhenxiao Wang, Zelong Wu, Di Hei, Xiaojun Du, Yunfei School of Data and Computer Science Sun Yat-sen University Guangzhou China Guangdong Key Laboratory of Big Data Analysis and Processing Guangzhou510006 China School of Electronic Information and Communications Huazhong University of Science and Technology Wuhan China National Supercomputer Center in Guangzhou Guangzhou China

The course of parallel programming is becoming more and more important for the education of students majoring in computer science. However, it is not easy to learn parallel programming well due to its high theory and practice requirements. In this paper, we design and implement an automatic assignment generation and assessment system to help students learn parallel programming. The assignments can be generated according to user behaviors and thus able to guide students to learn parallel programming step by step. Besides, it can automatically generate an overall assessment of student assignments by using fuzzy string matching, which provides an approximate reference score of objective questions. Subjective questions can be assessed directly by comparing the answer to the reference answer. This system also provides a friendly user interface for students to complete online assignments and let teachers manage their question database. In our teaching practice, students can learn parallel programming more effectively with the help of such an assignment generation and assessment system. © Springer Nature Singapore Pte Ltd. 2020.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

Proceedings - international symposium on parallel architectures, algorithms and programming, PAAP

Proceedings - International Symposium on Parallel Architectu...

引用

9th international Conference on parallel architectures, algorithms and programming, PAAP 2018

ISBN: (纸本)9781538694039

The proceedings contain 39 papers. The topics discussed include: face inpainting with dilated skip architecture and multi-scale adversarial networks;plaintext checkable encryption with check delegation: new models and simple constructions;state space model predictive control based on nuclear norm system identification;time series forecasting using sequence-to-sequence deep learning framework;gesture recognition based on tri-axis accelerometer using 1D Gabor filters;the application of clustering mining technology in e-commerce website;enhancing data availability through automatic replication in the hadoop cloud system;and mapping exceptions to high-level source code on a heterogeneous architecture.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Gpu-accelerated parallel aligning long reads with high error rate using enhanced sparse suffix array 10th

Gpu-accelerated parallel aligning long reads with high error...

引用

10th international symposium on parallel architectures, algorithms and programming, PAAP 2019

作者： Wei, Hao Zhong, Cheng Chen, Danyang Yin, Mengxiao Zhang, Jinxiong School of Computer Electronics and Information Guangxi University Nanning Guangxi530004 China

The read alignment (sequence alignment) is one of the most basic and time-consuming problems in Bioinformatics. In this paper, a CPU-GPU parallel long-read alignment method is studied to solve this problem. A lightweight data structure using enhanced sparse suffix array is used to store the index of reference genome in order to adapt to the limited memory capacity of GPU architecture. The two-dimensional search space between the reference genome and long reads is divided into several search sub-spaces. The massive long reads alignment is further divided into the multiple long-read alignments with smaller size. A CPU-GPU parallel algorithm aligning long reads with high error rate is implemented by improving the seeds selection scheme. The experimental results show that the parallel algorithm can accelerate remarkably the long-read alignment while maintaining the alignment accuracy and recall rate as a whole. © Springer Nature Singapore Pte Ltd. 2020.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

An improved heuristic-dynamic programming algorithm for rectangular cutting problem 10th

An improved heuristic-dynamic programming algorithm for rect...

引用

10th international symposium on parallel architectures, algorithms and programming, PAAP 2019

作者： Yin, Aihua Chen, Chong Hu, Dongping Huang, Jianghai Yang, Fan School of Software and Internet of Things Engineering Jiangxi University of Finance and Economics Jiangxi Nanchang China

In this paper, we discussed a two-dimensional cutting problem with defects. In this problem, we are given a rectangular area which contains defects. The objective is to cut some rectangles with a given shape and direction from this rectangular area, which cannot overlap the defects, maximizing some profit associated with the rectangles generating by this cutting. We present an improved Heuristic-Dynamic Program (IHDP) to solve this problem and prove the important theorem about its complexity. The algorithm reduces the size of the discretization sets, establishes one-dimensional knapsack problem with the width and height of the small rectangular blocks, constructs two discretization sets using the obtained solution and the right and upper boundaries of the defects, and performs trial cut lines for each element of the discretization set. The algorithm calculates 14 internationally recognized examples. The experimental results show that it obtains the optimal solution of these examples, and its computing time is nearly ten times higher than that of the latest literature algorithm. © Springer Nature Singapore Pte Ltd. 2020.

关键词： Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

A pipelining strategy for accelerating convolutional networks on arm processors 10th

A pipelining strategy for accelerating convolutional network...

引用

10th international symposium on parallel architectures, algorithms and programming, PAAP 2019

作者： Zhou, Xin Li, Rongchun Zhang, Peng Liu, Yuntao Dou, Yong National Key Laboratory for Parallel and Distribution Processing National University of Defense Technology Changsha450001 China

Convolutional neural networks (CNN) is playing an important role in many fields. Many applications are able to run the inference process of CNN with pre-trained models on mobile devices in these days. Improving performance of embedded processors such as ARM-based CPUs makes it possible to meet the requirement of real-time processing. In this paper, a pipelining strategy is proposed to accelerate convolution networks on ARM processors. We implement a 3 × 3 convolution with Neon instructions which are single instruction and multiple data (SIMD) instructions supported by ARM processors. In order to reduce stalls in the pipeline, issue orders of instructions are rearranged according to the out-of-order execution and dual-issue mechanism on ARM processors. A tiling method is exploited to increase data reuse. The input feature map is divided into multiple 6 × 6 tiles, and the computations within the tile is highly optimized using our proposed pipelining strategy. The speedup of proposed method is 2.88 compared with gcc compiled codes on RK3288. The effect of our optimizing method is measured by a performance profiling tool, cycles and cache misses are decreased significantly. The multi-thread version implemented with openMP achieve speedup of 6.8 compared with single-thread gcc complied version. © Springer Nature Singapore Pte Ltd. 2020.

关键词： Pipelines

来源：评论

学校读者我要写书评

暂无评论

Efficient parallel Simulations of Wireless Signal Wave Propagation

Efficient Parallel Simulations of Wireless Signal Wave Propa...

引用

international symposium on Symbolic and Numeric algorithms for Scientific Computing (SYNASC)

作者： Dorin-Marian Ionita Filip-George Manole Emil-Ioan Slusanschi University Politehnica of Bucharest Bucharest Romania

ISBN: (数字)9781728176284

ISBN: (纸本)9781728176291

A common pattern in high performance scientific computing is the structured grid pattern in which one or more elements of a matrix are computed as a stencil operation of other matrix neighbouring elements. Since there are multiple options to efficiently implement this pattern on modern computing architectures, we provide a comparison of the performance of a number of parallel implementations on a multi-core system with GPU capabilities and also on a FPGA embedded inside a SoC. The application used for this case study implements the propagation of wireless signals in a bi-dimensional environment, considering reflections and signal attenuation. The parallel programming paradigms examined in this paper include CUDA, TBB, Rust, OpenMP, and HLS as hardware description paradigm, with CUDA proving to be the fastest implementation.

关键词： Wireless communication Scientific computing parallel programming Graphics processing units Numerical simulation Reflection Numerical models

来源：评论

学校读者我要写书评

暂无评论

Resultant gradient flow method for multiple objective programming based on efficient computing 10th

Resultant gradient flow method for multiple objective progra...

引用

10th international symposium on parallel architectures, algorithms and programming, PAAP 2019

作者： Feng, Bao He, Peixin Li, Yunyao Wu, Junfeng Li, Peng Yao, Haichang Ji, Yimu Min, Chao Zhang, Jiekui Li, Youtao Wang, Peizhuang Shi, Yong He, Jing Zheng, Hui Wang, Yang Nanjing University of Finance and Economics Nanjing China Nanjing University of Posts and Telecommunications Nanjing China Southwestern Petroleum University Chengdu China Jingqi Smart Healthcare Pty Ltd Hefei China Research Centre on Fictitious Economy and Data Science Beijing China Swinburne University of Technology Melbourne Australia

The process of blending gas transmission contains multiple kinds of influence factors that are related with the achievement of maximal overall profit for a refinery gas company. It is, therefore, a multiple objective optimization problems. To maximize overall profit, we proposes a multiple objective resultant gradient descent method (RGDM) to solve fractional, nonlinear, and multiple objective programming problems. Resultant gradient descent requires a proper direction of multiple objective functions. The proper direction in this paper is computed by gradient flow to approach to the global maximum values. Gradient flow is one of the forms of geometric flow, which is widely used in linear programming, least-squares approximation, optimization, and differential equation. It is the first time to be used in mathematical programming. Resultant gradient flow is calculated in linear programming, and the extremum can directly affect the extremum of the our multiple objective functions. Such steps can indirectly simplify the non-linear objective function by separate the single objective functions so that we can use the gradient flow method to solve the multi-objective problem of non-linear programming. It also embodies the stability and efficiency of the proposed gradient flow. With the case study of a refinery gas company, this paper build a overall profit model. Also, we apply the proposed resultant method to solve this multi-objective problem by a planned strategy of how to supply natural gas to the residential area and schedule the initial coordination. Moreover, its solutions are displayed and compared with a genetic algorithm-based solver in our experimental study. © Springer Nature Singapore Pte Ltd. 2020.

关键词： Least squares approximations

来源：评论

学校读者我要写书评

暂无评论

Workshop 17: PAISE parallel AI and Systems for the Edge

Workshop 17: PAISE Parallel AI and Systems for the Edge

引用

IEEE international symposium on parallel and Distributed Processing Workshops and Phd Forum (IPDPSW)

作者： Pete Beckman Rajesh Sankaran Mathematics and Computer Science Division Argonne National Laboratory USA

ISBN: (数字)9781728174457

ISBN: (纸本)9781728174570

Applications involving voluminous data but needing low-latency computation and local feedback require that the computing be performed as close to the data source as possible — often at the interface to the physical world. Communication constraints and the need for privacy-preserving approaches also dictate the need for computing at the edge. Given the growth in such application scenarios and the recent advances in algorithms and techniques, machine learning and inference at the edge are unfolding and growing at a rapid pace. In support of these applications, a wide range of hardware (CPUs, GPUs, ASICs) is venturing farther away from the center, closer to the physical world. The resulting diversity in edgecomputing hardware in terms of capabilities, architectures, and programming models poses several new challenges.

关键词： Conferences Hardware Distributed databases Computer security Mathematics Computer science Distributed processing

来源：评论

学校读者我要写书评

暂无评论

Automatic Generation of Warp-Level Primitives and Atomic Instructions for Fast and Portable parallel Reduction on GPUs 2019

Automatic Generation of Warp-Level Primitives and Atomic Ins...

引用

17th IEEE/ACM international symposium on Code Generation and Optimization (CGO)

作者： De Gonzalo, Simon Garcia Huang, Sitao Gomez-Luna, Juan Hammond, Simon Mutlu, Onur Hwu, Wen-mei UIUC CS & Coordinated Sci Lab Champaign IL 61820 USA UIUC ECE & Coordinated Sci Lab Champaign IL USA Swiss Fed Inst Technol Comp Sci Zurich Switzerland Sandia Natl Labs Scalable Comp Architecture Livermore CA 94550 USA

ISBN: (纸本)9781728114361

Since the advent of GPU computing, GPU hardware has evolved at a fast pace. Since application performance heavily depends on the latest hardware improvements, performance portability is extremely challenging for GPU application library developers. Portability becomes even more difficult when new low-level instructions are added to the ISA (e.g., warp shuffle instructions) or the microarchitectural support for existing instructions is improved (e.g., atomic instructions). Library developers, besides re-tuning the code for new hardware features, deal with the performance portability issue by hand-writing multiple algorithm versions that leverage different instruction sets and microarchitectures. High-level programming frameworks and Domain Specific Languages (DSLs) do not typically support low-level instructions (e.g., warp shuffle and atomic instructions), so it is painful or even impossible for these programming systems to take advantage of the latest architectural improvements. In this work, we design a new set of high-level APIs and qualifiers, as well as specialized Abstract Syntax Tree (AST) transformations for high-level programming languages and DSLs. Our transformations enable warp shuffle instructions and atomic instructions (on global and shared memories) to be easily generated. We show a practical implementation of these transformations by building on Tangram, a high-level kernel synthesis framework. Using our new language and compiler extensions, we implement parallel reduction, a fundamental building block used in a wide range of algorithms. parallel reduction is representative of the performance portability challenge, as its performance heavily depends on the latest hardware improvements. We compare our synthesized parallel reduction to another high-level programming framework and a hand-written high-performance library across three generations of GPU architectures, and show up to 7.8x speedup (2x on average) over hand-written code.

关键词： Graphics processing units programming Computer architecture Libraries Hardware DSL Microarchitecture

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共52页 << < 6 7 8 9 10 11 12 13 14 15 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：