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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

馆藏范围

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

日期分布

学科分类号

1,393 篇 工学
- 1,180 篇 计算机科学与技术...
- 600 篇 软件工程
- 296 篇 信息与通信工程
- 175 篇 电气工程
- 101 篇 控制科学与工程
- 97 篇 电子科学与技术（可...
- 59 篇 动力工程及工程热...
- 55 篇 机械工程
- 41 篇 仪器科学与技术
- 31 篇 生物工程
- 26 篇 网络空间安全
- 25 篇 生物医学工程（可授...
- 21 篇 建筑学
- 16 篇 环境科学与工程（可...
- 16 篇 安全科学与工程
- 15 篇 光学工程
- 15 篇 土木工程
357 篇 管理学
- 290 篇 管理科学与工程(可...
- 99 篇 图书情报与档案管...
- 95 篇 工商管理
327 篇 理学
- 195 篇 数学
- 63 篇 物理学
- 63 篇 系统科学
- 44 篇 生物学
- 30 篇 统计学（可授理学、...
- 15 篇 化学
26 篇 经济学
- 26 篇 应用经济学
23 篇 法学
- 18 篇 社会学
15 篇 农学
- 14 篇 作物学
15 篇 医学
- 14 篇 临床医学
10 篇 文学
2 篇 艺术学
1 篇 军事学

主题

275 篇 peer to peer com...
237 篇 distributed comp...
203 篇 computer network...
176 篇 wireless sensor ...
132 篇 protocols
131 篇 grid computing
120 篇 cloud computing
107 篇 computational mo...
102 篇 routing
91 篇 delay
89 篇 computer archite...
88 篇 mobile computing
87 篇 servers
81 篇 algorithm design...
79 篇 ad hoc networks
78 篇 mobile communica...
77 篇 bandwidth
75 篇 concurrent compu...
75 篇 network topology
68 篇 computer science

机构

22 篇 institute of com...
16 篇 institute of com...
10 篇 national laborat...
8 篇 school of comput...
8 篇 school of comput...
8 篇 graduate univers...
8 篇 school of comput...
8 篇 school of comput...
7 篇 national laborat...
7 篇 seikei universit...
7 篇 key laboratory o...
6 篇 department of co...
6 篇 rissho universit...
6 篇 national laborat...
6 篇 chinese academy ...
5 篇 key laboratory o...
5 篇 graduate univers...
4 篇 inria
4 篇 department of ma...
4 篇 nokia research c...

作者

8 篇 kurt rothermel
7 篇 zhang desheng
7 篇 makoto takizawa
7 篇 valentin cristea
7 篇 rothermel kurt
6 篇 zomaya albert y.
6 篇 li jinbao
6 篇 ailixier aikebai...
6 篇 frank dürr
5 篇 wei liu
5 篇 tang tao
5 篇 lin yisong
5 篇 min geyong
5 篇 tomoya enokido
5 篇 jin hai
5 篇 guo longjiang
5 篇 kai xiang
5 篇 jiannong cao
4 篇 qishi wu
4 篇 zhang lei

语言

2,386 篇 英文
5 篇 中文
2 篇 其他

检索条件"任意字段=2010 International Conference on Parallel and Distributed Computing and Networks, PDCN 2010"

共 2393 条记录，以下是241-250 订阅

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

详细简洁

排序：

A distributed parallel AdaBoost algorithm for face detection

A distributed parallel AdaBoost algorithm for face detection

引用

2010 IEEE international conference on Intelligent computing and Intelligent Systems, ICIS 2010

作者： Huang, ZheHuang Shi, Xiaodong School of Mathematics Sciences Huaqiao University Quanzhou 362021 China Cognitive Science Department Xiamen University Xiamen 361005 China Fujian Key Laboratory of the Brain-like Intelligent Systems Xiamen 361005 China

ISBN: (纸本)9781424465835

AdaBoost is an excellent machine-learning algorithm, which produces a strong classifier by selecting the discriminating features and combining them linearly. But the computational complexity of AdaBoost algorithms is very high that restricts its studies and applications. In this paper we utilize parallel processing techniques to implement the parallel algorithm based on AdaBoost. The experiment results show the parallel algorithm can reduce the run time and has a high speedup. ©2010 IEEE.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

GMH: A message passing toolkit for GPU clusters

GMH: A message passing toolkit for GPU clusters

引用

16th IEEE international conference on parallel and distributed Systems, ICPADS 2010

作者： Chen, Jie Watson III, William Mao, Weizhen Scientific Computing Group Jefferson Lab. Newport News VA 23606 United States Department of Computer Science College of William and Mary Williamsburg VA 23187 United States

ISBN: (纸本)9780769543079

Driven by the market demand for high-definition 3D graphics, commodity graphics processing units (GPUs) have evolved into highly parallel, multi-threaded, many-core processors, which are ideal for data parallel computing. Many applications have been ported to run on a single GPU with tremendous speedups using general C-style programming languages such as CUDA. However, large applications require multiple GPUs and demand explicit message passing. This paper presents a message passing toolkit, called GMH (GPU Message Handler), on NVIDIA GPUs. This toolkit utilizes a data-parallel thread group as a way to map multiple GPUs on a single host to an MPI rank, and introduces a notion of virtual GPUs as a way to bind a thread to a GPU automatically. This toolkit provides high performance MPI style point-to-point and collective communication, but more importantly, facilitates event-driven APIs to allow an application to be managed and executed by the toolkit at runtime. © 2010 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

A distributed Approach for Top-k Star Queries on Massive Information networks 20

A Distributed Approach for Top-k Star Queries on Massive Inf...

引用

20th IEEE international conference on parallel and distributed Systems (ICPADS)

作者： Jin, Jiahui Khemmarat, Samamon Gao, Lixin Luo, Junzhou Southeast Univ Sch Comp Sci & Engn Nanjing Jiangsu Peoples R China Univ Massachusetts Amherst Dept Elect & Comp Engn Amherst MA USA

ISBN: (纸本)9781479976157

Massive information networks, such as the knowledge graph by Google, contain billions of labeled entities. Star queries, which aim to identify an entity, given a set of related entities, are common on such networks. Answering star queries can be modeled as a graph pattern matching problem. Traditional approaches apply graph indices to accelerate the query processing. Unfortunately, it is so costly that it is nearly infeasible to build indices on billion node graphs since the time or storage complexity of most indexing techniques is super-linear to the graph size. In this paper, we propose an algorithm to identify the top-k best answers for a star query. Instead of using expensive indices, our algorithm utilizes novel bounding techniques to derive the top-k best answers efficiently. Further, the algorithm can be implemented in a distributed manner scaling to billions of entities and hundreds of machines. We demonstrate the effectiveness and the efficiency of our approach through a series of experiments on real-world information networks.

关键词： Top-k Query distributed System Star Query Information Network Billion-Node Graph Big Data

来源：评论

学校读者我要写书评

暂无评论

Cooperate and compete! A hybrid solving strategy for task-parallel SAT solving on Peer-to-Peer Desktop Grids

Cooperate and compete! A hybrid solving strategy for task-pa...

引用

2010 international conference on High Performance computing and Simulation, HPCS 2010

作者： Schulz, Sven Blochinger, Wolfgang University of Stuttgart Universitätsstraße 38 70569 Stuttgart Germany

ISBN: (纸本)9781424468287

The presented work is part of our long-term research goal to develop parallel SAT solving methods for large scale Peer-to-Peer Desktop Grids, which aggregate globally distributed resources. In such a parallel environment, appropriate strategies for dealing with massive parallelism are necessary. In particular, efficiency and at the same time robustness of the parallel methods must be ensured. In this paper, we report on a hybrid strategy for parallel SAT Solving, which combines exploratory and competition parallelism in an adaptive way to meet these goals. ©2010 IEEE.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

Proceedings - IEEE/IFIP international conference on Embedded and Ubiquitous computing, EUC 2010

Proceedings - IEEE/IFIP International Conference on Embedded...

引用

IEEE/IFIP 8th international conference on Embedded and Ubiquitous computing, EUC 2010

ISBN: (纸本)9780769543222

The proceedings contain 125 papers. The topics discussed include: schedule swapping: a technique for temperature management of distributed embedded systems;user-level network protocol stacks for automotive infotainment systems;replay debugging for multi-threaded embedded software;optimizing runtime reconfiguration decisions;architectural support for reducing parallel processing overhead in an embedded multiprocessor;trading conditional execution for more registers on ARM processors;co-simulation of self-adaptive automotive embedded systems;empirical evaluation of content-based pub/sub systems over cloud infrastructure;a reflective service gateway for integrating evolvable sensor-actuator networks with pervasive infrastructure;handling mobility on a QoS-aware service-based framework for mobile systems;trust measurement methods in organic computing systems by direct observation;and rule-based approach for context inconsistency management scheme in ubiquitous computing.

关键词：

来源：评论

学校读者我要写书评

暂无评论

SciCloud: Scientific computing on the cloud 10

SciCloud: Scientific computing on the cloud

引用

10th IEEE/ACM international Symposium on Cluster, Cloud, and Grid computing, CCGrid 2010

作者： Srirama, Satish Batrashev, Oleg Vainikko, Eero Distributed Systems Group Institute of Computer Science University of Tartu J. Liivi 2 Tartu Estonia

ISBN: (纸本)9781424469871

SciCloud is a project studying the scope of establishing private clouds at universities. With these clouds, researchers can efficiently use the already existing resources in solving computationally intensive scientific, mathematical, and academic problems. The project established a Eucalyptus based private cloud and developed several customized images that can be used in solving problems from mobile web services, distributed computing and bio-informatics domains. The poster demonstrates the SciCloud and reveals two applications that are benefiting from the setup along with our research scope and results in scientific computing. © 2010 IEEE.

关键词： Websites

来源：评论

学校读者我要写书评

暂无评论

Experiments with memory-to-memory coupling for end-to-end fusion simulation workflows 10

Experiments with memory-to-memory coupling for end-to-end fu...

引用

10th IEEE/ACM international Symposium on Cluster, Cloud, and Grid computing, CCGrid 2010

作者： Docan, Ciprian Zhang, Fan Parashar, Manish Cummings, Julian Podhorszki, Norbert Klasky, Scott Center for Autonomic Computing Rutgers University Piscataway NJ United States California Institute of Technology 1200 E. California Blvd. Pasadena CA 91125 United States Oak Ridge National Laboratory P.O. Box 2008 Oak Ridge TN 37831 United States

ISBN: (纸本)9781424469871

Scientific applications are striving to accurately simulate multiple interacting physical processes that comprise complex phenomena being modeled. Efficient and scalable parallel implementations of these coupled simulations present challenging interaction and coordination requirements, especially when the coupled physical processes are computationally heterogeneous and progress at different speeds. In this paper, we present the design, implementation and evaluation of a memory-to-memory coupling framework for coupled scientific simulations on high-performance parallel computing platforms. The framework is driven by the coupling requirements of the Center for Plasma Edge Simulation, and it provides simple coupling abstractions as well as efficient asynchronous (RDMA-based) memory-to-memory data transport mechanisms that complement existing parallel programming systems and data sharing frameworks. The framework enables flexible coupling behaviors that are asynchronous in time and space, and it supports dynamic coupling between heterogeneous simulation processes without enforcing any synchronization constraints. We evaluate the performance and scalability of the coupling framework using a specific coupling scenario, on the Jaguar Cray XT5 system at Oak Ridge National Laboratory. © 2010 IEEE.

关键词： parallel programming

来源：评论

学校读者我要写书评

暂无评论

License management in grid and cloud computing

License management in grid and cloud computing

引用

5th international conference on P2P, parallel, Grid, Cloud and Internet computing, 3PGCIC 2010

作者： Raekow, Yona Simmendinger, Christian Grabowski, Piotr Jenz, Domenic Fraunhofer SCAI St. Augustin Germany T-Systems Solutions for Research Stuttgart Germany Poznan Supercomputing and Networking Center Poznan Poland Stuttgart Germany

ISBN: (纸本)9780769542379

The lack of license management schemes in distributed environments is becoming a major obstacle for the commercial adoption of Grid or Cloud infrastructures. In this paper, we present a complete license management architecture that enables a pay-per-use license management which can be deployed together with an on-demand computing scenario. Our architecture enables authenticated access to a remote license server. The license management architecture can be deployed in any distributed environment. It supports existing client/server based software license management tools (for example FlexNet Publisher). This allows an easy transition from current software license business models which support only a local license management towards business models which support license management in distributed environments. © 2010 IEEE.

关键词： Computer architecture

来源：评论

学校读者我要写书评

暂无评论

A distributed wakening based target tracking protocol for wireless sensor networks

A distributed wakening based target tracking protocol for wi...

引用

9th international Symposium on parallel and distributed computing, ISPDC 2010

作者： Alaybeyoglu, Aysegul Dagdeviren, Orhan Kantarci, Aylin Erciyes, Kayhan Celal Bayar University Computer Engineering Department Muradiye Manisa Turkey Izmir Institute of Technology Computer Engineering Department Urla Izmir Turkey Ege University Computer Engineering Department Bornova Izmir Turkey Izmir University Computer Engineering Department Uckuyular Izmir Turkey

ISBN: (纸本)9780769541204

We propose a two layer protocol for tracking fast targets in sensor networks. At the lower layer, the distributed Spanning Tree Algorithm (DSTA) [12] partitions the network into clusters with controllable diameter and constructs a spanning tree backbone of clusterheads rooted at the sink. At the upper layer, we propose a target tracking algorithm which wakes clusters of nodes by using the estimated trajectory beforehand, which is different from existing studies [3] in which target can be detected only when the nodes close to the target are awake. We provide the simulation results and show the effect of fore-waking operation by comparing error and miss ratios of existing approaches with our proposed target tracking algorithm. © 2010 IEEE.

关键词： Clutter (information theory)

来源：评论

学校读者我要写书评

暂无评论

On economic and computational-efficient resource pricing in large distributed systems 10

On economic and computational-efficient resource pricing in ...

引用

10th IEEE/ACM international Symposium on Cluster, Cloud, and Grid computing, CCGrid 2010

作者： Mihailescu, Marian Teo, Yong Meng Department of Computer Science National University of Singapore Computing 1 13 Computing Drive Singapore 117417 Singapore

ISBN: (纸本)9781424469871

There is growing interest in large-scale systems where globally distributed and commoditized resources can be shared and traded, such as peer-to-peer networks, grids, and cloud computing. Users of these systems are rational and maximize their own interest when consuming and contributing shared resources, even if by doing so they affect the overall efficiency of the system. To manage rational users, resource pricing and allocation can provide the necessary incentives for users to behave such that the overall efficiency can be maximized. In this paper, we propose a dynamic pricing mechanism for the allocation of shared resources, and evaluate its performance. In contrast with several existing trading models, our scheme is designed to allocate a request with multiple resource types, such that the user does not have to aggregate different resource types manually. We formally prove the economic properties of our pricing scheme using the mechanism design framework. We perform both theoretical and simulation analysis to evaluate the economic and computational efficiency of the allocation and the scalability of the mechanism. Our simulations are validated against a prototype implementation on PlanetLab. © 2010 IEEE.

关键词： Peer to peer networks

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共240页 << < 21 22 23 24 25 26 27 28 29 30 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：