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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

2,684 篇 会议
56 册 图书
54 篇 期刊文献

馆藏范围

2,794 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,840 篇 工学
- 1,627 篇 计算机科学与技术...
- 845 篇 软件工程
- 338 篇 电气工程
- 220 篇 电子科学与技术（可...
- 208 篇 信息与通信工程
- 84 篇 控制科学与工程
- 62 篇 光学工程
- 57 篇 机械工程
- 41 篇 仪器科学与技术
- 38 篇 生物医学工程（可授...
- 38 篇 生物工程
- 31 篇 材料科学与工程（可...
- 25 篇 动力工程及工程热...
- 21 篇 化学工程与技术
- 20 篇 建筑学
- 15 篇 土木工程
- 13 篇 力学（可授工学、理...
- 12 篇 交通运输工程
499 篇 理学
- 342 篇 数学
- 113 篇 物理学
- 51 篇 系统科学
- 48 篇 生物学
- 30 篇 统计学（可授理学、...
- 26 篇 化学
173 篇 管理学
- 119 篇 管理科学与工程(可...
- 62 篇 图书情报与档案管...
- 49 篇 工商管理
40 篇 医学
- 30 篇 临床医学
- 14 篇 基础医学(可授医学...
15 篇 法学
- 15 篇 社会学
9 篇 经济学
9 篇 农学
8 篇 文学
2 篇 军事学
1 篇 教育学

主题

360 篇 parallel process...
219 篇 computer archite...
205 篇 graphics process...
146 篇 parallel archite...
135 篇 graphics process...
129 篇 hardware
115 篇 parallel algorit...
112 篇 image processing
98 篇 computational mo...
94 篇 concurrent compu...
87 篇 instruction sets
86 篇 field programmab...
83 篇 algorithm design...
79 篇 multicore proces...
77 篇 signal processin...
76 篇 parallel process...
66 篇 parallel program...
60 篇 gpu
59 篇 throughput
59 篇 kernel

机构

11 篇 natl univ def te...
6 篇 college of compu...
6 篇 school of comput...
6 篇 hosei univ dept ...
6 篇 natl univ def te...
5 篇 univ aizu dept c...
5 篇 carleton univ sc...
5 篇 school of comput...
5 篇 computer science...
5 篇 city university ...
4 篇 chinese acad sci...
4 篇 univ michigan ad...
4 篇 institute of com...
4 篇 univ chinese aca...
4 篇 school of comput...
4 篇 univ jaume 1 dep...
4 篇 hainan internati...
4 篇 tech univ cluj n...
4 篇 department of co...
4 篇 beihang universi...

作者

11 篇 jack dongarra
10 篇 roman wyrzykowsk...
9 篇 konrad karczewsk...
9 篇 quintana-orti en...
7 篇 dongarra jack
7 篇 kothapalli kisho...
6 篇 hannig frank
6 篇 liu jie
6 篇 su jinshu
6 篇 nakano koji
6 篇 peng shietung
6 篇 li yamin
6 篇 chu wanming
6 篇 wyrzykowski roma...
6 篇 thulasiraman par...
5 篇 ito yasuaki
5 篇 jerzy waśniewski
5 篇 wang guojun
5 篇 geyong min
5 篇 wanlei zhou

语言

2,758 篇 英文
14 篇 中文
11 篇 俄文
11 篇 其他
2 篇 乌克兰文
1 篇 西班牙文

检索条件"任意字段=10th International Conference on Algorithms and Architectures for Parallel Processing"

共 2794 条记录，以下是281-290 订阅

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

详细简洁

排序：

A GPU-based jde algorithm applied to continuous unconstrained optimization 18th

A GPU-based jde algorithm applied to continuous unconstraine...

引用

Joint conferences on 18th international conference on Intelligent Systems Design and Applications, ISDA 2018 and 10th World Congress on Nature and Biologically Inspired Computing , NaBIC 2018

作者： Boiani, Mateus Dominico, Gabriel Stubs Parpinelli, Rafael Santa Catarina State University JoinvilleSC Brazil

ISBN: (纸本)9783030166564

Population-based search algorithms, such as the Differential Evolution approach, evolve a pool of candidate solutions during the optimization process and are suitable for massively parallel architectures promoted by the use of GPUs. Hence, this paper proposes a GPU-based self-adaptive Differential Evolution employing the jDE mechanism to control its parameters, named cujDE. Two CUDA structures are employed to model the kernel functions in cujDE. the proposed algorithm is compared with another GPU-based self-adaptive DE (cuSaDE) in four continuous unconstrained benchmark functions. Also, the speedup between the CPU-based and the GPU-based jDE is measured. Results obtained suggest that the proposed approach is well suited to and competitive for continuous optimization. © Springer Nature Switzerland AG 2020.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

GPU parallelization and Optimization of a Combustion Simulation Application

GPU Parallelization and Optimization of a Combustion Simulat...

引用

IEEE international conference on High Performance Computing and Communications (HPCC)

作者： Zhixiang Liao Yongzhou Liu Yonggang Che State Key Laboratory of High Performance Computing Institute for Quantum Information College of Computer National University of Defense Technology Changsha China

Graphics processing units (GPUs) are widely used in the area of scientific computing. While GPUs provide much higher peak performance, efficient implementation of real applications on the GPU architectures is still a non-trivial task. It is crucial to realize efficient solution algorithms that can better utilize GPU architectures. this paper presents our efforts in parallelizing and optimizing LESAP, a CFD application for scramjet combustion simulation, on NVIDIA GPUs. the GPU parallelization is realized based on the CUDA programming model, with a data-parallel implicit time-marching method that is efficient on the GPU architecture. Furthermore, shared memory and redundant calculation are proposed to reduce memory access overhead during GPU computation, and data transfer between CPU and GPU is optimized by packing the data to be transferred. the experimental results show that the GPU version, when runs on four V100 GPUs, achieves a speedup of 11.26 times compared to the CPU version that runs on two 24-core Intel Skylake Gold 6240R CPUs. Excellent parallel scalability across multiple GPUs is also observed.

关键词： Gold Smart cities Computational modeling Graphics processing units Computer architecture Combustion Central processing Unit

来源：评论

学校读者我要写书评

暂无评论

Exploring Memory Access Techniques for Efficient FPGA based 3D CNN Accelerator Design

Exploring Memory Access Techniques for Efficient FPGA based ...

引用

IEEE international conference on Artificial Intelligence Circuits and Systems (AICAS)

作者： Fatima Hameed Khan Muhammad Adeel Pasha Shahid Masud Department of Electrical Engineering Lahore University of Management Sciences (LUMS) Lahore Pakistan

ISBN: (数字)9798350383638

ISBN: (纸本)9798350383645

Recent advancements in 3D Convolutional Neural Network (CNN) architectures have demonstrated superior performance across diverse computer vision tasks, albeit with a trade-off of intense computational and memory demands. thus, the tiling of incoming data becomes mandatory for 3D CNN acceleration in memory-constrained platforms such as Field Programmable Gate Arrays (FPGA). In this paper, different memory access techniques are explored to reduce the data traffic between on-chip and off-chip memories during the inference stage of a 3D CNN. the most suitable data traffic mode is identified by considering multiple parameters like latency, on-chip memory utilization and off-chip memory access. A parameterized and modular design approach for 3D CNNs has been implemented on an FPGA, where the input and weight data mapping modules are designed to minimize the on-chip memory requirements. these modules are parameterized for variable tiling sizes and different memory access modes while the main computation is performed on a systolic-array-based pipelined architecture. the experiments conducted on three widely adopted 3D networks, I3D, C3D, and R(2+1)D, have shown 16%, 28%, and 10% improvement in latency respectively. the proposed methodology also results in a lower energy dissipation profile.

关键词： three-dimensional displays Memory management Random access memory parallel processing Logic gates Hardware System-on-chip

来源：评论

学校读者我要写书评

暂无评论

Recommending Database architectures for Social Queries: A Twitter Case Study 17th

Recommending Database Architectures for Social Queries: A Tw...

引用

17th IFIP WG 12.5 international conference on Artificial Intelligence Applications and Innovations (AIAI) / 6th 5G-PINE Workshop / AI-BIO Workshop / DAAI Workshop / DARE Workshop / EEAI Workshop / 10th MHDW Workshop

作者： Marountas, Michael Drakopoulos, Georgios Mylonas, Phivos Sioutas, Spyros Univ Patras CEID Patras 26504 Hellas Greece Ionian Univ Dept Informat Kerkyra 49100 Hellas Greece

ISBN: (纸本)9783030791520;9783030791506;9783030791490

Database deployment is a complex task depending on a multitude of operational parameters such as anticipated data scaling trends, expected type and volume of queries, uptime requirements, replication policies, available budget, and personnel training and experience. thus, enterprise database administrators eventually rely on various performance metrics in conjunction to existing company policies in order to determine the best possible solution under these constraints. the recent advent of NoSQL databases, including graph databases such as Neo4j and document stores like MongoDB, added another degree of freedom in database selection since for a number of years relational databases such as PostgreSQL were the only available technology. In this work the scaling characteristics of a representative set of social queries executed on virtual machine installations of PostgreSQL and MongoDB are evaluated on a large volume of political tweets regarding Brexit. Moreover, Wiener filters for predicting the execution time of social query windows of fixed length over both databases are designed.

关键词： Database administration Database evaluation Signal processing for databases Information engineering Social network analysis

来源：评论

学校读者我要写书评

暂无评论

Formation Control of Multiple Aerial Robots Using LSTM-based Model Predictive Control

Formation Control of Multiple Aerial Robots Using LSTM-based...

引用

RSI/ISM international conference on Robotics and Mechatronics (ICROM)

作者： Mohammad Amin Najafqolian Khalil Alipour Roujin Mousavifard Bahram Tarvirdizadeh Department of Mechatronics Engineering Advanced Service Robots (ASR) Laboratory Faculty of New Sciences and Technologies University of Tehran Tehran Iran

ISBN: (纸本)9781665454537

this paper proposes a Long Short-Term Memory- (LSTM-) based Model Predictive Control (MPC) design for the formation of multi-agent Unmanned Aerial Vehicles (UAVs). the quadrotor model is considered nonlinear and there are not any simplifying assumptions therefore, the results are more reliable and the proposed method is applicable. A cascade controller with a position controller as the main loop and an attitude controller as the inner loop is presented to address the formation control problem. An LSTM network is used as the estimator to predict the future states of each quadrotor, and the Differential Evolution (DE) finds the optimal value of inputs to satisfy constraints and decrease tracking errors. In addition to the online learning ability, the proposed controller could overcome environmental or structural disturbances, uncertainties, and noises. Furthermore, close-loop stability analysis is studied. In the end, simulation examples are given to prove the acceptability of the presented control structure.

关键词： Uncertainty Simulation parallel processing Autonomous aerial vehicles Stability analysis Formation control Reliability

来源：评论

学校读者我要写书评

暂无评论

parallel Software Testing Sequence Generation Method Target at Full Covering Tested Behaviors 19th

Parallel Software Testing Sequence Generation Method Target ...

引用

19th international conference on algorithms and architectures for parallel processing (ICA3PP)

作者： Sun, Tao Wan, Xiaoyun Zhong, Wenjie Guo, Xin Zhang, Ting Inner Mongolia Univ Coll Comp Sci Hohhot 100021 Inner Mongolia Peoples R China

ISBN: (纸本)9783030389611;9783030389604

parallel software system testing is very difficult because the number of states expands sharply caused by parallel behaviors. In this paper, a testing sequence generation method is proposed, target at full covering tested behaviors and related behaviors over all execution paths. Because of state spaces of parallel software systems are often large, this paper focuses on the state space subgraph, contained all firing of tested and related behaviors, of system model. Firstly, the software system is modeled with Colored Petri Net (CPN), called system model (SM), and every tested behavior or related behavior is modeled also with CPN, called Behavior Model Unit (BMU). then, the method proposes mapping operation, intersection operation, and so on to finally realize the generation of test sequence. Practices show that this method is efficient, which could achieve full coverage.

关键词： parallel software Testing sequence generation Full covering Tested behaviors Colored Petri Net (CPN)

来源：评论

学校读者我要写书评

暂无评论

An Upper Bound for Sorting Rn with LRE 10th

An Upper Bound for Sorting Rn with LRE

引用

10th international Advanced Computing conference, IACC 2020

作者： Kuppili, Sai Satwik Chitturi, Bhadrachalam Ravella, Venkata Vyshnavi Datta, C. K. Phani Department of Computer Science and Engineering Amrita Vishwa Vidyapeetham Amritapuri India Department of Computer Science University of Texas at Dallas Richardson TX United States

ISBN: (纸本)9789811604034

A permutation π over alphabet Σ= 1, 2, 3, …, n, is a sequence where every element x in Σ occurs exactly once. Sn is the symmetric group consisting of all permutations of length n defined over Σ. In = (1, 2, 3, …, n) and Rn= (n, n- 1, n- 2, …, 2, 1 ) are identity (i.e. sorted) and reverse permutations respectively. An operation, that we call as an LRE operation, has been defined in OEIS with identity A186752. this operation is constituted by three generators: left-rotation, right-rotation and transposition (1,2). We call transposition (1,2) that swaps the two leftmost elements as Exchange. the minimum number of moves required to transform Rn into In with LRE operation are known for n≤ 11 as listed in OEIS with sequence number A186752. For this problem no upper bound is known. OEIS sequence A186783 gives the conjectured diameter of the symmetric group Sn when generated by LRE operations [1]. the contributions of this article are: (a) the first non-trivial upper bound for the number of moves required to sort Rn with LRE;(b) a tighter upper bound for the number of moves required to sort Rn with LRE;and (c) the minimum number of moves required to sort R10 and R11 have been computed. Here we are computing an upper bound of the diameter of Cayley graph generated by LRE operation. Cayley graphs are employed in computer interconnection networks to model efficient parallel architectures. the diameter of the network corresponds to the maximum delay in the network. © 2021, Springer Nature Singapore Pte Ltd.

关键词： parallel architectures

来源：评论

学校读者我要写书评

暂无评论

Verification of Envelope Tracking Concepts for High Frequency TCM/ZVS in Two-Level AC/DC Converter Applications

Verification of Envelope Tracking Concepts for High Frequenc...

引用

international conference on Power Electronics and Motion Control (IPEMC)

作者： thomas Langbauer Martin Scheffauer Franz Vollmaier David Menzi Roberto Petrella Architectures & Topologies Division Power Electronics Silicon Austria Labs GmbH Graz Austria Power Electronic Systems Laboratory ETH Zurich Zurich Switzerland Packaging & Multiphysics Division Power Electronics Silicon Austria Labs GmbH Villach Austria Dipartimento Politecnico di Ingegneria e Architettura (DPIA) Università degli Studi di Udine Udine Italy

ISBN: (数字)9798350351330

ISBN: (纸本)9798350351347

Triangular current mode (TCM) enables the benefit of zero voltage switching, but it is accompanied by two significant functional limitations. Initially, it often requires expensive FPGA, ASIC, and/or specialized hardware-based sensing. Secondly, the time delays linked with such sensing and processing can lead to a trade-off between the achievable switching frequency and the precision of the triangular inductor current waveform. this paper delivers the experimental verification of an alternative method where the inductor current envelopes are measured using straightforward analog quasi-peak detectors. the sampling rate needed for these envelopes is in first approximation independent of the applied switching frequency. the control behavior is mainly unaffected by time and signal delays due to the low frequency envelope signals being used, allowing for an affordable standard DSP to implement the proposed method. Importantly, the same control loop can also facilitate continuous conduction mode (CCM) operation, whereby a normal CCM operation at constant switching frequency and a mode with variable switching frequency and constant ripple current can be featured. Using a standard two-level grid-tied inverter configuration as a case study, this paper shows a measurement based verification of the concept of the envelope tracking-based TCM (E-TCM) and CCM (E-CCM) method. A prototype is presented to demonstrate the behavior of an envelope tracking hardware solution, including a measurement-based evaluation of the proposed circuits in operation with a 0.5 kVA, two-level SiC-based converter. this converter, together with its envelope tracking circuit, is capable of operating in TCM at frequencies up to several hundred kHz and can dynamically transition to CCM during operation.

关键词： Control design Tracking Switching frequency Current measurement Zero voltage switching Frequency conversion Sensors

来源：评论

学校读者我要写书评

暂无评论

FANG: Fast and Efficient Successor-State Generation for Heuristic Optimization on GPUs 19th

FANG: Fast and Efficient Successor-State Generation for Heur...

引用

19th international conference on algorithms and architectures for parallel processing (ICA3PP)

作者： Koester, Marcel Gross, Julian Krueger, Antonio Saarland Informat Campus Campus D3-2 D-66123 Saarbrucken Germany

ISBN: (纸本)9783030389918;9783030389901

Many optimization problems (especially nonsmooth ones) are typically solved by genetic, evolutionary, or metaheuristic-based algorithms. However, these genetic approaches and other related papers typically assume the existence of a neighborhood or successor-state function N(x), where x is a candidate state. the implementation of such a function can become arbitrarily complex in the field of combinatorial optimization. Many N(x) functions for a huge variety of different domainspecific problems have been developed in the past to solve this general problem. However, it has always been a great challenge to port or realize these functions on a massively-parallel architecture like a Graphics processing Unit (GPU). We present a GPU-based method called FANG that implements a generic and reusable N(x) for arbitrary domains in the field of combinatorial optimization. It can be customized to satisfy domainspecific requirements and leverages the underlying hardware in a fast and efficient way by construction. Moreover, our method has a high scalability with respect to the number of input states and the complexity of a single state. Measurements show significant performance improvements compared to traditional exploration approaches leveraging the CPU on our evaluation scenarios.

关键词： Heuristic search Combinatorial optimization Successor-state generation Neighborhood exploration Massively-parallel processing Graphics processing units GPUs

来源：评论

学校读者我要写书评

暂无评论

A Distributed Framework for Online Stream Data Clustering 20th

A Distributed Framework for Online Stream Data Clustering

引用

20th international conference on algorithms and architectures for parallel processing (ICA3PP)

作者： Ding, Jiafeng Fang, Junhua Chao, Pingfu Xu, Jiajie Zhao, PengPeng Zhao, Lei Soochow Univ Dept Comp Sci & Technol Suzhou Peoples R China Univ Queensland Brisbane Qld Australia

ISBN: (纸本)9783030602451;9783030602444

the recent prevalence of positioning sensors and mobile devices generates a massive amount of spatial-temporal data from moving objects in real-time. As one of the fundamental processes in data analysis, the clustering on spatial-temporal data creates various applications, like event detection and travel pattern extraction. However, most of the existing works only focus on the offline scenario, which is not applicable to online time-sensitive applications due to their low efficiency and ignorance of temporal features. In this paper, we propose a distributed streaming framework for spatial-temporal data clustering, which accepts various clustering algorithms while ensuring low resource consumption and result correctness. the framework includes a dynamic partitioning strategy for continuous load-balancing and a cluster-merging algorithm based on convex hulls [10], which guarantees the result correctness. Extensive experiments on real dataset prove the effectiveness of our proposed framework and its advantage over existing solutions.

关键词： Real-time cluster analysis Distributed stream processing Spatial-temporal data mining Top-k query parallel computing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共280页 << < 25 26 27 28 29 30 31 32 33 34 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：