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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,701 篇 会议
48 册 图书
23 篇 期刊文献

馆藏范围

1,772 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,366 篇 工学
- 1,236 篇 计算机科学与技术...
- 552 篇 软件工程
- 242 篇 信息与通信工程
- 221 篇 电气工程
- 76 篇 控制科学与工程
- 50 篇 电子科学与技术（可...
- 43 篇 生物工程
- 34 篇 机械工程
- 26 篇 动力工程及工程热...
- 22 篇 仪器科学与技术
- 21 篇 力学（可授工学、理...
- 20 篇 建筑学
- 19 篇 土木工程
- 18 篇 生物医学工程（可授...
- 16 篇 安全科学与工程
- 15 篇 材料科学与工程（可...
- 14 篇 化学工程与技术
- 13 篇 石油与天然气工程
329 篇 理学
- 227 篇 数学
- 55 篇 物理学
- 51 篇 生物学
- 29 篇 系统科学
- 28 篇 统计学（可授理学、...
- 20 篇 化学
215 篇 管理学
- 159 篇 管理科学与工程(可...
- 67 篇 图书情报与档案管...
- 49 篇 工商管理
71 篇 医学
- 62 篇 临床医学
15 篇 法学
- 13 篇 社会学
14 篇 经济学
- 14 篇 应用经济学
9 篇 文学
8 篇 教育学
6 篇 农学
1 篇 军事学

主题

109 篇 distributed comp...
79 篇 parallel process...
76 篇 distributed comp...
61 篇 cloud computing
51 篇 parallel computi...
44 篇 computational mo...
41 篇 parallel program...
39 篇 computer archite...
35 篇 distributed data...
34 篇 fault tolerance
29 篇 concurrent compu...
29 篇 parallel process...
29 篇 middleware
28 篇 parallel algorit...
28 篇 mapreduce
26 篇 resource managem...
25 篇 application soft...
25 篇 big data
24 篇 wireless sensor ...
24 篇 protocols

机构

14 篇 saint petersburg...
7 篇 chinese acad sci...
6 篇 univ adelaide sc...
6 篇 institute of com...
5 篇 zhejiang univ co...
5 篇 shanghai jiao to...
5 篇 plekhanov russia...
4 篇 saint petersburg...
4 篇 harbin inst tech...
4 篇 meshcheryakov la...
4 篇 centre for distr...
4 篇 univ otago dept ...
4 篇 univ stuttgart i...
4 篇 st petersburg st...
4 篇 science and tech...
3 篇 huazhong univ sc...
3 篇 joint institute ...
3 篇 king saud univer...
3 篇 department of co...
3 篇 university of el...

作者

17 篇 zomaya albert y.
10 篇 bogdanov alexand...
10 篇 shen hong
9 篇 korkhov vladimir
8 篇 degtyarev alexan...
8 篇 albert y. zomaya
6 篇 li y
6 篇 taheri javid
5 篇 dustdar schahram
5 篇 leymann frank
5 篇 kopp oliver
5 篇 li kuan-ching
5 篇 kutovskiy nikola...
5 篇 nakayama shigeru
5 篇 huang z.
5 篇 sousa leonel
5 篇 gankevich ivan
5 篇 rothermel kurt
4 篇 jerzy waśniewski
4 篇 leung k.

语言

1,693 篇 英文
53 篇 其他
18 篇 中文
9 篇 俄文

检索条件"任意字段=9th International Conference on Parallel and Distributed Computing, Applications and Technologies"

共 1772 条记录，以下是1071-1080 订阅

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

详细简洁

排序：

MapReduce Implementation of Prestack Kirchhoff Time Migration (PKTM) on Seismic Data

MapReduce Implementation of Prestack Kirchhoff Time Migratio...

引用

IEEE international conference on parallel and distributed computing, applications and technologies (PDCAT)

作者： Nikzad Babaii Rizvandi Ali Javadzadeh Boloori Najmeh Kamyabpour Albert Y. Zomaya Networked Systems Theme National ICT Australia (NICTA) Australian Technology Park Park NSW Australia Centre of Distributed and High Performance Computing School of Information Technologies University of Sydney Park NSW Australia INEXT-Centre of Innovation in IT Services and Applications University of Technology Sydney NSW Australia Centre of Distributed and High Performance Computing School of Information Technologies University of Sydney NSW Australia

the oil and gas industries have been great consumers of parallel and distributed computing systems, by frequently running technical applications with intensive processing of terabytes of data. By the emergence of cloud computing which gives the opportunity to hire high-throughput computing resources with lower operational costs, such industries have started to adopt their technical applications to be executed on such high-performance commodity systems. In this paper, we first give an overview of forward/inverse Prestack Kirchhoff Time Migration (PKTM) algorithm, as one of the well-known seismic imaging algorithms. then we will explain our proposed approach to fit this algorithm for running on Google's MapReduce framework. Toward the end, we will analyse the relation between MapReduce-based PKTM completion time and the number of mappers/reducers on pseudo-distributed MapReduce mode.

关键词： Imaging Algorithm design and analysis Earth Program processors Signal processing algorithms distributed databases Industries

来源：评论

学校读者我要写书评

暂无评论

Load balancing in distributed systems using network transferable computer

Load balancing in distributed systems using network transfer...

引用

1st international conference on parallel, distributed computing technologies and applications, PDCTA 2011

作者： Dhas, Vijayakumar G. Anaikkalpalayam Chinnasamy, Sathish Kumar Swaminathan, Mathangi Veeravagu, Lavanya Department of Information Technology MIT Anna University Chennai India Ltd. Chennai India MIT Anna University Chennai India

ISBN: (纸本)9783642240362

Dynamic load balancing (DLB) is a method for balancing the server load, and as an offset, the network traffic, in distributed systems. the DLB method is based on Network Transferable Computer (NTC) and Mobile IP, and works using the concept of virtualization. A management system is provided to handle the entire process. It (1) analyzes packets for the server (2)calculates the fluctuation rate of the amount of packets toward the server (3)estimates the future amount of packets.(4)determines whether the server will virtually move or not and a new location of the server (5)takes care of post migration analysis. the evaluation of this method is underlined by simulations, which will show effective reduction of server load. © 2011 Springer-Verlag.

关键词： Internet protocols

来源：评论

学校读者我要写书评

暂无评论

Exploiting Concurrency for Efficient Dissemination in Wireless Sensor Networks

Exploiting Concurrency for Efficient Dissemination in Wirele...

引用

7th IEEE international conference on distributed computing in Sensor Systems (DCOSS)

作者： Gao, Yi Bu, Jiajun Dong, Wei Chen, Chun Rao, Lei Liu, Xue Zhejiang Univ Coll Comp Sci Zhejiang Prov Key Lab Serv Robot Hangzhou Zhejiang Peoples R China Gen Motors Elect & Controls Syst Res Lab Palo Alto CA 94306 USA McGill Univ Sch Comp Montreal H3A 0E9 PQ Canada

ISBN: (纸本)9781457705137

Wireless Sensor Networks (WSNs) can be successfully applied in a wide range of applications. Efficient data dissemination is a fundamental service which enables many useful high-level functions such as parameter reconfiguration, network reprogramming, and etc. Many current data dissemination protocols employ network coding techniques to deal with packet losses. the coding overhead, however, becomes a bottleneck in terms of dissemination delay. We exploit the concurrency ability of sensor nodes and propose MT-Deluge, a multi-threaded design of a coding-based data dissemination protocol. By separating the coding and radio operations into two threads and carefully scheduling their executions, MT-Deluge shortens the dissemination delay effectively. An incremental decoding algorithm is employed to further improve MT-Deluge's performance. Experiments with 20 TelosB motes on three representative topologies show that MT-Deluge shortens the dissemination delay by 37.6%similar to 48.6% compared to a typical data dissemination protocol while keeping the merits of loss resilience.

关键词： Decoding Delay Encoding Instruction sets MT-Deluge Protocols Receivers Synchronization TelosB motes coding operations coding overhead coding-based data dissemination protocol concurrency ability dissemination delay high-level functions incremental decodin

来源：评论

学校读者我要写书评

暂无评论

the Multidimensional Scaling and Barycentric Coordinates Based distributed Localization in Wireless Sensor Networks

The Multidimensional Scaling and Barycentric Coordinates Bas...

引用

IEEE international conference on parallel and distributed computing, applications and technologies (PDCAT)

作者： Cuiqin Hou Yibin Hou Zhangqin Huang Huibing Zhang Embedded Software and System Institute Beijing University of Technology Beijing China GuiLin University of Electronic Technology Guilin Guangxi China

Position information is vital for wireless sensor networks in many applications. In this paper, based on the barycentric coordinate system, we incorporate a term constrains sensors to remain the intrinsic structure revealed by range measurements between neighboring nodes into the STRESS function, which is the cost function optimized by the distributed weighted-multidimensional scaling algorithm (dwMDS). By minimizing the modified cost function, we derive a distributed localization algorithm called the Multidimensional Scaling and Barycentric Coordinates based distributed Localization Algorithm (MDS_BC_DLA). Experimental results on four different types of WSNs show MDS_BC_DLA outperforms dwMDS.

关键词： Sensors Wireless sensor networks Signal processing algorithms Cost function Coordinate measuring machines Vectors Classification algorithms

来源：评论

学校读者我要写书评

暂无评论

Design of FRT capability and distributed voltage control of PV generation system

Design of FRT capability and distributed voltage control of ...

引用

2011 IEEE 9th international conference on Power Electronics and Drive Systems, PEDS 2011

作者： Yamauchi, Hayato Yona, Atsushi Senjyu, Tomonobu Department of Electrical and Electronics Engineering Faculty of Engineering University of the Ryukyus Okinawa Japan

ISBN: (纸本)9781612849997

It is issue that reduction of carbon-dioxide emissions to prevent global warming. the PV(photovoltaic) system technologies are rapidly expanding and have increasing roles in electric power technology and regarded as the green energy. But, the increasing of PV system results in the fluctuating power from changing amount of solar insolation and temperature of solar cell. Moreover, partial shadowing has been identified as a main cause for reducing energy yield of grid-connected PV systems. It is necesary to consider MPPT(Maximum Power Point Tracking) to achive highly efficient operation. this paper also adopts MPPT control to consider partial shadow. In grid connection, domestic PV system is interconnected with single phase AC. When momentary terminal voltage drop, the central control is inability to cope. those coping techniques is control terminal voltage by reactive power control in distributed system. And, the increasing number of PV will lead to increased rate PV output of total power supply, resulting in an imbalance of demand by PV system simultaneously parallel off when momentary terminal voltage drop. therefore, in this paper presents FRT (Fault Ride-through) function of domestic PV system that block unwanted parallel off and continued operation in a few minutes. Effectiveness of the proposed method is verified by simulation results in Matlab/simPower System® environment. © 2011 IEEE.

关键词： Global warming

来源：评论

学校读者我要写书评

暂无评论

Performance improvement for multicore processors using variable page technologies

Performance improvement for multicore processors using varia...

引用

IEEE international conference on Networking, Architecture and Storage

作者： Zhang, Xiaohui Jiang, Yifei Cong, Ming Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China Graduate University of Chinese Academy of Sciences Beijing 100049 China Loongson Technology Corporation Limited Beijing 100190 China

ISBN: (纸本)9780769545097

In order to improve system performance, many modern processors support superpage technology, which is also called variable page. It improves TLB coverage greatly without increasing TLB size. But supporting superpage brings great challenge to operating systems. In this paper, we implement two variable page technologies, including the static variable page and dynamic variable page, in Linux kernel on Godson-3 four-core processors. the static variable page technology is implemented on the basis of hugetlbfs pseudo filesystem. the dynamic one chooses proper page sizes according to the address spaces of applications adaptively. Experiment results show that static variable page technology improves the performance of scientific applications such as large matrix multiplication significantly. the number of TLB misses is reduced by 99% and the speed of large-scale matrix multiplication is improved by over 50%. the dynamic self-adapting variable page technology can bring an average performance improvement of 15% to SPECCPU 2000 benchmarks. Compared with system of single large page (64KB), the filesystem performance of system supporting dynamic variable page is significantly improved by about 25%. © 2011 IEEE.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

An XML Data Placement Strategy for distributed XML Storage and parallel Query

An XML Data Placement Strategy for Distributed XML Storage a...

引用

IEEE international conference on parallel and distributed computing, applications and technologies (PDCAT)

作者： Jing Zhang Bo Lang Yawei Duan State Key Laboratory of Software Development Environment Beihang University Beijing China

Since there has been significant amount of XML documents generated in various application domains, efficient XML management has become an important problem. distributed XML storage and parallel query based on Map Reduce can be an effective solution to this problem. As XML data placement strategy is a key factor of parallel system performance, in this paper we present an XML placement strategy, which is Query Workload Estimation based XML Placement strategy (QWEXP) for efficient distributed XML storage and parallel query. To achieve query workload balance, it partitions XML based on query workload estimation which is calculated by XML structure without knowing of user queries, considering that in common application scenarios user queries are unknown in advance. the partitioned XML segments are around an XML storage unit W0, to support scalability of parallel XML database. Finally segments are distributed to each processing node evenly to ensure workload balance on parallel query execution. Experimental results have shown that QWEXP promotes the speedup and scale up properties of parallel XML system greatly.

关键词： XML Estimation Partitioning algorithms distributed databases Scalability Benchmark testing

来源：评论

学校读者我要写书评

暂无评论

Transformation of active reference graph into passive reference graph for distributed garbage collection

Transformation of active reference graph into passive refere...

引用

1st international conference on parallel, distributed computing technologies and applications, PDCTA 2011

作者： Seetha Lakshmi, B. Balapriya, C.D. Soniya, R. KLN College of Information Technology Pottapalayam Sivagangai District Tamil Nadu India

ISBN: (纸本)9783642240362

With the increasing use of active object systems, agents and concurrent object oriented languages like Java, the problem of garbage collection of unused resources has become more complicated. Since Active objects are standalone computational agents identifying garbage in active objects system cannot be based on reachability from a root set (which we use for passive objects). We have to go for separate algorithm to collect garbage on system which uses active objects. For the systems which use both active and passive objects we have to use 2 separate methods for collecting garbage. To avoid this we can use a transformation algorithm that can transfer active object reference graph into passive object reference graph, after which we can apply the passive object algorithm to collect garbage from the entire system. An attempt is made to travel through the transformation algorithms. © 2011 Springer-Verlag.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Dynamically Accessing Packet Header Fields at High-Speed

Dynamically Accessing Packet Header Fields at High-Speed

引用

IEEE international conference on parallel and distributed computing, applications and technologies (PDCAT)

作者： Ralph Duncan Peder Jungck Kenneth Ross CloudShield Technologies SAIC company Sunnyvale CA USA

A significant part of packet processing consists of detecting whether certain standard protocol headers are present, where they are located and whether they include optional information. Packet processing programs are on tight time budgets, especially to handle speeds in the gigabits per second (gbps) range. thus, high-speed mechanisms for finding and accessing headers are critical. Our approach lets users define headers as C-style structures in a high-level language, packetC [1], and specify header locations in terms of offsets from the start of the current packet, which is treated as an array of unsigned bytes. these offsets can be expressed in terms of network layer offsets, constant values, runtime-calculated variables and combinations of all of these. this paper focuses on the principal forms these offset expressions can take and on how our FPGAs (Field Programmable Gate Arrays), compiler and interpreter collectively handle them at runtime. For simple and complex header offset scenarios we provide users with intuitive, high-level ways to describe offsets and provide effective runtime mechanisms to access header fields.

关键词： Protocols Runtime Payloads parallel processing Field programmable gate arrays Arrays Registers

来源：评论

学校读者我要写书评

暂无评论

Dacoop: Accelerating Data-Iterative applications on Map/Reduce Cluster

Dacoop: Accelerating Data-Iterative Applications on Map/Redu...

引用

IEEE international conference on parallel and distributed computing, applications and technologies (PDCAT)

作者： Yi Liang Guangrui Li Lei Wang Yanpeng Hu Department of Computer Science Beijing University of Technology Beijing China Institute of Computing Technology Chinese Academy of Sciences Beijing China Hwellzen Software Center Shanghai China

Map/reduce is a popular parallel processing framework for massive-scale data-intensive computing. the data-iterative application is composed of a serials of map/reduce jobs and need to repeatedly process some data files among these jobs. the existing implementation of map/reduce framework focus on perform data processing in a single pass with one map/reduce job and do not directly support the data-iterative applications, particularly in term of the explicit specification of the repeatedly processed data among jobs. In this paper, we propose an extended version of Hadoop map/reduce framework called Dacoop. Dacoop extends Map/Reduce programming interface to specify the repeatedly processed data, introduces the shared memory-based data cache mechanism to cache the data since its first access, and adopts the caching-aware task scheduling so that the cached data can be shared among the map/reduce jobs of data-iterative applications. We evaluate Dacoop on two typical data-iterative applications: k-means clustering and the domain rule reasoning in sementic web, with real and synthetic datasets. Experimental results show that the data-iterative applications can gain better performance on Dacoop than that on Hadoop. the turnaround time of a data-iterative application can be reduced by the maximum of 15.1%.

关键词： Processor scheduling Data models Programming Scheduling distributed databases Computer architecture Load modeling

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共178页 << < 104 105 106 107 108 109 110 111 112 113 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：