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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,768 篇 会议
57 册 图书
47 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

2,015 篇 工学
- 1,780 篇 计算机科学与技术...
- 943 篇 软件工程
- 297 篇 信息与通信工程
- 293 篇 电气工程
- 246 篇 电子科学与技术（可...
- 95 篇 控制科学与工程
- 52 篇 机械工程
- 49 篇 生物工程
- 44 篇 光学工程
- 41 篇 生物医学工程（可授...
- 37 篇 仪器科学与技术
- 28 篇 动力工程及工程热...
- 27 篇 化学工程与技术
- 21 篇 土木工程
- 20 篇 力学（可授工学、理...
- 19 篇 材料科学与工程（可...
- 18 篇 建筑学
541 篇 理学
- 385 篇 数学
- 106 篇 物理学
- 56 篇 生物学
- 48 篇 系统科学
- 32 篇 化学
- 32 篇 统计学（可授理学、...
197 篇 管理学
- 121 篇 管理科学与工程(可...
- 81 篇 图书情报与档案管...
- 56 篇 工商管理
51 篇 医学
- 42 篇 临床医学
- 16 篇 基础医学(可授医学...
19 篇 文学
17 篇 经济学
- 17 篇 应用经济学
15 篇 法学
- 14 篇 社会学
12 篇 农学
4 篇 教育学
3 篇 军事学

主题

342 篇 parallel process...
200 篇 parallel process...
193 篇 computer archite...
157 篇 graphics process...
153 篇 parallel archite...
112 篇 parallel algorit...
108 篇 graphics process...
106 篇 hardware
86 篇 image processing
78 篇 computational mo...
73 篇 signal processin...
71 篇 concurrent compu...
66 篇 instruction sets
65 篇 algorithm design...
65 篇 multicore proces...
63 篇 field programmab...
60 篇 parallel program...
59 篇 parallel computi...
53 篇 gpu
49 篇 digital signal p...

机构

10 篇 natl univ def te...
8 篇 college of compu...
6 篇 hosei univ dept ...
6 篇 college of compu...
5 篇 univ aizu dept c...
5 篇 national univers...
5 篇 natl univ def te...
5 篇 city university ...
5 篇 science and tech...
4 篇 chinese acad sci...
4 篇 school of comput...
4 篇 carleton univ sc...
4 篇 univ chinese aca...
4 篇 school of comput...
4 篇 charles univ pra...
4 篇 department of co...
4 篇 school of comput...
4 篇 hainan internati...
4 篇 purple mountain ...
4 篇 department of co...

作者

10 篇 liu jie
9 篇 jack dongarra
8 篇 roman wyrzykowsk...
7 篇 wang qinglin
7 篇 konrad karczewsk...
7 篇 quintana-orti en...
6 篇 gepner pawel
6 篇 peng shietung
6 篇 li kuan-ching
6 篇 li yamin
6 篇 chu wanming
6 篇 prasanna viktor ...
6 篇 rothermel kurt
6 篇 yang chao-tung
5 篇 dongarra jack
5 篇 olas tomasz
5 篇 hannig frank
5 篇 wanlei zhou
5 篇 qian depei
5 篇 ewa deelman

语言

2,845 篇 英文
16 篇 其他
13 篇 中文
1 篇 俄文

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

共 2872 条记录，以下是2671-2680 订阅

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

详细简洁

排序：

parallel time domain solvers for electrically large transient scattering problems

Parallel time domain solvers for electrically large transien...

引用

European conference on Antennas and Propagation, EuCAP

作者： Yang Liu Abdulkadir Yucel Hakan Bagcý Eric Michielssen University of Michigan Ann Arbor MI US King Abdullah University of Science and Technology Thuwal SA

Marching on in time (MOT)-based integral equation solvers represent an increasingly appealing avenue for analyzing transient electromagnetic interactions with large and complex structures. MOT integral equation solvers for analyzing electromagnetic scattering from perfect electrically conducting objects are obtained by enforcing electric field boundary conditions and implicitly time advance electric surface current densities by iteratively solving sparse systems of equations at all time steps. Contrary to finite difference and element competitors, these solvers apply to nonlinear and multi-scale structures comprising geometrically intricate and deep sub-wavelength features residing atop electrically large platforms. Moreover, they are high-order accurate, stable in the low- and high-frequency limits, and applicable to conducting and penetrable structures represented by highly irregular meshes. this presentation reviews some recent advances in the parallel implementations of time domain integral equation solvers, specifically those that leverage multilevel plane-wave time-domain algorithm (PWTD) on modern manycore computer architectures including graphics processing units (GPUs) and distributed memory supercomputers. the GPU-based implementation achieves at least one order of magnitude speedups compared to serial implementations while the distributed parallel implementation are highly scalable to thousands of compute-nodes. A distributed parallel PWTD kernel has been adopted to solve time domain surface/volume integral equations (TDSIE/TDVIE) for analyzing transient scattering from large and complex-shaped perfectly electrically conducting (PEC)/dielectric objects involving ten million/tens of millions of spatial unknowns.

关键词： Time-domain analysis Integral equations Transient analysis Electromagnetic scattering Europe Antennas

来源：评论

学校读者我要写书评

暂无评论

DeepSparse: A Task-parallel Framework for SparseSolvers on Deep Memory architectures

DeepSparse: A Task-Parallel Framework for SparseSolvers on D...

引用

international conference on High Performance Computing

作者： Md Afibuzzaman Fazlay Rabbi M. Yusuf Özkaya Hasan Metin Aktulga Umit V. Çatalyürek Computer Science & Engineering Michigan State University Georgia Institute of Technology Atlanta GA USA

Data movement is an important bottleneck against efficiency and energy consumption in large-scale sparse matrix computations that are commonly used in linear solvers, eigensolvers and graph analytics. We introduce a novel task-parallel sparse solver framework, named DeepSparse, which adopts a fully integrated task-parallel approach. DeepSparse framework differs from existing work in that it adopts a holistic approach that targets all computational steps in a sparse solver rather than narrowing the problem into small kernels (e.g., SpMM, SpMV). We present the implementation details of DeepSparse and demonstrate its merit in two popular eigensolvers, LOBPCG and Lanczos algorithms. We observe that DeepSparse achieves 2× - 16× fewer cache misses across different cache layers (L1, L2 and L3) over implementations of the same solvers based on optimized library function calls. We also achieve 2× - 3.9× improvement in execution time when using DeepSparse over the same library versions.

关键词： Task analysis Sparse matrices Kernel Libraries Linear algebra Mathematical model parallel processing

来源：评论

学校读者我要写书评

暂无评论

Using the CPU and GPU for real-time video enhancement on a mobile computer

Using the CPU and GPU for real-time video enhancement on a m...

引用

international conference on Signal processing Proceedings (ICSP)

作者： Asheer Bachoo Optronic Sensor Systems Defence Peace Safety and Security Council of Scientific and Industrial Research Pretoria South Africa

Real-time video enhancement is generally achieved using costly specialized hardware that have specific functions and outputs. Commercial off-the-shelf hardware, such as desktop computers with Graphics processing Units (GPUs), are also commonly used as cost effective solutions for real-time video processing. In the past, the limitations in computer hardware meant that real-time video enhancement was mainly done on desktop GPUs with minimal use of the Central processing Unit (CPU). these algorithms were simple and easily parallelizable in nature, which enabled them to achieve real-time performance. However, complex enhancement algorithms also require the sequential processing of data and this cannot be easily achieved in real-time on a GPU. In this paper, the current advances in mobile CPU and GPU hardware are used to implement video enhancement algorithms in a new way on a mobile computer. Both the CPU and GPU are used effectively to achieve realtime performance for complex image enhancement algorithms that require both sequential and parallel processing operations. Results are presented for histogram equalization, local adaptive histogram equalization, contrast enhancement using tone mapping and exposure fusion of multiple 8-bit grey scale videos of size up to 1600×1200 pixels.

关键词： Pixel Graphics processing unit Histograms Real time systems Central processing Unit Streaming media Hardware

来源：评论

学校读者我要写书评

暂无评论

Resident Block-Structured Adaptive Mesh Refinement on thousands of Graphics processing Units

Resident Block-Structured Adaptive Mesh Refinement on Thousa...

引用

international conference on parallel processing (ICPP)

作者： David Beckingsale Wayne Gaudin Andrew Herdman Stephen Jarvis Department of Computer Science University of Warwick Coventry UK High Performance Computing AWE plc UK

Block-structured adaptive mesh refinement (AMR) is a technique that can be used when solving partial differential equations to reduce the number of cells necessary to achieve the required accuracy in areas of interest. these areas (shock fronts, material interfaces, etc.) are recursively covered with finer mesh patches that are grouped into a hierarchy of refinement levels. Despite the potential for large savings in computational requirements and memory usage without a corresponding reduction in accuracy, AMR adds overhead in managing the mesh hierarchy, adding complex communication and data movement requirements to a simulation. In this paper, we describe the design and implementation of a resident GPU-based AMR library, including: the classes used to manage data on a mesh patch, the routines used for transferring data between GPUs on different nodes, and the data-parallel operators developed to coarsen and refine mesh data. We validate the performance and accuracy of our implementation using three test problems and two architectures: an 8 node cluster, and 4,196 nodes of Oak Ridge National Laboratory's Titan supercomputer. Our GPU-based AMR hydrodynamics code performs up to 4.87× faster than the CPU-based implementation, and is scalable on 4,196 K20x GPUs using a combination of MPI and CUDA.

关键词： Graphics processing units Adaptation models Libraries Hydrodynamics Mathematical model Electric shock Computational modeling

来源：评论

学校读者我要写书评

暂无评论

A new parameterized string matching algorithm by combining bit-parallelism and suffix automata

A new parameterized string matching algorithm by combining b...

引用

international conference on Computer and Information Technology (CIT)

作者： Rajesh Prasad Suneeta Agarwal LDC Institute of Technical Studies Allahabad India Motilal Nehru National Institute of Technology Allahabad India

In the parameterized string matching, a given pattern P is said to match with a substring t of the text T, if there exist a bijection from the symbols of P to the symbols of t. this problem has an important application in software maintenance, where we wish to find the equivalency between two sections of codes. Two sections of codes are said to be equivalent, if one can be transformed into the other by renaming identifiers and variables only. Crochemore et al., 1994, has developed an algorithm (BDM) for exact string matching problem using suffix automata. Kimmo Fredriksson et al., 2006, has developed parameterized bit-parallel algorithm (parameterized shift-or) and parameterized BDM (PBDM). Parameterized shift-or (PSO) simulates finite automata in their nondeterministic form. the main drawback of PSO is: it is unable to skip text characters while matching forward. In this paper, we develop a new algorithm for parameterized string matching problem. this algorithm is based upon both suffix automata and bit parallelism concepts. this algorithm is faster than PBDM, since it processes the suffix automata in their non-deterministic form.

关键词： Automata Pattern matching Arrays parallel processing Encoding Computers Software maintenance

来源：评论

学校读者我要写书评

暂无评论

Real-time grasping of unknown objects based on computer vision

Real-time grasping of unknown objects based on computer visi...

引用

international conference on Advanced Robotics (ICAR)

作者： P.J. Sanz A.P. del Pohil J.M. Inesta Department of Computer Science Jaume I University Castellon Spain

We present an integrated system for vision-guided grasping in the real world. By using very limited resources-a standard personal computer and a robot-mounted camera-an inexpensive robot arm stably grasps unknown planar objects in real time by using visual perception and a standard parallel-jaw gripper. In a simple, yet powerful fashion our system integrates computer vision, grasping and vision-guided control. Novel techniques are presented to solve the involved problems under the imposed resource constraints: namely, for information reduction in image processing, strategies for grasp determination and vision-guided control for grasp execution. Particularly, a novel technique called curvature-symmetry fusion is used to help in efficient grasp determination. the system provides the user with a quantitative measure of the degree of stability of the planned grasp. Experimental results are provided. the imposed resource constraints makes it suitable for short-term applications in the real world, such as service or medical.

关键词： Computer vision Friction Grippers parallel robots Robot vision systems Visual perception Computer science Microcomputers Real time systems Control systems

来源：评论

学校读者我要写书评

暂无评论

A Gaussian Recursive Filter parallel Implementation with Overlapping

A Gaussian Recursive Filter Parallel Implementation with Ove...

引用

international IEEE conference on Signal-Image Technologies and Internet-Based System

作者： Pasquale De Luca Ardelio Galletti Livia Marcellino Department of Computer Science University of Salerno Italy Department of Science and Technology University of Naples Parthenope Naples Italy

ISBN: (数字)9781728156866

ISBN: (纸本)9781728156873

Gaussian convolutions computation is required in several scientific fields and, to this aim, efficient approximation methods, based on Recursive Filters (RFs), have been developed recently. Among them, Gaussian Recursive Filters (RFs) are designed to approximate the Gaussian convolution in a very efficient way. the accuracy of these methods, as is well known, can be improved by means of the use of the so-called K-iterated Gaussian recursive filters, that is in the repeated application of the basic RF. To improve the provided accuracy, K-iterated versions of these methods are also considered. Since it is often necessary to handle large size one-dimensional input signals, a parallel approach becomes mandatory. Recently, we proposed a parallel algorithm for the implementation of the K-iterated first-order Gaussian RF on multicore architectures. Here, using a similar parallelization strategy, based on a domain decomposition with overlapping, we propose a new implementation that would exploit, in terms of both accuracy and performance, the GPU (Graphics processing Unit) capabilities on CUDA environment. Tests and experiments confirm the reliability and the efficiency of the proposed implementation.

关键词： Radio frequency Convolution Graphics processing units parallel algorithms Tools Boundary conditions Instruction sets

来源：评论

学校读者我要写书评

暂无评论

Autonomous checkers robot using enhanced massive parallel game tree search

Autonomous checkers robot using enhanced massive parallel ga...

引用

the international conference on Informatics and Systems (INFOS)

作者： Ahmed A. Elnaggar Mahmoud Gadallah Mostafa Abdel Aziem Hisham Aldeeb Computer Science Department Modern Academy Maadi Cairo Egypt Computer Science Department AAST Cairo Egypt Computer Science Department MTI University Cairo Egypt

the dream of building intelligent robotic systems to interact and communicate with people and help them in their lives is a very old and ongoing study. In this research, the massive parallel autonomous checkers agent "MPACA" can autonomously play checkers with a human upto Grandmaster level without requiring a special checkers board for detecting human movements. the main aim and contribution of this research is proposing enhanced algorithms for a game tree search using two different approaches. the first was a task-based approach on CPU with a parallel database, while the second was a threads-based approach on the GPU with no divergence and dynamic parallelism. the two approaches were compared with previous studies using various approaches, including threads on CPU for up to 6× speedup for an 8-core processor and threads on GPU using iterative dependence and fixed grid and block size of up to 40× speedup at 14 depth. Furthermore, the approaches were tested with different depths on the CPU and the GPU. the result shows speed up for parallel CPU tasks up to 7× for an 8-core processor and parallel GPU of up to 80× at 14 depth.

关键词： Graphics processing units Central processing Unit Games Libraries parallel processing Robots Databases

来源：评论

学校读者我要写书评

暂无评论

Simplified pseudo-dynamic receive beamforming for FPGA implementation

Simplified pseudo-dynamic receive beamforming for FPGA imple...

引用

Biomedical Engineering international conference (BMEiCON)

作者： U. Techavipoo P. Pinunsottikul R. Keinprasit P. thajchayapong National Electronics and computers Technology Center Pathumthani Thailand

ISBN: (纸本)9781467391573

An algorithm to reduce computational time for pseudo-dynamic receive beamforming using FPGA is presented. this includes a method to store and retrieve the predetermined delays and other parameters. In addition, we present a simplified implementation method to compute the scanline one sample at a time. the addresses of the echo signal data from different piezoelectric elements are parallel calculated using the delays. Subsequently, the data are loaded and summed, resulting in one sample on the scanline. this method is easy to be modified for delay error compensation and for different window lengths. this algorithm is implemented on an FPGA (Virtex-4, Xilinx, inc., San Jose, CA) and providing fast computational time of 0.998 ms per scanline for 8192 samples at 40-MHz sampling with comparable image qualities to dynamic receive beamforming.

关键词： Delays Array signal processing Field programmable gate arrays Random access memory Apertures Indexes Read only memory

来源：评论

学校读者我要写书评

暂无评论

eBFP: A processing-in-Memory Storage Method with parallel Computing and Low Latency

eBFP: A Processing-in-Memory Storage Method with Parallel Co...

引用

international conference on Computers, Communications, and Systems (ICCCS)

作者： Jiehao Miao Jizhou Bai Bingbin Huang Jingrui Li Kaixuan Bao Wei Xu School of Information Science and Engineering Southeast University Nanjing China National Mobile Communications Research Laboratory Southeast University Nanjing China Purple Mountain Laboratories Nanjing China

With the development of the sixth Generation (6G) mobile communication, big data and deep learning, new requirements for latency and computational complexity have been put forward. therefore, in this paper, we propose a new floating-point storage called extended block floating-point (eBFP). this article first briefly introduces the storage method of the IEEE Standard for Floating-point Arithmetic (IEEE-754) floating-point numbers and its shortcomings, and then details the storage method of the eBFP operator and its specific operation logic. Finally, a simulation comparison with IEEE-754 floating-point number shows the advantage of eBFP to better trade-off accuracy and complexity.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共288页 << < 264 265 266 267 268 269 270 271 272 273 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：