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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

3,404 篇 会议
126 篇 期刊文献
6 册 图书

馆藏范围

3,536 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

2,759 篇 工学
- 2,601 篇 计算机科学与技术...
- 1,584 篇 软件工程
- 533 篇 信息与通信工程
- 427 篇 电气工程
- 267 篇 控制科学与工程
- 188 篇 电子科学与技术（可...
- 174 篇 网络空间安全
- 44 篇 机械工程
- 43 篇 生物医学工程（可授...
- 37 篇 动力工程及工程热...
- 31 篇 生物工程
- 28 篇 力学（可授工学、理...
- 26 篇 建筑学
- 23 篇 安全科学与工程
- 22 篇 材料科学与工程（可...
- 21 篇 化学工程与技术
- 20 篇 仪器科学与技术
- 19 篇 土木工程
- 19 篇 交通运输工程
1,100 篇 理学
- 982 篇 数学
- 135 篇 统计学（可授理学、...
- 98 篇 物理学
- 72 篇 系统科学
- 38 篇 生物学
- 26 篇 化学
420 篇 管理学
- 326 篇 管理科学与工程(可...
- 202 篇 工商管理
- 121 篇 图书情报与档案管...
37 篇 经济学
- 37 篇 应用经济学
27 篇 法学
- 26 篇 社会学
20 篇 医学
15 篇 农学
12 篇 教育学
3 篇 文学
1 篇 军事学
1 篇 艺术学

主题

494 篇 parallel process...
276 篇 distributed comp...
216 篇 parallel process...
195 篇 distributed comp...
178 篇 concurrent compu...
170 篇 parallel algorit...
167 篇 computer science
117 篇 application soft...
112 篇 computer archite...
89 篇 parallel program...
89 篇 hardware
80 篇 computational mo...
76 篇 computer network...
72 篇 costs
72 篇 algorithm design...
65 篇 processor schedu...
64 篇 delay
55 篇 grid computing
49 篇 fault tolerance
48 篇 scalability

机构

12 篇 syracuse univ sy...
12 篇 pacific northwes...
11 篇 georgia inst of ...
9 篇 new jersey inst ...
9 篇 univ of maryland...
9 篇 national laborat...
8 篇 univ of californ...
8 篇 michigan state u...
8 篇 univ ottawa site...
7 篇 texas a&m univ c...
7 篇 ibm thomas j. wa...
7 篇 purdue univ west...
7 篇 ieee
6 篇 carleton univ sc...
6 篇 school of comput...
6 篇 shanghai jiao to...
6 篇 univ of minnesot...
6 篇 univ of central ...
6 篇 univ of illinois...
6 篇 carleton univ ot...

作者

15 篇 boukerche azzedi...
13 篇 bader david a.
11 篇 das sajal k.
9 篇 ranka sanjay
9 篇 li keqin
8 篇 sohn andrew
7 篇 panda dhabaleswa...
7 篇 prasanna viktor ...
7 篇 choudhary alok
7 篇 sato mitsuhisa
6 篇 taura kenjiro
6 篇 ibarra oscar h.
6 篇 zomaya albert y.
6 篇 yang laurence t.
6 篇 welch lonnie r.
6 篇 zhang xiaodong
6 篇 cristea valentin
6 篇 nakano koji
6 篇 sun xian-he
6 篇 boukerche a

语言

3,522 篇 英文
12 篇 其他
2 篇 中文

检索条件"任意字段=Proceedings of the 5th IEEE Symposium on Parallel and Distributed Processing"

共 3536 条记录，以下是701-710 订阅

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

详细简洁

排序：

parallel aggregation queries over star schema: A hierarchical encoding scheme and efficient percentile computing as a case

Parallel aggregation queries over star schema: A hierarchica...

引用

9th ieee International symposium on parallel and distributed processing with Applications, ISPA 2011

作者： Qin, Xiongpai Wang, Huiju Du, Xiaoyong Wang, Shan School of Information Renmin University of China Beijing 100872 China Beijing 100872 China

ISBN: (纸本)9780769544281

Big data analysis is a main challenge we meet recently. Cloud computing is attracting more and more big data analysis applications, due to its well scalability and fault-tolerance. Some aggregation functions, like SUM, can be computed in parallel, because they satisfy distributive law of addition. Unfortunately, some of statistical functions are not naturally parallelizable. that means they do not satisfy distributive law of addition. In this paper, we focus on percentile computing problem. We proposed an iterative-style prediction-based parallel algorithm in a distributed system. Prediction is done through a sampling technique. Experiment results verify the efficiency of our algorithm. © 2011 ieee.

关键词： Big data

来源：评论

学校读者我要写书评

暂无评论

New parallel prefix algorithm for multicomputers

New parallel prefix algorithm for multicomputers

引用

9th ieee International symposium on parallel and distributed processing with Applications, ISPA 2011

作者： Lin, Yen-Chun Ko, Chun-Yu Department of Computer Science and Information Engineering Chang Jung Christian University Taiwan Department of Computer Science and Information Engineering National Taiwan University of Science and Technology Taiwan

ISBN: (纸本)9780769544281

A new computation-efficient parallel prefix algorithm for message-passing multicomputers is presented. the algorithm uses only half-duplex communications. It provides the flexibility of choosing parameter values for either fewer computation time steps or fewer communication time steps to achieve the minimal running time based on the ratio of the time required by a communication step to the time required by a computation step. thus, under certain conditions, the new algorithm can run faster than previous ones for the same multicomputer model. © 2011 ieee.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

PATUS: A code generation and autotuning framework for parallel iterative stencil computations on modern microarchitectures

PATUS: A code generation and autotuning framework for parall...

引用

25th ieee International parallel and distributed processing symposium, IPDPS 2011

作者： Christen, Matthias Schenk, Olaf Burkhart, Helmar Department of Mathematics and Computer Science University of Basel Switzerland

ISBN: (纸本)9780769543857

Stencil calculations comprise an important class of kernels in many scientific computing applications ranging from simple PDE solvers to constituent kernels in multigrid methods as well as image processing applications. In such types of solvers, stencil kernels are often the dominant part of the computation, and an efficient parallel implementation of the kernel is therefore crucial in order to reduce the time to solution. However, in the current complex hardware micro architectures, meticulous architecture-specific tuning is required to elicit the machine's full compute power. We present a code generation and auto-tuning framework Patus for stencil computations targeted at multi- and many core processors, such as multicore CPUs and graphics processing units, which makes it possible to generate compute kernels from a specification of the stencil operation and a parallelization and optimization strategy, and leverages the auto tuning methodology to optimize strategy-dependent parameters for the given hardware architecture. © 2011 ieee.

关键词： Program processors

来源：评论

学校读者我要写书评

暂无评论

parallel integral image generation algorithm on multi-core system

Parallel integral image generation algorithm on multi-core s...

引用

9th ieee International symposium on parallel and distributed processing with Applications, ISPA 2011

作者： Wu, Yi-Ta Wu, Yih-Tyng Cho, Chao-Yi Tseng, Shau-Yin Liu, Chun-Nan King, Chung-Ta D300 Information and Communications Research Laboratories ICL Industrial Technology Research Institute ITRI Taiwan Investigation Bureau Ministry of Justice Taiwan Department of Computer Science National Tsing Hua University Hsinchu Taiwan

ISBN: (纸本)9780769544281

Integral image becomes a very useful tool in most of the computer vision applications in recent years, and the parallelization strategy is the most popular approach for efficiently generating the integral image. However, most of current parallel integral image generation algorithms are developed based on the dedicated hardware architecture. In this paper, we developed a parallel integral image generation algorithm on Tile64 which is a MIMD-based embedded system. It can be found that our parallel integral image generation algorithm achieved 7.66 times more efficient than the original sequential integral image generation. © 2011 ieee.

关键词： Image processing

来源：评论

学校读者我要写书评

暂无评论

A TDMA medium access control mechanism for ieee 802.11-based wireless networks

A TDMA medium access control mechanism for IEEE 802.11-based...

引用

5th International Conference on Genetic and Evolutionary Computing, ICGEC2011

作者： Liaw, Guan-Hsiung Yeh, Yen-Tung Department of Information Engineering I-Shou University Dashu Dist. Kaohsiung City Taiwan Recruitment Center of National Armed Forces Taichung City Taiwan

ISBN: (纸本)9780769544496

As DCF (distributed Coordination Function) in ieee 802.11 standard adopts distributed contention with random backoff time, it results in uncertainty and packet delay and jitter. It is not suitable for real-time data transmission and cannot meets the needs to access media resources at fixed time interval for some application, such as VoIP. this paper proposes a TDMA-like distributed multiple access mechanism for ieee 802.11-based wireless local area net. this mechanism allows a station to avoid competition via TDMA-like access method and periodically occupy the wireless transmission medium. In addition, the proposed mechanism is appropriately designed such that it can co-exist with the original distributed coordination function (DCF) in parallel. the packet delay and jitter are effectively constrained in the proposed mechanism. © 2011 ieee.

关键词： Time division multiple access

来源：评论

学校读者我要写书评

暂无评论

A Scalable Architecture for Intrusion-Detection Systems Based on a Broadband Network of Embedded Set-Top Boxes

A Scalable Architecture for Intrusion-Detection Systems Base...

引用

54th ieee International Midwest symposium on Circuits and Systems (MWSCAS)

作者： Neill, Richard Carloni, Luca P. Columbia Univ Dept Comp Sci New York NY 10027 USA

ISBN: (纸本)9781612848570

As the processing power of set-top box (STB) devices continnes to grow with each new product generation and multiple service operators directly manage millions of these devices through a dedicated broadband network, we propose to harness this massive aggregate computational power to execute large-scale parallel applications. We present a prototype implementation of a heterogeneous distributed embedded system that combines a complete head-end cable system with a DOCSIS broadband network of STBs and an interoperable embedded implementation of Open MPI running on the STB operating system. We demonstrate the operations and performance of this system by reporting the experimental results that we obtained for the execution of various instances of Multiple Sequence Alignment, a parallel bioinformatics application. Based on these results we propose a new distributed embedded system architecture for highly-scalable intrusion-detection systems.

关键词： Broadband communication DOCSIS broadband network Frequency modulation Linux Radio frequency Servers Transform coding bioinformatics bioinformatics application computer networks dedicated broadband network embedded set-top boxes embedded systems head end cable system heterogeneous distributed embedded system intrusion detection systems large scale parallel applications massive aggregate computational power multiple sequence alignment scalable architecture security of data set-top boxes

来源：评论

学校读者我要写书评

暂无评论

distributed fine-grained access control in wireless sensor networks

Distributed fine-grained access control in wireless sensor n...

引用

25th ieee International parallel and distributed processing symposium, IPDPS 2011

作者： Ruj, Sushmita Nayak, Amiya Stojmenovic, Ivan SITE University of Ottawa Ottawa ON K1N 6N5 Canada

ISBN: (纸本)9780769543857

In mission-critical activities, each user is allowed to access some specific, but not all, data gathered by wireless sensor networks. Yu et al [1] recently proposed a centralized fine grained data access control mechanism for sensor networks, which exploits a cryptographic primitive called attribute based encryption (ABE). there is only one trusted authority to distribute keys to the sensor nodes and the users. Compromising the single authority can undermine the whole network. We propose a fully distributed access control method, which has several authorities instead of one. Each sensor has a set of attributes and each user has an access structure of attributes. A message from a sensor is encrypted such that only a user with matching set of attributes can decrypt. Compared to [1], our schemes need simpler access structure which make secret key distribution more computation efficient, when user rights are modified. We prove that our scheme can tolerate compromising all but one distribution centers, which independently distribute their contributions to a single user key. Our scheme do not increase the computation and communication costs of the sensors, making it highly desirable for fine grained access control. © 2011 ieee.

关键词： Access control

来源：评论

学校读者我要写书评

暂无评论

Redesign of higher-level matrix algorithms for multicore and distributed architectures and applications in quantum Monte Carlo simulation

Redesign of higher-level matrix algorithms for multicore and...

引用

25th ieee International parallel and distributed processing symposium, IPDPS 2011

作者： Lee, Che-Rung Bai, Zhaojun Department of Computer Science National TsingHua University Hsinchu 30013 Taiwan Department of Computer Science University of California Davis CA 95616 United States

ISBN: (纸本)9780769543857

A matrix operation is referred to as a hard-to-parallel matrix operation (HPMO) if it has serial bottlenecks that are hardly parallelizable. Otherwise, it is referred to as an easy-to-parallel matrix operation (EPMO). Empirical evidences showed the performance scalability of an HPMO is significantly poorer than an EPMO on multicore and distributed architectures. As the result, the design of higher-level algorithms for applications, for the performance considerations on multicore and distributed architectures, should avoid the use of HPMOs as the computational kernels. In this paper, as a case study, we present an HPMO-avoiding algorithm for the Green's function calculation in quantum Monte Carlo simulation. the original algorithm utilizes the QR-decomposition with column pivoting (QRP) as its computational kernel. QRP is an HPMO. the redesigned algorithm maintains the same simulation stability but employs the standard QR decomposition without pivoting (QR), which is an EPMO. Different implementations of the redesigned algorithm on multicore and distributed architectures are investigated. Although some implementations of the redesigned method use about a factor of three more floating-point operations than the original algorithm, they are about 20% faster on a quad core system and 2.5 times faster on a 1024-CPU massively parallel processing system. the broader impact of the redesign of higher-level matrix algorithms to avoid HPMOs in other computational science applications is also discussed. © 2011 ieee.

关键词： Monte Carlo methods

来源：评论

学校读者我要写书评

暂无评论

A study of speculative distributed scheduling on the cell/B.E.

A study of speculative distributed scheduling on the cell/B....

引用

25th ieee International parallel and distributed processing symposium, IPDPS 2011

作者： Bellens, Pieter Perez, Josep M. Badia, Rosa M. Labarta, Jesus Barcelona Supercomputing Center Spain Spain Spain Universitat Politecnica de Catalunya Spain

ISBN: (纸本)9780769543857

Star Super scalar's (StarSs) programming model converts a sequential application in C or Fortran into an efficient parallel program. the resulting parallel code is highly dynamic in the sense that data analysis and task scheduling occur at run-time, while the application executes. In this paper we compare this approach to the strategy adopted by other multi-core programming environments. the prize to pay for dynamic scheduling and dependence tracking is higher runtime overhead. We propose a distributed scheduler for Task Dependence Graphs (TDGs) to attenuate the scheduling cost in heterogeneous multi-core architectures. this scheduler allows the cores to speculatively select tasks from a conservative estimate of the TDG. In case of conflicts or lack of tasks a lightweight centralized scheduler services the faulting core after which the latter resumes its participation in the distributed scheme. Experiments with Cell Super scalar (CellSs) on a representative set of benchmarks demonstrate the reduction in runtime overhead achieved by the distributed scheduler. this reduction in runtime overhead carries over directly to a performance improvement for a large fraction of the benchmarks. © 2011 ieee.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

A sketch-based architecture for mining frequent items and itemsets from distributed data streams 11

A sketch-based architecture for mining frequent items and it...

引用

proceedings of the 2011 11th ieee/ACM International symposium on Cluster, Cloud and Grid Computing

作者： Cesario, Eugenio Grillo, Antonio Mastroianni, Carlo Talia, Domenico Italy Italy

ISBN: (纸本)9780769543956

this paper presents the design and the implementation of an architecture for the analysis of data streams in distributed environments. In particular, data stream analysis has been carried out for the computation of items and item sets that exceed a frequency threshold. the mining approach is hybrid, that is, frequent items are calculated with a single pass, using a sketch algorithm, while frequent item sets are calculated by a further multi-pass analysis. the architecture combines parallel and distributed processing to keep the pace with the rate of distributed data streams. In order to keep computation close to data, miners are distributed among the domains where data streams are generated. the paper also reports the experimental results obtained with a prototype of the architecture, tested on a Grid composed of two domains handling two different data streams. © 2011 ieee.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共354页 << < 67 68 69 70 71 72 73 74 75 76 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：