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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

10,310 篇 会议
249 篇 期刊文献
187 册 图书
2 篇 学位论文

馆藏范围

10,748 篇 电子文献
1 种 纸本馆藏

日期分布

学科分类号

4,858 篇 工学
- 4,307 篇 计算机科学与技术...
- 3,040 篇 软件工程
- 722 篇 电气工程
- 679 篇 信息与通信工程
- 520 篇 控制科学与工程
- 376 篇 电子科学与技术（可...
- 161 篇 机械工程
- 147 篇 动力工程及工程热...
- 98 篇 网络空间安全
- 97 篇 生物工程
- 91 篇 安全科学与工程
- 86 篇 仪器科学与技术
- 79 篇 建筑学
- 71 篇 土木工程
- 71 篇 生物医学工程（可授...
- 64 篇 化学工程与技术
- 57 篇 材料科学与工程（可...
- 54 篇 力学（可授工学、理...
- 54 篇 光学工程
1,330 篇 理学
- 954 篇 数学
- 213 篇 系统科学
- 162 篇 统计学（可授理学、...
- 157 篇 物理学
- 120 篇 生物学
- 67 篇 化学
1,046 篇 管理学
- 827 篇 管理科学与工程(可...
- 409 篇 工商管理
- 252 篇 图书情报与档案管...
120 篇 经济学
- 120 篇 应用经济学
71 篇 法学
- 58 篇 社会学
45 篇 教育学
40 篇 医学
26 篇 农学
14 篇 文学
9 篇 军事学
2 篇 艺术学

主题

1,688 篇 application soft...
899 篇 distributed comp...
874 篇 computer archite...
872 篇 computer science
849 篇 hardware
728 篇 concurrent compu...
668 篇 parallel process...
560 篇 software enginee...
559 篇 computational mo...
446 篇 real time system...
345 篇 runtime
326 篇 costs
324 篇 software systems
319 篇 processor schedu...
317 篇 fault tolerance
315 篇 resource managem...
292 篇 software
289 篇 operating system...
287 篇 scalability
283 篇 bandwidth

机构

35 篇 school of comput...
23 篇 ibm thomas j. wa...
22 篇 department of co...
21 篇 school of softwa...
20 篇 college of compu...
20 篇 school of electr...
19 篇 state key labora...
19 篇 department of el...
19 篇 department of co...
18 篇 department of co...
16 篇 school of comput...
15 篇 department of el...
15 篇 department of co...
15 篇 department of co...
15 篇 department of co...
14 篇 department of el...
14 篇 beijing jiaotong...
13 篇 department of co...
13 篇 school of comput...
13 篇 institute of inf...

作者

20 篇 m. takizawa
20 篇 rajkumar buyya
20 篇 k.h. kim
18 篇 dhabaleswar k. p...
18 篇 jack dongarra
17 篇 m. kandemir
17 篇 h.j. siegel
16 篇 a. choudhary
14 篇 m. parashar
14 篇 howard jay siege...
13 篇 l.r. welch
13 篇 parashar manish
13 篇 gao guang r.
12 篇 dongarra jack
12 篇 h. casanova
12 篇 hari subramoni
12 篇 welch lonnie r.
12 篇 xiao qin
12 篇 maciejewski anth...
11 篇 jun wang

语言

10,444 篇 英文
268 篇 其他
34 篇 中文
1 篇 西班牙文
1 篇 法文
1 篇 葡萄牙文

检索条件"任意字段=International Symposium on Software Engineering for Parallel and Distributed Systems"

共 10748 条记录，以下是3751-3760 订阅

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

详细简洁

排序：

A communication-avoiding, hybrid-parallel, rank-revealing orthogonalization method

A communication-avoiding, hybrid-parallel, rank-revealing or...

引用

25th IEEE international parallel and distributed Processing symposium, IPDPS 2011

作者： Hoemmen, Mark Scalable Algorithms Department Sandia National Laboratories MS 1320 P.O. Box 5800 Albuquerque NM 87185-1320 United States

ISBN: (纸本)9780769543857

Orthogonalization consumes much of the run time of many iterative methods for solving sparse linear systems and eigenvalue problems. Commonly used algorithms, such as variants of Gram-Schmidt or Householder QR, have performance dominated by communication. Here, "communication" includes both data movement between the CPU and memory, and messages between processors in parallel. Our Tall Skinny QR (TSQR) family of algorithms requires asymptotically fewer messages between processors and data movement between CPU and memory than typical orthogonalization methods, yet achieves the same accuracy as Householder QR factorization. Furthermore, in block orthogonalizations, TSQR is faster and more accurate than existing approaches for orthogonalizing the vectors within each block ("normalization"). TSQR's rank-revealing capability also makes it useful for detecting deflation in block iterative methods, for which existing approaches sacrifice performance, accuracy, or both. We have implemented a version of TSQR that exploits both distributed-memory and shared-memory parallelism, and supports real and complex arithmetic. Our implementation is optimized for the case of orthogonalizing a small number (5 - 20) of very long vectors. The shared-memory parallel component uses Intel's Threading Building Blocks, though its modular design supports other shared-memory programming models as well, including computation on the GPU. Our implementation achieves speedups of 2 times or more over competing orthogonalizations. It is available now in the development branch of the Trilinos software package, and will be included in the 10.8 release. © 2011 IEEE.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

Searching in Internet of Things: Vision and challenges

Searching in Internet of Things: Vision and challenges

引用

9th IEEE international symposium on parallel and distributed Processing with Applications, ISPA 2011

作者： Zhang, Daqiang Yang, Laurence T. Huang, Hongyu School of Computer Science Nanjing Normal University Nanjing China Jiangsu Research Center of Information Security and Confidential Engineering Nanjing China Department of Computer Science St. Francis Xavier University Antigonish Canada Department of Computer Science Chongqing University Chongqing China

ISBN: (纸本)9780769544281

This paper discusses the challenges in searching imposed by the burgeoning field of Internet of Things (IoT). It first overviews the evolution of the new field to its predecessors: searching in the mobile computing, ubiquitous computing and information retrieve. Then, it identifies four research thrusts: architecture design, search locality, real-time and scalability. It also sketches several presumptive IoT scenarios, and uses them to identify key capabilities missing in today's systems. This paper concludes with a discussion of the research necessary to design and develop these capabilities. In addition, this paper proposes a series of measurement dimensions, based on which it investigates the state-of-the-art efforts. © 2011 IEEE.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

parallelization of the training for face detection with transactional memory

Parallelization of the training for face detection with tran...

引用

2011 international Conference on Automation and Robotics, ICAR 2011

作者： Zeng, Kun Key Laboratory and Technology for National Defence of Parallel and Distributed Processing School of Computer National Univiersity of Defense Technology ChangSha Hunan China

ISBN: (纸本)9783642256455

The development of multi-core processor makes the parallelization of traditional sequential algorithms increasingly important. Meanwhile, transactional memory serves a good parallel programming model. This paper takes the advantage of software transactional memory to parallelize the Multi-Exit Asymmetric Adaboost algorithm for face detection. The parallel version is evaluated on three different implementations of software transactional memory. The experiment results show that the transactional memory based parallelization outperforms the traditional lock based approach. A speedup of nearly seven is achieved on a eight-core machine on an eight-core system. © 2011 Springer-Verlag.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

Proceedings - 6th international symposium on parallel Computing in Electrical engineering, PARELEC 2011

Proceedings - 6th International Symposium on Parallel Comput...

引用

6th international symposium on parallel Computing in Electrical engineering, PARELEC 2011

ISBN: (纸本)9780769543970

The proceedings contain 33 papers. The topics discussed include: static average case analysis fork-join framework programs based on MOQA method;parallelizing a coarse grain graph search problem based upon LDPC codes on a supercomputer;an approach towards automation firmware modeling for an exploration and evaluation of efficient parallelization alternatives;communication on the fly for hierarchical systems of chip multi-processors;optimizing heterogeneous 3D networks-on-chip;a dynamic core grouping approach to improve raw architecture many-core processor performance;event-driven scheduling for parallel stream processing;optimal placement of the wind generators in the medium voltage power grid;potential of general purpose graphic processing unit for energy management system;goal-oriented adaptive workload management for irregular applications;and distributed program control flow and behavior governed by global states monitoring.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Attic: A case study for distributing data in BOINC projects

Attic: A case study for distributing data in BOINC projects

引用

25th IEEE international parallel and distributed Processing symposium, Workshops and Phd Forum, IPDPSW 2011

作者： Elwaer, AbdelHamid Harrison, Andrew Kelley, Ian Taylor, Ian School Of computer Science and Informatics Cardiff University Cardiff United Kingdom

ISBN: (纸本)9780769543857

The BOINC toolkit is a very successful software infrastructure for the development of "volunteer computing" projects. For data distribution, the standard BOINC architecture provides uses a centralized server, or fixed set of pre-configured servers, each with a copy of a project's input files. This mirrored configuration has provided a way for BOINC projects to increase the size of their user-base and manage their data as projects grow. However, such a centrally administered approach can be limiting in terms of performance metrics, such as scalability and reliability, and also for management, since such servers have to be manually installed and configured for use. In this paper, we study an alternative approach, which is capable of providing a more lightweight and dynamic environment for distributing data, called Attic. Attic makes use of a secure decentralized approach and BitTorrent-like file swarming techniques to serve data and manage load. To compare our approach to the current centralized infrastructure, we show three experiments where we have integrated Attic with BOINC;each compares how Attic performs against BOINC as fragments (chunks) of the original data file are distributed and downloaded concurrently from multiple data centers. Our results show that careful choice of chunk size, by analyzing a server's uploading capabilities and file size, can result in large throughput gains for Attic when compared to the current BOINC data distribution paths. © 2011 IEEE.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Completely distributed particle filters for target tracking in sensor networks

Completely distributed particle filters for target tracking ...

引用

25th IEEE international parallel and distributed Processing symposium, IPDPS 2011

作者： Jiang, Bo Ravindran, Binoy Department of Electrical and Computer Engineering Virginia Tech. Blacksburg VA 24061 United States

ISBN: (纸本)9780769543857

Particle filters (or PFs) are widely used for the tracking problem in dynamic systems. Despite their remarkable tracking performance and flexibility, PFs require intensive computation and communication, which are strictly constrained in wireless sensor networks (or WSNs). Thus, distributed particle filters (or DPFs) have been studied to distribute the computational workload onto multiple nodes while minimizing the communication among them. However, weight normalization and resampling in generic PFs cause significant challenges in the distributed implementation. Few existing efforts on DPF could be implemented in a completely distributed manner. In this paper, we design a completely distributed particle filter (or CDPF) for target tracking in sensor networks, and further improve it with neighborhood estimation toward minimizing the communication cost. First, we describe the particle maintenance and propagation mechanism, by which particles are maintained on different sensor nodes and propagated along the target trajectory. Then, we design the CDPF algorithm by adjusting the order of PFs' four steps and leveraging the data aggregation during particle propagation. Finally, we develop a neighborhood estimation method to replace the measurement broadcasting and the calculation of likelihood functions. With this approximate estimation, the communication cost of DPFs can be minimized. Our experimental evaluations show that although CDPF incurs about 50% more estimation error than semi-distributed particle filter (or SDPF), its communication cost is lower than that of SDPF by as much as 90%. © 2011 IEEE.

关键词： Target tracking

来源：评论

学校读者我要写书评

暂无评论

Model-driven runtime resource predictions for advanced mechatronic systems with dynamic data structures

Model-driven runtime resource predictions for advanced mecha...

引用

13th IEEE international symposium on Object/Component/Service-Oriented Real-Time distributed Computing (ISORC)

作者： Henkler, Stefan Oberthuer, Simon Giese, Holger Seibel, Andreas OFFIS Oldenburg EE Architecture Anal & Design Software Engn Grp D-26121 Oldeburg Germany Univ Paderborn Heinz Nixdorf Inst Syst Res Grp D-33098 Paderborn Germany Univ Potsdam Hasso Plattner Insitute Syst Anal & Modeling Grp D-14482 Potsdam Germany

ISBN: (纸本)9780769540375

The next generation of advanced mechatronic systems is expected to enhance their functionality and improve their performance by context-dependent behavior. Therefore, these systems require to represent information about their complex environment and changing sets of collaboration partners internally. This requirement is in contrast to the usually assumed static structures of embedded systems. In this paper, we present a model-driven approach which overcomes this situation by supporting dynamic data structures while still guaranteeing that valid worst-case execution times can be derived. It supports a flexible resource manager which avoids to operate with the prohibitive coarse worst-case boundaries but instead supports to run applications in different profiles which guarantee different resource requirements and put unused resources in a profile at other applications' disposal. By supporting the proper estimation of worst case execution time (WCET) and worst case number of iteration (WCNI) at runtime, we can further support to create new profiles, add or remove them at runtime in order to minimize the over-approximation of the resource consumption resulting from the dynamic data structures required for the outlined class of advanced systems.

关键词： Model-Driven engineering Safety Critical systems Dynamic Data Structures Flexible Resource Manager Runtime WCET Analysis

来源：评论

学校读者我要写书评

暂无评论

Middleware Support for Complex and distributed Security Services in Multi-tier Web Applications

Middleware Support for Complex and Distributed Security Serv...

引用

3rd international symposium on engineering Secure software and systems, ESSoS 2011

作者： De Ryck, Philippe Desmet, Lieven Joosen, Wouter Katholieke Univ Leuven IBBT DistriNet B-3001 Louvain Belgium

ISBN: (纸本)9783642191244

The security requirements of complex multi-tier web applications have shifted from simple localized needs, such as authentication or authorization, to physically distributed but actually aggregated services, such as end-to-end data protection, non-repudiation or patient consent management. Currently, there is no support for integrating complex security services in web architectures, nor are approaches from other architectural models easily portable. In this paper we present the architecture of a security middleware, aimed at providing a reusable solution bringing support for complex security requirements into the application architecture, while addressing typical web architecture challenges, such as the tiered model or the lack of sophisticated client-side logic. We both evaluate the security of the middleware and present a case study and prototype implementation, which show how the complexities of a web architecture can be dealt with while limiting the integration effort.

关键词： middleware multi-tier architecture security web application non-repudiation

来源：评论

学校读者我要写书评

暂无评论

Large volume testing for executable formal specification using hadoop

Large volume testing for executable formal specification usi...

引用

25th IEEE international parallel and distributed Processing symposium, Workshops and Phd Forum, IPDPSW 2011

作者： Kusakabe, Shigeru Grad. School of Info. Sci. and Electrical Engineering Kyushu University Fukuoka 819-0395 Japan

ISBN: (纸本)9780769543857

Formal methods are mathematically-based techniques for specifying, developing and verifying a component or system, in order to increase the confidence regarding to the reliability and robustness of the target. Formal methods can be used at different levels with different techniques, and one approach is to use model-oriented formal languages such as VDM languages in writing specifications. During model development, we can test executable specifications in VDM-SL and VDM. In a lightweight formal approach, we test formal specifications to increase our confidence as we do in implementing software codes with conventional programming languages. While the specific level of rigor depends on the aim of the project, millions of tests may be conducted in developing highly reliable mission-critical software in a light-weight formal approach. In this paper, we introduce our approach to supporting large volume of testing for executable formal specifications using Hadoop, an implementation of MapReduce programming model. We are able to automatically distribute interpretation of specifications in VDM languages by using Hadoop. We also apply a property-based data-driven testing tool, QuickCheck, over MapReduce so that specification can be checked with thousands of tests by using formally described pre/post conditions and invariant functions. As an advanced property-based data-driven testing approach, we also discuss model-based testing. We observed scalable performance in testing large amount of data for executable specifications in our approaches. © 2011 IEEE.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

Prolonging the lifetime of wireless sensor networks using multi-level clustering and heterogeneity

Prolonging the lifetime of wireless sensor networks using mu...

引用

作者： Soni, Surender Katiyar, Vivek Department of Computer Science and Engineering National Institute of Technology Hamirpur - 177 005 India

ISBN: (纸本)9789604742776

Clustering in wireless sensor networks (WSNs) is an important technique to prolong lifetime of a WSN. This paper proposes energy efficient multi-level clustering scheme called Power Aware Multi-level Clustering (PAMC) for homogeneous wireless sensor networks. Further, we also apply the proposed multi-level clustering scheme for heterogeneous wireless sensor networks. Due to large area of deployment, the network needs to have a multi-level clustering protocol that will enable far-off nodes to communicate with the base station. Simulation is used to analyze the proposed protocols and compare the performance with existing protocol EEMC. Simulation results demonstrate that our proposed protocols are effective in prolonging the network lifetime.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 372 373 374 375 376 377 378 379 380 381 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：