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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

197 篇 会议
6 篇 期刊文献
2 册 图书

馆藏范围

205 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

154 篇 工学
- 150 篇 计算机科学与技术...
- 67 篇 软件工程
- 24 篇 电气工程
- 20 篇 信息与通信工程
- 13 篇 控制科学与工程
- 9 篇 仪器科学与技术
- 5 篇 动力工程及工程热...
- 5 篇 电子科学与技术（可...
- 5 篇 交通运输工程
- 5 篇 安全科学与工程
- 4 篇 网络空间安全
- 3 篇 生物工程
- 2 篇 机械工程
- 2 篇 建筑学
- 2 篇 土木工程
- 2 篇 生物医学工程（可授...
- 1 篇 冶金工程
- 1 篇 水利工程
- 1 篇 化学工程与技术
33 篇 理学
- 23 篇 数学
- 6 篇 化学
- 5 篇 系统科学
- 4 篇 生物学
- 2 篇 统计学（可授理学、...
- 1 篇 物理学
30 篇 管理学
- 22 篇 管理科学与工程(可...
- 17 篇 工商管理
- 14 篇 图书情报与档案管...
1 篇 经济学
- 1 篇 应用经济学
1 篇 医学
- 1 篇 临床医学

主题

21 篇 cloud computing
9 篇 parallel process...
9 篇 distributed comp...
8 篇 peer to peer com...
8 篇 distributed comp...
7 篇 concurrent compu...
7 篇 grid computing
7 篇 computational mo...
7 篇 scheduling
6 篇 message passing
6 篇 computer archite...
6 篇 distributed syst...
5 篇 computer science
5 篇 mobile agents
5 篇 bandwidth
5 篇 genetic algorith...
5 篇 data models
4 篇 parallel algorit...
4 篇 application soft...
4 篇 fault tolerance

机构

2 篇 high-performance...
2 篇 parallel and dis...
2 篇 institut univers...
2 篇 ibm t.j. watson ...
2 篇 department of co...
2 篇 beihang univ sch...
2 篇 parallel and dis...
1 篇 faculty of infor...
1 篇 department of co...
1 篇 department of co...
1 篇 rechen- und komm...
1 篇 institut für inf...
1 篇 cicese ensenada ...
1 篇 faculty of infor...
1 篇 univ utah sci co...
1 篇 tech univ berlin...
1 篇 high-performance...
1 篇 simula research ...
1 篇 chongqing univ k...
1 篇 swiss fed inst t...

作者

3 篇 kuan-ching li
3 篇 chao-tung yang
3 篇 li xiaorong
2 篇 park woo-chan
2 篇 bouamama sadok
2 篇 dieter mey
2 篇 kim il-san
2 篇 han tack-don
2 篇 lee kil-whan
2 篇 yoon duk-ki
2 篇 domenico talia
2 篇 li kuan-ching
2 篇 akl selim g.
2 篇 plale beth
2 篇 chen peng
2 篇 yang chao-tung
1 篇 nandi asoke k.
1 篇 han biao
1 篇 ortiz aurélien
1 篇 hillhouse bob

语言

205 篇 英文

检索条件"任意字段=19th International Conference on Parallel and Distributed Computing Systems, PDCS 2006"

共 205 条记录，以下是121-130 订阅

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

详细简洁

排序：

parallel and distributed Local Fisher Discriminant Analysis to Reduce Hyperspectral Images on Cloud computing Architectures 19th

Parallel and Distributed Local Fisher Discriminant Analysis ...

引用

19th international conference on Advanced Concepts for Intelligent Vision systems (ACIVS)

作者： Zaatour, Rania Bouzidi, Sonia Zagrouba, Ezzeddine Univ Tunis El Manar Inst Super Informat El Manar LR16ES06 Lab Rech Informat Modelisat & Traitement 2 Rue Abou Raihane Bayrouni Lariana 2080 Tunisia

ISBN: (纸本)9783030014490;9783030014483

Hyperspectral images are data cubes that offer very rich spectral and spatial resolutions. these images are so highly dimensioned that we generally reduce them in a pre-processing step in order to process them efficiently. In this context, Local Fisher Discriminant Analysis (LFDA) is a feature extraction technique that proved better than several commonly used dimensionality reduction techniques. However, this method suffers from memory problems and long execution times on commodity hardware. In this paper, to solve these problems, we first added an optimization step to LFDA to make it executable on commodity hardware and to make it suitable for parallel and distributed computing, then, we implemented it in a parallel and distributed way using Apache Spark. We tested our implementation on Amazon Web Services (AWS)'s Elastic MapReduce (EMR) clusters, using different hyperspectral images with different sizes. this proved higher performances with a speedup of up to 70x.

关键词： Local Fisher Discriminant Analysis (LFDA) Cloud computing Dimensionality reduction Hyperspectral images Amazon Web Services (AWS) Elastic MapReduce (EMR)

来源：评论

学校读者我要写书评

暂无评论

Portable and scalable parallel applications with VCluster

Portable and scalable parallel applications with VCluster

引用

19th European conference on Modelling and Simulation, ECMS 2005

作者： Lee, Joohan Hua, Zhang Guha, Ratan School of Computer Science University of Central Florida FL 32816 United States

ISBN: (纸本)1842331124

Message passing based parallel programming paradigm and associated libraries such as MPI and PVM have proven its novelty and efficiency by successful applications in many diverse areas ranging from scientific computation, simulation, graphics, machine learning, to data mining. those tools have been de facto parallel programming libraries for cluster computing where a cluster consists of usually homogeneous uniprocessor machines. Recent advances in processor technologies made it possible to build a cluster of multiprocessor machines more economically. In addition, a new programming language, Java, and its associated technologies opened a door to flourish of new and more efficient development of distributed computing software. Virtual Cluster computing (VCluster) library is a portable parallel runtime system we have developed to support parallel programs that run on the cluster of heterogeneous uni- and multi-processors. In this paper, we briefly introduce the features of VCluster system and describe how parallel programs can be developed efficiently with VCluster. We also present the experimental results showing the performance of the developed system on two exemplary applications, heat diffusion and back propagation neural network, and compare them with other systems. © ECMS, 2005.

关键词： Message passing

来源：评论

学校读者我要写书评

暂无评论

Evaluation of Architectural Support for Speech Codecs Application in Large-Scale parallel Machines 20

Evaluation of Architectural Support for Speech Codecs Applic...

引用

20th international conference on parallel and distributed computing systems, pdcs 2007

作者： Azeemi, Naeem Zafar Christian Doppler Laboratory for Design Methodology of Signal Processing Algorithms Institute of Communications and Radio Frequency Engineering University of Technology Vienna Gusshausstrasse 25/389 ViennaA-1040 Austria

ISBN: (纸本)9781604233926

Next generation multimedia mobile phones that use the high bandwidth 3G cellular radio network consume more power. Multimedia algorithms such as speech, video transcodecs have very large instruction foot prints and consequently stalled due to instruction cache misses. the conflicts in on-chip caches contribute a large fraction of the CPU cycle penalty and hence increase in power consumption. Many commercial tools are developed to minimize such cache misses by adequately placing the frequently called procedures in an application. Followed by profile extraction, these tools use cache line coloring and post compilation techniques for cache hit optimization. the major impediment in the optimal performance of such tools is their static layout profile, which does not consider the dynamic behavior of the application. We propose a methodology called DCP (dynamic code placement) for positioning code at run time for good instruction cache performance and have implemented in high end processors. the dynamic application profile is completely transparent to the developer’s code. this technique optimizes the code footprint in memory layout of a program. It improves i-cache mapping to increase the number of cache hits and eventually reduce the CPU stalls. Our optimization is powered with static as well as detail run time profile information that extracts the relevant, temporal behavior of the applications. Moreover, while mapping code in instruction cache, the effect of inter-procedural code positioning is also considered. Improvement over the Pettis and Hansen approach (PH) is also shown in results. though majority of multimedia applications can be optimized by our framework, application dominated with the function pointers do not work correctly. the technique incurs low overheads and enhances the cache hits architecture correlation. For a range of applications we show that instruction miss rates can be reduced by 19-68%. Using a simple model this corresponds to execution time re

关键词： Embedded systems

来源：评论

学校读者我要写书评

暂无评论

引用

19th IASTED international conference on parallel and distributed computing and systems

作者： Behl, Sanjiv Verma, Rakesh M. Computer Science Department University of Houston-Victoria Victoria TX 77901 United States Computer Science Department University of Houston Houston TX 77204 United States

ISBN: (纸本)9780889867048

Multiple-disk architectures are an attractive approach to meet high performance I/O demands in I/O intensive applications such as search engines, web servers and information retrieval systems. this requires that the issues of dynamic load balancing and access parallelism be addressed, which is the goal of this paper. We address the problem of document declustering in a keyword-based information retrieval system for parallel architectures consisting of a single processor and multiple disks. We propose and evaluate experimentally four similarity-based methods, viz., set, multiset, vector, and euclidean, for declustering documents. Interestingly, our results show that for single keyword queries as well as boolean and queries the set and multiset methods generally outperform the vector and euclidean methods with set being the best for the so-called simple plan. We also introduce a highest-frequency first retrieval scenario and compare the methods under this scenario, and find that set and multiset methods are still generally superior to the other methods with the multiset outperforming the set method. We compare these methods with the (theoretically) optimal values, which are practically impossible to achieve. Finally, we approximated the multiset method using the harmonic mean and found that the results were slightly inferior than multiset method, but still better than the vector and euclidean methods.

关键词： parallel architectures

来源：评论

学校读者我要写书评

暂无评论

Self-constrained resource allocation procedures for parallel task graph scheduling on shared computing grids

Self-constrained resource allocation procedures for parallel...

引用

19th IASTED international conference on parallel and distributed computing and systems

作者： N'Takpé, Tchimou Suter, Frédéric Nancy Université / LORIA UMR 7503 CNRS - INPL - INRIA - Nancy 2 - UHP Nancy 1 Campus Scientifique BP 239 F-54506 Vandoeuvre-lès-Nancy France

ISBN: (纸本)9780889867048

Two of the main characteristics of computation grids are their heterogeneity and the sharing of resources between different users. this is the cost of the tremendous computing power offered by such platforms. Scheduling several applications concurrently in such an environment is thus challenging. In this paper we propose a first step towards the scheduling of multiple parallel task graphs (PTG), a class of applications that can benefit of large and powerful platforms, by focusing on the allocation process. We consider the application of a resource constraint on the schedule and determine the number of processors allocated to the different tasks of a PTG while respecting that constraint. We present two different allocation procedures and validate them in simulation over a wide range of scenarios with regard to their respect of the resource constraint and their impact on the completion time of the scheduled applications. We find that our procedures provide a guarantee on the resource usage for a low cost in terms of execution time.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

Euro-Par 2013 parallel Processing 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Felix Wolf Bernd Mohr Dieter Mey

ISBN: (数字)9783642400476

ISBN: (纸本)9783642400469

this book constitutes the refereed proceedings of the 19th international conference on parallel and distributed computing, Euro-Par 2013, held in Aachen, Germany, in August 2013. the 70 revised full papers presented were carefully reviewed and selected from 261 submissions. the papers are organized in 16 topical sections: support tools and environments; performance prediction and evaluation; scheduling and load balancing; high-performance architectures and compilers; parallel and distributed data management; grid, cluster and cloud computing; peer-to-peer computing; distributed systems and algorithms; parallel and distributed programming; parallel numerical algorithms; multicore and manycore programming; theory and algorithms for parallel computation; high performance networks and communication; high performance and scientific applications; GPU and accelerator computing; and extreme-scale computing.

关键词： Programming Languages, Compilers, Interpreters Operating systems System Performance and Evaluation Computer Communication Networks Numeric computing Special Purpose and Application-Based systems

来源：评论

学校读者我要写书评

暂无评论

Welcome Message from the conference Chair - pdcs 2006

Proceedings of the IASTED International Conference on Parall...

引用

Proceedings of the IASTED international conference on parallel and distributed computing and systems 2006年

作者： Zheng, S.Q.

No abstract available

关键词：

来源：评论

学校读者我要写书评

暂无评论

EPDKS: An efficient proximity-based distributed k-ary structured overlay network

EPDKS: An efficient proximity-based distributed k-ary struct...

引用

19th IASTED international conference on parallel and distributed computing and systems

作者： Alima, Luc Onana Beauport, Stefan Institut d'Informatique Université de Mons-Hainaut Avenue du Champ de Mars 6 57000 Mons Belgium

ISBN: (纸本)9780889867048

Structured peer-to-peer overlay networks provide a means for interconnecting a large set of computing nodes called peers in a distributed, scalable and self-organizing manner. Typically in such systems, each peer maintains contact information about a small subset of other peers called neighbors. these neighbors are often chosen to ensure that each lookup operation takes a logarithmic number of overlay hops under normal conditions. Relying solely on the number of overlay hops as the metric for the quality of the lookup operation is not sufficient both for the applications using the overlay network and, for the effective use of the underlying communication network which is typically the Internet. DKS [1] is a P2P middleware built upon the principle we called distributed K-ary search, which ensures that any lookup takes O(log k(N)) overlay hops, where N is the number of nodes in the system and K is the search arity. In a DKS overlay network, proximity is not considered. As a result, end-to-end latencies could be significantly large. In this paper we present EPDKS, a novel structured peer-to-peer overlay network that is based on the distributed K-ary search principle. EPDKS takes proximity into account by combining round-trip times and the number of IP hops for interconnecting peers, thereby reducing end-to-end latencies and making effective use of the underlying network. Furthermore, we propose improvements for some of the algorithms currently implemented in the DKS. Simulation results confirm our expectations that EPDKS ensures lower end-to-end latencies and smaller number of IP hops when compared to DKS.

关键词： Overlay networks

来源：评论

学校读者我要写书评

暂无评论

Strategy for distributing procedures on distributed multiprocessors

Strategy for distributing procedures on distributed multipro...

引用

Proceedings of the 19th international conference on Industrial Electronics, Control and Instrumentation

作者： Nomura, Mitsunori Murakoshi, Hideki Funakubo, Noboru Tokyo Metropolitan Inst of Technology Tokyo Japan

ISBN: (纸本)0780308913

this paper proposes a strategy for distributing program fragments by focusing on each variable of which status is modified by actors. the parallel computing environment that users do not need to pay attention to messages is provided. On this strategy, distributed memory multiprocessors can execute programs written by procedural languages without any extension. Also this approach is useful to reduce the amount of data passing through the network . We simulated this strategy for simple problems and find that messages passed among processors efficiently.

关键词： Multiprocessing systems

来源：评论

学校读者我要写书评

暂无评论

Prototypical implementation of location-aware services based on super-distributed RFID tags

引用

19th international conference on Architecture of computing systems

作者： Bohn, J Swiss Fed Inst Technol Inst Pervas Comp Zurich Switzerland

ISBN: (纸本)3540327657

We provide evidence of the feasibility and effectiveness of a middleware architecture for mobile devices which employs dense distributions of small computerized entities for providing fault-tolerant location-aware services. We do so by describing exemplary implementations based on radio frequency identification (RFID) as an enabling technology. Firstly, we present prototypical implementations of the hardware abstraction layer and of selected core middleware services. the latter enable a mobile device to store and retrieve data and position information in physical places in a fault-tolerant manner, and to identify places based on a location abstraction which is robust against failure of individual tags. Secondly, we investigate the feasibility of some higher-level services and applications by developing and evaluating prototypical systems for tracing and tracking, self-positioning, and collaborative map-making.

关键词： Technical presentations

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共21页 << < 9 10 11 12 13 14 15 16 17 18 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：