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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

954 篇 会议
20 篇 期刊文献
2 册 图书

馆藏范围

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

日期分布

学科分类号

654 篇 工学
- 596 篇 计算机科学与技术...
- 238 篇 软件工程
- 190 篇 电气工程
- 76 篇 电子科学与技术（可...
- 61 篇 信息与通信工程
- 31 篇 控制科学与工程
- 23 篇 动力工程及工程热...
- 11 篇 机械工程
- 11 篇 仪器科学与技术
- 8 篇 生物医学工程（可授...
- 7 篇 力学（可授工学、理...
- 7 篇 环境科学与工程（可...
- 7 篇 安全科学与工程
- 5 篇 材料科学与工程（可...
- 5 篇 建筑学
- 5 篇 交通运输工程
- 5 篇 生物工程
- 5 篇 网络空间安全
91 篇 理学
- 53 篇 数学
- 27 篇 系统科学
- 18 篇 物理学
- 8 篇 生物学
- 6 篇 统计学（可授理学、...
- 5 篇 化学
89 篇 管理学
- 77 篇 管理科学与工程(可...
- 32 篇 工商管理
- 14 篇 图书情报与档案管...
10 篇 经济学
- 10 篇 应用经济学
8 篇 法学
- 7 篇 社会学
6 篇 医学
4 篇 教育学
- 4 篇 教育学
3 篇 文学
2 篇 农学
2 篇 军事学

主题

75 篇 computer archite...
62 篇 hardware
60 篇 parallel process...
55 篇 multicore proces...
48 篇 computational mo...
37 篇 concurrent compu...
37 篇 high performance...
34 篇 instruction sets
34 篇 multi-core
33 篇 graphics process...
32 篇 cloud computing
31 篇 scalability
30 篇 parallel program...
29 篇 programming
29 篇 program processo...
29 篇 graphics process...
27 篇 kernel
25 篇 embedded systems
24 篇 conferences
24 篇 resource managem...

机构

9 篇 ohio state univ ...
5 篇 saitama univ gra...
4 篇 ohio state univ ...
3 篇 saitama universi...
3 篇 vienna universit...
3 篇 oak ridge natl l...
3 篇 graduate school ...
3 篇 fraunhofer igd t...
3 篇 center for compu...
3 篇 karlsruhe instit...
3 篇 oak ridge natl l...
3 篇 beihang univ sch...
2 篇 penn state univ ...
2 篇 uppsala univ upp...
2 篇 seoul natl univ ...
2 篇 coll william & m...
2 篇 china university...
2 篇 waseda univ dept...
2 篇 tsinghua univers...
2 篇 national univers...

作者

6 篇 takuya azumi
6 篇 panda d. k.
6 篇 azumi takuya
5 篇 subramoni hari
5 篇 shingo igarashi
5 篇 benini luca
4 篇 tatsuya horiguch...
4 篇 tasuku ishigooka
4 篇 petiton serge
4 篇 el-ghazawi tarek
4 篇 sato mitsuhisa
4 篇 amano hideharu
3 篇 liu bo
3 篇 klasky scott
3 篇 dongarra jack
3 篇 varbanescu ana l...
3 篇 qian depei
3 篇 sriram krishnamo...
3 篇 weichslgartner a...
3 篇 alam sadaf r.

语言

967 篇 英文
8 篇 其他
1 篇 中文

检索条件"任意字段=IEEE International Workshop on Multi-/Many-core Computing Systems"

共 976 条记录，以下是741-750 订阅

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

详细简洁

排序：

High performance computing of line of sight viewshed

High performance computing of line of sight viewshed

引用

ieee international Conference on multimedia and Expo (ICME)

作者： Ligang Lu Brent Paulovicks Michael Perrone Vedim Sheinin IBM Thomas J. Watson Research Center Yorktown Heights NY USA

In this paper we present our recent research and development work for multicore computing of Line of Sight (LoS) on the Cell Broadband Engine (CBE) processors. LoS can be found in many applications where real-time high performance computing is required. We will describe an efficient LoS multi-core parallel computing algorithm, including the data partition and computation load allocation strategies to fully utilize the CBE's computational resources for efficient LoS viewshed parallel computing. In addition, we will also illustrate a successive fast transpose algorithm to prepare the input data for efficient Single-Instruction-multiple-Data (SIMD) operations. Furthermore, we describe the data input and output (I/O) management scheme to reduce the (I/O) latency in Direct-Memory-Access (DMA) data fetching and storing operations. The performance evaluation of our LoS viewshed computing scheme over an area of interest (AOI) with more than 4.19 million points has shown that our parallel computing algorithm on CBE takes less than 25.5 ms, which is several orders of magnitude faster than the available commercial systems.

关键词： Parallel processing Algorithm design and analysis Partitioning algorithms Real time systems Graphical user interfaces Program processors Buffer storage

来源：评论

学校读者我要写书评

暂无评论

Enforcing multi-user Access Policies to Encrypted Cloud Databases

Enforcing Multi-user Access Policies to Encrypted Cloud Data...

引用

international workshop on Policies for Distributed systems and Networks

作者： Mihaela Ion Giovanni Russello Bruno Crispo CREATE-NET International Research Center Trento Italy Department of Information Engineering and Computer Science University of Trento Trento Italy

Cloud computing has the advantage that it offers companies (virtually) unlimited data storage at attractive costs. However, it also introduces new challenges for protecting the confidentiality of the data, and the access to the data. Sensitive data like medical records, business or governmental data cannot be stored unencrypted on the cloud. Moreover, they can be of interest to many users and different policies could apply to each. Companies need new mechanisms to query the encrypted data without revealing anything to the cloud server, and to enforce access policies to the data. Current security schemes do not allow complex encrypted queries over encrypted data in a multi-user setting. Instead, they are limited to keyword searches. Moreover, current solutions assume that all users have the same access rights to the data. This demo shows the implementation of a scheme that allows making SQL-like queries on encrypted databases in a multi-user setting, while at the same time allowing the database owner to assign different access rights to users.

关键词： Databases Servers Logic gates Encryption Keyword search

来源：评论

学校读者我要写书评

暂无评论

An Effective Dynamic Scheduling Runtime and Tuning System for Heterogeneous multi and many-core Desktop Platforms

An Effective Dynamic Scheduling Runtime and Tuning System fo...

引用

ieee international Conference on High Performance computing and Communications (HPCC)

作者： Alecio P. D. Binotto Carlos E. Pereira Arjan Kuijper Andre Stork Dieter W. Fellner Fraunhofer IGD Technische Universität Darmstadt Darmstadt Germany Institute of Informatics UFRGS Federal University of Rio Grande do Sul Porto Alegre Brazil

A personal computer can be considered as a one-node heterogeneous cluster that simultaneously processes several application tasks. It can be composed by, for example, asymmetric CPU and GPUs. This way, a high-performance heterogeneous platform is built on a desktop for data intensive engineering calculations. In our perspective, a workload distribution over the Processing Units (PUs) plays a key role in such systems. This issue presents challenges since the cost of a task at a PU is non-deterministic and can be affected by parameters not known a priori. This paper presents a context-aware runtime and tuning system based on a compromise between reducing the execution time of engineering applications - due to appropriate dynamic scheduling - and the cost of computing such scheduling applied on a platform composed of CPU and GPUs. Results obtained in experimental case studies are encouraging and a performance gain of 21.77% was achieved in comparison to the static assignment of all tasks to the GPU.

关键词： Graphics processing unit Databases Dynamic scheduling Computational fluid dynamics Runtime Timing History

来源：评论

学校读者我要写书评

暂无评论

Reducing complexity in H.264/AVC motion estimation by using a GPU

Reducing complexity in H.264/AVC motion estimation by using ...

引用

ieee workshop on multimedia Signal Processing

作者： R. Rodríguez-Sánchez J. L. Martínez G. Fernández-Escribano J. M. Claver J. L. Sánchez Instituto de Investigación en Informática de Albacete Universidad de Castilla La Mancha Albacete Spain Architecture and Technology of Computing Systems Group Complutense University Ciudad Universitaria Madrid Spain Departmento de Informática Universidad de Valencia Burjassot Spain

H.264/AVC applies a complex mode decision technique that has high computational complexity in order to reduce the temporal redundancies of video sequences. Several algorithms have been proposed in the literature in recent years with the aim of accelerating this part of the encoding process. Recently, with the emergence of many-core processors or accelerators, a new approach can be adopted for reducing the complexity of the H.264/AVC encoding algorithm. This paper focuses on reducing the inter prediction complexity adopted in H.264/AVC and proposes a GPU-based implementation using CUDA. Experimental results show that the proposed approach reduces the complexity by as much as 99% (100x of speedup) while maintaining the coding efficiency.

关键词： Graphics processing unit Prediction algorithms Algorithm design and analysis Encoding Instruction sets Proposals Software algorithms

来源：评论

学校读者我要写书评

暂无评论

Enabling multi-physics Coupled Simulations within the PGAS Programming Framework 11

Enabling Multi-physics Coupled Simulations within the PGAS P...

引用

ieee/ACM international Symposium on Cluster computing and the Grid (CCGRID)

作者： Fan Zhang Ciprian Docan Manish Parashar Scott Klasky Center of Autonomic Computing Rutgers University Piscataway NJ USA Oak Ridge National Laboratory Oak Ridge TN USA

ISBN: (纸本)9780769543956

Complex coupled multi-physics simulations are playing increasingly important roles in scientific and engineering applications such as fusion plasma and climate modeling. At the same time, extreme scales, high levels of concurrency and the advent of multicore and many core technologies are making the high-end parallel computing systems on which these simulations run, hard to program. While the Partitioned Global Address Space (PGAS) languages is attempting to address the problem, the PGAS model does not easily support the coupling of multiple application codes, which is necessary for the coupled multi-physics simulations. Furthermore, existing frameworks that support coupled simulations have been developed for fragmented programming models such as message passing, and are conceptually mismatched with the shared memory address space abstraction in the PGAS programming model. This paper explores how multi-physics coupled simulations can be supported within the PGAS programming framework. Specifically, in this paper, we present the design and implementation of the XpressSpace programming system, which enables efficient and productive development of coupled simulations across multiple independent PGAS Unified Parallel C (UPC) executables. XpressSpace provides the global-view style programming interface that is consistent with the memory model in UPC, and provides an efficient runtime system that can dynamically capture the data decomposition of global-view arrays and enable fast exchange of parallel data structures between coupled codes. In addition, XpressSpace provides the flexibility to define the coupling process in specification file that is independent of the program source codes. We evaluate the performance and scalability of Xpress Space prototype implementation using different coupling patterns extracted from real world multi-physics simulation scenarios, on the Jaguar Cray XT5 system of Oak Ridge National Laboratory.

关键词： Couplings Arrays Data models Electronics packaging Programming Instruction sets Runtime

来源：评论

学校读者我要写书评

暂无评论

Improved Grid Security Posture through multi-factor Authentication

Improved Grid Security Posture through Multi-factor Authenti...

引用

international workshop on Grid computing

作者： Victor Hazlewood Patricia Kovatch Matthew Ezell Matthew Johnson Patti Redd National Institute for Computational Sciences University of Tennessee Oak Ridge TN USA

While methods of securing communication over the Internet have changed from clear text to secure encrypted channels over the last decade, the basic username-password combination for authentication has remained the mainstay in academic research computing and grid environments. Security incidents affecting grids, such as the TeraGrid stakkato incident of 2004 and 2005, has demonstrated that the use of reusable passwords for authentication can be readily exploited and can lead to a widespread security incident across the grid [1, 2]. The University of Tennessee's National Institute for Computational Sciences (NICS) founded in 2008 has provided resources to the TeraGrid, including Kraken, a 1.17 petaflops Cray XT5, and has implemented and promoted the use of multi-factor authentication mechanisms since its founding. The benefits of use of this stronger authentication method has been higher productivity and resource availability for users due to no known user account compromises caused by stolen NICS user credentials that led to disabling accounts or system resources. NICS has been developing and experimenting with expanding our use of multi-factor authentication to the grid. NICS has integrated multi-factor authentication with our certificate authority so that users can now run my proxy and receive a multi-factor authenticated certificate. NICS is also exploring the federation of multi-factor authentication systems, with the goal of "one user, one token". This is especially important, as new grid resources, such as Blue Waters, will only allow multi-factor authentication, and we want the users to only carry one token, not many tokens. XSEDE, the TeraGrid successor, will also be deploying multi-factor authentication in addition to the other existing authentication methodologies. XSEDE will also work closely with science gateways and workflows to develop and maintain secure frameworks for the highest level of security possible.

关键词： Authentication Servers Logic gates Communities Prototypes

来源：评论

学校读者我要写书评

暂无评论

A Very Fast Simulator for Exploring the many-core Future

A Very Fast Simulator for Exploring the Many-Core Future

引用

international Symposium on Parallel and Distributed Processing (IPDPS)

作者： Olivier Certner Zheng Li Arun Raman Olivier Temam ST Microelectronics INRIA Saclay France INRIA Saclay île-de-France Orsay France Princeton University NJ USA

Although multi-core architectures with a large number of cores ("many-cores'') are considered the future of computing systems, there are currently few practical tools to quickly explore both their design and general program scalability. In this paper, we present Simany, a discrete-event-based many-core simulator able to support more than a thousand cores while being orders of magnitude faster than existing flexible approaches. One of the difficult challenges for a reasonably realistic many-core simulation is to model faithfully the potentially high concurrency a program can exhibit. Simany uses a novel virtual time synchronization technique, called spatial synchronization, to achieve this goal in a completely local and distributed fashion, which diminishes interactions and preserves locality. Compared to previous simulators, it raises the level of abstraction by focusing on modeling concurrent interactions between cores, which enables fast coarse comparisons of high-level architecture design choices and parallel programs performance. Sequential pieces of code are executed natively for maximal speed. We exercise the simulator with a set of dwarf-like task-based benchmarks with dynamic control flow and irregular data structures. Scalability results are validated through comparison with a cycle-level simulator up to 64 cores. They are also shown consistent with well-known benchmark characteristics. We finally demonstrate how Simany can be used to efficiently compare the benchmarks' behavior over a wide range of architectural organizations, such as polymorphic architectures and network of clusters.

关键词： Synchronization Computer architecture Programming System recovery Hardware Accuracy

来源：评论

学校读者我要写书评

暂无评论

Autonomic computing: the first decade 11

Autonomic computing: the first decade

引用

Proceedings of the 8th ACM international conference on Autonomic computing

作者： Jeffrey O. Kephart IBM Thomas J Watson Research Hawthorne NY USA

ISBN: (纸本)9781450306072

This talk provides a retrospective on the first decade of autonomic computing, an assessment of the extent to which the original vision has been realized, and some discussion and speculation about the the remaining research *** a decade has elapsed since Paul Horn, IBM's senior vice president of research, introduced the concept of autonomic computing during a keynote address to the National Academy of Engineers at Harvard University in October, 2001. Warning of a looming crisis arising from the ever-growing complexity of managing IT infrastructures, he enjoined the academic and industrial research communities to develop large-scale computing systems analogous to the autonomic nervous system, which subconsciously controls many of the body's muscles and organs. Horn envisioned that, just as the autonomous nervous system frees the conscious mind from the burden of increasing our heart rate and respiration rate when we exercise, an autonomic computing system would free system administrators from the burden of tuning database performance or mining multiple log files full of arcane messages to diagnose why an application is suddenly failing, enabling them instead to specify desired behavior through high-level policies. This vision was promoted and elucidated further in The Vision of Autonomic computing, which appeared in ieee Computer in January, 2003. That article described some of the capabilities that autonomic computing systems and their elements ought to possess, such as the ability to configure, heal, protect and optimize themselves, suggested a high-level multi-agent architecture, and laid out a number of key engineering and science research challenges that would require the combined efforts of experts from many different disciplines to *** worldwide research community quickly embraced autonomic computing. In June 2003, the Algorithms and Architectures for Self-managing systems workshop at the Federated computing Research Conference and the Acti

关键词： retrospective autonomic computing

来源：评论

学校读者我要写书评

暂无评论

Commodity Cluster-Based Parallel Implementation of an Automatic Target Generation Process for Hyperspectral Image Analysis

Commodity Cluster-Based Parallel Implementation of an Automa...

引用

international Conference on Parallel and Distributed systems (ICPADS)

作者： Sergio Bernabe Antonio Plaza Hyperspectral Computing Laboratory Department of Technology of Computers and Communications University of Extremadura Caceres Spain

The development of parallel implementations is an important task for hyper spectral data exploitation. In most cases, real-time or nearly real-time processing of hyper spectral images is required for swift decisions which depend upon high computing performance of algorithm analysis. A popular algorithm in hyper spectral image interpretation is the automatic target generation process (ATGP). In this paper, we develop a new parallel version of this algorithm, which is routinely applied in many application domains, including defence and intelligence, precision agriculture, geology, or forestry. We improve considerably the computational cost of this algorithm, and also improve its detection accuracy by incorporating a new method for calculating the orthogonal projection process in which the algorithm is based using the Gram-Schmidt method. Our proposed strategy reduces the computational cost over the a previous implementation of the same algorithm which uses the pseudoinverse operation to compute the orthogonal projection. Our parallel algorithm is implemented on a multi-core cluster system made up of of sixteen nodes, with two CPUs of four cores per node, and quantitatively evaluated using hyper spectral data collected by NASA's Airborne Visible Infra-Red Imaging Spectrometer (AVIRIS) over the World Trade Center (WTC) in New York and over the Cup rite mining district, Nevada, United States.

关键词： Hyperspectral imaging Vectors Algorithm design and analysis Clustering algorithms Object detection Parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Flexible Development of Dense Linear Algebra Algorithms on Massively Parallel Architectures with DPLASMA

Flexible Development of Dense Linear Algebra Algorithms on M...

引用

ieee international Symposium on Parallel and Distributed Processing workshops and Phd Forum (IPDPSW)

作者： George Bosilca Aurelien Bouteiller Anthony Danalis Mathieu Faverge Azzam Haidar Thomas Herault Jakub Kurzak Julien Langou Pierre Lemarinier Hatem Ltaief Piotr Luszczek Asim YarKhan Jack Dongarra Innovative Computing Laboratory University of Tennessee USA Oak Ridge National Laboratory USA University of Paris XI France University of Colorado Denver USA

We present a method for developing dense linear algebra algorithms that seamlessly scales to thousands of cores. It can be done with our project called DPLASMA (Distributed PLASMA) that uses a novel generic distributed Direct Acyclic Graph Engine (DAGuE). The engine has been designed for high performance computing and thus it enables scaling of tile algorithms, originating in PLASMA, on large distributed memory systems. The underlying DAGuE framework has many appealing features when considering distributed-memory platforms with heterogeneous multicore nodes: DAG representation that is independent of the problem-size, automatic extraction of the communication from the dependencies, overlapping of communication and computation, task prioritization, and architecture-aware scheduling and management of tasks. The originality of this engine lies in its capacity to translate a sequential code with nested-loops into a concise and synthetic format which can then be interpreted and executed in a distributed environment. We present three common dense linear algebra algorithms from PLASMA (Parallel Linear Algebra for Scalable multi-core Architectures), namely: Cholesky, LU, and QR factorizations, to investigate their data driven expression and execution in a distributed system. We demonstrate through experimental results on the Cray XT5 Kraken system that our DAG-based approach has the potential to achieve sizable fraction of peak performance which is characteristic of the state-of-the-art distributed numerical software on current and emerging architectures.

关键词： Tiles Engines Linear algebra Heuristic algorithms multicore processing Plasmas

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共98页 << < 71 72 73 74 75 76 77 78 79 80 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：