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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

639 篇 会议
12 篇 期刊文献
9 册 图书

馆藏范围

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

日期分布

学科分类号

519 篇 工学
- 494 篇 计算机科学与技术...
- 349 篇 软件工程
- 94 篇 信息与通信工程
- 45 篇 电气工程
- 42 篇 控制科学与工程
- 18 篇 电子科学与技术（可...
- 8 篇 机械工程
- 8 篇 生物工程
- 6 篇 动力工程及工程热...
- 6 篇 生物医学工程（可授...
- 4 篇 仪器科学与技术
- 4 篇 建筑学
- 4 篇 测绘科学与技术
- 4 篇 安全科学与工程
- 3 篇 土木工程
- 3 篇 化学工程与技术
- 2 篇 光学工程
118 篇 理学
- 92 篇 数学
- 15 篇 统计学（可授理学、...
- 12 篇 物理学
- 11 篇 生物学
- 6 篇 系统科学
- 4 篇 化学
- 2 篇 大气科学
- 2 篇 地质学
68 篇 管理学
- 53 篇 管理科学与工程(可...
- 41 篇 工商管理
- 20 篇 图书情报与档案管...
5 篇 经济学
- 5 篇 应用经济学
5 篇 法学
- 4 篇 社会学
2 篇 医学
1 篇 农学

主题

45 篇 distributed comp...
32 篇 parallel process...
26 篇 distributed comp...
24 篇 parallel computi...
17 篇 optimization
15 篇 parallel process...
14 篇 cloud computing
13 篇 parallel program...
12 篇 gpu
11 篇 distributed syst...
10 篇 parallel algorit...
10 篇 fault tolerance
9 篇 big data
9 篇 resource managem...
9 篇 data mining
9 篇 protocols
9 篇 distributed data...
8 篇 computational mo...
8 篇 high performance...
8 篇 scheduling

机构

7 篇 kyoto inst techn...
5 篇 univ comp studie...
4 篇 kyoto inst techn...
4 篇 college of compu...
3 篇 kyoto inst techn...
3 篇 natl taipei univ...
3 篇 kyoto coll grad ...
3 篇 chinese acad sci...
3 篇 natl univ def te...
3 篇 chulalongkorn un...
3 篇 science and tech...
2 篇 vienna universit...
2 篇 a*star institute...
2 篇 soochow univ sch...
2 篇 natl taipei univ...
2 篇 univ puerto rico...
2 篇 tu münchen garch...
2 篇 fukuoka inst tec...
2 篇 department of co...
2 篇 washington univ ...

作者

5 篇 hochin teruhisa
5 篇 toporkov victor
5 篇 yemelyanov dmitr...
4 篇 nomiya hiroki
4 篇 gonzalez teofilo...
3 篇 cong guojing
3 篇 michael alexande...
3 篇 kawamura takao
3 篇 chang yang-lang
3 篇 senivongse twitt...
3 篇 alexandru costan
3 篇 liu jie
3 篇 shibayama kiyosh...
3 篇 hirata hiroaki
3 篇 stephen l. scott
3 篇 nunome atsushi
3 篇 sugahara kazunor...
3 篇 xiaorong li
3 篇 mario cannataro
3 篇 sha edwin h.-m.

语言

640 篇 英文
20 篇 其他

检索条件"任意字段=18th IASTED International Conference on Parallel and Distributed Computing and Systems"

共 660 条记录，以下是191-200 订阅

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

详细简洁

排序：

A parallel voronoi diagram on hypercube computers

A parallel voronoi diagram on hypercube computers

引用

Proceedings of the 16th iasted international conference on parallel and distributed computing and systems

作者： Muhammad, Rashid Bin Department of Computer Science Kent State University United States

the Voronoi diagram of a set of n sites on the plane has application in many diverse areas such as Geographical Information systems (GIS), Visualization, Robotics, Computer Graphics and Computer Aided Design (CAD). Unfortunately, its construction is very costly for large input sizes, and fast parallel algorithms for the problem are desired. there are no known parallel algorithms for the problem that are optimal with respect to the time-processor product. Best sequential algorithms work in O(n lg(n)) time. In this paper, an O(lg3n) time parallel algorithm for constructing the Voronoi Diagram of a set of n sites in the plane is presented on a hypercube with n processors. Our technique parallelizes the well-known seemingly inherent sequential technique of Shamos and Hoey, and makes use of a number of special properties of the dividing polygonal chain and the Batcher's bitonic sort.

关键词： parallel processing systems

来源：评论

学校读者我要写书评

暂无评论

parallel Harmony Search Based distributed Energy Resource Optimization 18

Parallel Harmony Search Based Distributed Energy Resource Op...

引用

2015 18th international conference on Intelligent System Application to Power systems (ISAP)

作者： Ceylan, Oguzhan Liu, Guodong Tomsovic, Kevin Univ Tennessee Dept Elect Engn & Comp Sci Knoxville TN 37996 USA Oak Ridge Natl Lab Power & Energy Syst Grp Oak Ridge TN 37381 USA

ISBN: (纸本)9781509001910

this paper presents a harmony search based parallel optimization algorithm to minimize voltage deviations in three phase unbalanced electrical distribution systems and to maximize active power outputs of distributed energy resources (DR). the main contribution is to reduce the adverse impacts on voltage profile during a day as photovoltaics (PVs) output or electrical vehicles (EVs) charging changes throughout a day. the IEEE 123-bus distribution test system is modified by adding DRs and EVs under different load profiles. the simulation results show that by using parallel computing techniques, heuristic methods may be used as an alternative optimization tool in electrical power distribution systems operation.

关键词： Linear programming Optimization Power distribution Program processors Sociology Statistics Voltage control

来源：评论

学校读者我要写书评

暂无评论

An improvement for the dynamic distributed double guided genetic algorithm for MAX-CSPs

An improvement for the dynamic distributed double guided gen...

引用

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

作者： Nisrine, Zaier Sadok, Bouamama Khaled, Ghedira SOIE Laboratory University of TUNIS Tunisia

ISBN: (纸本)9780889867048

this paper propose a new approach to improve the Dynamic distributed Double Guided Genetic Algorithm (D3G2A) dealing with Maximal Constraint Satisfaction Problems. Inspired by the NEO-DARWINISM theory and the nature laws, D3G2A consists in creating agents cooperating together to solve problems. In D3G2A, It was proved that the spent CPU time could be improved. the new approach Inspired by the D 3G2A for CSOP and ΣCSPs, will redistribute the load of species agents more equally in order to better the CPU time. this improvement allows not only reduction in species agent's number but also decrease communications agents cost. thus, a sub-population is composed of chromosomes violating a number of constraints in the same interval. In the present paper, the new approach is first described and then compared with the old one. Results of experimentations are analyzed and discussed.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

Pipelined parallel LZSS for Streaming Data Compression on GPGPUs

Pipelined Parallel LZSS for Streaming Data Compression on GP...

引用

IEEE 18th international conference on parallel and distributed systems (ICPADS)

作者： Ozsoy, Adnan Swany, Martin Chauhan, Arun Indiana Univ Sch Informat & Comp Bloomington IN 47405 USA

ISBN: (纸本)9781467345651;9780769549033

In this paper, we present an algorithm and provide design improvements needed to port the serial Lempel-Ziv-Storer-Szymanski (LZSS), lossless data compression algorithm, to a parallelized version suitable for general purpose graphic processor units (GPGPU), specifically for NVIDIA's CUDA Framework. the two main stages of the algorithm, substring matching and encoding, are studied in detail to fit into the GPU architecture. We conducted detailed analysis of our performance results and compared them to serial and parallel CPU implementations of LZSS algorithm. We also benchmarked our algorithm in comparison with well known, widely used programs;GZIP and ZLIB. We achieved up to 34x better throughput than the serial CPU implementation of LZSS algorithm and up to 2.21x better than the parallelized version.

关键词： Lossless data compression LZSS GPU CUDA

来源：评论

学校读者我要写书评

暂无评论

Spanning trees for distributed search in P2P systems

Spanning trees for distributed search in P2P systems

引用

Proceedings of the 16th iasted international conference on parallel and distributed computing and systems

作者： Kaushik, Neena R. Figueira, Silvia M. Department of Computer Engineering Santa Clara University Santa Clara CA 95053-0566 United States

Searching for data location in P2P systems is a message-intensive task. Basically, a query needs to reach all the nodes in order to find the locations of a specified data. this search involves a broadcast, and an inappropriate broadcast strategy may not only lead to inefficient data sharing, but also directly affect the scalability of the P2P system. We propose the utilization of an ad-hoc spanning tree for distributed search in P2P systems. this spanning tree is built as an overlay network. We define algorithms to maintain the ad-hoc spanning tree, and we compare the search time obtained with the ad-hoc spanning tree with the time obtained with other structures used for broadcasting in parallel and distributed systems. this comparison is done with an MPI emulation.

关键词： Computer systems

来源：评论

学校读者我要写书评

暂无评论

Optimizing Change Detection in distributed Digital Collections An Architectural Perspective of Change Detection 18

Optimizing Change Detection in Distributed Digital Collectio...

引用

18th IEEE/ACIS international conference on Software Engineering, Artificial Intelligence, Networking and parallel/distributed computing (SNPD)

作者： Meegahapola, Lakmal Alwis, Roshan Nimalarathna, Eranga Mallawaarachchi, Vijini Meedeniya, Dulani Jayarathna, Sampath Univ Moratuwa Dept Comp Sci & Engn Moratuwa Sri Lanka Calif State Polytech Univ Pomona Dept Comp Sci Pomona CA 91768 USA

ISBN: (纸本)9781509055043

Digital documents are likely to have problems associated with the persistence of links, especially when dealing with references to external resources. People keep track of various webpages of their interest using distributed digital collections and without possession of these documents;the curator cannot control how they change. In the current context, managing these distributed digital collections and getting notifications about various changes have become a significant challenge. In this paper, we address the architectural aspects of change detection systems and present optimized change detection architecture, including a web service and a browser plugin, along with an email notification service. We have performed an experimental study on our hybrid architecture for change detection in a distributed digital collection. the proposed method introduces a preliminary framework that can serve as a useful tool to mitigate the impact of unexpected change in documents stored in decentralized collections in the future.

关键词： Change detection change notification distributed digital collections

来源：评论

学校读者我要写书评

暂无评论

parallel Processing of Massive EEG Data with MapReduce

Parallel Processing of Massive EEG Data with MapReduce

引用

IEEE 18th international conference on parallel and distributed systems (ICPADS)

作者： Wang, Lizhe Chen, Dan Ranjan, Rajiv Khan, Samee U. Kolodziej, Joanna Wang, Jun Chinese Acad Sci Ctr Earth Observat & Digital Earth Beijing 100864 Peoples R China China Univ Geosciences Sch Comp Beijing Peoples R China CSIRO ICT Ctr Informat Engn lab Marshfield 2122 WI USA N Dakota State Univ Dept Elect & Comp Engn Grand Forks ND 58201 USA Univ Technol Inst Comp Sci Krakow Poland Univ Cent Florida Dept Elect Engn & Comp Sci Orlando FL 32816 USA

ISBN: (纸本)9781467345651;9780769549033

Analysis of neural signals like electroencephalogram (EEG) is one of the key technologies in detecting and diagnosing various brain disorders. As neural signals are non-stationary and non-linear in nature, it is almost impossible to understand their true physical dynamics until the recent advent of the Ensemble Empirical Mode Decomposition (EEMD) algorithm. the neural signal processing with EEMD is highly compute-intensive due to the high complexity of the EEMD algorithm. It is also data-intensive because 1) EEG signals contain massive data sets 2) EEMD has to introduce a large number of trials in processing to ensure precision. the MapReduce programming mode is a promising parallel computing paradigm for data intensive computing. To increase the efficiency and performance of the neural signal analysis, this research develops parallel EEMD neural signal processing with MapReduce. In this paper, we implement the parallel EEMD with Hadoop in a modern cyberinfrastructure. Test results and performance evaluation show that parallel EEMD can significantly improve the performance of neural signal processing.

关键词： Data-intensive computing MapReduce parallel processing parallel PROCESSING (COMPUTERS) signal processing Electroencephalography Brain Diseases Key technology MAPPING(MAthEMATICAL) Signal analysis data parallel computing data flow computing

来源：评论

学校读者我要写书评

暂无评论

Improving graph coloring on distributed-memory parallel computers

Improving graph coloring on distributed-memory parallel comp...

引用

18th international conference on High Performance computing, HiPC 2011

作者： Sariyüce, Ahmet Erdem Saule, Erik Çataryürek, Ümit V. Department of Biomedical Informatics Ohio State University United States Department of Computer Science and Engineering Ohio State University United States Department of Electrical and Computer Engineering Ohio State University United States

ISBN: (纸本)9781457719516

Graph coloring is a combinatorial optimization problem that classically appears in distributed computing to identify the sets of tasks that can be safely performed in parallel. Despite many existing efficient sequential algorithms being known for this NP-Complete problem, distributed variants are challenging. Building on an existing distributed-memory graph coloring framework, we investigate two techniques in this paper. First, we investigate the application of two different vertex-visit orderings, namely Largest First and Smallest Last, in a distributed context and show that they can help to significantly decrease the number of colors, on small-to medium-scale parallel architectures. Second, we investigate the use of a distributed post-processing operation, called recoloring, which further drastically improves the number of colors while not increasing the runtime more than twofold on large graphs. We also investigate the use of multicore architectures for distributed graph coloring algorithms. © 2011 IEEE.

关键词： Computational complexity

来源：评论

学校读者我要写书评

暂无评论

Application categories for QOS management of distributed applications

Application categories for QOS management of distributed app...

引用

Proceedings of the 16th iasted international conference on parallel and distributed computing and systems

作者： Keep, Heather Bauer, Michael Department of Computer Science University of Western Ontario London Ont. N6A 5B7 Canada

Quality of Service (QoS) management in today's distributed computing environments requires that application level resource requirements be considered from the user's perspective since user satisfaction is the ultimate goal of QoS management. the variety of applications and diversity of user requirements creates challenges for management systems to attempt to satisfy user requirements. In this paper, a policy-driven architecture for user-defined differentiated services is proposed and an overview of the implementation given. the key contribution of this paper is the use of application categories, each characterizing different sets of applications with similar QoS requirements, to determine groups of policies for use by the management system. this approach can reduce the number of policies that much be defined and provide flexibility in meeting individual user QoS requirements. Experience with the prototype is also reported.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

Generalized optional locking in distributed systems

Generalized optional locking in distributed systems

引用

Proceedings of the 16th iasted international conference on parallel and distributed computing and systems

作者： Schöbel-theuer, thomas Universität Stuttgart Germany

We present optional locking as a method for significantly speeding up distributed locks, and we generalize it to multiple lock types obeying a conflict relation. the generalized version can simulate the message passing paradigm on top of distributed Shared Memory (DSM) with no more messages than explicit message passing would need. thus we argue that message passing can be viewed as a true special case of optional locking. As a consequence, the attractiveness of DSM programming models should increase significantly due to well-recognized advantages such as simplicity and reduced software engineering cost;mixtures of both message passing and shared data access patterns can be treated uniformly. Measurements and simulations based on database benchmarks indicate a substantial performance improvement of optional locking over conventional locking even in presence of multiple lock types.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共66页 << < 16 17 18 19 20 21 22 23 24 25 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：