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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是651-660 订阅

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

详细简洁

排序：

Restricted duplication based MILP formulation for scheduling task graphs on unrelated parallel machines

Restricted duplication based MILP formulation for scheduling...

引用

5th International symposium on parallel Architectures, Algorithms and Programming (PAAP)

作者： Singh, Jagpreet Mangipudi, Bhargav Betha, Sandeep Auluck, Nitin Indian Inst Technol Ropar Dept Comp Sci & Engn Rupnagar 140001 India

ISBN: (纸本)9780769548982;9781467345668

Duplication has proved to be a vital technique for scheduling task graphs on a network of unrelated parallel machines. Few attempts have been made to model duplication in a Mixed Integer Linear Program (MILP) to reduce schedule length. Other known optimal MILPs duplicate a job on all the available processing elements and this increases their complexities. this paper proposes a new REStricted Duplication (RESDMILP) approach to model duplication in a MILP. the complexity of this model increases with the increase in the amount of duplication. Experiments conducted have revealed that RESDMILP achieves better runtimes when the problem instance is solved optimally and provides better lower bound and percentage gap if it is run for a fixed amount of time. the percentage gap is defined as, (UB-LB)/UB where UB and LB are the upper and lower bounds achieved by the MILPs respectively.

关键词： MILP Scheduling Heterogeneous Duplication Multiprocessors

来源：评论

学校读者我要写书评

暂无评论

Topology-aware deployment of scientific applications in cloud computing

Topology-aware deployment of scientific applications in clou...

引用

2012 ieee 5th International Conference on Cloud Computing, CLOUD 2012

作者： Fan, Pei Chen, Zhenbang Wang, Ji Zheng, Zibin Lyu, Michael R. National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha 410073 China Dept. of Computer Science and Engineering Chinese University of Hong Kong Hong Kong Hong Kong

ISBN: (纸本)9780769547558

Nowadays, more and more scientific applications are moving to cloud computing. the optimal deployment of scientific applications is critical for providing good services to users. Scientific applications are usually topology-aware applications. therefore, considering the topology of a scientific application during the development will benefit the performance of the application. However, it is challenging to automatically discover and make use of the communication pattern of a scientific application while deploying the application on cloud. To attack this challenge, in this paper, we propose a framework to discover the communication topology of a scientific application by pre-execution and multi-scale graph clustering, based on which the deployment can be optimized. Comprehensive experiments are conducted by employing a well-known MPI benchmark and comparing the performance of our method with those of other methods. the experimental results show the effectiveness of our topology-aware deployment method. © 2012 ieee.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Hybrid Mode Radio Link Control for Efficient Video Transmission over 4G/LTE Network

Hybrid Mode Radio Link Control for Efficient Video Transmiss...

引用

ieee 18th International Conference on parallel and distributed Systems (ICPADS)

作者： Tirouvengadam, Balaaji Nayak, Amiya Univ Ottawa Sch Elect Engn & Comp Sci Ottawa ON K1N 6N5 Canada

ISBN: (纸本)9781467345651;9780769549033

Accessing video content on mobile devices has become widespread in recent years. the wireless network has to become content aware in order to offer enhanced quality of video service through efficient utilisation of the wireless spectrum. this paper proposes a scheme for end-to-end video transmission over Long Term Evolution (LTE) network. the network elements are made aware of the critical video frames that are transmitted through the network with the help of a field in Internet Protocol (IP) header which reduces the processing time. A new mode of operation called Hybrid Mode (HM) for Radio Link Control (RLC) of evolved NodeB (eNodeB) has been defined to ensure the reliable delivery of critical video frames which in turn increase the video quality. the simulation results with the proposed scheme show a 7% increase in received video quality in comparison to the legacy Unacknowledged Mode (UM) of RLC. the proposed scheme also removes the major jitter and provides a reduction in end-to-end delay by 99% when compared with the Acknowledged Mode (AM).

关键词： Radio Link Control Content Aware H.264 AVC Video Streaming 4G/LTE Networks

来源：评论

学校读者我要写书评

暂无评论

Multithreaded algorithms for maxmum matching in bipartite graphs

Multithreaded algorithms for maxmum matching in bipartite gr...

引用

2012 ieee 26th International parallel and distributed processing symposium, IPDPS 2012

作者： Azad, Ariful Halappanavar, Mahantesh Rajamanickam, Sivasankaran Boman, Erik G. Khan, Arif Pothen, Alex Purdue University United States Pacific Northwest National Laboratory United States Sandia National Laboratories United States

ISBN: (纸本)9780769546759

We design, implement, and evaluate algorithms for computing a matching of maximum cardinality in a bipartite graph on multicore and massively multithreaded computers. As computers with larger numbers of slower cores dominate the commodity processor market, the design of multithreaded algorithms to solve large matching problems becomes a necessity. Recent work on serial algorithms for the matching problem has shown that their performance is sensitive to the order in which the vertices are processed for matching. In a multithreaded environment, imposing a serial order in which vertices are considered for matching would lead to loss of concurrency and performance. But this raises the question: Would parallel matching algorithms on multithreaded machines improve performance over a serial algorithm? We answer this question in the affirmative. We report efficient multithreaded implementations of three classes of algorithms based on their manner of searching for augmenting paths: breadth-first-search, depth-first-search, and a combination of both. the Karp-Sipser initialization algorithm is used to make the parallel algorithms practical. We report extensive results and insights using three shared-memory platforms (a 48-core AMD Opteron, a 32-coreIntel Nehalem, and a 128-processor Cray XMT) on a representative set of real-world and synthetic graphs. To the best of our knowledge, this is the first study of augmentation-based parallel algorithms for bipartite cardinality matching that demonstrates good speedups on multithreaded shared memory multiprocessors. © 2012 ieee.

关键词： parallel algorithms

来源：评论

学校读者我要写书评

暂无评论

Using of environment's dynamic geometric models for solving the mobile robot SLAM problem

Using of environment's dynamic geometric models for solving ...

引用

5th International symposium on Communications Control and Signal processing, ISCCSP 2012

作者： Babakina, Nadezhda A. Kolesnikov, Maxim P. St. Petersburg State Polytechnic University Distributed Intelligent Systems Department 28 Grazhdansky Pr. St. Petersburg 195220 Russia

ISBN: (纸本)9781467302760

In this paper the problem of environment geometric model making is considered. this problem is main part of global issue for mobile robots task-oriented moving in random non-stationary environments. We propose an approach to making of tree-type dynamic structures for environment description, based on two or more input video channels. Such structures allow to uniquely describe the position of the robot and surrounding objects in the relative coordinate system. Mobile robot position changes lead to the realize of tree structures dynamic properties and allow to modify local detailing level. © 2012 ieee.

关键词： Computer vision

来源：评论

学校读者我要写书评

暂无评论

proceedings - 12th ieee/ACM International symposium on Cluster, Cloud and Grid Computing, CCGrid 2012

Proceedings - 12th IEEE/ACM International Symposium on Clust...

引用

12th ieee/ACM International symposium on Cluster, Cloud and Grid Computing, CCGrid 2012

ISBN: (纸本)9780769546919

the proceedings contain 137 papers. the topics discussed include: design and implementation of portable and efficient non-blocking collective communication;productive parallel linear algebra programming with unstructured topology adaption;user transparent data and task parallel multimedia computing with pyxis-DT;fine-grained access control in the chirp distributed file system;a map-reduce based framework for heterogeneous processing element cluster environments;workflow scheduling to minimize data movement using multi-constraint graph partitioning;decentralized orchestration of data-centric workflows using the object modeling system;evaluating dynamics and bottlenecks of memory collaboration in cluster systems;GPU performance enhancement via communication cost reduction: case studies of radix sort and WSN relay node placement problem;and client classification policies for SLA enforcement in shared cloud datacenters.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Incremental decode and forward relaying using distributed space time coding

Incremental decode and forward relaying using distributed sp...

引用

5th International symposium on Communications Control and Signal processing, ISCCSP 2012

作者： Mabrouk, Ons Boujemaa, Hatem Higher School of Communications of Tunis TECHTRA Research Unit Carthage University Tunisia

ISBN: (纸本)9781467302760

distributed space time coding (DSTC) is an efficient way to exploit spatial diversity for cooperative system. In regular cooperative diversity networks, relays forward the source signal to the destination every time regardless of the channel conditions which limits the system throughput. In this paper, we propose an incremental relaying protocol based on decode and forward transmission in conjunction with DSTC to save the channel resources. If the destination requests the help from the relays, they cooperate with each other and decode and forward an Alamouti coded version of their signals. the average bit error probability (BEP) is derived in a closed form expression. Simulations are performed to confirm our theoretical analysis. the effect of the signal to noise ratio (SNR) threshold and the position of relays on the bit error probability are discussed. Moreover, our results show that the proposed scheme offers better performance than incremental-selective DF relaying when the relays are near the source. © 2012 ieee.

关键词： Signal to noise ratio

来源：评论

学校读者我要写书评

暂无评论

Towards distributed recognition of emotion from speech

Towards distributed recognition of emotion from speech

引用

5th International symposium on Communications Control and Signal processing, ISCCSP 2012

作者： Han, Wenjing Zhang, Zixing Deng, Jun Wollmer, Martin Weninger, Felix Schuller, Bjorn Institute for Human-Machine Communication Technische Universitt München Germany School of Computer Science and Technology Harbin Institute of Technology Harbin China

ISBN: (纸本)9781467302760

this paper introduces an approach for performing distributed speech emotion recognition in a client-server architecture. In this architecture, the client side deals only with feature extraction, compression and bit-stream formatting, while the server side performs bit-stream decoding, feature decompression and emotion recognition, which requires more computational resources. Taking into account the trade-off between the required transmission bandwidth and recognition accuracy, we propose to employ a vector quantization approach based on independent codebooks for feature sub-spaces. Extensive test runs are conducted to reveal the impact of quantization parameters on the compression rate and recognition performance. In the result, by using a quantization strategy involving 32 subvectors and 9 bit codeword length, almost 30 times compression can be reached without a considerable increase of the error rate. © 2012 ieee.

关键词： Emotion Recognition

来源：评论

学校读者我要写书评

暂无评论

distributed Multimedia Content Analysis with MapReduce

Distributed Multimedia Content Analysis with MapReduce

引用

ieee International symposium on Personal, Indoor and Mobile Radio Communications

作者： Arto Heikkinen Jouni Sarvanko Mika Rautiainen Mika Ylianttila Department of Communications Engineering University of Oulu Finland Center for Internet Excellence University of Oulu Finland Department of Computer Science and Engineering University of Oulu Finland

ISBN: (纸本)9781467362337

this paper introduces a scalable solution for distributing content-based video analysis tasks using the emerging MapReduce programming model. Scalable and efficient solutions are needed for this type of tasks, as the number of multimedia content is growing at an increasing rate. We present a novel implementation utilizing the popular Apache Hadoop MapReduce framework for both analysis job scheduling and video data distribution. We employ face detection as a case example because it represents a popular visual content analysis task. the main contribution of this paper is the performance evaluation of distribution models for video content processing in various configurations. In our experiments, we have compared the performance of our video data distribution method against two alternatives solutions on a seven node cluster. Hadoop's performance overhead in video content analysis was also evaluated. We found Hadoop to be a data efficient solution with minimal computational overhead for the face detection task.

关键词： MapReduce distributed video analysis Face detection parallel computing

来源：评论

学校读者我要写书评

暂无评论

Bit rate reduction video transcoding with distributed computing

Bit rate reduction video transcoding with distributed comput...

引用

20th Euromicro International Conference on parallel, distributed and Network-Based processing, PDP 2012

作者： Jokhio, Fareed Deneke, Tewodros Lafond, Sébastien Lilius, Johan Åbo Akademi University Department of Information Technologies Joukahainengatan 3-5 20520 Turku Finland

ISBN: (纸本)9780769546339

this paper presents an approach to perform bit rate reduction transcoding by video segmentation. the paper shows how a high performance distributed video transcoder can be built using multiple processing units and a Message Passing Interface based parallel programming model. the computation parallelization and data distribution among computing units is discussed. For data distribution coarse grain approach is used in which significant gain in terms of execution speedup is obtained. the segmentation of video stream with (1) equal size having unequal number of intra frames and (2) unequal size having equal number of intra frames is performed to achieve high performance. the results show that the proposed distributed video transcoder provides very short startup times. © 2012 ieee.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共354页 << < 62 63 64 65 66 67 68 69 70 71 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：