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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 篇 会议
252 篇 期刊文献
187 册 图书
2 篇 学位论文

馆藏范围

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

日期分布

学科分类号

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

主题

1,688 篇 application soft...
899 篇 distributed comp...
876 篇 computer archite...
873 篇 computer science
849 篇 hardware
728 篇 concurrent compu...
668 篇 parallel process...
559 篇 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,619 篇 英文
96 篇 其他
34 篇 中文
1 篇 西班牙文
1 篇 法文
1 篇 葡萄牙文

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

共 10751 条记录，以下是3901-3910 订阅

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

详细简洁

排序：

An auto-tuning solution to data streams clustering in OpenCL

An auto-tuning solution to data streams clustering in OpenCL

引用

14th IEEE Int. Conf. on Computational Science and engineering, CSE 2011, the 11th international symposium on Pervasive systems, Algorithms, and Networks, I-SPAN 2011, and the 10th IEEE Int. Conf. on Ubiquitous Computing and Communications, IUCC 2011

作者： Fang, Jianbin Varbanescu, Ana Lucia Sips, Henk Parallel and Distributed Systems Group Delft University of Technology Delft Netherlands

ISBN: (纸本)9780769544779

Due to its applicability to numerous types of data, including telephone records, web documents, and click streams, the data stream model has recently attracted attention. For analysis of such data, it is crucial to process the data in a single pass, or a small number of passes, using little memory. This paper provides an OpenCL implementation for data streams clustering, and then presents several optimizations for it, which make it more efficient in terms of memory usage. In order to maximize performance for different problem sizes and architectures, we also propose an auto-tuning solution. Experimental results show that our fully optimized implementation can perform 2.1x and 1.4x faster than the native OpenCL implementation on NVIDIA GTX480 and AMD HD5870, respectively, it can also achieve 1.4x to 3.3x speedup relative to the original CUDA implementation solution on GTX480. © 2011 IEEE.

关键词： Auto-tuning Clustering Data Streams OpenCL Performance Optimizations

来源：评论

学校读者我要写书评

暂无评论

Design of a robot cloud center

Design of a robot cloud center

引用

international Workshop on Assurance in distributed systems and Networks

作者： Du, Zhihui Yang, Weiqiang Chen, Yinong Sun, Xin Wang, Xiaoying Xu, Chen Tsinghua National Laboratory for Information Science and Technology Department of Computer Science and Technology Tsinghua University 100084 Beijing China School of Software and Microelectronics Peking University 102600 Beijing China School of Computing Informatics and Decision Systems Engineering Arizona State University Tempe AZ 85287 United States Department of Computer Technology and Application Qinghai University Xining Qinghai 810016 China International School Beijing University of Posts and Telecommunications 102209 Beijing China

ISBN: (纸本)9780769543499

Service-oriented architecture and cloud computing have become the prevalent computing paradigm. In this paradigm, computing resources can be accessed like other utility services available in today's society. In the meantime, robotics applications are joining the trend. More and more robot applications are shifting from manufacture to non-manufacture and service industries. However, for the on-demand supply of the large-scale heterogeneous robots, It is still a problem have not yet been studied, including the fundamental management and efficiency issues in using of these resources. In this paper, we design a framework of "Robot Cloud Center" (RCC) following the general cloud computing paradigm to address the current limitations in capacity and versatility of robotic applications. In this framework, a robot can be provided as a service just like a public utility service so that everyone can access the powerful robotic services easily, efficiently, and cheaply. Based on a given scenario, a robot scheduling algorithm in RCC is proposed to take advantage of the heterogeneous robot resources to meet the end user's requirement with the minimum cost.

关键词： Robot programming

来源：评论

学校读者我要写书评

暂无评论

A Hierarchical Middleware Architecture for Efficient Home Control through an IPv6-Based Global Network

A Hierarchical Middleware Architecture for Efficient Home Co...

引用

international symposium on parallel and distributed Processing with Applications, ISPA

作者： Sang Oh Park Tae Hoon Do Sung Jo Kim School of Computer Science and Engineering Chung-Ang University Seoul South Korea

A cyber physical systems (CPS) are deeply embedded systems that can be applied to home devices, medical equipments, cars, and etc. Since it is expected that a CPS system will be integrated with other CPSes designed for various areas to ultimately create a global CPS network covering a global network, IPv6 is suitable to these large-scaled integrated network environments. This paper proposes a hierarchical middleware architecture for an efficient search and control of home devices on an IPv6-based global network from anywhere through smart phones along with a new mechanism intended to drastically reduce the number of messages that are generated for searching devices.

关键词： High definition video XML Home automation Smart phones Middleware Hardware Performance evaluation

来源：评论

学校读者我要写书评

暂无评论

A Two-Level Caching Protocol for Hierarchical Peer-to-Peer File Sharing systems

A Two-Level Caching Protocol for Hierarchical Peer-to-Peer F...

引用

international symposium on parallel and distributed Processing with Applications, ISPA

作者： Qiying Wei Tingting Qin Satoshi Fujita Department of Information Engineering Graduate School of Engineering Hiroshima University Japan

In hierarchical Peer-to-Peer (P2P) systems, several selected peers are promoted as super-peers to provide an efficient lookup service for the ordinary peers, although it would cause a service bottleneck and a heavy workload at the point of the promoted peers. In this paper, we propose a two-level caching architecture consisting of level-1 cache and level-2 cache to relax such bottlenecks in hierarchical P2Ps. Each cache is partitioned into two parts so that it could manage both of static and dynamic data in a space-efficient manner, where static data indicates popular pages which are frequently requested by many users and dynamic data indicates pages which may not be popular but repeatedly requested during a short time period. The performance of the proposed method is evaluated by simulation. The result indicates that our caching protocol significantly reduces the network traffic and exhibits a high hit rate even in small cache sizes.

关键词： Peer to peer computing Protocols Servers Search engines Probabilistic logic Concrete Frequency estimation

来源：评论

学校读者我要写书评

暂无评论

Energy-efficient workflow distribution 11

Energy-efficient workflow distribution

引用

Proceedings of the 5th international Conference on Communication System software and Middleware

作者： Fischer, Daniel Föll, Stefan Herrmann, Klaus Rothermel, Kurt Institute of Parallel and Distributed Systems Universität Stuttgart Universitätsstrasse 38 70569 Stuttgart Germany

ISBN: (纸本)9781450305600

Pervasive computing and business process modeling are increasingly joining forces, as mobile human users shall be seamlessly integrated into business processes. In respective scenarios, humans use mobile devices and wireless technology to interact with workflows running in a powerful back-end infrastructure. However, the frequent interaction between humans and workflows causes a high communication overhead and, thus, high energy consumption on mobile devices. This impacts the usability and efficiency of the business process due to rapidly drained batteries and the resulting short life-times of the devices and applications. We present an approach based on a minimum-cut algorithm for reducing costly data transmissions during workflow execution by distributing parts of a workflow to the users' devices. Our motivation is to reduce the energy consumption on the mobile devices and, thus, avoid draining batteries in the field. We prove that our algorithm finds the optimal solution for a given network and workflow, decreasing the energy consumed on mobile devices by 32-37% compared to an approach where the entire workflow is executed in the infrastructure. Thus, in typical domains like logistics and health care, one third of the energy can be saved. This either means that devices have to be charged less frequently, leading to less distraction in the business process, or that mobile device specifications can be lowered. Significant cost reductions result in both cases. © 2011 ACM.

关键词： Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

Application of an ERM Framework and Its Real-Time System to Disaster Risk Management

Application of an ERM Framework and Its Real-Time System to ...

引用

IEEE international symposium on parallel and distributed Processing with Applications Workshops (ISPAW)

作者： Taeho Park Beom-Cheol Park Dhong Ha Lee Jae-Bong Kim Organization and Management San Jose State University Foundation San Jose USA CyberLogitec Co. Ltd. Seoul South Korea Industrial Information Engineering University of Suwon Suwon South Korea Division of International Trade and Economics Korea Maritime University Busan South Korea

The growing risks of economic, societal, and environmental losses from disasters increase a need for a system to prevent, mitigate, or deal with disasters. However, past research revealed that there are few practical tools and systems available to manage the risk of disasters. This research is to apply an Enterprise Risk Management (ERM) framework to disaster risk management for preventing, assessing, mitigating, preparing, controlling, and monitoring disaster risks, and then to show a possibility to use a real-time ERM system to manage the disaster risks.

关键词： Risk management Real time systems Monitoring Disaster management Companies Standards

来源：评论

学校读者我要写书评

暂无评论

Profiling Heterogeneous Multi-GPU systems to Accelerate Cortically Inspired Learning Algorithms

Profiling Heterogeneous Multi-GPU Systems to Accelerate Cort...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： Andrew Nere Atif Hashmi Mikko Lipasti Department of Electrical and Computer Engineering University of Wisconsin Madison Madison WI USA

Recent advances in neuroscientific understanding make parallel computing devices modeled after the human neocortex a plausible, attractive, fault-tolerant, and energy-efficient possibility. Such attributes have once again sparked an interest in creating learning algorithms that aspire to reverse-engineer many of the abilities of the brain. In this paper we describe a GPGPU-accelerated extension to an intelligent learning model inspired by the structural and functional properties of the mammalian neocortex. Our cortical network, like the brain, exhibits massive amounts of processing parallelism, making today's GPGPUs a highly attractive and readily-available hardware accelerator for such a model. Furthermore, we consider two inefficiencies inherent to our initial design: multiple kernel-launch overhead and poor utilization of GPGPU resources. We propose optimizations such as a software work-queue structure and pipelining the hierarchical layers of the cortical network to mitigate such problems. Our analysis provides important insight into the GPU architecture details including the number of cores, the memory system, and the global thread scheduler. Additionally, we create a runtime profiling tool for our parallel learning algorithm which proportionally distributes the cortical network across the host CPU as well as multiple GPUs, whether homogeneous or heterogeneous, that may be available to the system. Using the profiling tool with these optimizations on Nvidia's CUDA framework, we achieve up to 60× speedup over a single-threaded CPU implementation of the model.

关键词： Brain models Graphics processing unit Computational modeling Biological system modeling Neurons

来源：评论

学校读者我要写书评

暂无评论

Optimizing Large-Scale Graph Analysis on a Multi-threaded, Multi-core Platform

Optimizing Large-Scale Graph Analysis on a Multi-threaded, M...

引用

international symposium on parallel and distributed Processing (IPDPS)

作者： Guojing Cong Konstantin Makarychev IBM Thomas J. Watson Research Center Yorktown Heights NY USA

The erratic memory access pattern makes it hard to implement fast large-scale graph analysis. Although algorithms of fine-grain parallelism seem to benefit from multithreading, it is unclear whether the long memory latency of such workload is fully masked on current systems, and if not, whether improving locality brings any performance benefit, especially when the cache is simple. We optimize several fundamental graph algorithms on a multi-threaded, multi-core platform, with simple caches. Although the naive implementation scales, we show nonetheless the number of hardware threads is insufficient to fully mask the memory latency for typical graph analysis workload and the processor is unlikely to be fully utilized. In optimizing for cache performance, we show that known cache-friendly designs that prove effective on traditional architectures do not perform well on this platform. We explore low-cost measures such as software prefetching and manipulating the storage of the input to improve performance. Our results show that compared with the original implementation speedups between 10% and 200% are achieved at different number of threads with our optimization.

关键词： Prefetching Hardware Pipelines Computer architecture software algorithms

来源：评论

学校读者我要写书评

暂无评论

Exploiting Module Locality to Improve software Fault Prediction

Exploiting Module Locality to Improve Software Fault Predict...

引用

IEEE international symposium on parallel and distributed Processing with Applications Workshops (ISPAW)

作者： Cheng-Zen Yang Ing-Xiang Chen Chin-Sung Fan-Chiang Department of Computer Science and Engineering Yuan-Ze University Chungli Taiwan Telcordia Applied Research Centre-Taiwan Telcordia Technologies Inc. Piscataway NJ USA

Receiving bug reports, developers usually need to spend significant amount of time resolving where to fix the faults. Although previous studies have shown that the revision frequency of a file location is an important measure to reflect the possibility of containing bugs, the frequency-based approaches achieve limited prediction accuracy for file locations having low revision frequencies. Our empirical observations show that the files of low revision frequencies in the same file directory or package of the files of high revision frequencies may be potential bug-fixing candidates for future bug reports. In this paper, we present a novel enhancement by exploiting module locality to improve the frequency-based approaches. Our experiments on three open source projects reveal that module locality can be employed to consistently improve the hit rate of a frequency-based approach and achieve the highest improvement of about 14%.

关键词： software Accuracy Computer bugs Measurement History Complexity theory Predictive models

来源：评论

学校读者我要写书评

暂无评论

Detecting and correcting the index of DAE by the combinatorial relaxation algorithm

Detecting and correcting the index of DAE by the combinatori...

引用

2011 IEEE 10th international symposium on distributed Computing and Applications to Business,engineering(第十届电子商务、工程及科学领域的分布式计算和应用国际学术研讨会 DCABES 2011)

作者： Xiaolei Zhang Yongxin Yan Xuesong Wu Jianwen Cao International School Beijing University of Posts and Telecommunications Beijing China Laboratory of Parallel Software and ComputationalScience the Institute of SoftwareChinese Academy o Laboratory of Parallel Software and Computational Science the Institute of Software Chinese Academ

The mathematical modeling and simulation based on the Modelica language usually gets a high-index differential-algebraic equation (DAE) system. The structural index reduction algorithms can serve as a fast method to reduce such high-indexed issues. In order to solve the failure of the structural index reduction algorithms in some cases, the combinatorial 1relaxation algorithm is analyzed and studied. Finally, the result of an example shows the combinatorial relaxation algorithm is an effective way to improve the stability of the index reduction algorithms based on the structural index of DAE.

关键词： Modelica differential-algebraic equation index reduction combinatorial relaxation algorithm

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 387 388 389 390 391 392 393 394 395 396 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：